Page 685 - Computer science 868 Class 12
P. 685

24.   K-map: It is a graphical method of simplifying a Boolean expression.
                   25.  Literals: Literals are the constant values used in a program code.
                   26.  Logical Operators: Logical Operators return true or false depending on the result of the given condition which
                        depends upon the relationship between the parameters of the expression.
                   27.   Maxterm: It can be defined as the sum terms of all the variables present in the expression both in complemented
                        and un complemented forms.
                   28.  Methods: Methods are the block of statements in a program which performs a specific task and can be reused
                        as and when required.

                   29.   Minterm:  It can be defined  as the product  terms  of all  the variables  present in  the expression  both  in
                        complemented and normal forms.

                   30.  Multiplexer: It is a combinational circuit that selects a single output  from a set of inputs.
                   31.  Object: It is a unique entity that contains properties, methods and events together in an Object-Oriented
                        Programming Language. The classes in Java are non-primitive/user-defined data types that act as a blueprint
                        for creating objects of the same type.
                   32.  Operators: Operators are used to instruct the compiler to execute some operations or calculations.
                   33.  Polymorphism: Polymorphism in Java refers to the same object having multiple forms and attributes.
                   34.   Proposition: It is a declarative statement that can either be true or false, but not both or any other value.

                   35.  Pseudocode: It is a representation of an algorithm in any standard human readable language and mathematical
                        notations.
                   36.  Queue: A queue is a linear data structure which works on FIFO principle. It has two ends namely the front and
                        the rear. Insertion in a queue takes place from the rear end and deletion from the front end.
                   37.  Recursion: It is a programming technique where the function calls itself repeatedly until a exit condition called
                        the base case is achieved.
                   38.  Relational Operators: Relational Operators compare two variables or expressions and the resultant output is
                        the relation between them.
                   39.  Searching: It is the way of finding an element in an array. There are two types of searching – linear and binary
                        search.
                   40.  Shift Operators: Shift Operators are used for shifting the bits to the value of the first operand right or left.
                   41.  Space complexity: Space complexity is the amount of memory space required to run an algorithm.

                   42.  Stack: A stack is a linear data structure which stores data in LIFO (Last In First Out) order. A stack has only one
                        end, top. Insertion and deletion of data takes place from the top only.

                   43.  Subclass: It is a class that inherits the features of another class.
                   44.  Superclass: It is a class from where features are inherited to another class.
                   45.   Tautology: It is a proposition that has 1 as its truth value, and a contradiction has 0 as its truth value.
                   46.  Time complexity: Time complexity is the total time taken to execute the instructions (steps) of a program.

                   47.  Token: Each individual character that is used for creating an executable code in Java is known as a token.
                   48.   Truth table: It is a mathematical table that lists the output of any Boolean expression for all the possible
                        combinations of its inputs.
                   49.  Unboxing: It is a method of changing an object of a wrapper class into its corresponding primitive value.
                   50.  Variables:  Variables are  the  named memory  locations  that  contain values depending  on the  type  of the
                        variable.



                                                                                                                       683
                                                                                                             Glossary  683
   680   681   682   683   684   685   686