Same chapter3 marksDifficulty: Medium
Write a recursive Java method to compute the nth term of the Fibonacci sequence, taking the first two terms as 0 and 1.
Recursion
3 marksDifficulty: Medium
Write a recursive Java method to reverse a string.
Original Khojo Papers practice question — not from a past board paper.
Answer
String rev(String s) { if (s.length() <= 1) return s; return rev(s.substring(1)) + s.charAt(0); }
No citable source has been recorded for this record. Treat it as practice material, not as fact.
Explanation
The base case is a string of length zero or one, which is its own reverse.
Related questions
From the same topic and chapter, at a similar level.
Same chapter3 marksDifficulty: Medium
Write a recursive Java method to find the greatest common divisor of two positive integers.
Recursion
Same chapter3 marksDifficulty: Medium
Write a recursive Java method to compute the factorial of a non-negative integer n.
Recursion
Same chapter3 marksDifficulty: Medium
State two advantages and two disadvantages of recursion compared with iteration.
Recursion
Same chapter3 marksDifficulty: Medium
How many times is the method called in total when fact(5) is executed, taking fact(0) as the base case?
Recursion
Same subject3 marksDifficulty: Medium
Reduce F(A, B, C) = Σ(0, 1, 2, 3) using a Karnaugh map.
Karnaugh Maps