Lecture 4

The process of defining a problem (or the solution to a problem) in terms of (a simpler version of) itself is known as:

• repetition

• recursion

• reapparition

• reversing

Which of the following is the best definition of a recursive method?

• A method that iterates itself exactly 5 times.

• A method that invokes itself by name within the method.

• A method that will never iterate infinitely.

• A method that cannot be called more than once.

Recursion is similar to which of the following?

• if-else

• switch-case

• loops

• none of the above

Name the condition at which the recursive method will stop calling itself.

• Base case

• Worst Case

• Best Case

• None of the above

What is the following recursive function missing?

int fun1(int x, int y){

return fun1(x - 1, x + y);

}

• A base case

• A general case

• a title

• A return statement

Which of the following problems can be solved using recursion?

• finding Nth number of the Fibonacci sequence

• finding the factorial of a number

• finding the length of a string

• all of the above

What would happen if the base case if not defined in the recursive method?

• Stack Overflow

• Stack Underflow

• Program Crashes

• None of the above

Which data structure is required to perform recursion?

• Queue

• Stack

• LinkedList

• Graph

A recursive method is a method in which the solution of a problem depends upon

• smaller instance of the same problem

• larger instances of the same problem

• smaller instance of different problem

• larger instances of different problem

Where does the execution of the program starts?

• user-defined function

• main function

• void function

• else function