Question # 1

Which of the following statement is true about dummy node of threaded binary tree

Choose an answer

The left pointer of dummy node points to the itself while the right pointer points to the root of tree.

The left pointer of dummy node points to the root node of the tree while the right pointer points itself i.e. to dummy node

The left pointer of dummy node points to the root node of the tree while the right pointer is always NULL

The right pointer of dummy node points to the itself while the left pointer is always NULL

A binary relation R over S is called an equivalence relation if it has following property(s)

Choose an answer

Reflexivity

Symmetry

Transitivity

All 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

A binary tree with 24 internal node has ____ external node.

Choose an answer

22

23

48

25

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

Here is a small function definition:

void f(int i, int &k)

{ i

= 1; k = 2;

}

Suppose that a main program has two integer variables x and y, which are given the value 0. Then the main program calls f(x,y); What are the values of x and y after the function f finishes?

Choose an answer

Both x and y are still 0.

x is still 0, but y is now 2.

x is now 1, and y is now 2.

Which of the following statement is NOT true about find operation :

Choose an answer

It is not a requirement that a find operation returns any specific name, just that finds on two elements return the same answer if and only if they are in the same set.

One idea might be to use a tree to represent each set, since each element in a tree has the same root, thus the root can be used to name the set.

Initially each set contains one element.

initially each set contains one element and it does not make sense to make a tree of one node only.

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

Choose an answer

Traversal

Heap

Union

Huffman encoding

Consider a min heap, represented by the following array: 10,30,20,70,40,50,80,60 After inserting a node with value 31.Which of the following is the updated min heap?

Choose an answer

10,30,20,31,40,50,80,60,70

10,30,20,70,40,50,80,60,31

10,31,20,30,40,50,80,60,31

31,10,30,20,70,40,50,80,60

The difference between the binary tree and a binary search tree is that:

Choose an answer

a binary search tree has two children per node whereas a binary tree can have none, one, or two children per node

in binary search tree nodes are inserted based on the values they contain

in binary tree nodes are inserted based on the values they contain

none of these

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

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