Question # 1

A complete binary tree us a tree that is ___ filled with the possible exception of the bottom level.

Choose an answer

partially

completely

incompletely

partly

Double link list is always has one NULL pointer

Choose an answer

True

False

Not Sure

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

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 both pointers of the node in a binary trees are NULL then it will be a___

Choose an answer

Inner node

Leaf node

Root node

None of the above

Suppose that a selection sort of 100 items has completed 42 iterations of the main loop. How many items are now guaranteed to be in their final spot (never to be moved again)?

Choose an answer

21

41

42

53

By using _____ we avoid recursive method of traversing a tree,which makes use of stacks and consumes a lot of memory and time.

Choose an answer

Binary tree only

Threaded binary tree

Heap data structure

Huffman encoding

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

Which of the following statement is NOT true about threaded binary tree?

Choose an answer

Right thread of the right-most node points to the dummy node

Left thread of the left-most node points to the dummy node.

The left pointer of dummy node points to the root node of the tree

Left thread of the right-most node points to the dummy node.

Which of the following heap method increase the value of key at position „p‟ by the amount „delta‟?

Choose an answer

increaseKey(p,delta)

decreaseKey(p,delta)

preculateDown(p,delta)

remove(p,delta)

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