NEB Class 12 • Computer Science • Programming II • Practice Set

Recursion in C Practice Set: NEB 12 Computer

Q: Which equation should I remember?

Define result(n)=base when n reaches the stopping condition; otherwise combine current work with result(smaller n). Prove the argument moves toward the base case.

Q: How should I begin a numerical?

Draw the situation, list known quantities in SI units, choose the governing relation symbolically, substitute once and finish with a unit and reasonableness check.

Q: What is a common exam mistake?

Omitting a base case, failing to reduce the problem, recomputing expensive branches, or using recursion where input depth can overflow the stack.

Q: How can I practise this topic?

Alternate one concept explanation, one diagram and two numericals. Revisit errors after a day instead of only rereading the solution.

Q: Where can I get tuition support?

For online or physical KTM Tuition classes, call 9846662070. After Grade 12, the MKS Education panel below gives preparation and pre-counselling contacts.

Master Recursion in C through clear concepts, representations, a reliable answer method and exam-focused practice.

Read the quick answer Explore FAQs

Student reviewing English learning notes and a practice planner

Concepts · Worked reasoning · NEB practice

Quick answer: Recursion solves a problem by calling the same function on a smaller instance. Correct recursive design has reachable base cases, measurable progress and awareness of stack use.

Worked practice

Build the result from meaning, not memory

Recursion solves a problem by calling the same function on a smaller instance. Correct recursive design has reachable base cases, measurable progress and awareness of stack use.

Worked example

long fact(int n){if(n<=1)return 1;return n*fact(n-1);} computes factorial for a validated nonnegative n.

The governing relationship is Define result(n)=base when n reaches the stopping condition; otherwise combine current work with result(smaller n). Prove the argument moves toward the base case. Check the convention, geometry or boundary condition before calculation.

Independent practice ladder

Define the key physical quantities and give their SI units.
Draw and label the relevant wave, ray, mode or energy diagram.
Recalculate the worked example after changing one input by a factor of two.
Explain the result without equations.
Create a Nepal-relevant situation such as a classroom speaker, musical pipe, optical slit or thermal machine.
Compare two cases and predict the larger output before calculating.
Find and repair one deliberately wrong sign, node or unit.
Write a three-mark answer and a five-mark answer.

Answer protocol: diagram → known data → principle → symbolic equation → SI substitution → result → physical check. Omitting a base case, failing to reduce the problem, recomputing expensive branches, or using recursion where input depth can overflow the stack.

NEB answer method

Model → evidence → equation → check

First identify the system and what the question asks. Label the diagram, apparatus or reaction with SI quantities, then state the principle before selecting an equation. Solve symbolically where possible and check units, limiting cases and chemical or physical meaning.

Stage	Question	Evidence
Model	What is idealised?	Assumption stated
Representation	Which diagram fits?	Labels or balanced equation
Calculation	Which relation follows?	Symbols then SI values
Evaluation	Does it make sense?	Unit, sign and trend check

Make the idea concrete in Nepal

Connect the model to a school laboratory, household technology, health, environment, energy or local material. The example should clarify the science rather than merely mention a place. Compare a prediction with an observation and record uncertainty.

Review the NEB Class 12 Computer Science revision roadmap and the complete Computer Science guide. For online or physical tuition, call 9846662070.

Questions students ask about Recursion in C

What is the central idea of Recursion in C?

Recursion solves a problem by calling the same function on a smaller instance. Correct recursive design has reachable base cases, measurable progress and awareness of stack use.

Which equation should I remember?

Define result(n)=base when n reaches the stopping condition; otherwise combine current work with result(smaller n). Prove the argument moves toward the base case.

How should I begin a numerical?

Draw the situation, list known quantities in SI units, choose the governing relation symbolically, substitute once and finish with a unit and reasonableness check.

What is a common exam mistake?

Omitting a base case, failing to reduce the problem, recomputing expensive branches, or using recursion where input depth can overflow the stack.

How can I practise this topic?

Alternate one concept explanation, one diagram and two numericals. Revisit errors after a day instead of only rereading the solution.

Where can I get tuition support?

For online or physical KTM Tuition classes, call 9846662070. After Grade 12, the MKS Education panel below gives preparation and pre-counselling contacts.

Frequently asked questions

References and next steps

Scope checked against CDC Nepal; concept support from an institutional reference and OpenStax Science. Continue with the Recursion in C cluster.

NEB +2 tuition support

Ask about online or physical tuition

For focused Class 11 and Class 12 subject tuition, lesson clarification, worked-example practice and exam preparation, call 9846662070. Class mode, timetable, teacher availability and fees should be confirmed directly before enrolment.

Call 9846662070

Continue planning