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

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 Worst case occur in linear search algorithm when_________.
   
   
   
   
   1.  Item is the last element in the array
   
   
   2.  Item is not in the array at all
   
   
   3.  Item is the last element in the array or is not there at all
   
   
   4.  None of above
   
   
   
   
   
   
   
   
   


2. 
   Items in a priority queue are entered in a _____________ order
   
   
   
   
   1.  order of priority
   
   
   2.  as and when they come
   
   
   3.  both a & b
   
   
   4.  random
   
   
   
   
   
   
   
   
   


3. 
   A ___________ is a data structure that organizes data similar to a line in the supermarket, where the first one in line is the first one out.
   
   
   
   
   1.  Queue linked list
   
   
   2.  Stacks linked list
   
   
   3.  Linear linked list
   
   
   4.  none of the above
   
   
   
   
   
   
   
   
   


4. 
   How many number of comparisons are required in insertion sort to sort a file if the file is sorted in reverse order? 
   
   
   
   
   1.  N-1
   
   
   2.  N/2
   
   
   3.  N
   
   
   4.  N2
   
   
   
   
   
   
   
   
   


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


6. 
   Which of the following data structures are indexed structures?
   
   
   
   
   1.  linked lists
   
   
   2.  linear arrays
   
   
   3.  none of above
   
   
   4.  both a & b
   
   
   
   
   
   
   
   
   


7. 
   A variable P is called as a pointer if_________.
   
   
   
   
   1.  P contains the address of an element in DATA
   
   
   2.  P can store only memory addresses
   
   
   3.  P contain the DATA and the address of DATA
   
   
   4.  P points to the address of first element in DATA
   
   
   
   
   
   
   
   
   


8. 
   Which of the following is not the part of ADT description?
   
   
   
   
   1.  Operations
   
   
   2.  Data
   
   
   3.  both a & b
   
   
   4.  none of above
   
   
   
   
   
   
   
   
   


9. 
   In graphs, A hyperedge is an edge that is allowed to take on any number of ______.
   
   
   
   
   1.  labels
   
   
   2.  Vertices
   
   
   3.  edges
   
   
   4.  nodes
   
   
   
   
   
   
   
   
   


10. 
    Key value pair is usually seen in__________.
    
    
    
    
    1.  Heaps
    
    
    2.  Skip list
    
    
    3.  Both a and b
    
    
    4.  Hash tables
    
    
    
    
    
    
    
    
    

---