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

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. 
   Stack is also called as
   
   
   
   
   1.  First in first out
   
   
   2.  Last in last out
   
   
   3.  Last in first out
   
   
   4.  First in last out
   
   
   
   
   
   
   
   
   


2. 
   Linked lists are best suited
   
   
   
   
   1.   for relatively permanent collections of data
   
   
   2.   for both of above situation
   
   
   3.   for none of above situation
   
   
   4.  for the size of the structure and the data in the structure are constantly changing
   
   
   
   
   
   
   
   
   


3. 
   The worst-case time complexity of Quick Sort is________.
   
   
   
   
   1.  O(n2)
   
   
   2.  O(n)
   
   
   3.  O(n logn)
   
   
   4.  O(log n)
   
   
   
   
   
   
   
   
   


4. 
   Which of the following data structure is non linear type?
   
   
   
   
   1.  Strings
   
   
   2.  Lists
   
   
   3.  Stacks 
   
   
   4.  Graph 
   
   
   
   
   
   
   
   
   


5. 
   Finding the location of the element with a given value is:
   
   
   
   
   1.  Sort
   
   
   2.  Search
   
   
   3.  Both of the above
   
   
   4.  None of above
   
   
   
   
   
   
   
   
   


6. 
   To represent hierarchical relationship between elements, Which data structure is suitable?
   
   
   
   
   1.  Dequeue
   
   
   2.  Tree
   
   
   3.  Priority
   
   
   4.  Graph
   
   
   
   
   
   
   
   
   


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


8. 
   The time factor when determining the efficiency of algorithm is measured by
   
   
   
   
   1.  Counting the number of statements
   
   
   2.  Counting microseconds
   
   
   3.  Counting the kilobytes of algorithm
   
   
   4.  Counting the number of key operations
   
   
   
   
   
   
   
   
   


9. 
   Quick sort efficiency can be improved by adopting
   
   
   
   
   1.  insertion method
   
   
   2.  tree search method
   
   
   3.  non-recursive method
   
   
   4.  none of the above
   
   
   
   
   
   
   
   
   


10. 
    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 the last element in the array or is not there at all
    
    
    4.  When Item is somewhere in the middle of the array
    
    
    
    
    
    
    
    
    

---