Question # 1

A kind of expression where the operator is present between two operands called ________ expressions .

Choose an answer

Postfix

Infix

Prefix

None of the above

Consider the following paragraph with blanks. A …….…….. is a linear list where …………… and ………… take place at the same end . This end is called the …….………. What would be the correct filling the above blank positions?

Choose an answer

(i) queue (ii) insertion (iii) removals (iv) top

(i) stack (ii) insertion (iii) removals (iv) bottom

(i) stack (ii) insertion (iii) removals (iv) top

(i) tree (ii) insertion (iii) removals (iv) top

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

Choose an answer

31

32

33

66

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

Choose an answer

54

55

56

57

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.

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

A binary tree with N internal nodes has _____ links, _______ links to internal nodes and ________ links to external nodes

Choose an answer

N+1, 2N, N-1

N+1, N-1, 2N

2N, N-1, N+1

N-1, 2N, N+1

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 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

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

Choose an answer

48

4

222

5

Consider a min heap, represented by the following array: 3,4,6,7,5 After calling the function deleteMin().Which of the following is the updated min heap?

Choose an answer

4,6,7,5

6,7,5,4

4,5,6,7

4,6,5,7

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;

Double link list is always has one NULL pointer

Choose an answer

True

False

Not Sure

Huffman encoding uses _________ tree to develop codes of varying lengths for the letters used in the original message

Choose an answer

Linked List

Stack

Queue

Binary tree

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]

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

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

Choose an answer

22

23

48

25

If a complete binary tree has height h then its no. of nodes will be,

Choose an answer

Log (h)

2^h+1 - 1

Log (h) - 1

2^h - 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.

Every AVL is

Choose an answer

Binary tree

Complete tree

None of these

Binary Search tree

More Classes

Other Links

PHY-101 Quiz OnlineTest 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

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