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

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 sorting procedures is the slowest?
   
   
   
   
   1.  Heap sort
   
   
   2.  Shell sort
   
   
   3.  Bubble sort
   
   
   4.  Quick sort
   
   
   
   
   
   
   
   
   


2. 
   In a Max heap the largest key is at
   
   
   
   
   1.  a leaf
   
   
   2.  a node
   
   
   3.  both a & b
   
   
   4.  the root
   
   
   
   
   
   
   
   
   


3. 
   The complexity of Binary search algorithm is
   
   
   
   
   1.  O(log )
   
   
   2.  O(n)
   
   
   3.  O(n2)
   
   
   4.  O(n log n)
   
   
   
   
   
   
   
   
   


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


5. 
   ___________ level is where the model becomes compatible executable code
   
   
   
   
   1.  Abstract level
   
   
   2.  Application level
   
   
   3.  both a & b
   
   
   4.  Implementation level
   
   
   
   
   
   
   
   
   


6. 
   Which data structure allows deleting data elements from and inserting at rear?
   
   
   
   
   1.  Binary search tree
   
   
   2.  Queues
   
   
   3.  Stacks
   
   
   4.  none of the above
   
   
   
   
   
   
   
   
   


7. 
    Which of the following data structure is linear type?
   
   
   
   
   1.  Stack
   
   
   2.  Trees
   
   
   3.  Binary tree
   
   
   4.  Graph
   
   
   
   
   
   
   
   
   


8. 
   The running time of insertion sort is
   
   
   
   
   1.  O(n)
   
   
   2.  O(log n)
   
   
   3.  O(n log n)
   
   
   4.  O(n^2)
   
   
   
   
   
   
   
   
   


9. 
   Two main measures for the efficiency of an algorithm are
   
   
   
   
   1.  Processor and memory
   
   
   2.  Complexity and capacity
   
   
   3.  Time and space
   
   
   4.  Data and space
   
   
   
   
   
   
   
   
   


10. 
    The algorithm like Quick sort does not require extra memory for carrying out the sorting procedure. This technique is called __________.
    
    
    
    
    1.  stable
    
    
    2.  unstable
    
    
    3.  in-partition
    
    
    4.  in-place
    
    
    
    
    
    
    
    
    

---