• 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

C Programming
If integer needs two bytes of storage, then maximum value of an unsigned integer is

215
None of these
216
216 – 1
215 – 1

ANSWER DOWNLOAD EXAMIANS APP

C Programming
What will be the output of the following program?void main(){ char str1[] = "abcd"; char str2[] = "abcd"; if(str1==str2) printf("Equal"); else printf("Unequal");}

Error
Unequal
Equal
None of these.

ANSWER DOWNLOAD EXAMIANS APP

C Programming
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

10
15
30
1
-5

ANSWER DOWNLOAD EXAMIANS APP

C Programming
Which of the following comments about the ++ operator are correct?

The operand can come before or after the operator
It associates from the right
It cannot be applied to an expression
It is a unary operator
All of these

ANSWER DOWNLOAD EXAMIANS APP

C Programming
C Language developed at _________?

AT & T's Bell Laboratories of USA in 1970
Sun Microsystems in 1973
AT & T's Bell Laboratories of USA in 1972
Cambridge University in 1972

ANSWER DOWNLOAD EXAMIANS APP

C Programming
What will be the output of the program ?#include#includevoid main(){ char str[] = "Exam\0Veda"; printf("%s", str);}

Exam Veda
Veda
Exam
None of these
Exam\0Veda

ANSWER DOWNLOAD EXAMIANS APP
MORE MCQ ON C Programming

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
↑