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

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. 
   Each array declaration need not give, implicitly or explicitly, the information about____________.
   
   
   
   
   1.  the data type of array
   
   
   2.  the index set of the array
   
   
   3.  the first data from the set to be stored
   
   
   4.  the name of array
   
   
   
   
   
   
   
   
   


2. 
   Which of the following sorting methods would be most suitable for sorting a list which is almost sorted?
   
   
   
   
   1.  Bubble Sort
   
   
   2.  Quick Sort
   
   
   3.  Selection Sort
   
   
   4.  Insertion Sort
   
   
   
   
   
   
   
   
   


3. 
   The elements of an array are stored successively in memory cells because _______________.
   
   
   
   
   1.  by this way computer can keep track only the address of the first element and the addresses of other elements can be calculated
   
   
   2.  the architecture of computer memory does not allow arrays to store other than serially
   
   
   3.  both of above
   
   
   4.  none of above
   
   
   
   
   
   
   
   
   


4. 
   The number of swapping’s needed to sort the numbers 8, 22, 7, 9, 31, 19, 5, 13 in ascending order, using bubble sort is ______.
   
   
   
   
   1.  10
   
   
   2.  14
   
   
   3.  13
   
   
   4.  9
   
   
   
   
   
   
   
   
   


5. 
   For the improvement of efficiency of quick sort the pivot can be ______________.
   
   
   
   
   1.  the last element
   
   
   2.  the middle element
   
   
   3.  the first element
   
   
   4.  the mean element
   
   
   
   
   
   
   
   
   


6. 
    Which of the following is non-liner data structure?
   
   
   
   
   1.  Strings
   
   
   2.  Trees
   
   
   3.  Stacks
   
   
   4.  List
   
   
   
   
   
   
   
   
   


7. 
   Straight selection sort is basically a method of repeated ____________.
   
   
   
   
   1.  position adjustment
   
   
   2.  interchange
   
   
   3.  searching
   
   
   4.  None of the above
   
   
   
   
   
   
   
   
   


8. 
   If the values of a variable in one module is indirectly changed by another module, this situation is called ____________.
   
   
   
   
   1.  side-module update
   
   
   2.  internal change
   
   
   3.  inter-module change
   
   
   4.  side effect
   
   
   
   
   
   
   
   
   


9. 
    Which of the following data structure store the homogeneous data elements?
   
   
   
   
   1.  Arrays
   
   
   2.  Pointers
   
   
   3.  Records
   
   
   4.  none of the above
   
   
   
   
   
   
   
   
   


10. 
    Quick sort is the fastest available method of sorting because of ______.
    
    
    
    
    1.  O(n log n) comparisons
    
    
    2.  low over head
    
    
    3.  n(log n) comparisons
    
    
    4.  low overhead and also O(n log n) comparisons
    
    
    
    
    
    
    
    
    

---