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

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. 
    Which of the following statements hold true for binary trees?
   
   
   
   
   1.  The left subtree of a node contains only nodes with keys less than the node’s key
   
   
   2.  The right subtree of a node contains only nodes with keys greater than the node’s key
   
   
   3.  Both a and b above
   
   
   4.  None of the above
   
   
   
   
   
   
   
   
   


2. 
   In a heap, element with the greatest key is always in the _______ node.
   
   
   
   
   1.  leaf
   
   
   2.  first node of left sub tree
   
   
   3.  first node of right sub tree
   
   
   4.  root
   
   
   
   
   
   
   
   
   


3. 
   Number of selections required to sort a file of size N by straight selection requires ______.
   
   
   
   
   1.  N - 1
   
   
   2.  O(N2)
   
   
   3.  log N
   
   
   4.  None of the above
   
   
   
   
   
   
   
   
   


4. 
   An empty list is the one which has no __________.
   
   
   
   
   1.  data
   
   
   2.  nodes
   
   
   3.  address
   
   
   4.  both a and b
   
   
   
   
   
   
   
   
   


5. 
   The space factor when determining the efficiency of algorithm is measured by ____________.
   
   
   
   
   1.  Counting the minimum memory needed by the algorithm
   
   
   2.  Counting the average memory needed by the algorithm
   
   
   3.  Counting the maximum disk space needed by the algorithm
   
   
   4.  Counting the maximum memory needed by the algorithm
   
   
   
   
   
   
   
   
   


6. 
   Which among the following is the best when the list is already sorted?
   
   
   
   
   1.  Bubble sort
   
   
   2.  Insertion sort
   
   
   3.  Merge sort
   
   
   4.  Selection sort
   
   
   
   
   
   
   
   
   


7. 
   The recurrence relation capturing the optimal execution time of the Towers of Hanoi problem with n discs is ______.
   
   
   
   
   1.  T(n) = 2T(n - 1) + 1
   
   
   2.  T(n) = 2T(n - 1) + n
   
   
   3.  T(n) = 2T(n - 2) + 2
   
   
   4.  T(n) = 2T(n/2) + 1
   
   
   
   
   
   
   
   
   


8. 
   The complexity of Bubble sort algorithm is _________.
   
   
   
   
   1.  O(n)
   
   
   2.  O(n log n)
   
   
   3.  O(n2)
   
   
   4.  O(log n)
   
   
   
   
   
   
   
   
   


9. 
   Heap is defined to be a ___________.
   
   
   
   
   1.  binary tree
   
   
   2.  tree structure
   
   
   3.  complete binary tree
   
   
   4.  None of the above
   
   
   
   
   
   
   
   
   


10. 
    Inserting an item into the stack when stack is not full is called ___________.Operation and deletion of item form the stack, when stack is not empty is called ___________operation.
    
    
    
    
    1.  delete, insert
    
    
    2.  pop, push
    
    
    3.  insert, delete
    
    
    4.  push, pop
    
    
    
    
    
    
    
    
    

---