Computer Science Mock Test UGC-NET (Data Structure) - Part 6

This Quiz is posted with the sole aim of guiding the aspirants of UGC-NET Exam to the path of success. To sharpen the edges of your own intelligence and practice, in a structured and concrete manner to ensure you definite Success in your endeavor and will Pave your way for a successful career in Teaching (or) Research Profession . All the very best...... Knock the door of success......

1. 
    The Average case occur in linear search algorithm ____________.
   
   
   
   
   1.  When Item is not in the array at all
   
   
   2.  When Item is the last element in the array
   
   
   3.  When Item is somewhere in the middle of the array
   
   
   4.  None of above
   
   
   
   
   
   
   
   
   


2. 
   Which of the following ways below is a In order traversal?
   
   
   
   
   1.  Root->right sub tree-> left sub tree
   
   
   2.  Root->left sub tree-> right sub tree
   
   
   3.  right sub tree-> left sub tree->Root
   
   
   4.  left sub tree-> root->right sub tree
   
   
   
   
   
   
   
   
   


3. 
   The depth of a complete binary tree is given by
   
   
   
   
   1.  Dn = log2n+1
   
   
   2.  Dn = n log2n+1
   
   
   3.  Dn = n log2n
   
   
   4.  Dn = log2n
   
   
   
   
   
   
   
   
   


4. 
    A connected graph T without any cycles is called_______.
   
   
   
   
   1.  a tree graph
   
   
   2.  a tree
   
   
   3.  free tree
   
   
   4.  all of the above.
   
   
   
   
   
   
   
   
   


5. 
   Which of the following case does not exist in complexity theory?
   
   
   
   
   1.  Worst case
   
   
   2.  Best case
   
   
   3.  Average case
   
   
   4.  Null case
   
   
   
   
   
   
   
   
   


6. 
   An algorithm that calls itself directly or indirectly is known as_____.
   
   
   
   
   1.  Polish notation
   
   
   2.  Recursion
   
   
   3.  Traversal algorithm
   
   
   4.  Sub algorithm
   
   
   
   
   
   
   
   
   


7. 
   The operation of processing each element in the list is known as____.
   
   
   
   
   1.  Traversal
   
   
   2.  Sorting
   
   
   3.  Inserting
   
   
   4.  Merging
   
   
   
   
   
   
   
   
   


8. 
   Which of the following sorting algorithm is of divide-and-conquer type?
   
   
   
   
   1.  Insertion sort
   
   
   2.  Bubble sort
   
   
   3.  Binary search trees
   
   
   4.  Quick sort
   
   
   
   
   
   
   
   
   


9. 
   The memory address of the first element of an array is called_______________.
   
   
   
   
   1.  foundation address
   
   
   2.  floor address
   
   
   3.  base address
   
   
   4.  first address
   
   
   
   
   
   
   
   
   


10. 
    Which data structure is used in breadth first search of a graph to hold nodes?
    
    
    
    
    1.  Tree
    
    
    2.  Stack 
    
    
    3.  Array
    
    
    4.  queue
    
    
    
    
    
    
    
    
    

---