Ads 720 x 90

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







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 search tree whose left subtree and right subtree differ in hight by at most 1 unit is called ___________.


    1.  Lemma tree

    2.  Red-black tree

    3.  AVL tree

    4.  None of the above







  2. Which of the following is not a limitation of binary search algorithm?


    1.  requirement of sorted array is expensive when a lot of insertion and deletions are needed

    2.  must use a sorted array

    3.  there must be a mechanism to access middle element directly

    4.  binary search algorithm is not efficient when the data elements are more than 1000







  3. For sorting a file of size n by straight selection sort, the number of comparisons made in the first pass is _________.


    1.  n - 1

    2.  n(n - 1)/2

    3.  n

    4.  None of the above







  4. Finding the location of the element with a given value is:


    1.  Graph

    2.  Traversal

    3.  Tree

    4.  Search







  5. Which if the following is/are the levels of implementation of data structure?


    1.  Implementation level

    2.  Application level

    3.  Abstract level

    4.  All of the above







  6. A _______ is a data structure that organizes data similar to a line in the supermarket, where the first one in line is the first one out.


    1.  stacks linked list

    2.  queue linked list

    3.  both a & b

    4.  none of the above







  7.  Heap sort is found to be very efficient _________.


    1.  with regard to storage requirement

    2.  regarding overheads involved

    3.  in time consumption

    4.  none of the above









  8. The complexity of Bubble sort algorithm is _____________.


    1.  O(n log n)

    2.  O(n2)

    3.  O(n)

    4.  O(log n)







  9. _______ form of access is used to add and remove nodes from a queue.


    1.  FIFO, First In First Out

    2.  LIFO,Last In First Out

    3.  FIFO, First In First Out

    4.  none of the above







  10. In a balance binary tree the height of two sub trees of every node can not differ by more than _______________.


    1.  0

    2.  2

    3.  3

    4.  1















Post a Comment

0 Comments