Question # 1

Consider the following paragraph with blanks. A …….…….. is a linear list where …………… and ………… take place at the same end . This end is called the …….………. What would be the correct filling the above blank positions?

Choose an answer

(i) queue (ii) insertion (iii) removals (iv) top

(i) stack (ii) insertion (iii) removals (iv) bottom

(i) stack (ii) insertion (iii) removals (iv) top

(i) tree (ii) insertion (iii) removals (iv) top

In complete binary tree the bottom level is filled from________

Choose an answer

Left to right

Right to left

Not filled at all

None of the given option

A complete binary tree of height 3 has between ________ nodes.

Choose an answer

8 to 14

8 to 15

8 to 16

8 to 17

A simple sorting algorithm like selection sort or bubble sort have a wrostcase of

Choose an answer

O(1) time because all lists take the same amount of time to sort

O(n) time because it has to perform n swaps to order the list.

O(n² ) time because sorting 1 element takes O(n) time - After 1 pass through the list, either of these algorithms can guarantee that 1 element is sorted.

O(n³ ) time, because the worst case has really random input which takes longer to sort.

Suppose you implement a heap (with the largest element on top) in an array. Consider the different arrays below, determine the one that cannot possibly be a heap:

Choose an answer

7 6 5 4 3 2 1

7 3 6 2 1 4 5

7 6 4 3 5 2 1

7 3 6 4 2 5 1

Use of binary tree in compression of data is known as _______

Choose an answer

Traversal

Heap

Union

Huffman encoding

A binary tree with N internal nodes has ____ links ,links to internal node and ____links to external

Choose an answer

N+1, 2N, N-1

N+1, N-1, 2N

2N, N-1, N+1

N-1, 2N, N+1

The data of the problem is of 2 GB and the hard disk is of 1 GB capacity,to solve this problem we should

Choose an answer

use better data structure

Increase the hard disk space

Use the better algorithm

Use as much data as we can store on the hard disk

If there are 56 internal nodes in a binary tree then how many external nodes this binary tree will have?

Choose an answer

54

55

56

57

If both pointers of the node in a binary tree are NULL then it will be a/an _______ .

Choose an answer

Inner node

Leaf node

Root node

None of the given options

In case of deleting a node from AVL tree,rotation could be prolong to the root node.

Choose an answer

yes

no

not sure

More Classes

Other Links

CS-301 Final Term Exams Preparation Virtual University MCQs With Answers

Choose an answer

Choose an answer

Choose an answer

Choose an answer

Choose an answer

Choose an answer

Choose an answer

Choose an answer

Choose an answer

Choose an answer

Choose an answer