PRUTOR FINAL QUIZ

Q:1. In a binary search algorithm, Which is the worst case scenario:-

1.O(1)

2.O(log n)

3.O(n)

4.O(n/2)

---

Q:2. Which statement is correct in case of tower of hanoi ?

1.It consists of more than three rods.

2.Only one disk can move at a time.

3.any disk can be moved on to any one.

4.None of the above.

---

Q:3. How many swaps will be performed in selection sort in worst case :-

1.zero

2.one

3.n-1

4.n

---

Q:4. Which of the following is true for binary search algorithm :-

1.Array can be in sorted order

2.Search is performed by repetedly dividing search interval into one fourth

3.If there are two or more numbers equals to the search item, either can be true depending on implementation

4.Its best case complexity is O(log n)

---

Q:5. Which of the following statement is true for recursion ?

1.Absence of base condition can cause infinite loop.

2.There is only one base case.

3.Both 1 and 2.

4.None of the above.

---

ANSWERS

Ans 1:- O(logn)

 In binary search, we eliminate half of the possible entries. So, worst case time complexity of binary search is logarithmic.

Ans 2 Only one disk can move at a time.

Rules for tower of hanoi is only one disk can move at a time.

Ans 3 n-1

selection sort gives the minimum number of swaps to sort an array.

Ans 4 Array can be sorted order

Binary Search works by assuming the middle of the array contains the middle value in the array.

Ans 5 Absence of base condition can cause infinte loop

needs a condition to terminate