Question # 1

Which of the following statement is correct property of binary trees?

Choose an answer

A binary tree with internal nodes has N+1 internal links

A binary tree with N external nodes has 2N internal nodes.

A binary tree with N internal nodes has N+ 1 external node.

None of above statement is a property of the binary tree.

Which of the given option is NOT a factor in Union by Size:

Choose an answer

Maintain sizes (number of nodes) of all trees, and during union.

Make smaller tree, the subtree of the larger one

Make the larger tree, the subtree of the smaller one.

Implementation: for each root node i, instead of setting parent[i] to -1, set it to -k if tree rooted at i has k nodes

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.

Each node in a double link list has ,

Choose an answer

1 pointer

2 pointer

3 pointer

4 pointers

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

Choose an answer

54

55

56

57

The _______ method of list will position the currentNode and lastCurrentNode at the start of the list.

Choose an answer

Remove

Back

The maximum number of external nodes for a binary tree of Height H is ____

Choose an answer

2^h

2^h+1

2^h+2

2^h+3

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

Choose an answer

yes

no

not sure

Double link list is always has one NULL pointer

Choose an answer

True

False

Not Sure

Suppose we have a hash table whose hash function is "n% 12",if the number 35 is already in the hash table which of the following numbers would cause a collision ?

Choose an answer

144

145

143

148

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