Page 545 - Computer science 868 Class 12
P. 545

Unsolved Questions



                 A.  Tick ( ) the correct option:
                    1.  ………………… form of access is used to add and remove elements from a circular queue.
                       a.  LIFO                                        b.  FIFO
                       c.  LIFI                                        d.  FOFO
                    2.  The error situation when we try to push an item into an already full stack is called ………………… .
                       a.  under flow                                  b.  over flow
                       c.  vertical flow                               d.  free flow
                    3.  We can remove 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.  ab + c*
                       c.  abc* +                                      d.  ab + *c
                    5.  The prefix notation of x + y + z  is ………………… .
                       a.  +xy + z                                     b.  +x + yz
                       c.  ++xyz                                       d.  xyz++
                    6.  A linear list in which each node has a pointer to point to the successor node only is called ………………… linked list.
                       a.  single                                      b.  double
                       c.  linear                                      d.  unit
                    7.  ………………… node of a tree has no child node.
                       a.  parent                                      b.  internal
                       c.  external                                    d.  root
                    8.  Total nodes present in a tree is called its ………………… .
                       a.  degree                                      b.  size
                       c.  level                                       d.  depth
                    9.  In pre order traversal, ………………… node is visited first.
                       a.  leftmost                                    b.  rightmost
                       c.  root                                        d.  child
                 B.  Fill in the blanks:

                    1.  The data elements are arranged in a hierarchical order representing parent child relationship in a ………………… data structure.
                    2.  The process of returning the topmost element in stack is called ………………… .
                    3.  In circular queue, the rear pointer changes by ………………… after inserting an element.
                    4.  All nodes except …………………  node are child nodes.
                    5.  The sequence of edges joining one node with another node is called ………………… .
                    6.  BST stands for ………………… tree.
                    7.  A binary tree can have only ………………… root node.
                    8.  When the order in which the nodes are visited is Left, Right, Root, it is ………………… traversal.
                    9.  The post fix notation of x % y ^ z is  ………………… .
                    10.  Post fix notation is also called  ………………… notation.

                 C.  Answer the following questions:
                     1.  Differentiate between
                        a.  Array and Linked list
                        b.  Post fix and Prefix
                        c.  Height and Depth of a tree
                        d.  Linked list and Binary tree
                        e.  Pre Order traversal and Post Order traversal


                                                                                                                       543
                                                                                                       Data Structures  543
   540   541   542   543   544   545   546   547   548   549   550