• HOME
  • QUIZ
  • CONTACT US
EXAMIANS
  • COMPUTER
  • CURRENT AFFAIRS
  • ENGINEERING
    • Chemical Engineering
    • Civil Engineering
    • Computer Engineering
    • Electrical Engineering
    • Mechanical Engineering
  • ENGLISH GRAMMAR
  • GK
  • GUJARATI MCQ

C PROGRAMMING QUIZ

Consider the following program fragment:for(c=1, sum=0; c <= 10; c++){ scanf("%d", &x); if( x < 0 ) continue; sum += x;}What would be the value of sum for the input 1, -1, 2, -2, 3, -3, 4, -4, 5, -5

TRUE ANSWER : ?
YOUR ANSWER : ?

What is the output of the following statements?int i = 0;printf("%d %d", i, i++);

TRUE ANSWER : ?
YOUR ANSWER : ?

Determine Output:main(){ char *str1 = "abcd"; char str2[] = "abcd"; printf("%d %d %d", sizeof(str1), sizeof(str2), sizeof("abcd"));}

TRUE ANSWER : ?
YOUR ANSWER : ?

Determine output:void main(){ extern int i; i=20; printf("%d", sizeof(i));}

TRUE ANSWER : ?
YOUR ANSWER : ?

When a function is recursively called all the automatic variables are stored in a ..........

TRUE ANSWER : ?
YOUR ANSWER : ?

What will be output after executing following code?#include# define a 10void main(){ printf("%d..", a); foo(); printf("%d", a);}void foo(){ #undef a #define a 50}

TRUE ANSWER : ?
YOUR ANSWER : ?

What will be the output of the given program?#include<stdio.h>void main(){int a=11,b=5;if(a=5) b++;printf("%d %d", ++a, b++);}

TRUE ANSWER : ?
YOUR ANSWER : ?

Comment on the following pointer declaration?int *ptr, p;

TRUE ANSWER : ?
YOUR ANSWER : ?

Determine Output:void main(){ int c = - -2; printf("c=%d", c);}

TRUE ANSWER : ?
YOUR ANSWER : ?

The recursive functions are executed in a ...........

TRUE ANSWER : ?
YOUR ANSWER : ?
MORE MCQ

QUIZ STATS

  • 0
  • 0

DOWNLOAD APP

  • APPLE
    from app store
  • ANDROID
    from play store

SEARCH

LOGIN HERE


  • GOOGLE

FIND US

  • 1.70K
    FOLLOW US
  • EXAMIANSSTUDY FOR YOUR DREAMS.
  • SUPPORT :SUPPORT EMAIL ACCOUNT : examians@yahoo.com

OTHER WEBSITES

  • GUJARATI MCQ
  • ACCOUNTIANS

QUICK LINKS

  • HOME
  • QUIZ
  • PRIVACY POLICY
  • DISCLAIMER
  • TERMS & CONDITIONS
  • CONTACT US
↑