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

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. 
   ______ is a pile in which items are added at one end and removed from the other.
   
   
   
   
   1.  List
   
   
   2.  Stack
   
   
   3.  Queue
   
   
   4.  none of the above
   
   
   
   
   
   
   
   
   


2. 
   When determining the efficiency of algorithm the time factor is measured by_____________.
   
   
   
   
   1.  Counting the kilobytes of algorithm
   
   
   2.  Counting microseconds
   
   
   3.  Counting the number of statements
   
   
   4.  Counting the number of key operations
   
   
   
   
   
   
   
   
   


3. 
   The memory address of fifth element of an array can be calculated by the formula ________.
   
   
   
   
   1.     LOC(Array[5]=Base(Array)+w(5-lower bound), where w is the number of words per memory cell for the array
   
   
   2.  LOC(Array[5])=Base(Array[5])+(5-lower bound), where w is the number of words per memory cell for the array
   
   
   3.  LOC(Array[5])=Base(Array[4])+(5-Upper bound), where w is the number of words per memory cell for the array
   
   
   4.   none of the above
   
   
   
   
   
   
   
   
   


4. 
   A linked list index is ____ that represents the position of a node in a linked list.
   
   
   
   
   1.  a variable
   
   
   2.  a character
   
   
   3.  a Boolean
   
   
   4. An Integer
   
   
   
   
   
   
   
   
   


5. 
   In a Stack the command to access nth element from the top of the stack s will be ___________.
   
   
   
   
   1.  S [top-n-1]
   
   
   2.  S [Top+n]
   
   
   3.  both a & b
   
   
   4.  S[Top-n]
   
   
   
   
   
   
   
   
   


6. 
   ______ form of access is used to add and remove nodes from a stack.
   
   
   
   
   1.  FIFO
   
   
   2.  LIFO
   
   
   3.  both a & b
   
   
   4.  none of the above
   
   
   
   
   
   
   
   
   


7. 
   The in order traversal of tree will yield a sorted listing of elements of tree in _______________.
   
   
   
   
   1.  Binary search trees
   
   
   2.  Heaps
   
   
   3.  Binary trees
   
   
   4.  None of above
   
   
   
   
   
   
   
   
   


8. 
   Each data item in a record may be a group item composed of sub-items; those items which are in decomposable are called ________.
   
   
   
   
   1.  scalars
   
   
   2.  atoms
   
   
   3.  elementary items
   
   
   4.  all of above
   
   
   
   
   
   
   
   
   


9. 
   Suppose we need to sort a list of employee records in ascending order, using the social security number (a 9-digit number) as the key (i.e., sort the records by social security number). If we need to guarantee that the running time will be no worse than n log n, which sorting methods could we use?
   
   
   1.  quick sort
   
   
   2.  insertion sort
   
   
   3.  merge sort
   
   
   4.  none of above
   
   
   
   
   
   
   
   
   
   
   
   
   


10. 
    The way a card game player arranges his cards as he picks them one by one can be compared to ____.
    
    
    
    
    1.  Merge sort
    
    
    2.  Bubble sort
    
    
    3.  Quick sort
    
    
    4.  Insertion sort
    
    
    
    
    
    
    
    
    

---