Pakistan's best MCQs practice hub — FPSC · PPSC · CSS · NTS · Other Exams
Login

What is ‘Recursion’ in programming?

AAn error
BA loop
CA function calling itself
DA data structure

Explanation

• Recursive functions solve problems by breaking them into smaller sub-problems.
• Must have a ‘base case’ to prevent infinite loops.
• Useful for tree and graph algorithms.

Exam Relevance
  • Topic: Competitive Exams
  • Subtopic: FPSC/PPSC/NTS Past Papers
Submitted by: mcqstutor Team More Computer MCQs →

No Comments

Leave a comment

Your email address will not be published. Required fields are marked *