CS301P Final Term Quiz 9 July 2023 by Miss Mehwish

We also provide Past papers for Mids. and Finals

Cross Check your answers before submitting directly from the file. We are not responsible for 100% correction as human error exists

Q1. Binary Search Algorithm cannot be applied to:

1. Array sorted in ascending order
2. Array sorted in descending order
3. Array sorted in any order
4. Linked List

Correct option: d) Linked List

Q2. Which of the following formula gives the index position of the right child of "i"?

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

Correct option: a) 2*i + 1

Q3. In Binary Search Algorithm, if the value being searched is greater than "mid", then the updated "low" for the right half of the array will be computed as:

1. Low = mid - 1
2. Low = mid + high
3. Low = mid * 2
4. Low = mid + 1

Correct option: d) Low = mid + 1

Q4. If we call the union function as union(5, 7), then the name of the new set will be:

1. 5
2. 7
3. 5 + 7
4. 5 & 7

Correct option: c) 5 + 7

Q5. Which of the following methods takes an array to make a heap out of it?

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

Correct option: c) Buildheap()

Q6. Which of the following methods takes one element at a time to make a heap?

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

Correct option: a) Insert()

Q7. Which of the following formulas gives the index position of the left child of "i"?

1. 2 + i
2. i/2