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

The difference between the binary tree and a binary search tree is that:

Choose an answer

a binary search tree has two children per node whereas a binary tree can have none, one, or two children per node

in binary search tree nodes are inserted based on the values they contain

in binary tree nodes are inserted based on the values they contain

none of these

In an array list the current element is

Choose an answer

the first element

the middle element

the last element

The element where the current pointer points to

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]

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

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

Choose an answer

N

N²

Nlog2N

log₂N

A binary relation R over S is called an equivalence relation if it has following property(s)

Choose an answer

Reflexivity

Symmetry

Transitivity

All of the given options

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

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 following statement is true about find(x) operation :

Choose an answer

A find(x) on element x is performed by returning exactly the same node that is found.

A find(x) on element x is performed by returning the root of the tree containing x.

A find(x) on element x is performed by returning TRUE.

A find(x) on element x is performed by returning the whole tree itself containing x

Suppose that a selection sort of 100 items has completed 42 iterations of the main loop. How many items are now guaranteed to be in their final spot (never to be moved again)?

Choose an answer

21

41

42

53

If there are 23 external nodes in a binary tree then what will be the no. of internal nodes in this binary tree?

Choose an answer

23

24

21

22 (n-1)

Here is an array of ten integers: 5 3 8 9 1 7 0 2 6 4 The array after the FIRST iteration of the large loop in a selection sort (sorting from smallest to largest).

Choose an answer

0 3 8 9 1 7 5 2 6 4

2 6 4 0 3 8 9 1 7 5

2 6 4 9 1 7 0 3 8 5

0 3 8 2 6 4 9 1 7 5

Which of the following statement is correct?

Choose an answer

A Threaded Binary Tree is a binary tree in which every node that does not have a left child has a THREAD (in actual sense, a link) to its INORDER successor.

A Threaded Binary Tree is a binary tree in which every node that does not have a right child has a THREAD (in actual sense, a link) to its PREOREDR successor.

A Threaded Binary Tree is a binary tree in which every node that does not have a right child has a THREAD (in actual sense, a link) to its INORDER successor.

A Threaded Binary Tree is a binary tree in which every node that does not have a right child has a THREAD (in actual sense, a link) to its POSTORDER successor.

In an array we can store data elements of different types

Choose an answer

True

False

Not sure

While joining nodes in the building of Huffman encoding tree if there are more nodes with same frequency, we choose the nodes _______.

Choose an answer

Randomly

That occur first in the text message

That are lexically smaller among others

That are lexically greater among others

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

If the bottom level of a binary tree is NOT completely filled, depicts that the tree is NOT a

Choose an answer

Expression tree

threaded binary tree

complete binary tree

perfectly complete binary tree

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

Consider the following infix expression: x – y * a + b / c Which of the following is a correct equivalent expression(s) for the above?

Choose an answer

x y -a * b +c /

x *y a - b c / +

x y a * - b c / +

x y a * - b/ + c

A complete binary tree of height ___ has node between 16 to 31.

Choose an answer

2

3

4

5

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