CS301P Quiz Jan 2026

VU QUIZ REPORT

Subject: CS301P

Quiz Completed: 1/5/2026, 8:58:03 AM Total Questions: 10

Which of the following formula gives the index position of the left child of “i”?

1. 2+i
2. 2*i
3. i/2
4. 2i+1

Correct answer: 2*i

Which of the following method take one element at a time to make a heap?

1. traverse ()
2. Buildheap()
3. Insert ()
4. percolatedown ()

Correct answer: Insert ()

A complete binary tree with a property that the value at each node is at least as small as the values in its children are called as _______. A. Binary search tree

B. Min Heap

C. Max Heap D. Binary tree The ASCII value for character ‘A’ is: A. 68 B. 66 C. 67

D. 65

Selected Answer: D

Consider a max heap, represented by the following array: 49, 39, 36, 31, 27, 21, 35, 12 After the deletion of node with value 49. Which of the following is the updated max heap?

1. 39, 36, 35 ,21, 27, 31, 12
2. 39, 36, 31 ,27, 21, 35, 12
3. 39, 31, 36,12, 27, 21, 35
4. 39, 36, 31,12, 27, 21, 35

Correct answer: 39, 31, 36,12, 27, 21, 35

What is the total frequency of character ‘B’ in the given Huffman encoding tree?

1. 9
2. 5
3. 0
4. 14

Correct answer: 5

Which of the following node has the maximum value in a max heap?

1. None of the given options.
2. Root node
3. Left most child
4. Right most child

Correct answer: Root node

Which of the following method takes an array to make a heap out of it?

1. Buildheap()
2. traverse ()
3. percolatedown ()
4. Insert ()

Correct answer: Buildheap()

Selected Answer: A

Which of the following bit stream represents the string ‘cab’ in the given Huffman tree?

1. 110 1011 0
2. 1011 0 110
3. 100 110 111
4. 1011 0 111

Correct answer: 1011 0 110

In min heap, deletemin() will put the ______ element at the first position of the array. A. None of the given options. B. Third

C. Last

D. Second