Lec 7: Loops and Recursion

Question 1

What is the syntax of a do loop

Answer 1

do{
Statement(s);
} while (condition);

Question 2

What are 2 examples of infinitely running loops?

Answer 2

for(; ; ){} and while(true){}

Question 3

What does continue do in a loop?

Answer 3

Immediately ends that loop run and goes for a new run

Question 4

What is the number of iterations for
for (int i = 1; i < n; n++){
//iteration
}

Answer 4

n - 1

Question 5

True or false: Every recursive method must have a base case or a stopping condition

Answer 5

True

Question 6

True or false: A recursive method is invoked differently from a non-recursive method

Answer 6

False

Question 7

True or false: Every recursive method must have a return value

Answer 7

False

Question 8

What error happens when a recursive method doesn’t eventually get to a solution?

Answer 8

StackOverFlow

Question 9

In the following method, what is the base case?
static int xMethod(int n){
if (n==1){
return 1;
}else{
return n + xMethod(n-1)}
}

Answer 9

n == 1

Question 10

True or false: Recursive methods take more memory space than non-recursive methods

Answer 10

True

Question 11

True or false: recursive methods run faster than non-recursive methods

Answer 11

False

Question 12

True or false: A recursive method can always be replaced by a non-recursive method

Answer 12

True