Java Programming Language › Recursion in Java › Question #24831
Multiple Choice Moderate

QBase case for factorial?

ID: #24831 Recursion in Java 19 views
Question Info
#24831Q ID
ModerateDifficulty
Recursion in JavaTopic
Start Quiz on This Topic
 Your Answer

Select All That Apply

Tick every correct option, then press Check Answer.

  • A n = 1 ✔ ✖
  • B n = 0 ✔ ✖
  • C n = 2 ✔ ✖
  • D n = -1 ✔ ✖
Correct Answer

Explanation

Answer: (b) n = 0
 Continue Practice
Previous Question Next Question
 Share

Share This Question

Challenge a friend or share with your study group.

 More from This Topic

Related MCQ Questions

Disadvantage of recursion?... You are given a function to compute factorial using recursion: public int factorial(int n) { if (n == 0) { return 1; } return n * factorial(n - 1); } What is the base case in th... Which problem can be solved using recursion?... Binary search recursion code will: (i) Have two base cases (ii) Have two recursive calls (iii) May cause stack overflow... Which statement is true?... Which is true about recursion and iteration?... What is a stack overflow error?... Which of the following best describes a recursive function?... What is recursion in computer programming?... Which of the following is true about recursion?...