Page 541 - Computer science 868 Class 12
P. 541

MIND DRILL



                     Solved Questions


                 A.  Tick ( ) the correct option:
                    1.  ………………… form of access is used to add and remove elements from a queue.
                       a.  LIFO                                        b.  FIFO
                       c.  LIFI                                        d.  FOFO
                    2.  This is an error situation when we try to pop an item from an empty stack.
                       a.  underflow                                   b.  over flow
                       c.  vertical flow                               d.  free flow
                    3.  We can insert an element in a dequeue from the ………………… .
                       a.  middle                                      b.  front
                       c.  rear                                        d.  both b and c
                    4.  The post fix notation of a + b + c is ………………… .
                       a.  abc++                                       b.  ++abc
                       c.  ab+c+                                       d.  +ab+c
                    5.  The prefix notation of x + y is ………………… .
                       a.  +xy                                         b.  xy+
                       c.  ++xy                                        d.  xy++
                    6.  A linear list in which each node has a pointer to point to the predecessor and successor nodes is called ………………… linked list.
                       a.  single                                      b.  double
                       c.  linear                                      d.  dual
                    7.  The ………………… node can only be one in a tree.
                       a.  leaf                                        b.  internal
                       c.  external                                    d.  root
                    8.  Degree of a binary tree is ………………… .
                       a.  0                                           b.  1
                       c.  2                                           d.  3
                    9.  Nodes having same parent are called ………………… .
                       a.  leaf                                        b.  child
                       c.  descendant                                  d.  siblings
                    10.  In post order traversal ………………… node is visited first.
                       a.  leftmost                                    b.  rightmost
                       c.  root                                        d.  child
                   Answers
                   1.  b           2.   a           3.  d         4.  c           5.  a          6.   b      7.  d
                   8.  c           9.   d          10.  a


                 B.  Fill in the blanks:
                    1.  The data elements are arranged contiguously one after the another in a ………………… data structure.
                    2.  Process of entering data into stack is called ………………… .
                    3.  In a linked list memory is allocated ………………… .
                    4.  The node from where sub nodes emerge is called ………………… node.

                    5.  A tree with ‘N’ nodes will have ………………… edges.
                    6.  A set of disjoint trees is called a ………………… .
                    7.  A binary tree is said to be balanced if the difference of height of its left sub tree and right sub tree is less than or equal to
                       ………………… .


                                                                                                                       539
                                                                                                       Data Structures  539
   536   537   538   539   540   541   542   543   544   545   546