GATE 2015 COMPUTER SCIENCE & INFORMATION TECH. – CS – C Programming | Q. 21 (Session – 2)

Learn how recursion, the function call stack, LIFO, and putchar() work together to solve GATE 2015 C Programming Question 21. Step-by-step explanation shows why the output is DCBA.

Read more

Solved C Recursion Problems: Factorial, Fibonacci, Sum of Digits & More

Learn recursion in C with solved problems on factorial, sum of digits, prime factors, Fibonacci series, and decimal-to-binary conversion. Each problem includes a simple recursive solution and explanation.

Read more

Sum of First 5 Natural Numbers in C: Understanding Recursion Step by Step

Learn recursion in C with a simple example of finding the sum of the first 5 natural numbers. Understand recursive functions, base conditions, function call stacks, LIFO, and how recursive calls return through unwinding.

Read more

GATE 2015 COMPUTER SCIENCE & INFORMATION TECH. – CS – C Programming | Q. 11 (Session – 3)

Learn how to solve GATE 2015 C Programming Question 11 using character arrays, pointer arithmetic, dereferencing, 0, ‘0’, ‘\0’, and printf(“%s”) with a clear step-by-step explanation.

Read more

GATE 2015 COMPUTER SCIENCE & INFORMATION TECH. – CS – C Programming | Q. 62 (Shift – 1)

Learn how pointer arithmetic works with 2-D arrays in C using GATE 2015 Question 62. Understand array indexing, row pointers, memory addresses, dereferencing, and expressions such as x+3, *(x+3), and *(x+2)+3 with simple step-by-step explanations.

Read more
Translate Β»