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

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. 
    Which of the following linked list below have last node of the list pointing to the first node?
   
   
   
   
   1.  circular linked list
   
   
   2.  doubly linked list
   
   
   3.  circular doubly linked list
   
   
   4.  circular singly linked list
   
   
   
   
   
   
   
   
   


2. 
   A _____ tree is a tree where for each parent node, there is only one associated child node.
   
   
   
   
   1.  rooted complete binary tree
   
   
   2.  complete binary tree
   
   
   3.  balanced binary tree
   
   
   4.  degenerate tree
   
   
   
   
   
   
   
   
   


3. 
   Which data structure allows deleting data elements from front and inserting at rear?
   
   
   
   
   1.  Queues
   
   
   2.  Dequeus
   
   
   3.  Stacks
   
   
   4.  None of the above
   
   
   
   
   
   
   
   
   


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


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


6. 
   To represent hierarchical relationship between elements, which data structure is suitable?
   
   
   
   
   1.  Deque
   
   
   2.  Tree
   
   
   3.  Priority
   
   
   4.  All of above
   
   
   
   
   
   
   
   
   


7. 
   Identify the data structure which allows deletions at both ends of the list but insertion at only one end.
   
   
   
   
   1.  Input-restricted deque
   
   
   2.  Priority queues
   
   
   3.  Output-restricted deque
   
   
   4.  Both b & c
   
   
   
   
   
   
   
   
   


8. 
   In a binary tree, certain null entries are replaced by special pointers which point to nodes higher in the tree for efficiency. These special pointers are called
   
   
   
   
   1.  Branch
   
   
   2.  Leaf
   
   
   3.  Path
   
   
   4.  Thread
   
   
   
   
   
   
   
   
   


9. 
   A binary tree whose every node has either zero or two children is called ___________.
   
   
   
   
   1.  Binary search tree
   
   
   2.  Complete binary tree
   
   
   3.  Extended binary tree
   
   
   4.  None of the above
   
   
   
   
   
   
   
   
   


10. 
    In a graph if e=[u, v], Then u and v are called
    
    
    
    
    1.  adjacent nodes
    
    
    2.  neighbours
    
    
    3.  endpoints of e
    
    
    4.  All of above
    
    
    
    
    
    
    
    
    

---