Question # 1

Merge sort makes two recursive calls,which statement is true after these recursive calls,finish but before the merge step?

Choose an answer

Elements in the first half of the array are less than or equal to elements in the second half of the array

None of the given options

The array elements form a heap.

Elements in the second half of the array are less than or equal to elements in the first half of the array

Which one of the following is NOT the property of equivalence relation

Choose an answer

Reflexive

Symmetric

Transitive

Associative

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

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

Choose an answer

2

3

4

5

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]

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

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

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

Choose an answer

31

32

33

66

Double link list is always has one NULL pointer

Choose an answer

True

False

Not Sure

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

The _______ method of list will position the currentNode and lastCurrentNode at the start of the list.

Choose an answer

Remove

Back

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

Binary Search is an algorithm of searching ,used with the ____ data .

Choose an answer

Sorted

Unsorted

Heterogeneous

A compound data structure is the data structure which can have multiple data items of same type or of different types,which of the following can be considered compound data structure ?

Choose an answer

Arrays

LinkLists

Binary Search Trees

All of the given options

_________ is a data structure that can grow easily dynamically at run time without having to copy existing elements.

Choose an answer

Array ()

List

Both of these

None of these

If a complete binary tree has n number of nodes then its height will be

Choose an answer

Log₂(n+1)-1

2ⁿ

2ⁿ-1

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

Which one of the following is valid postfix expression?

Choose an answer

ab+c*d-

abc*+d-

abc+*d-

abc*)+d-

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

Which one is a self-referential data type?

Choose an answer

Stack

Queue

Link list

All of these

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