Question # 1

If there are N elements in an array then the number of maximum steps needed to find an element using Binary Search is _______ .

Choose an answer

N

N²

Nlog₂N

log₂N

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

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

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

Choose an answer

This dummy node never has a value

This dummy node has always some dummy values

This dummy node has either no value or some dummy value

This dummy node has always some integer value

Which of the following is not true regarding the maze generation ?

Choose an answer

Randomly remove walls until the entrance and exit cells are in same set

Removing a wall is the same as doing union of operation

Removing a randomly chosen wall if the cell is separatedare already in the same set

Do not remove a randomly chosen wall if the cells it separates are already in the same set.

A binary tree with 33 internal nodes has _______ links to internal nodes.

Choose an answer

31

32

33

66

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.

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

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

There is/are ________ case/s for rotation in an AVL tree,

Choose an answer

1

2

3

4

Consider te following array 23 15 5 12 40 10 7 After the first pass of a particular algorithm, the array looks like 15 12 23 10 7 40 Name the algorithm used

Choose an answer

Heap sort

Selection sort

insertion sort

Bubble sort

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