• 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
Determine output:main(){ int i = abc(10); printf("%d", --i);}int abc(int i){ return(i++);}

10
11
9
None of these.

ANSWER DOWNLOAD EXAMIANS APP

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

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

ANSWER DOWNLOAD EXAMIANS APP

C Programming
What will be the output of the program if the array begins at address 65486?#includevoid main(){ int arr[] = {12, 14, 15, 23, 45}; printf("%u, %u", arr, &arr);}

None of these
65486, 65487
65486, 65490
65486, 65486
65486, 65488

ANSWER DOWNLOAD EXAMIANS APP

C Programming
What will be the output of this program on an implementation where int occupies 2 bytes?#include void main(){ int i = 3; int j; j = sizeof(++i + ++i); printf("i=%d j=%d", i, j);}

i=4 j=2
i=3 j=2
the behavior is undefined
i=5 j=2

ANSWER DOWNLOAD EXAMIANS APP

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

Last In First Out order
First In First Out order
Random order
Iterative order
Parallel order

ANSWER DOWNLOAD EXAMIANS APP

C Programming
What is the maximum number of dimensions an array in C may have?

2
8
Theoratically no limit. The only practical limits are memory size and compilers.
20
50

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
↑