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

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

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

Learn how to solve GATE 2015 Question 34 using simple step-by-step tracing. This C programming question covers functions, pass-by-value, pointers, local variables, and modifying values using addresses. The final answer is -5.

Read more

GATE 2014 C Programming Question 10 (CS 01 – SET 1)

Solve GATE 2014 C Programming Question 10 step by step. Learn how pointers, scanf(), and printf() work together, and understand why the correct answer is (D).

Read more
Translate Β»