Why is the constructor of the QueueLinkedList class empty?

because initialization of data members of the QueueLinkedList class is performed by the destructor of the LinkedList class because initialization of data members of the QueueLinkedList class is performed by the constructor of the LinkedList class. because initialization of data members of the LinkedList class is performed by the constructor of the LinkedList class. because initialization of data members of the LinkedList class is performed by the destructor of the LinkedList class.

A sort which iteratively passes through a list to exchange the first element with any element less than it and then repeats with a new first element is called ______________.

heap sort bubble sort quick sort insertion sort

The complexity of linear search algorithm is _______.

O(n) O(log n) O(n log n) O(log 2n)

The result of evaluating prefix expression */b+-dacd, where a = 3, b = 6, c = 1, d = 5 is ______.

12 4 16 10

The indirect change of the values of a variable in one module by another module is called ______________.

side effect inter-module change internal change side-module update

As part of the maintenance work, you are entrusted with the work of rearranging the library books in a shelf in proper order, at the end of each day. The ideal choice will be ________________.

Merge sort Insertion sort Selection sort Bubble sort

The elements of an array are stored successively in memory cells because ____________.

by this way computer can keep track only the address of the first element and the addresses of other elements can be calculated the architecture of computer memory does not allow arrays to store other than serially none of the above both of the above

Which of the following is not the required condition for binary search algorithm?

There should be the direct access to the middle element in any sublist The list must be sorted Both a & b There must be mechanism to delete and/or insert elements in listWhen converting binary tree into extended binary tree, all the original nodes in binary tree are ____________.

external nodes on extended tree vanished on extended tree internal nodes on extended tree none of the above

If the out degree of every node is exactly equal to M or 0 and the num ber of nodes at level K is Mk-1 [con sider root at level 1], then tree is called as (i) Full m-ary try (ii) Complete m-ary tree (iii)Positional m-ary tree

Only (ii) Only (i) Both (ii) and (III) Both (i) and (ii)

## Post a Comment