• 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:void main(){ int i=10; i = !i>14; printf("i=%d", i); }

1
10
0
None of these
14

ANSWER DOWNLOAD EXAMIANS APP

C Programming
Which of the following statements are correct about an array?1. The array int num[26]; can store 26 elements.2. The expression num[1] designates the very first element in the array.3. It is necessary to initialize the array at the time of declaration.4. The declaration num[SIZE] is allowed if SIZE is a macro.

1, 4
2, 4
None of these
1
2, 3

ANSWER DOWNLOAD EXAMIANS APP

C Programming
The default parameter passing mechanism is

None of these.
call by value
call by reference
call by value result

ANSWER DOWNLOAD EXAMIANS APP

C Programming
Determine output:void main(){ int i=0, j=1, k=2, m; m = i++ || j++ || k++; printf("%d %d %d %d", m, i, j, k);}

0 1 2 2
0 1 2 3
1 1 2 3
None of these
1 1 2 2

ANSWER DOWNLOAD EXAMIANS APP

C Programming
Find the output of the following program.void main(){ int array[10]; int *i = &array[2], *j = &array[5]; int diff = j-i; printf("%d", diff);}

Garbage value
6
Error
3

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

-5
1
15
10
30

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
↑