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

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. 
    The time factor when determining the efficiency of algorithm is measured by  ___________.
   
   
   
   
   1.  Counting the kilobytes of algorithm
   
   
   2.  Counting microseconds
   
   
   3.  Counting the number of key operations
   
   
   4.  Counting the number of statements
   
   
   
   
   
   
   
   
   


2. 
    The Worst case occur in linear search algorithm when ___________.
   
   
   
   
   1.  Item is not in the array at all
   
   
   2.   Item is the last element in the array
   
   
   3.  Item is somewhere in the middle of the array
   
   
   4.  Item is the last element in the array or is not there at all
   
   
   
   
   
   
   
   
   


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.  Both b & c
   
   
   
   
   
   
   
   
   


4. 
    The complexity of Binary search algorithm is ______.
   
   
   
   
   1.  O(n log n)
   
   
   2.  O(n2)
   
   
   3.  O(log )
   
   
   4.  O(n)
   
   
   
   
   
   
   
   
   


5. 
   Which of the following data structure is linear data structure?
   
   
   
   
   1.  Trees
   
   
   2.  List
   
   
   3.  Graphs
   
   
   4.  Arrays
   
   
   
   
   
   
   
   
   


6. 
   If yyy, xxx and zzz are the elements of a lexically ordered binary tree, then in preorder traversal which node will be traverse first
   
   
   
   
   1.  can not be determined
   
   
   2.  xxx
   
   
   3.  yyy
   
   
   4.  zzz
   
   
   
   
   
   
   
   
   


7. 
   In an array representation of binary tree the right child of root will be at location of
   
   
   
   
   1.  3
   
   
   2.  2
   
   
   3.  4
   
   
   4.  5
   
   
   
   
   
   
   
   
   


8. 
   If every node u in G is adjacent to every other node v in G, A graph is said to be ___________.
   
   
   
   
   1.  isolated
   
   
   2.  strongly connected
   
   
   3.  finite
   
   
   4.  complete
   
   
   
   
   
   
   
   
   


9. 
   When representing any algebraic expression E which uses only binary operations in a 2-tree,
   
   
   
   
   1.  the operations in E will appear as external nodes and variables in internal nodes
   
   
   2.  the variables and operations in E will appear only in external nodes
   
   
   3.  the variable in E will appear as external nodes and operations in internal nodes
   
   
   4.  the variables and operations in E will appear only in internal nodes
   
   
   
   
   
   
   
   
   


10. 
    In a graph if e=(u, v) means _______.
    
    
    
    
    1.  e  end at u and begins at v
    
    
    2.  e begins at u and ends at v
    
    
    3.  u is processor and v is successor
    
    
    4.  both b and c
    
    
    
    
    
    
    
    
    

---