Question # 1

I have implemented the queue with a linked list, keeping track of a front pointer and a rear pointer. Which of these pointers will change during an insertion into an EMPTY queue?

Choose an answer

Neither changes

only front pointer charges

Only rear pointer changes.

Both change. Since it is an empty queue the front and rear are initialize to -1, so on insertion both the pointers will change and point to 0.

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

_____ only removes items in reserve order as they were entered

Choose an answer

Stack

Queue

Both of these

None of these

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.

A complete binary tree of height 3 has between _____ node

Choose an answer

8-14

8-15

8-16

8-17

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

Choose an answer

yes

no

not sure

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

Suppose currentNode refers to a node in a linked list(using the Node class with member variables called data and next node),What statement changes currentNode so that it refers to the next node?

Choose an answer

currentNode ++;

currentNode = nextNode;

currentNode += nextNode;

currentNode = currentNode->nextNode;

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

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)

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 now 1 but y is still 0

x is still 0,but y is now 2

x is now1 1 and y is now 2

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