Question # 1

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

Choose an answer

22

23

48

25

Let heap stored in an array as H = [50, 40, 37, 32, 28, 22, 36, 13]. In other words, the root of the heap contains the maximum element. What is the result of deleting 40 from this heap

Choose an answer

[50,32, 37,13, 28, 22, 36] according to max heap property

[37, 28, 32, 22, 36, 13]

[37, 36, 32, 28, 13, 22]

[37, 32, 36, 13, 28, 22]

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;

Every AVL is

Choose an answer

Binary tree

Complete tree

None of these

Binary Search tree

If numbers 5,222,4,48 are inserted in queue,which one will be removed first?

Choose an answer

48

4

222

5

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.

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 is NOT a correct statement about Table ADT.

Choose an answer

n a table, the type of information in columns may be different. yes

A table consists of several columns, known as entities.

The row of a table is called a record.

A major use of table is in databases where we build and use tables for keeping information.

In a min heap , preculateDown procedure will move smaller value______ and bigger value______.

Choose an answer

left,right

right,left

up,down

down,up

If a max heap is implemented using a partially filled array called data, and the array contains n elements (n > 0), where is the entry with the greatest value?

Choose an answer

Data[0]

data[1]

data[n-1]

data[n]

In a selection sort of n element ,how many times the swap function is called the execution of the algorithm?

Choose an answer

n-1

0

n log n

1

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