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

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. 
   __________is very useful in situation when data have to stored and then retrieved in reverse order.
   
   
   
   
   1.  List
   
   
   2.  Queue
   
   
   3.  Stack
   
   
   4.  Link list
   
   
   
   
   
   
   
   
   


2. 
   Which of the following data structure is linear data structure?
   
   
   
   
   1.  Trees
   
   
   2.  Graphs
   
   
   3.  List
   
   
   4.  Arrays
   
   
   
   
   
   
   
   
   


3. 
   Suppose we are sorting an array of eight integers using some quadratic sorting algorithm. After four iterations of the algorithm’s main loop, the array elements are ordered as shown here:2 4 5 7 8 1 3 6
   
   
   
   
   1.  Insertion sort
   
   
   2.  Selection sort
   
   
   3.  Heap sort
   
   
   4.  Bubble sort
   
   
   
   
   
   
   
   
   


4. 
   The correct order of the efficiency of the following sorting algorithms according to their overall running time comparison is
   
   
   
   
   1.  Selection>bubble>insertion
   
   
   2.  Insertion>selection>bubble
   
   
   3.  Insertion>bubble>selection
   
   
   4.  bubble>selection>insertion
   
   
   
   
   
   
   
   
   


5. 
   _________ is not the component of data structure.
   
   
   
   
   1.  Storage Structures
   
   
   2.  Operations
   
   
   3.  Algorithms
   
   
   4.  None of above
   
   
   
   
   
   
   
   
   


6. 
   In linear search algorithm the Worst case occurs when_________.
   
   
   
   
   1.  The item is not in the array at all
   
   
   2.  The item is the last element in the array or is not there at all
   
   
   3.  The item is the last element in the array
   
   
   4.  The item is somewhere in the middle of the array
   
   
   
   
   
   
   
   
   


7. 
   In quick sort, the number of partitions into which the file of size n is divided by a selected record is __________.
   
   
   
   
   1.  2
   
   
   2.  n - 1
   
   
   3.  n + 1
   
   
   4.  n
   
   
   
   
   
   
   
   
   


8. 
   In heap sort the input is arranged in the form of a ___________.
   
   
   
   
   1.  tree
   
   
   2.  stack
   
   
   3.  queue
   
   
   4.  heap
   
   
   
   
   
   
   
   
   


9. 
   Two dimensional arrays are also called __________.
   
   
   
   
   1.  tables arrays
   
   
   2.  matrix arrays
   
   
   3.  both of above
   
   
   4.  none of above
   
   
   
   
   
   
   
   
   


10. 
    The pop() member function determines if the stack is empty by calling the _____ member function.
    
    
    
    
    1.  removedfront()
    
    
    2.  hasNext()
    
    
    3.  removeback()
    
    
    4.  isEmpty()
    
    
    
    
    
    
    
    
    

---