• 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
An array elements are always stored in ________ memory locations.

Random
Sequential and Random
Sequential
None of these

ANSWER DOWNLOAD EXAMIANS APP

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

2 4 4
2 5 5
5 5 5
2 4 5

ANSWER DOWNLOAD EXAMIANS APP

C Programming
int a[5] = {1,2,3}What is the value of a[4]?

3
Garbage Value
1
0
2

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.

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

ANSWER DOWNLOAD EXAMIANS APP

C Programming
What will be the output of following program code?#include int main(void){ char p; char buf[10] = {1, 2, 3, 4, 5, 6, 9, 8}; p = (buf + 1)[5]; printf("%d", p); return 0;}

Error
9
None of these
6
5

ANSWER DOWNLOAD EXAMIANS APP

C Programming
What will be the output of the following code?#includevoid main(){ int s=0; while(s++<10) { if(s<4 && s<9) continue; printf("%dt", s); }}

None of these
1 2 3 4 5 6 7 8 9
1 2 3 10
4 5 6 7 8 9 10
4 5 6 7 8 9

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
↑