GATE 2013 COMPUTER SCIENCE & INFORMATION TECH. – CS – C Programming | Q. 42

Learn how to solve GATE 2013 C Programming Question 42 using recursion, pass-by-reference, and pass-by-value. Trace each recursive call step by step and understand how the final answer 6561 is obtained.

Read more

GATE 2012 COMPUTER SCIENCE & INFORMATION TECH. – CS – C Programming | Q.3

Solve GATE 2012 C Programming Question 3 step by step. Learn how switch-case fall-through works when break statements are absent and understand why the correct answer is Option (C).

Read more

GATE 2014 (CS02) – C Programming | Q.10

Solve GATE 2014 C Programming Question 10 step by step. Learn how the right-shift operator >>= 1 works, convert 435 to binary, trace the loop, and find why func(435) returns 9.

Read more
Translate »