Recursion Quiz 3

Which approach does the naive recursive rope cutting problem use?

What is the total number of subsets generated for an array of size n using recursion?

What is the recurrence relation for solving Tower of Hanoi?

What will be the minimum number of moves required to solve Tower of Hanoi for 4 disks?

In the Josephus problem, which of the following correctly represents the recursive solution?

For Josephus(n = 5, k = 2), what is the position of the survivor (0-based index)?

What is the time complexity of the naive recursive solution to the Subset Sum Problem?

Which technique is used for generating all permutations of a string recursively?

The Josephus problem is closely related to:

What is wrong with the following code?

function permute(str, l, r) {

if (l === r) console.log(str);
for (let i = l; i <= r; i++) {
[str[l], str[i]] = [str[i], str[l]];
permute(str, l + 1, r);
[str[l], str[i]] = [str[i], str[l]];
}
}

permute("abc", 0, 2);