Page 684 - Computer science 868 Class 12
P. 684

Subject Enrichment





                          GLOSSARY

                                                                                    #Digital Literacy



                  1.  Algorithm: It is a set of well-defined finite steps or rules to be followed to solve any problem.

                  2.  Arithmetic Operators: Arithmetic Operators are used to perform different arithmetical calculations.
                  3.  Array: It can be defined as a set of variables that contains values of the same data types having the same variable
                     names but different subscripts required to separate the values. Thus, an array is a composite data type.
                  4.  Autoboxing: It is a method of converting a primitive value into an object of the corresponding wrapper class.
                  5.  Base case: It is the condition where the function stops calling itself. This is a very important part of recursion
                     construct otherwise the function will call itself infinitely until the program crashes.
                  6.  Big O notation: It is the measurement of the growth rate of an algorithm with an increase in its input size. It
                     defines the upper bound of an algorithm or the maximum time taken by an algorithm for a given input size.
                  7.  Binary Operators: Binary Operators work on two operands.
                  8.  Binary tree: A binary tree is a tree structure where the degree is 2.

                  9.  Bitwise Operators: Bitwise Operators work on the bit level of the operands on which the expression depends.
                 10.   Boolean algebra: It has laws that help in simplifying a complex Boolean expression which further reduces the
                     number of digital gates required to represent a circuit.
                 11.  Computation: Computation involves the process of solving a problem and the algorithm associated with it.
                 12.  Constructor: Constructor is a member method with same name of the class that is used to initialize the
                     instance variables of the objects.
                 13.   Converse: It is the proposition obtained by interchanging antecedent and consequent, while the inverse is the
                     proposition obtained by taking negated antecedent and negated consequent.

                 14.  Data structure: Data structure is a systematic way of storing and organising data in a specialised format, and
                     its relationship with all associated members.

                 15.  Decoder: It is a combinational circuit that converts any binary number to its equivalent Octal, Decimal or
                     Hexadecimal form.
                 16.  Dominant Term: The term which dominates the algorithm the most is called the dominant term and is only
                     included in the Big O notation.
                 17.  Encoder: It is a combinational circuit that converts decimal, octal or hexadecimal numbers to its equivalent
                     binary form.
                 18.  final: The keyword ‘final’ is used to make the variable fixed which can’t change its values.
                 19.  Flowchart: It is a pictorial representation of an algorithm using standard symbols.
                 20.  Full adder: The full adder is a combinational circuit that is designed  to perform the addition of three bits and
                     produces the two binary outputs as sum (S) and carry(C) bits.
                 21.   Half adder: It is a combinational circuit that is designed  to perform the addition of two bits and produces the
                     two binary outputs as sum (S) and carry(C) bits.

                 22.  Identifiers: Identifiers are used to give names to variables, classes, methods, etc.
                 23.  Indirect recursion: It is a coding technique where the first method calls the second method which in turn calls
                     the first method in a circular fashion.


                682682  Touchpad Computer Science-XII
   679   680   681   682   683   684   685   686