GATE CS 2015 Set 3 — Question 42

Go beyond PYQs with Success TrackerAI-powered personalised practice and doubt support. Unlimited practice on eligible plans; AI usage limits apply.
NAT+2 / -0MediumStorage ClassesC ProgrammingProgramming & Data StructuresFunctions & Recursion

Programming & Data Structures → C Programming → Functions & Recursion

Last updated

Question

Consider the following C program.
#include<stdio.h>
int f1(void);
int f2(void);
int f3(void);
int x = 10;

int main( )
{
  int x = 1;
  x += f1( ) + f2( ) + f3( ) + f2( );
  printf("%d", x);
  return 0;
}

int f1( ) { int x = 25; x++; return x;}
int f2( ) { static int x = 50; x++; return x;}
int f3( ) { x *= 10; return x;}
The output of the program is ________.
Your answer

Enter a number. Decimals, negative values and scientific notation are accepted.

The solution stays hidden until you check.

Continue learning with Success Tracker

A step still unclear? Work through it with support

Use Success Tracker to ask about the reasoning, then try another GATE CS question to check your understanding.

AI-powered practice· Unlimited practice on eligible plans
PYQs with solutions
Attempt available previous-year questions, then compare your reasoning with the worked solution. Coverage varies by stream.
Practice that adapts
Choose a topic, work on weaker areas and bookmark questions to revisit. Your attempts feed your progress tracking.
AI doubt support
Ask follow-up questions about a step or concept while practising, instead of stopping at the final answer.

Unlimited practice is available on eligible plans. Free practice and AI usage have limits; check the current plan allowances before choosing.

This page stays readable without an account. AI responses can be wrong; check them against the solution and source material.

More questions on C Programming