Recursion Mcqs

Our collections of Multiple choice questions and answers focuses on study of ” Recursion ” in Data Structures. These questions are chosen from a collection of most authoritative and best reference books on Data Structures. Our aim is to prepare an individual for competitive exams like NTS | GAT | ECAT | Data Warehouse jobs | Data Mining | DB administration jobs Software House and Computer Programmer jobs | University and College entrance exams and various tests and job interviews. One should practice our Mcqs to assimilate knowledge on Recursion comprehensively.

166.
Which of the following methods can be used to find the largest and smallest number in a linked list?

Recursion

Iteration

Both Recursion and iteration

None of the mentioned

167.
Which of the following methods can be used to find the nth fibonnaci number?

Dynamic programming

Recursion

Iteration

All of the mentioned

168.
Which of the following methods can be used to find the sum of digits of a number?

Recursion

Iteration

Greedy algorithm

Both recursion and iteration

169.
Which of the following methods can be used to find the sum of first n natural numbers?

Iteration

Recursion

Binomial coefficient

All of the mentioned

170.
Which of the following methods can be used to search an element in a linked list?

Iterative linear search

Iterative binary search

Recursive binary search

All of the mentioned

171.
Which of the following methods used to find the sum of first n natural numbers has the least time complexity?

Recursion

Iteration

Binomial coefficient

All of the mentioned

172.
Which of the following problems can be solved using recursion?

Factorial of a number

Nth fibonacci number

Length of a string

All of the mentioned

173.
Which of the following recurrence relations can be used to find the nth fibonacci number?

F(n) = F(n) + F(n – 1)

F(n) = F(n) + F(n + 1)

F(n) = F(n – 1)

F(n) = F(n – 1) + F(n – 2)

174.
Which of the following recursive formula can be used to find the factorial of a number?

Fact(n) = n * fact(n)

Fact(n) = n * fact(n+1)

Fact(n) = n * fact(n-1)

Fact(n) = n * fact(1)

175.
Which of the following techniques can be used to search an element in an unsorted array?

Iterative linear search

Recursive binary search

Iterative binary search

All of the mentioned

176.
You have to find the sum of digits of a number given that the number is always greater than 0. Which of the following base cases can replace the base case for the below code?

If(n == 0) return 1

If(n == 1) return 0

If(n == 1) return 1

None of the mentioned

177.
________________ is a powerful technique which is used to invoke a function.

Computing

Recursion

Big O

None of the above

error: You are not allowed to do so.....
0Shares
0
Scroll to Top