How do I solve WBJECA 2025 Computer questions?

Practice WBJECA 2025 Computer previous year questions with step-by-step solutions on Mathem Solvex. Each question includes a detailed explanation and video solution to help you master the concept quickly.

What is the difficulty level of WBJECA Computer questions?

WBJECA Computer questions range from moderate to advanced difficulty. Consistent practice with official previous year papers and topic-wise drills on Mathem Solvex is the most effective preparation strategy.

Are WBJECA previous year papers available for free?

Yes. Mathem Solvex provides free access to WBJECA previous year question papers and topic-wise PDFs. You can download them or attempt them as timed live mock tests directly on the platform.

WBJECA 2025 Computer PYQ — What happens when a recursive function in C lacks a proper base c… | Mathem Solvex

A.
The function executes only once and terminates.
B.
The compiler shows a syntax error.
C.
It leads to infinite recursion and eventually a stack overflow.
(Correct Answer)
D.
The function automatically converts to an iterative form.

Correct Answer:

It leads to infinite recursion and eventually a stack overflow.

Explanation

In C programming, a recursive function must have a base condition to terminate the recursive calls. When this condition is missing, the function continues to call itself indefinitely.

Mathematically, if we represent the depth of the recursion stack as $D$ , and the maximum stack size available to the process as $S_{ma x}$ , the program will encounter a fatal error when:

$D \geq S_{ma x}$

As the function calls itself without a base case, it consumes stack memory for every frame. Once the memory limit is exceeded, the system triggers a stack overflow, causing the program to crash.

WBJECA 2025 — Computer PYQ

Choose the correct answer:

Explanation

Explanation