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

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. 
   To represent hierarchical relationship between elements, the following data structure is suitable_________.
   
   
   
   
   1.  Priority
   
   
   2.  Dequeue
   
   
   3.  Tree
   
   
   4.  All of above
   
   
   
   
   
   
   
   
   


2. 
    The following data structure allows deleting data elements from front and inserting at rear _____________.
   
   
   
   
   1.  Stacks
   
   
   2.  Dequeue
   
   
   3.  Binary search tree
   
   
   4.  Queues
   
   
   
   
   
   
   
   
   


3. 
   The complexity of the average case of an algorithm is _________.
   
   
   
   
   1.   Much more complicated to analyze than that of worst case
   
   
   2.  Much more simpler to analyze than that of worst case
   
   
   3.  Sometimes more complicated and some other times simpler than that of worst case
   
   
   4.  None of the above
   
   
   
   
   
   
   
   
   


4. 
   This data structure allows deletions at both ends of the list but insertion at only one end _____.
   
   
   
   
   1.  Output-restricted dequeue
   
   
   2.  Priority queues
   
   
   3.  Both a & b
   
   
   4.  Input-restricted dequeue
   
   
   
   
   
   
   
   
   


5. 
   The time required in best case for search operation in binary tree is________.
   
   
   
   
   1.  O(n)
   
   
   2.  O(log 2n)
   
   
   3.  O(2n)
   
   
   4.  O(log n)
   
   
   
   
   
   
   
   
   


6. 
   Which of the following ways below is a pre-order traversal?
   
   
   
   
   1.  Root->left sub tree-> right sub tree
   
   
   2.  left sub tree-> right sub tree->Root
   
   
   3.  Root->right sub tree-> left sub tree
   
   
   4.  right sub tree-> left sub tree->Root
   
   
   
   
   
   
   
   
   


7. 
   Breadth First search is used in______--.
   
   
   
   
   1.  Graphs
   
   
   2.  Binary trees
   
   
   3.  Stacks
   
   
   4.  Both a and c above
   
   
   
   
   
   
   
   
   


8. 
   The complexity of merge sort algorithm is ___________.
   
   
   
   
   1.  O(n log n)
   
   
   2.  O(n)
   
   
   3.  O(log n)
   
   
   4.  O(n2)
   
   
   
   
   
   
   
   
   


9. 
   What happens when you push a new node onto a stack?
   
   
   
   
   1.  the new node is placed at the back of the linked list.
   
   
   2.  the new node is placed at the middle of the linked list.
   
   
   3.  the new node is placed at the front of the linked list.
   
   
   4.  No Changes happens
   
   
   
   
   
   
   
   
   


10. 
    Which of the following data structure is not linear data structure?
    
    
    
    
    1.  Linked lists
    
    
    2.  Arrays
    
    
    3.  Both of above
    
    
    4.  None of above
    
    
    
    
    
    
    
    
    

---