Question # 1

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

By using __________we avoid the recursive method of traversing a Tree, which makes use of stacks and consumes a lot of memory and time.

Choose an answer

Binary tree only

Threaded binary tree

Heap data structure

Huffman encoding

Which formula is the best approximation for the depth of a heap with n nodes?

Choose an answer

log (base 2) of n

The number of digits in n (base 10), e.g., 145 has three digits

The square root of n

n

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

Merge sort and quicksort both fail into the same category of sorting algorithms,What is this category ?

Choose an answer

O(nlogn) sorts

Interchange sort

Average time is quadratic

None of the given options.

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

We can build a heap in ________ time.

Choose an answer

Linear

Exponential

Polynomial

None of the above

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

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

Choose an answer

Remove

Back

There is/are ________ case/s for rotation in an AVL tree,

Choose an answer

1

2

3

4

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

Choose an answer

2

3

4

5

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

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

If there are N internal nodes in a binary tree then what will be the number of the no,of external node in the binary tree?

Choose an answer

N-1

N

N+1

N+2

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 is a property of binary tree?

Choose an answer

A binary tree of N external nodes has N internal node.

A binary tree of N internal nodes has N+ 1 external node

A binary tree of N external nodes has N+ 1 internal node

A binary tree of N internal nodes has N- 1 external node.

A complete binary tree of height 3 has between _____ node

Choose an answer

8-14

8-15

8-16

8-17

Which of the following statement is NOT correct?

Choose an answer

In linked list the elements are necessarily to be contiguous

In the linked list the elements may locate at far positions in the memory

in the linked list each elements also has he address of the elements next to it

In an array the elements are contiguous

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 complete binary tree of height ____ has nodes between 16-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