The total number of comparisons in a bubble sort is ______.
O(n2) O(2n) O(n log n) None of the above
The dummy header in linked list contain _________.
Pointer to the last record of the actual data Last record of the actual data Both a & b First record of the actual data
A sort which compares adjacent elements in a list and switches where necessary is ____.
insertion sort bubble sort quick sort heap sort
A binary tree can easily be converted into q 2-tree ____________.
by inserting an external nodes for non-empty node by inserting an internal nodes for non-empty node by replacing each empty sub tree by a new internal node by replacing each empty sub tree by a new external node
Write the out put of the fol low ing pro gram: int a[] = {1,2,3}*P;
Run time error Address of the first element Address of the third element Junk value
In linked lists there are no NULL links in _______________.
Single linked list Circular linked list Linear linked list both a & c
In a Heap tree _____________.
Values in a node is greater than every value in children of it. Values in a node is greater than every value in left sub tree and smaller than right sub tree Both a & b None of above
The post order traversal of a binary tree is DEBFCA. Find out the pre order traversal ___________.
ABDCEF ABFCDE ADBFEC ABDECF
The total number of comparisons made in quick sort for sorting a file of size n, is _______.
n(log n) O(n2) O(n log n) 2n(log n)
Two main measures for the efficiency of an algorithm are ______.
Data and space Complexity and capacity Processor and memory Time and space
Post a Comment