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

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. 
   Two dimensional arrays are also called
   
   
   
   
   1.  matrix arrays
   
   
   2.  tables arrays
   
   
   3.  both of above
   
   
   4.  none of above
   
   
   
   
   
   
   
   
   


2. 
   The following data structure is non-linear type
   
   
   
   
   1.  Stacks
   
   
   2.  Strings
   
   
   3.  Lists
   
   
   4.  None of the above
   
   
   
   
   
   
   
   
   


3. 
    Herder node is used as sentinel in _____________.
   
   
   
   
   1.  Binary tree
   
   
   2.  Queues
   
   
   3.  Graphs
   
   
   4.  Stacks
   
   
   
   
   
   
   
   
   


4. 
   The following data structure is linear type
   
   
   
   
   1.  Lists
   
   
   2.  Queues
   
   
   3.  Strings
   
   
   4.  All of the above
   
   
   
   
   
   
   
   
   


5. 
   What is the pecularity of red black trees?
   
   
   
   
   1.  In red-black trees, the root do not contain data
   
   
   2.  In red-black trees, the leaf nodes are relevant but do  not contain data.
   
   
   3.   Both a and b above
   
   
   4.  In red-black trees, the leaf nodes are not relevant and do not contain data.
   
   
   
   
   
   
   
   
   


6. 
   AVL trees have a faster ________.
   
   
   
   
   1.  Insertion
   
   
   2.  Retrieval
   
   
   3.  Deletion
   
   
   4.  Updation
   
   
   
   
   
   
   
   
   


7. 
   Which of the following data structure can't store the non-homogeneous data elements?
   
   
   
   
   1.  Arrays
   
   
   2.  Stacks
   
   
   3.  Records
   
   
   4.  Pointers
   
   
   
   
   
   
   
   
   


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


9. 
   In an array queue, data is stored in an _____ element.
   
   
   
   
   1.  Node
   
   
   2.  Linked List
   
   
   3.  Array
   
   
   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
    
    
    
    
    
    
    
    
    

---