-->

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

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 total number of comparisons in a bubble sort is ______.

1.  O(n2)

2.  O(2n)

3.  O(n log n)

4.  None of the above

1.  Pointer to the last record of the actual data

2.  Last record of the actual data

3.  Both a & b

4.  First record of the actual data

3. A sort which compares adjacent elements in a list and switches where necessary is ____.

1.  insertion sort

2.  bubble sort

3.  quick sort

4.  heap sort

4. A binary tree can easily be converted into q 2-tree ____________.

1.  by inserting an external nodes for non-empty node

2.  by inserting an internal nodes for non-empty node

3.  by replacing each empty sub tree by a new internal node

4.  by replacing each empty sub tree by a new external node

5.  Write the out put of the fol low ing pro gram: int a[] = {1,2,3}*P;

1.  Run time error

2.  Address of the first element

3.  Address of the third element

4.  Junk value

4.  both a & c

7. In a Heap tree _____________.

1.  Values in a node is greater than every value in children of it.

2.  Values in a node is greater than every value in left sub tree and smaller than right sub tree

3.  Both a & b

4.  None of above

8. The post order traversal of a binary tree is DEBFCA. Find out the pre order traversal ___________.

1.  ABDCEF

2.  ABFCDE

4.  ABDECF

9. The total number of comparisons made in quick sort for sorting a file of size n, is _______.

1.  n(log n)

2.  O(n2)

3.  O(n log n)

4.  2n(log n)

10.  Two main measures for the efficiency of an algorithm are ______.

1.  Data and space

2.  Complexity and capacity

3.  Processor and memory

4.  Time and space