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

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. 
   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 above
   
   
   
   
   
   
   
   
   


2. 
    On which principle does stack work?
   
   
   
   
   1.  LILO
   
   
   2.  FIFO
   
   
   3.  Both a and b
   
   
   4.  FILO
   
   
   
   
   
   
   
   
   


3. 
   Value of the first linked list index is _______
   
   
   
   
   1.  0
   
   
   2.  1
   
   
   3.  -1
   
   
   4.  none of the above
   
   
   
   
   
   
   
   
   


4. 
   A list of n strings, each of length n, is sorted into lexicographic order using the merge-sort algorithm. The worst case running time of this computation is
   
   
   
   
   1.  O (n2 log n)
   
   
   2.  O (n2 + log n)
   
   
   3.  O (n2)
   
   
   4.  O (n log n)
   
   
   
   
   
   
   
   
   


5. 
    Which of the following case does not exist in complexity theory?
   
   
   
   
   1.  Average case
   
   
   2.  Best case
   
   
   3.  Worst case
   
   
   4.  Null case
   
   
   
   
   
   
   
   
   


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


7. 
   A variable P is called pointer if
   
   
   
   
   1.  P contains the address of an element in DATA
   
   
   2.  P points to the address of first element in DATA
   
   
   3.  P contain the DATA and the address of DATA
   
   
   4.  P can store only memory addresses
   
   
   
   
   
   
   
   
   


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


9. 
   The concept of order Big O is important because
   
   
   
   
   1.  It is the lower bound of the growth rate of algorithm
   
   
   2.  It determines the maximum size of a problem that can       be solved in a given amount of time
   
   
   3.  It can be used to decide the best algorithm that solves       a given problem
   
   
   4.  Both b and c
   
   
   
   
   
   
   
   
   


10. 
    Identify the data structure which allows deletions at both ends of the list but insertion at only one end.
    
    
    
    
    1.  Priority queues
    
    
    2.  Output restricted qequeue
    
    
    3.  Stack
    
    
    4.  Input restricted dequeue
    
    
    
    
    
    
    
    
    

---