Courses

# Recurrence & Searching MCQ - 1

## 10 Questions MCQ Test GATE Computer Science Engineering(CSE) 2022 Mock Test Series | Recurrence & Searching MCQ - 1

Description
This mock test of Recurrence & Searching MCQ - 1 for Computer Science Engineering (CSE) helps you for every Computer Science Engineering (CSE) entrance exam. This contains 10 Multiple Choice Questions for Computer Science Engineering (CSE) Recurrence & Searching MCQ - 1 (mcq) to study with solutions a complete question bank. The solved questions answers in this Recurrence & Searching MCQ - 1 quiz give you a good mix of easy questions and tough questions. Computer Science Engineering (CSE) students definitely take this Recurrence & Searching MCQ - 1 exercise for a better result in the exam. You can find other Recurrence & Searching MCQ - 1 extra questions, long questions & short questions for Computer Science Engineering (CSE) on EduRev as well by searching above.
*Answer can only contain numeric values
QUESTION: 1

### The given diagram shows the flowchart for a recursive function  A(n). Assume that all statements, except for the recursive calls, have O(1)time complexity. If the worst case time complexity of this function is O(nα) then the least possible value (accurate up to two decimal positions) of α is ________. Flow chart for Recursive Function A(n). Solution:

If they are asking for worst case complexity hence,

By calling A(n) we get A(n/2) 5 times, Hence by applying masters theorem, Thus value of alpha will be 2.32

QUESTION: 2

### The recurrence relation that arises in relation with the complexity of binary search is:

Solution:

It is B. searching for only one half of the list. leading to T(n/2) + constant time in comparing and finding mid element.

QUESTION: 3

### The recurrence relation has the solution T (n) equal to

Solution:

According to Master theorem,       QUESTION: 4

Let

T(n) be the function defined by  Which of the following statements is true?

Solution:

using master method (case 1) QUESTION: 5

The solution to the recurrence equation Solution: We can apply Master's theorem case 1 with So, So, only option possible is B.

We can also directly solve as follows:   OR   QUESTION: 6

The running time of the following algorithm

Procedure A(n)

If n<=2 return (1) else return is best described by

Solution:

The complexity will be the number of times the recursion happens which is equal to the number of times we can take square root of n recursively, till n becomes 2.  QUESTION: 7

Consider the following recurrence relation Solution:    (We are taking floor of square root of numbers, and between
successive square roots number of numbers are in the series 3,5,7... like 3 numbers from 1...4,5numbers from 5-9 and so on).

We can try out options here or solve as shown at end:

Put So, answer must be B.

QUESTION: 8

The recurrence equation evaluates to

Solution:  QUESTION: 9

Consider a list of recursive algorithms and a list of recurrence relations as shown below. Each recurrence relation corresponds to exactly one algorithm and is used to derive the time complexity of the algorithm. Which of the following is the correct match between the algorithms and their recurrence relations?

Solution:
QUESTION: 10

Let T(N) be a function defined by the recurrence Which of the following statements is TRUE?

Solution:

Option C it can be done by Master theorem. So, is true for any real Hence Master theorem Case 1 satisfied, 