Discussion
_______ is often used to prove the correctness of a recursive function.
Answer: C
Mathematical induction is often used to prove the correctness of a recursive function. The base case corresponds to the non-recursive case of the function and the induction step shows that, if the recursive calls return correct results for smaller inputs, the function is correct for the larger input.
Diagonalization is a technique for proving that some sets are uncountable or problems undecidable. Commutativity is an algebraic property, and matrix multiplication is a computation. None of them matches the structure of a recursive proof.
No comment is present. Be the first to comment.
Loading…
Post your comment
Please log in or register to post a comment.
Examination Categories
- SSC Exams
- Banking Exams
- Teaching Exams
- Civil Services Exams
- Railways Exams
- Engineering Recruitment Exams
- Defence Exams
- State Government Exams
- Police Exams
- Insurance Exams
- Nursing Exams
- Other Government Exams
- NRA CET
- PG Entrance Exams
- Campus Placement
- MBA Entrance Exams
- CUET and UG Entrance
- Judiciary Exams
- Regulatory Body Exams
- Software Development