mediumFPSCNTSCSSPPSCFIAOTSIBASTSECATProgramming & Databases
Answer explanation
Explanation included
Practice quiz ready
Continue practising this MCQ topic
Use these links to review the full topic, start a timed quiz, or open the exam hub connected with this question.
Related Programming & Databases MCQs
View all1Which Operation can’t be performed by Queue?2Where is a local variable normally accessible?3What does a data type define?4What is the purpose of a break statement inside a loop?5Which loop is generally most suitable when the number of iterations is known in advance?6Which program translates an entire high-level programming language source code into machine code before execution?
Answer and explanation
Correct Answer: A: A function calling itself to solve a smaller version of a problem
Explanation: Recursion is a technique in which a function calls itself with a smaller or simpler version of the original problem. A recursive solution must normally include a base case that stops further calls. Without a valid base case, recursion may continue until available call-stack space is exhausted.
Continue practice
More Programming & Databases MCQs with answers
Use these links to review related questions, practise the full topic, or open the exam preparation pages connected with this MCQ.
Related questions
- Which Operation can’t be performed by Queue?
- Where is a local variable normally accessible?
- What does a data type define?
- What is the purpose of a break statement inside a loop?
- Which loop is generally most suitable when the number of iterations is known in advance?
- Which program translates an entire high-level programming language source code into machine code before execution?