Professional Documents
Culture Documents
Global Edge Sample Paper
Global Edge Sample Paper
INT MAIN( )
{
FOR( ; ;);
PRINTF("HELLO\N");
RETURN 0;
ANS: C
PRINTF("P:%X",P);
INT MAIN( )
{
INT *PTR;
FUNC(PTR);
PRINTF("PTR:%X",PTR);
RETURN 0;
ANS: B
PRINTF("%D %D\N",STRLEN(A),SIZEOF(A));
RETURN 0;
A. 5,5
B. 6,5
C. 5,6
D. 6,6
ANS: C
MAIN()
{
CHAR *S = "HELLO";
PRINTF("%S",1(S));
A. HELLO
B. ELLO
C. E
D. NONE OF THESE.
ANS: B
CHAR ( * ( F ( ) ) [ ] )( )
C. INVALID DECLARATION
ANS : D
1. A BINARY TREE OF HEIGHT H, H > 0 HAS
ANS: D
2. THRASHING IS
ANS: C
C. NONE OF THESE.
ANS: B
A. HEAP.
B. RESERVED MEMORY.
C. DATA SEGMENT.
D. STACK.
ANS: D
A. 12360.
B. 12560.
C. NONE OF THESE.
D. 12650.
ANS : C
1. MAIN()
{ INT I;
I=(2,3);
PRINTF("%D",I);
ANS : 3
2. MAIN(){
CHAR STR[]="GESL";
PRINTF("%D %D",SIZEOF(STR),STRLEN(STR));
}
A)5,5 B)4,4 C)5,4 D)4,5
ANS: 5, 4
ANS: 0 TIMES.
6. MAIN(){
INT K=5;
PRINTF("%D\N",K);
ANS: 7
7. MAIN(){
INT *PTR1,*PTR2;
PTR1=(INT *)MALLOC(SIZEOF(INT));
PTR2=FUNC(20,10,PTR1);
PRINTF("%D %D\N",*PTR1,*PTR2);
{
INT X=A+B;
*C=A-B;
RETURN(&X);
IF ( ( J = ~I ) < I )
PRINTF ( "TRUE" ) ;
ELSE
PRINTF ( "FALSE" ) ;
}
ANS : TRUE
ANS: 12
FILE *FP;
PRINTF("%D\N",SIZEOF(FP) );
ANS:4
11. MAIN()
{
INT A=10,20;
A^=B^=A^=B;
PRINTF("%D\N %D\N",A,B);
INT I=10;
SWITCH(I) {
}
CASE 5: PRINTF("HELLO WORLD ");
}
}
A) HELLO B) HELLO C) HELLO WORLD HELLO WORLD D) SYNTAX ERROR.
CHAR STR2[]="HELLO";
IF ( STR1==STR2 )
PRINTF("TRUE\N");
ELSE
PRINTF("FALSE\N");
}
ANS: FALSE.
A)TRUE B)FALSE C)ERROR D) UNPREDICTABLE.
15. MAIN()
{
# INCLUDE <STDIO.H>
INT I = 10 ;
PRINTF("%D\N", I/2 );
}
A)10 B)5 C)ERROR D) WARNING.
ANS : 5
STRUCT SIZE {
INT I;
CHAR CH ;
DOUBLE DB ;
};
MAIN () {
}
A)12 B)14 C)16 D)8
GLOBALEDGE PAPER
MAIN()
PTR++ = ARR;
PRINTF("%D,%D",PTR[2],ARR[2]);
RETURN 0;
}
WHAT IS THE OUTPUT :
C> PRINTS 3 3
D> PRINTD 4 3
2>
MAIN()
{
CHAR S[10];
SCANF ("%S",S);
PRINTF(S);
D> PRINTD S
3>
MAIN()
{
CHAR C = 255;
PRINTF ("%D",C);
RETURN 0;
B> PRINTS -1
C> PRINTS 2
4>
MAIN()
{
INT I;
FOR (I=7;I<=0;I--)
PRINTF ("HELLO\N");
}
5>
MAIN()
{
PRINTF( PRINTF ("WORLD") );
COMPUTER CONCEPTS
D> NOTHING
B> BOTTOM UP
B> CACHE
C> REGISTERS
ANS C:REGISTERS
B>RUN TIME
C>LINK TIME
4>LOAD TIME
----------------------------------------------------
1)
#INCLUDE<STDIO.H>
MAIN()
{
SCANF("%D");
PRINTF();
}
WHICH OF THE FOLLOWING IS CORRECT?
A)COMPILATION ERROR
C)NO OUTPUT
ANS : A
---------------------------------------------------------
2)
#INCLUDE<STDIO.H>
#DEFINE ISLOWER(C) ('A'<=(C) && (C)<='Z')
#DEFINE TOUPPER(C) (ISLOWER(C)?(C)-('A'-'A'):(C))
MAIN()
{
CHAR *P="I AM FINE";
WHILE(*P)
PRINTF("%C",TOUPPER(*P++));
}
A)BCD
B)AFE
C)AFE
D)BCD
----------------------------------------------------------
3)
#INCLUDE<STDIO.H>
MAIN()
{
200;
PRINTF("TRICKY PROBLEM");
}
A)WARNING MESSAGE
B)COMPILATION ERROR
D)NONE OF THESE
ANS : A
------------------------------------------------------------
4)WHICH IS THE NULL STATEMENT?
A) ;
B) {}
C) '\0';
D)ALL OF THESE
ANS : A
------------------------------------------------------------
5)WHAT IS THE CORRECT PROTOTYPE OF PRINTF FUNCTION ?
A)PRINTF(CHAR *P,...);
-----------------------------------------------------------
B).COM
C).INI
D)NONE
ANS : D
---------------------------------------------------------------
2)A MAGNETIC TAPE IS EQUIVALENT TO WHICH OF THE FOLLOWING
STRUCTURE?
A)GRAPHS
B)TREES
C)LISTS
D)DICTIONARIES
ANS : C
------------------------------------------------------------
3)FOR A LINKED LIST IMPLEMENTATION WHICH SEARCHING TECHNIQUE IS
NOT
APPLICABLE?
A)LINEAR SEARCH
B)NONE
C)QUICK SORT
D)BINARY SEARCH
ANS : D
----------------------------------------------------------------
4)ENCRYPTION AND DECRYPTION IS DONE IN WHICH LAYER?
A)DLL
B)NETWORK LAYER
C)TRANSPORT LAYER
D)PRESENTATION LAYER
ANS : D
------------------------------------------------------------
5)WHICH OF THE FOLLOWING IS NOT PERFORMED BY THE OS?
A)CPU SHCEDULING
B)MEMORY MANAGEMENT
C)TRANSACTION
D)NONE
ANS : C
1)WHAT IS BIG-ENDIAN.
A) MSB AT LOWER ADDRESS LSB AT HIGHER ADDRESS
ANS:A
2)WHAT IS LITTLE-ENDIAN.
A) MSB AT LOWER ADDRESS LSB AT HIGHER ADDRESS
ANS:B
3)8086 HAS
A)16 BIT DATA BUS ,16 BIT ADDRESS BUS
ANS:A
4) WHAT IS THE SCHEDULING ALGORITHM USED IN GENERAL OPERATING
SYSTEMS.
A) FCFS ALGORITHM
C) ROUND-ROBIN ALGORITHM
ANS:C
5)ROUTER IS PRESENT AT
A)PHYSICAL LAYER
C)NETWORK LAYER
D)NONE OF ABOVE
ANS:C
B) NO PREMPTION
D) CIRCULAR WAIT
ANS:D
ANS:D
B)1 0
C)1 1
D)0 0
ANS :C
9)INTERRUPT IS SERVICED
A)IMMEDIATLY WHEN IT OCCURS
C)IGNORED
ANS:B
C:
1.WHAT IS THE O/P ?
VOID MAIN()
{
CHAR *MESS[]={"HAVE","A","NICE","DAY","BYE");
PRINTF("%D \T %D",SIZEOF(MESS),SIZEOF(MESS[1]));
}
A. 16 4
B. 5 4
C. 20 4
D. ERROR
ANSWER: C
{
INT I,COUNT=0;
CHAR *P1="ABCDEFGHIJ";
CHAR *P2="ALCMENFOIP";
FOR(I=0;I<=STRLEN(P1);I++) {
IF(*P1++ == *P2++)
COUNT+=5;
ELSE
COUNT-=3;
}
PRINTF("COUNT=%D\N",COUNT);
A. 15
B. 6
C. 12
D. COMPILER ERROR
B. 0
C. -1
D.NONZERO
ANSWER:B
4.
MAIN(INT ARGC,CHAR *ARGV[])
{
PRINTF((ARGC > 1 ? "%C" : "%C",*++ARGV);
}
IF THE I/P STRING IS "GESL BANGALORE".
A. G
B. E
C. B
D. GESL
ANSWER: C
B. INT **A[5];
C. INT *(*A)[5];
ANSWER: C
QUESTIONS ON OS:
1.UDP IS A
A. RELIABLE PROTOCOL
B. UNRELIABLE PROTOCOL
C. CONNECTIONLESS PROTOCOL
D. BOTH B & C
ANSWER: D
B. CISC PROCESSOR
C. SISC PROCESSOR
ANSWER: A
B. A LOCAL VARIABLE
C. MUTEX
4.REPEATERS ARE IN
A. DATA LINK LAYER
B. PHYSICAL LAYER
C. NETWORK LAYER
D. TRANSPORT LAYER
ANSWER: B
B. CIRCUIT SWITCHING
C. MESSAGE SWITCHING
ANS : B ( NORMALLY )
( PACKET SWITCHING IN ISDN )
/* (1) : TRUE */
1. WHAT IS THE OUTPUT OF THE PROGRAM ?
MAIN()
{
INT A = 1;
#DEFINE P A
PRINTF("%D %D ",A++,P++) ;
}
A) 1, 0
B) 2, 0
C) 1 2
D) NONE OF THE ABOVE
ANS (D)
2. WHAT IS THE OUTPUT OF THE PROGRAM ?
#INCLUDE<STDIO.H>
MAIN()
{
#INCLUDE<STDIO.H>
INT A = 90 ;
PRINTF("%D",A) ;
}
A) 90
B) COMPILATION ERROR
C) LINKER ERROR
D) RUNTIME ERROR
ANS (A)
3. WHAT IS THE OUTPUT OF THE PROGRAM ?
MAIN()
{
MAIN() ;
}
A) COMPILATION ERROR
B) RUNTIME ERROR
C) EXECUTES UNTIL THE STACK OVERFLOWS(1)
ANS (C)
4. WHAT IS THE OUTPUT OF THE PROGRAM ?
#DEFINE MAX "HELLO"
MAIN()
{
PRINTF(MAX) ;
}
A. COMPILATION ERROR
B. PREPROCESSING ERROR
C. RUNTIME ERROR
D. HELLO
ANS (D)
5. WHAT IS THE OUTPUT OF THE PROGRAM ?
#DEFINE MAX MAIN()
MAIN()
{
MAX ;
A. COMPILATION ERROR
B. PREPROCESSING ERROR
C. RUNTIME ERROR
MAIN()
{
INT A = 90 ;
P P1 ;
P 1 = &A ;
PRINTF("%D",*P1) ;
}
A. 90
B. COMPILATION ERROR
C. RUNTIME ERROR
ANS (A)
7. WHAT IS THE OUTPUT OF THE PROGRAM ?
MAIN()
{
INT I = 1 ;
}
A. ONE
B. ZERO
C.ERROR
D. BOTH AND B
ANS (A)
8. WHAT IS THE OUTPUT OF THE PROGRAM ?
MAIN()
{
INT I = 1 ;
PRINTF("%D",I ? 1 : 0) ;
}
A. 1
B. 0
C. ERROR
{
INT A = 90 , B = 100 ;
A++ ;
A = (A ^ B) ^ (A = B );
B = A^B^A ;
--A ;
PRINTF("%D %D",A++,B++) ;
}
A. 90 100
B. 100 90
C. 101 91
D. 91 101
ANS (A)
10. WHAT IS THE OUTPUT OF THE PROGRAM ?
MAIN()
{
INT A = 10 , B = 100 ;
SWAP(&A , &B) ;
PRINTF("%D %D",A,B) ;
}
SWAP(INT *A , INT *B)
{
*A = * A + * B ;
*B = *A - *B ;
*A = *A - *B ;
SWAP1(&A , &B) ;
}
SWAP1(INT **A , INT **B)
{
**A = **A + **B ;
**B = **A - **B ;
**A = **A - **B ;
}
A. 100 10
B. 10 100 (1)
D. ERROR !!
ANS (B)
{
VOID *PTR ;
INT A = 10 ;
PTR = &A ;
PRINTF("%D",*PTR) ;
}
1. ERROR
2. 10
3. 20
4. NONE
ANS (1)
{
VOID *PTR ;
INT A = 90 ;
PTR = A ;
PTR = PTR1 ;
}
A. EXECUTES W/O ANY ERROR
B. COMPILATION ERROR
C. RUNTIME ERROR
D.NONE
ANS (A)
{
CHAR *P = "HELLOO" ;
{
;
}
}
A. ERROR
B. ADDRESS IS COPIED
D . NONE
ANS (C)
14. WHAT IS THE OUTPUT OF THE PROGRAM ?
INT G = 10 ;
MAIN()
{
INT A = 10 ;
PRINTF("%D",A) ;
}
INT G ;
A. 10
B. 11
C. ERROR
D. NONE
ANS (A)
15. WHAT IS THE OUTPUT OF THE PROGRAM ?
MAIN()
{
INT A = 1 ;
INT B = 0 ;
PRINTF("%D",A) ;
}
A. ERROR
B. NONE
C. 1
D .2
ANS (D)
16. WHAT IS THE OUTPUT OF THE PROGRAM ?
STRUCT S
{
INT SI;
UNION U
{
FLOAT UF;
CHAR UC;
};
};
MAIN()
{
PRINTF("%D",SIZEOF(STRUCT S));
}
A. 8
B. 3
C. 6 @
D. 7
STRUCT ST
{
INT A;
CHAR B;
}
MAIN()
{
}
A. STRUCT ST IS RETURN TYPE OF MAIN@
C. COMPILATION ERROR
ANS (A)
-----------------------------------------------------
18. WHAT IS THE OUTPUT OF THE PROGRAM ?
TYPEDEF STRUCT INFO
{
INT I;
CHAR B;
} NODE;
MAIN()
{
STRUCT INFO NODE1;
NODE1.I=55;
PRINTF("%D",NODE1.I);
}
A. 55
C.COMPILATION ERROR
D. GARBAGE VALUE.
ANS (A)
19. WHAT IS THE OUTPUT OF THE PROGRAM ?
STRUCT A
{
INT I;
INT DISPLAY()
{
PRINTF("HELLO WORLD\N");
}
};
MAIN()
{
STRCUT A VARA;
VARA.DISPLAY();
}
A. HELLO
B. HELLO WORLD
D. GARBAGE
STRUCT A
{
INT (*PTR)();
};
INT DISPLAY()
{
PRINTF("GLOBAL EDGE\N");
}
MAIN()
{
STRUCT A STRUCTA;
STRUCTA.PTR=DISPLAY;
STRUCTA.PTR();
}
A. GLOBAL EDGE
B. ADDRESS OF DISPLAY FUNCTION
C. ADDRESS OF STRUCTA
D.ERROR
ANS (A)
21. WHAT IS THE OUTPUT OF THE PROGRAM ?
TYPEDEF INT *ABC;
INT MAIN()
{
XYZ VAR;
}
1. VAR IS AN ARRAY OF INTEGER POINTERS.
2. VAR IS A POINTER TO AN INTEGER ARRAY.
OPTIONS:
A) ONLY 1 IS CORRECT.
B) ONLY 2 IS CORRECT.
ANSWER : B
{
INT A;
CHAR X;
CHAR Y;
}NAME;
INT MAIN()
{
NAME.A=258;
PRINTF("\N X = %D Y = %D ",NAME.X,NAME.Y);
A) X = 1 Y = 1
B) X = 2 Y = 2
C) X = 1 Y = 2
D) X = 2 Y = 1
ANSWER : B
23. CONSIDER THE PROGRAM,
INT MAIN()
{
INT A[20];
INT *P,*Q,VAL;
P = &A[0];
Q = &A[10];
VAL = Q - P;
A) Q = 1020 VAL = 20
B) Q = 1020 VAL = 10
C) Q = 1010 VAL = 10
D) Q = 1010 VAL = 20
ANSWER : B
24. CONSIDER THE PROGRAM,
STRUCT KEY
{
CHAR *WORD[2];
INT COUNT;
CHAR C;
}ABC;
INT MAIN()
{
PRINTF("\NSIZE %D",SIZEOF(ABC));
B) 7
C) 6
D) 5
ANSWER : B
MAIN()
{
INT A;
FUN();
PRINTF("%D",A);
A=50;
FUN()
{
INT I;
*(&I+4) = 100;
}
A. 50
B. GARBAGE VALUE
C. 100
D. COMPILER ERROR
MAIN()
#DEFINE X 5
INT B;
B = X;
PRINTF("%D",B);
A. COMPILER ERROR
B. RUNTIME ERROR
C. GARBAGE VALUE
D. 5
26. WHAT IS THE OUTPUT OF THE FOLLOWING PROGRAM ?
MAIN()
{
INT A; #DEFINE Y 10
A=Y;
PRINTF("%D",A);
A. 10
B. COMPILER ERROR
C. RUN-TIME ERROR
D. GARBAGE VALUE
#DEFINE S -50
MAIN()
{
INT S;
#IFDEF S
PRINTF("HELL\N");
#ELSE
PRINTF("HEAVEN\N");
#ENDIF
}
A. HELL
B. HEAVEN
C. COMPILATION ERROR
D. HELLHEAVEN
A. ARRAYS
B. POINTERS
D. CAN'T SAY
29.HOW MANY TIMES CAN A COMMENT BE NESTED ?
A)COMMENT_NEST_LIMIT TIMES
B)COMMENT_LIMIT TIMES
C)ONE TIME
D)NOT EVEN ONCE (R)
30
WHICH ONE MUST BE CORRECT IN THE FOLLOWING STATEMENTS ?
ANS (A)
31
SELECT THE CHOICE WHICH IS WRONG ?
ANS (C)
32
CONSIDER THE FOLLOWING PROGRAM
MAIN()
{
INT I,J;
I = 06;
J = 09;
33
WHAT WOULD BE THE OUTPUT ?
A)6 9
B)6 11
C)06 09
D)COMPILATION ERROR
# UNDEF __FILE__
# DEFINE __FILE__ "GLOBALEDGE"
MAIN()
{
PRINTF("%S\N",__FILE__);
A)COMPILATION ERROR
B)RUN-TIME ERROR
C)COMPILES BUT GIVES A WARNING
D)COMPILES NORMALLY
35).
WHAT HAPPENS WHEN WE COMPILE THIS PROGRAM ?
# DEFINE LINE
# DEFINE NAME "GESL"
MAIN()
{
PRINTF("%D "%S\N",LINE,NAME);
A)COMPILATION ERROR
B)COMPILES BUT WARNS
C)SYNTAX ERROR
D)COMPILES NORMALLY
36)
INT MAIN()
{
INT I = 5;
IF(1)
{
STATIC INT I;
I++;
PRINTF("%D", I);
}
PRINTF("%D", I);
A. ERROR
B. 5,0
C. 5,1
D. 1,5
ANS (D)
37)
INT MAIN()
{
INT A[4] = { 23, 67, 90};
A. JUNK
B. ERROR
C. 0 (ANS)
D. 1
38)
INT MAIN()
{
INT I = 1, 2;
PRINTF("%D", I);
A. 1
B. 2
C. ERROR
D. NONE
ANS (C)
39)
INT MAIN()
{
INT I;
{
I = I+2;
BREAK;
PRINTF("%D", I);
}
}
A. 0
B. 2
C. ERROR
D. NONE (ANS)
ANS (D)
40)
INT MAIN()
{
INT I;
I = 1, 2;
PRINTF("%D", I);
A. 1 (ANS)
B. 2
C. ERROR
D. NONE
41)
#INCLUDE<STDIO.H>
INT I =20;
INT MAXLEN = I;
INT MAIN()
{
INT J = I;
A) I=20 , J=20
B) I=20 , J=JUNK
C) ERROR
D) NONE
ANS.(C)
42)
INT MAIN()
{
INT I =10;
PRINTF("%D", J);
PRINTF("%D",I);
}
INT J = 20;
A) J=20 , I=10
B) J=JUNK , I=10
C) COMPILE TIME ERROR
D) RUNTIME ERROR
ANS (C)
-43
INT I =20;
INT I,J=10;
MAIN()
{
INT J =20;
A) REDECLARATION ERROR
B) I=20 , J=10
D) NONE
44)
INT MAIN()
{
INT K=2, I =10;
WHILE(K--)
{
PRINTF("%D\N",DISP(I));
}
}
DISP(INT K)
{
STATIC INT I=0;
RETURN I=I+K;
}
A) 10, 10
B) 10, 20 (ANS)
C) 20, 10
D) NONE
C)BOTH
D)COMPILED CODE FOR FUNCTIONS
WHILE(I--)
{
INT I =10;
PRINTF("%D",I);
}
}
A) 10, 9, 8, 7, .....1
D) NONE
-47
CHAR S[] = "HELLO\0 WORLD";
PRINTF("%S...%D",S,STRLEN(S));
ANS : (A)
-48
PRINTF("%%% S","HELLO");
ANS : (C)
(49).
ANS : (B)
(50).
INT I = 24;
PRINTF("%XD",I);
ANS : (C)
(51).
WHAT IS RETURN TYPE OF FREOPEN
(A) INT*
(B) FILE*
(C) INT
(D) VOID
ANS : (B)
(52).
STRUCT NODE
{
INT I;
};
MAIN()
{
STRUCT NODE N1;
PRINTF("%D",N1.I);
B. GARBAGE VALUE
C. ERROR.
4.WARNING
ANS: B
-53
STRUCT NODE_TAG
{
INT I;
};
MAIN()
{
PRINTF("%D",SIZE(NODE_TAG));
B). 6
C).GARBAGE VALUE
D).ERROR
ANS:D
-54
TYPEDEF STRUCT NODE_TAG
{
INT I=0;
INT J;
} NODE;
MAIN()
{
NODE N1;
PRINTF("%D",N1.I);
}
O/P OF THE PROGRAM:
1. 0
2. WARNING
3.GARBAGE VALUE
4.ERROR
ANS: D
-55 STRUCT
{
INT I;
}NODE ;
MAIN()
{
PRINTF("%D",NODE.I);
ANS: (A)
(56).
STRUCT NODE_TAG
{
INT A;
};
MAIN()
{
STRUCT NODE_TAG N1;
N1.PT=&N1;
N1.PT->A=5;
PRINTF("%D",N1.A);
(A). ERROR
(B). WARNING
(C). 5
(D).GARBAGE VALUE
ANS: (C)
-57
INT N;
SCANF("%D",N);
D)READS 0
ANS (C)
58)
STRCHR(S,C)
ANS :A
A)GARBAGE
B)NULL
C)0
D)-1
ANS (C)
-60
(VOID *) IS CALLED
(A)POINTER TO VOID
(B)POINTER TO ANY DATA TYPE
(C)GENERIC POINTER
(D)NONE OF THE ABOVE
ANS (C)
-61
WHAT THE PUTCHAR() WILL RETURN ON ERROR
A)0
B)EOF
C)NULL
D)-1
ANS (B)
62)WHAT IS THE OUTPUT OF THE FOLLOWING ?
I=5;
I=I++ * I++;
PRINTF("%D",I);
A)30
B)49
C)25
D)27
ANS (D)
I=5;
PRINTF("%D",I++ * I++);
A)30
B)49
C)25
D)37
ANS (C)
-65
#INCLUDE<STDIO.H>
INT MAIN(VOID)
{
PUTCHAR("0123456789ABCDEFGHIJKL" [16 & 17 ] );
RETURN NULL;
CHOICE(S) :
A) ERROR
B) NO OUTPUT
C) GARBAGE
D) G
66)
#INCLUDE<STDIO.H>
INT MAIN()
*(P+10);
FPRINTF(STDERR,"%S",P);
RETURN 'C';
CHOICE(S) :
B) ERROR
C) GARBAGE
D) PRINTS "WELCOME TO GESL" TO SCREEN
67)
MAIN()
{
CHAR *P="MASONIC DOZENS DEIFY FORELOCK TOO ...";
WHILE(*P)
PRINTF("%C",TOUPPER(*P++));
---------------------------------------------------
CHOICE(S) :
---------
A) ERROR
B) ORIGINALTO
C) MSDOSUSART
D) SIDEEFFECT
---------------------------------------------------
ANS :(D)
-68
#INCLUDE<STDIO.H>
INT MAIN(VOID)
PUTS("HELLO\0WORLD");
CHOICE(S) :
A) ERROR
B) HELLO$^@$S
C) HELLO
D) WORLD$%^#^
---------------------------------------------------
-69
#INCLUDE<STDIO.H>
{
PFI A = MAIN;
PRINTF("%S",A);
CHOICE(S) :
ANSWERS :
-------
1) (D) G
2) (D) PRINTS "WELCOME TO GESL" TO SCREEN
3) (D) SIDEEFFECT
4) (C) HELLO
5) (C) PRINTS SOME GARBAGE
70)
UNION U
{
INT IVAL;
FLOAT FVAL;
CHAR *SVAL;
}
SIZE OF U IS
A) 8 BYTES
B) 4 BYTES
D) 12
ANS (B)
71)
STRUCT X
{
INT I; INT J;INT K;
};
STRUCT X *P;
STRUCT X ARR[3];
P =&ARR[0];
P++;
WHAT IS P POINTING TO
A) POINTING TO I OF ARR[0]
B) POINTING TO J OF ARR[0]
C) POINTING TO K OF ARR[1]
D) POINTING TO I OF ARR[1]
ANS : (D)
72)
STRUCT A
{
INT B;
};
STRUCT B
{
INT B;
};
INT MAIN()
{
STRUCT A FIRST;
STRUCT B SECOND;
FIRST.B =10;
SECOND = FIRST;
PRINTF("%D",SECOND.B);
}
A) 10
B) GARBAGE
C) COMPILE ERROR
ANS: C
4) STRUCT A
{
INT X;
FLOAT Y;
DOUBLE Z;
STRUCT A B;
};
A) NO ERROR
B) COMPILE ERROR
5) STRUCT A{
STRUCT B
{
INT A;INT B;
} C;
INT *PTR;
}D;
D.PTR=&D.C.A;
A) COMPILE ERROR
B) SYNTAX ERROR
C) BOTH A AND C
ANS : D
1)
UNINITIALIZED STATIC VARIABLES ARE INTITIALIZED DURING
A) RUN TIME
B) COMPILE TIME
C) INITIALIZED BY OPERATING SYSTEM
ANS : B
2)
GIVEN THE HEIGHT OF A BINARY TREE WHAT IS THE MAXIMUM NUMBER
NODES
A) 2^(N+1) -1
B) 2^(N) -1
C) 2^(N-1) -1
D) NONE
ANS : A
CASE
A) BUBBLE SORT
B) INSERTION SORT
C) HEAP SORT
D) QUICK SORT
ANS : C
4) WHICH OF THE FOLLOWING IS CORRECT (^ IS EPSILON)
A) CONTEXT SENSITIVE GRAMMERS DO NOT ALLOW ^
ANS : D
**************************************************
*
**************************************************
*
**************************************************
*
**************************************************
*
1)
#INCLUDE<STDIO.H>
INT MAIN(VOID)
INT *INTPTR ;
INTPTR = (CHAR*)MALLOC(SIZEOF(10));
RETURN 0;
}
A) COMPILATION ERROR
B) RUNTIME ERROR
CORRECT ANSWER : C
-----------------------------
2)#INCLUDE<STDIO.H>
INT MAIN(VOID)
FILE *FP1,*FP2;
INT C;
FP1 = FOPEN("TESTING","A");
FP2 = FOPEN("TESTING","W");
FPUTC(C,FP1);
RETURN 0;
B) RUNTIME ERROR
CORRECT ANSWER : D */
-------------------------------------------
3.#INCLUDE<STDIO.H>
INT MAIN(VOID)
SCANF("%D",&INTNUM1);
SCANF("%D",INTNUM2);
FOR(I = 0;I<=3;I++)
{
NUM = INTNUM1 * INTNUM2 * NUM;
}
PRINTF("\N NUM = %D " , NUM);
RETURN 0;
B) RUNTIME ERROR
C) SUCCESSFUL EXECUTION
D) JUNK VALUE
CORRECT ANSWER : D */
-------------------------------------------------------
4).#INCLUDE<STDIO.H>
INT MAIN(VOID)
{
CHAR STR[5];
CHAR *NEWSTR;
SCANF("%S",&STR);
NEWSTR = GETS(STR);
RETURN 0;
}
/*A) COMPILATION ERROR
B) RUNTIME ERROR
C) SUCCESSFUL EXECUTION
D) JUNK VALUE
CORRECT ANSWER : A */
-------------------------------------------
5)
#INCLUDE<STDIO.H>
INT MAIN(VOID)
FILE *FP;
CHAR *STR ;
CHAR *NEWSTR;
FP = FOPEN("SOURCE","R");
NEWSTR = FGETS(STR,5,FP);
RETURN 0;
B) RUNTIME ERROR
C) SUCCESSFUL EXECUTION
D) SEGMENTATION FAULT
CORRECT ANSWER : D */
1 INT A=1,B=0, X;
X = A++ && ++B;
PRINTF("%D %D %D ",A,B,X );
OUTPUT ?
A) 1 1 2 B) 2 1 0 C) 2 0 2 D) 2 1 1
ANS: D
2
CHAR *FN();
MAIN() {
CHAR *S;
S = FN();
PRINTF("%S\N",S );
}
CHAR *FN()
{ RETURN "HELLO"; }
OUTPUT IS ?
ANS: C
3
INT I;
I+= 2;
PRINTF("I = %D\N", I );
OUTPUT IS ?
A) 12 B) 11 C) 10 D) 13
ANS: A
I = F();
PRINTF("%D",I );
}
F()
{ RETURN 1,2,3; }
A) 1 B) COMPILATION ERROR C) 2 D) 3
ANS: D
5
WHAT IS THE DIFFERENCE BETWEEN ++*IP AND *IP++ ?
ANS: B
16
WHAT IS THE OUTPUT OF THE FOLLOWING PROGRAM ?
# INCLUDE <STDIO.H>
INT
MAIN ( VOID )
{
INT X, Y, Z;
X = 2, Y = 4;
Z = X && Y;
PRINTF("Z = %D\N", Z );
1) 1
2) 0
3) NONE OF THESE
4) 8
ANS = 1
17
WHAT IS THE OUTPUT OF THE FOLLOWING PROGRAM ?
# INCLUDE <STDIO.H>
INT
MAIN ( VOID )
{
INT X = 48;
PRINTF("X = %S\N", X );
1) 10
2)0
3) RUN TIME ERROR
4) COMPILATION ERROR
ANS = 3
18
WHAT IS THE OUTPUT OF THE FOLLOWING PROGRAM ?
# INCLUDE <STDIO.H>
# DEFINE ONE 1
# DEFINE TWO 2
INT
MAIN ( VOID ) {
}
1. ONE = 1, TWO = 2
2. TWO = 1, ONE = 2
3. COMPILATION ERROR
4. NONE OF THESE
ANS = 3
19
IF THE COMMAND LINE ARGUMENTS FOR THE FOLLOWING PROGRAM ARE
<A.OUT>
AND <GLOBALEDGESOFTWARELTD>, WHAT IS THE OUTPUT OF THE
PROGRAM ?
# INCLUDE <STDIO.H>
INT
}
1. GLOBALEDGESOFTWARELTD
2. G
3. COMPILATION ERROR
4. RUN TIME ERROR
ANS = 4
20
WHAT IS THE OUTPUT OF THE FOLLOWING ?
# INCLUDE <STDIO.H>
{
FUN( 12, ( 13, ( 14, 15 ) ) );
RETURN 0;
}
VOID FUN( INT X, INT Y )
{
PRINTF("X = %D,Y = %D\N", X, Y );
1. X = 12, Y = 13
2. X = 14, Y = 15
3. X = 12, Y = 15
4. SYNTAX ERROR( TOO MANY ARGUMENTS TO FUN() )
ANS = 3
1)REMOVE THE ODD ONES
A)JOB SCHEDULER B)LONG TERM SCHEDULER C)MEDIUM TERM
SCHEDULER
ANS:D
ANS: D
ANS:C
B)PARSER
C)ASSEMBLER
D)CODE GENERATOR
ANS:C
OPERATING SYSTEM :
1. ROUND ROBIN ALGORITHM IS USED IN :
A. DEADLOCK PREVENTIOM B. PROCESS MANAGEMENT C . SCHEDULING
(1)
D . DEADLOCK DETECTION
A. 16 B. 20(1) C . 24 D. 12
6
THE INT SIZE DEPENDS ON ?
**************************************************
*
**************************************************
*
OS QUESTIONS
B. LFU
C. FIFO
D. LIFO
A. PAGING
B. SHEDULING
C. SEGMENTATION ( CORRECT )
D. FILE MANAGEMENT
A. SWAPPING
B. COMPACTION
C. THRASHING ( CORRECT)
D. EXTERNAL FRAGMENTATION
A. MUTUAL EXCLUSION
B. NON PREEMPTION
C. CIRCULAR WAIT
**************************************************
*
**************************************************
*
/* N/W QUESTIONS */
CHOICE(S) :
---------
CHOICE(S) :
---------
(A)34
(B)53
(C)33
(D)32
CHOICE(S) :
---------
(A) HDD
(B) BIOS ROM
(C) FIRST TRACK ZEROTH CYLINDER ZEROTH SECTOR
(D) ZEROTH TRACK ZEROTH CYLINDER FIRST SECTOR
CHOICE(S) :
--------
(A)NO DIFFERENCE BETWEEN THEM
(B)SWITCHES WORK IN DATA LINK LAYER & ROUTERS IN NETWORK
LAYER OF OSI MODEL
(C)SWITCHES DIVIDES THE BANDWIDTH ACROSS THE VARIOUS DEVICES
CONNECTED WHEREAS
ANSWERS :
-------
C. DEADLOCK DETECTION
3) MULTIPROGAMMING IS USED
A. TO MAXIMIZE CPU UTILIZATION (ANS)
C. TO SAVE MEMORY
4) DRAWBACK IN PAGING IS
A. INTERNAL FRAGMENTATION (ANS)
B. EXTERNAL FRAGMENTATION
A. FIFO (ANS)
B. LRU
C. LFU
D. NONE
**************************************************
*
**************************************************
*
1) A RELOCATABLE CODE IS
A) PORTABLE CODE
B) HARDWARE
3) C IS A
A) LOW LEVEL LANGUAGE
D) PORTABLE LANGUAGE
A)PREPROCESSING
E) NONE
5)DISPATCHER IS USED IN
A)MEMORY MANAGEMENT
B)DEADLOCK
C)SCHEDULING (ANS)
D)NONE
6) USE OF VIRTUAL MEMORY
C) BOTH
D) NONE
**************************************************
*
**************************************************
*
COMPUTER CONCEPTS
-----------------
------------------------------------------
2 TELNET IS
(A) APPLICATION LAYER PROTOCOL
(B) NETWORK LAYER PROTOCOL
(C) USED BY LINK LAYER FOR SENDING FRAMES
(D) NONE OF THE ABOVE
ANS : (A)
------------------------------------------
ANS : (B)
------------------------------------------
ANS : (A)
------------------------------------------
5 LINUX
(A) HAS HIERARCHICAL FILE SYSTEM
(B) HAS FAT
(C) TREATS PERIPHERAL DEVICES AS FILES
(D) BOTH (A) & (C)
ANS : (D)
------------------------------------------
**************************************************
*
**************************************************
*
ANS. A
2 DMA REQUIRES
B.CASH
C.CPU INSTANTIATION.
D.MAIN MEMORY.
ANS C
C.BOTH OF THESE
D.NONE OF THESE
ANS A
A.ASSEMBLY CODE
B.OBJECT CODE
C.MACHINE CODE
ANS B.
5 WHICH ONE THESE IS ONCHIP MEM
A.MAINMEMORY
B.CASH
**************************************************
*
**************************************************
*
---------------------------------------------------------------------------------
----------------
A. 3 B. 4
C. 5 @ D. 6
---------------------------------------------------------------------------------
-----------------
---------------------------------------------------------------------------------
-----------------
---------------------------------------------------------------------------------
-----------------
---------------------------------------------------------------------------------
-------------------
**************************************************
*
**************************************************
*
B) HERMAN HOLLERITH
C) ANTONY VAN
D) CHARLES BABBAGE
ANS .(D)
A) 24
B) 100
C) 80
D) 16
ANS.(C)
ANS.(B)
A)MICROSOFT
B)IBM
C)AT&T
D)HEWLETT PACKARD
ANS.(C)
ANS.(C)
**************************************************
*
**************************************************
*
B. DENNIS RITCHIE
C. TIM PATTERSON *
D. KEN THOMPSON
D. AUTOEXEC.BAT
C. ROM-BIOS SOFTWARE
D. ROM BASIC SOFTWARE
B.FLAGS REGISTER *
C.SEGMENT REGISTER
D.OFFSET REGISTER
C. 8 BITS LONG
D. 8 BYTES LONG
B. 4 BYTES LONG *
C. 8 BYTES LONG
D. 1 BYTE LONG
7.) THE PROGRAM COUNTER IS ALSO CALLED
A. STACK POINTER
B. BASE POINTER
C. INSTRUCTION POINTER *
B. 16 BIT MICROPROCESSOR
D. A 32 BIT MICROPROCESSOR
B. EGA
C. XGA
D. BCA *
B. INT86X() *
C. INTDOS()
D. INTDOSX() *
A. 2000
B. 3000
C. 4000 *
D. 5000
1
IEEE STANDS FOR ?
ANS: A
2
WHICH OF THE FOLLOWING PROTOCOL HELP US WHILE RECEIVING MAIL
MESSAGES
A) SNMP B)
ANS: C
3
WHICH OF THE FOLLOWING TOOLS ARE USED TO PARTITION THE HARD
DISK ?
A) FDISK
B) DISK MANAGER ( DM ).
C) BOTH
ANS: C
4
EBCDIC CODE STANDS FOR ?
ANS: A
5
C++ DESIGNED AND DEVELOPED BY ?
B) THOMSON.
C) BARY B BREY.
D) BJARNE STROUSTRUP
ANS: D)
1) : TRUE */
1. WHAT IS THE OUTPUT OF THE PROGRAM ?
MAIN()
{
INT A = 1;
#DEFINE P A
PRINTF("%D %D ",A++,P++) ;
}
A) 1, 0
B) 2, 0
C) 1 2
ANS (D)
2. WHAT IS THE OUTPUT OF THE PROGRAM ?
#INCLUDE<STDIO.H>
MAIN()
{
#INCLUDE<STDIO.H>
INT A = 90 ;
PRINTF("%D",A) ;
}
A) 90
B) COMPILATION ERROR
C) LINKER ERROR
D) RUNTIME ERROR
ANS (A)
3. WHAT IS THE OUTPUT OF THE PROGRAM ?
MAIN()
{
MAIN() ;
}
A) COMPILATION ERROR
B) RUNTIME ERROR
ANS (C)
{
PRINTF(MAX) ;
}
A. COMPILATION ERROR
B. PREPROCESSING ERROR
C. RUNTIME ERROR
D. HELLO
ANS (D)
5. WHAT IS THE OUTPUT OF THE PROGRAM ?
#DEFINE MAX MAIN()
MAIN()
{
MAX ;
A. COMPILATION ERROR
B. PREPROCESSING ERROR
C. RUNTIME ERROR
MAIN()
{
INT A = 90 ;
P P1 ;
P 1 = &A ;
PRINTF("%D",*P1) ;
}
A. 90
B. COMPILATION ERROR
C. RUNTIME ERROR
ANS (A)
7. WHAT IS THE OUTPUT OF THE PROGRAM ?
MAIN()
{
INT I = 1 ;
}
A. ONE
B. ZERO
C.ERROR
D. BOTH AND B
ANS (A)
8. WHAT IS THE OUTPUT OF THE PROGRAM ?
MAIN()
{
INT I = 1 ;
PRINTF("%D",I ? 1 : 0) ;
}
A. 1
B. 0
C. ERROR
{
INT A = 90 , B = 100 ;
A++ ;
A = (A ^ B) ^ (A = B );
B = A^B^A ;
--A ;
PRINTF("%D %D",A++,B++) ;
}
A. 90 100
B. 100 90
C. 101 91
D. 91 101
ANS (A)
10. WHAT IS THE OUTPUT OF THE PROGRAM ?
MAIN()
{
INT A = 10 , B = 100 ;
SWAP(&A , &B) ;
PRINTF("%D %D",A,B) ;
}
SWAP(INT *A , INT *B)
{
*A = * A + * B ;
*B = *A - *B ;
*A = *A - *B ;
SWAP1(&A , &B) ;
}
SWAP1(INT **A , INT **B)
{
**A = **A + **B ;
**B = **A - **B ;
**A = **A - **B ;
}
A. 100 10
B. 10 100 (1)
D. ERROR !!
ANS (B)
11. WHAT IS THE OUTPUT OF THE PROGRAM ?
MAIN()
{
VOID *PTR ;
INT A = 10 ;
PTR = &A ;
PRINTF("%D",*PTR) ;
}
1. ERROR
2. 10
3. 20
4. NONE
ANS (1)
{
VOID *PTR ;
INT A = 90 ;
PTR = A ;
PTR = PTR1 ;
}
A. EXECUTES W/O ANY ERROR
B. COMPILATION ERROR
C. RUNTIME ERROR
D.NONE
ANS (A)
{
CHAR *P = "HELLOO" ;
{
;
}
}
A. ERROR
B. ADDRESS IS COPIED
ANS (C)
14. WHAT IS THE OUTPUT OF THE PROGRAM ?
INT G = 10 ;
MAIN()
{
INT A = 10 ;
PRINTF("%D",A) ;
}
INT G ;
A. 10
B. 11
C. ERROR
D. NONE
ANS (A)
15. WHAT IS THE OUTPUT OF THE PROGRAM ?
MAIN()
{
INT A = 1 ;
INT B = 0 ;
}
A. ERROR
B. NONE
C. 1
D .2
ANS (D)
16. WHAT IS THE OUTPUT OF THE PROGRAM ?
STRUCT S
{
INT SI;
UNION U
{
FLOAT UF;
CHAR UC;
};
};
MAIN()
{
PRINTF("%D",SIZEOF(STRUCT S));
}
A. 8
B. 3
C. 6 @
D. 7
STRUCT ST
{
INT A;
CHAR B;
}
MAIN()
{
}
A. STRUCT ST IS RETURN TYPE OF MAIN@
C. COMPILATION ERROR
ANS (A)
-----------------------------------------------------
18. WHAT IS THE OUTPUT OF THE PROGRAM ?
TYPEDEF STRUCT INFO
{
INT I;
CHAR B;
} NODE;
MAIN()
{
STRUCT INFO NODE1;
NODE1.I=55;
PRINTF("%D",NODE1.I);
A. 55
C.COMPILATION ERROR
D. GARBAGE VALUE.
ANS (A)
19. WHAT IS THE OUTPUT OF THE PROGRAM ?
STRUCT A
{
INT I;
INT DISPLAY()
{
PRINTF("HELLO WORLD\N");
}
};
MAIN()
{
STRCUT A VARA;
VARA.DISPLAY();
}
A. HELLO
B. HELLO WORLD
D. GARBAGE
STRUCT A
{
INT (*PTR)();
};
INT DISPLAY()
{
PRINTF("GLOBAL EDGE\N");
}
MAIN()
{
STRUCT A STRUCTA;
STRUCTA.PTR=DISPLAY;
STRUCTA.PTR();
}
A. GLOBAL EDGE
B. ADDRESS OF DISPLAY FUNCTION
C. ADDRESS OF STRUCTA
D.ERROR
ANS (A)
21. WHAT IS THE OUTPUT OF THE PROGRAM ?
TYPEDEF INT *ABC;
INT MAIN()
{
XYZ VAR;
}
1. VAR IS AN ARRAY OF INTEGER POINTERS.
2. VAR IS A POINTER TO AN INTEGER ARRAY.
OPTIONS:
A) ONLY 1 IS CORRECT.
B) ONLY 2 IS CORRECT.
ANSWER : B
{
INT A;
CHAR X;
CHAR Y;
}NAME;
INT MAIN()
{
NAME.A=258;
PRINTF("\N X = %D Y = %D ",NAME.X,NAME.Y);
}
A) X = 1 Y = 1
B) X = 2 Y = 2
C) X = 1 Y = 2
D) X = 2 Y = 1
ANSWER : B
INT MAIN()
{
INT A[20];
INT *P,*Q,VAL;
P = &A[0];
Q = &A[10];
VAL = Q - P;
}
ASSUME P = 1000, WHAT IS THE VALUE OF Q AND VAL ?
A) Q = 1020 VAL = 20
B) Q = 1020 VAL = 10
C) Q = 1010 VAL = 10
D) Q = 1010 VAL = 20
ANSWER : B
STRUCT KEY
{
CHAR *WORD[2];
INT COUNT;
CHAR C;
}ABC;
INT MAIN()
{
PRINTF("\NSIZE %D",SIZEOF(ABC));
B) 7
C) 6
D) 5
ANSWER : B
MAIN()
{
INT A;
FUN();
PRINTF("%D",A);
A=50;
FUN()
{
INT I;
*(&I+4) = 100;
}
A. 50
B. GARBAGE VALUE
C. 100
D. COMPILER ERROR
MAIN()
{
#DEFINE X 5
INT B;
B = X;
PRINTF("%D",B);
A. COMPILER ERROR
B. RUNTIME ERROR
C. GARBAGE VALUE
D. 5
MAIN()
{
INT A; #DEFINE Y 10
A=Y;
PRINTF("%D",A);
}
A. 10
B. COMPILER ERROR
C. RUN-TIME ERROR
D. GARBAGE VALUE
#DEFINE S -50
MAIN()
{
INT S;
#IFDEF S
PRINTF("HELL\N");
#ELSE
PRINTF("HEAVEN\N");
#ENDIF
}
A. HELL
B. HEAVEN
C. COMPILATION ERROR
D. HELLHEAVEN
A. ARRAYS
B. POINTERS
D. CAN'T SAY
A)COMMENT_NEST_LIMIT TIMES
B)COMMENT_LIMIT TIMES
C)ONE TIME
D)NOT EVEN ONCE (R)
30
WHICH ONE MUST BE CORRECT IN THE FOLLOWING STATEMENTS ?
ANS (A)
31
SELECT THE CHOICE WHICH IS WRONG ?
ANS (C)
32
CONSIDER THE FOLLOWING PROGRAM
MAIN()
{
INT I,J;
I = 06;
J = 09;
33
WHAT WOULD BE THE OUTPUT ?
A)6 9
B)6 11
C)06 09
D)COMPILATION ERROR
# UNDEF __FILE__
# DEFINE __FILE__ "GLOBALEDGE"
MAIN()
{
PRINTF("%S\N",__FILE__);
A)COMPILATION ERROR
B)RUN-TIME ERROR
C)COMPILES BUT GIVES A WARNING
D)COMPILES NORMALLY
35).
WHAT HAPPENS WHEN WE COMPILE THIS PROGRAM ?
# DEFINE LINE
# DEFINE NAME "GESL"
MAIN()
{
PRINTF("%D "%S\N",LINE,NAME);
A)COMPILATION ERROR
B)COMPILES BUT WARNS
C)SYNTAX ERROR
D)COMPILES NORMALLY
36)
INT MAIN()
{
INT I = 5;
IF(1)
{
STATIC INT I;
I++;
PRINTF("%D", I);
}
PRINTF("%D", I);
}
A. ERROR
B. 5,0
C. 5,1
D. 1,5
ANS (D)
37)
INT MAIN()
{
INT A[4] = { 23, 67, 90};
A. JUNK
B. ERROR
C. 0 (ANS)
D. 1
3
INT MAIN()
{
INT I = 1, 2;
PRINTF("%D", I);
A. 1
B. 2
C. ERROR
D. NONE
ANS (C)
39)
INT MAIN()
{
INT I;
{
I = I+2;
BREAK;
PRINTF("%D", I);
}
}
A. 0
B. 2
C. ERROR
D. NONE (ANS)
ANS (D)
40)
INT MAIN()
{
INT I;
I = 1, 2;
PRINTF("%D", I);
A. 1 (ANS)
B. 2
C. ERROR
D. NONE
41)
#INCLUDE<STDIO.H>
INT I =20;
INT MAXLEN = I;
INT MAIN()
{
INT J = I;
A) I=20 , J=20
B) I=20 , J=JUNK
C) ERROR
D) NONE
ANS.(C)
42)
INT MAIN()
{
INT I =10;
PRINTF("%D", J);
PRINTF("%D",I);
}
INT J = 20;
A) J=20 , I=10
B) J=JUNK , I=10
D) RUNTIME ERROR
ANS (C)
-43
INT I =20;
INT I,J=10;
MAIN()
{
INT J =20;
A) REDECLARATION ERROR
B) I=20 , J=10
D) NONE
44)
INT MAIN()
{
INT K=2, I =10;
WHILE(K--)
{
PRINTF("%D\N",DISP(I));
}
}
DISP(INT K)
{
STATIC INT I=0;
RETURN I=I+K;
}
A) 10, 10
B) 10, 20 (ANS)
C) 20, 10
D) NONE
C)BOTH
WHILE(I--)
{
INT I =10;
PRINTF("%D",I);
}
}
A) 10, 9, 8, 7, .....1
D) NONE
-47
CHAR S[] = "HELLO\0 WORLD";
PRINTF("%S...%D",S,STRLEN(S));
ANS : (A)
-48
PRINTF("%%% S","HELLO");
ANS : (C)
(49).
(A) CHAR
(B) INT
(C) UNSIGNED INT
(D) VOID
ANS : (B)
(50).
INT I = 24;
PRINTF("%XD",I);
WHAT IS THE OUTPUT?
(A) 18
(B) 24
(C) 18D
(D)COMPILE TIME ERROR
ANS : (C)
(51).
WHAT IS RETURN TYPE OF FREOPEN
(A) INT*
(B) FILE*
(C) INT
(D) VOID
ANS : (B)
(52).
STRUCT NODE
{
INT I;
};
MAIN()
{
STRUCT NODE N1;
PRINTF("%D",N1.I);
A. 0
B. GARBAGE VALUE
C. ERROR.
4.WARNING
ANS: B
-53
STRUCT NODE_TAG
{
INT I;
};
MAIN()
{
PRINTF("%D",SIZE(NODE_TAG));
A). 4
B). 6
C).GARBAGE VALUE
D).ERROR
ANS:D
-54
TYPEDEF STRUCT NODE_TAG
{
INT I=0;
INT J;
} NODE;
MAIN()
{
NODE N1;
PRINTF("%D",N1.I);
1. 0
2. WARNING
3.GARBAGE VALUE
4.ERROR
ANS: D
-55 STRUCT
{
INT I;
}NODE ;
MAIN()
{
PRINTF("%D",NODE.I);
(A). 0
(B). GARBAGE VALUE
(C). ERROR.
(D). WARNING
ANS: (A)
(56).
STRUCT NODE_TAG
{
INT A;
};
MAIN()
{
STRUCT NODE_TAG N1;
N1.PT=&N1;
N1.PT->A=5;
PRINTF("%D",N1.A);
(A). ERROR
(B). WARNING
(C). 5
(D).GARBAGE VALUE
ANS: (C)
-57
INT N;
SCANF("%D",N);
C)RUNTIME ERROR
D)READS 0
ANS (C)
5
STRCHR(S,C)
ANS :A
A)GARBAGE
B)NULL
C)0
D)-1
ANS (C)
-60
(VOID *) IS CALLED
(A)POINTER TO VOID
(B)POINTER TO ANY DATA TYPE
(C)GENERIC POINTER
(D)NONE OF THE ABOVE
ANS (C)
-61
WHAT THE PUTCHAR() WILL RETURN ON ERROR
A)0
B)EOF
C)NULL
D)-1
ANS (B)
I=I++ * I++;
PRINTF("%D",I);
A)30
B)49
C)25
D)27
ANS (D)
I=5;
PRINTF("%D",I++ * I++);
A)30
B)49
C)25
D)37
ANS (C)
-65
#INCLUDE<STDIO.H>
INT MAIN(VOID)
{
PUTCHAR("0123456789ABCDEFGHIJKL" [16 & 17 ] );
RETURN NULL;
CHOICE(S) :
A) ERROR
B) NO OUTPUT
C) GARBAGE
D) G
66)
#INCLUDE<STDIO.H>
INT MAIN()
*(P+10);
FPRINTF(STDERR,"%S",P);
RETURN 'C';
CHOICE(S) :
B) ERROR
C) GARBAGE
D) PRINTS "WELCOME TO GESL" TO SCREEN
67)
MAIN()
{
CHAR *P="MASONIC DOZENS DEIFY FORELOCK TOO ...";
WHILE(*P)
PRINTF("%C",TOUPPER(*P++));
---------------------------------------------------
CHOICE(S) :
---------
A) ERROR
B) ORIGINALTO
C) MSDOSUSART
D) SIDEEFFECT
---------------------------------------------------
ANS D)
-68
#INCLUDE<STDIO.H>
INT MAIN(VOID)
PUTS("HELLO\0WORLD");
CHOICE(S) :
A) ERROR
B) HELLO$^@$S
C) HELLO
D) WORLD$%^#^
---------------------------------------------------
-69
#INCLUDE<STDIO.H>
TYPEDEF CHAR (*PFI) () ;
{
PFI A = MAIN;
PRINTF("%S",A);
CHOICE(S) :
B)INFINITE LOOP
ANSWERS :
-------
1) (D) G
2) (D) PRINTS "WELCOME TO GESL" TO SCREEN
3) (D) SIDEEFFECT
4) (C) HELLO
5) (C) PRINTS SOME GARBAGE
70)
UNION U
{
INT IVAL;
FLOAT FVAL;
CHAR *SVAL;
SIZE OF U IS
A) 8 BYTES
B) 4 BYTES
D) 12
ANS (B)
71)
STRUCT X
{
INT I; INT J;INT K;
};
STRUCT X *P;
STRUCT X ARR[3];
P =&ARR[0];
P++;
WHAT IS P POINTING TO
A) POINTING TO I OF ARR[0]
B) POINTING TO J OF ARR[0]
C) POINTING TO K OF ARR[1]
D) POINTING TO I OF ARR[1]
ANS : (D)
72)
STRUCT A
{
INT B;
};
STRUCT B
{
INT B;
};
INT MAIN()
{
STRUCT A FIRST;
STRUCT B SECOND;
FIRST.B =10;
SECOND = FIRST;
PRINTF("%D",SECOND.B);
A) 10
B) GARBAGE
C) COMPILE ERROR
ANS: C
4) STRUCT A
{
INT X;
FLOAT Y;
DOUBLE Z;
STRUCT A B;
};
A) NO ERROR
B) COMPILE ERROR
ANS : B
5) STRUCT A{
STRUCT B
{
INT A;INT B;
} C;
INT *PTR;
}D;
D.PTR=&D.C.A;
A) COMPILE ERROR
B) SYNTAX ERROR
C) BOTH A AND C
ANS : D
1)
UNINITIALIZED STATIC VARIABLES ARE INTITIALIZED DURING
A) RUN TIME
B) COMPILE TIME
ANS : B
2)
GIVEN THE HEIGHT OF A BINARY TREE WHAT IS THE MAXIMUM NUMBER
NODES
A) 2^(N+1) -1
B) 2^(N) -1
C) 2^(N-1) -1
D) NONE
ANS : A
CASE
A) BUBBLE SORT
B) INSERTION SORT
C) HEAP SORT
D) QUICK SORT
ANS : C
ANS : D
**************************************************
*
**************************************************
*
**************************************************
*
**************************************************
*
1)
#INCLUDE<STDIO.H>
INT MAIN(VOID)
{
INT *INTPTR ;
INTPTR = (CHAR*)MALLOC(SIZEOF(10));
RETURN 0;
A) COMPILATION ERROR
B) RUNTIME ERROR
CORRECT ANSWER : C
-----------------------------
2)#INCLUDE<STDIO.H>
INT MAIN(VOID)
FILE *FP1,*FP2;
INT C;
FP1 = FOPEN("TESTING","A");
FP2 = FOPEN("TESTING","W");
FPUTC(C,FP1);
RETURN 0;
}
B) RUNTIME ERROR
CORRECT ANSWER : D */
-------------------------------------------
3.#INCLUDE<STDIO.H>
INT MAIN(VOID)
SCANF("%D",INTNUM2);
FOR(I = 0;I<=3;I++)
{
NUM = INTNUM1 * INTNUM2 * NUM;
RETURN 0;
B) RUNTIME ERROR
C) SUCCESSFUL EXECUTION
D) JUNK VALUE
CORRECT ANSWER : D */
-------------------------------------------------------
4).#INCLUDE<STDIO.H>
INT MAIN(VOID)
CHAR STR[5];
CHAR *NEWSTR;
SCANF("%S",&STR);
RETURN 0;
B) RUNTIME ERROR
C) SUCCESSFUL EXECUTION
D) JUNK VALUE
CORRECT ANSWER : A */
-------------------------------------------
5)
#INCLUDE<STDIO.H>
INT MAIN(VOID)
FILE *FP;
CHAR *STR ;
CHAR *NEWSTR;
FP = FOPEN("SOURCE","R");
NEWSTR = FGETS(STR,5,FP);
RETURN 0;
}
/*A) COMPILATION ERROR
B) RUNTIME ERROR
C) SUCCESSFUL EXECUTION
D) SEGMENTATION FAULT
CORRECT ANSWER : D */
1 INT A=1,B=0, X;
X = A++ && ++B;
PRINTF("%D %D %D ",A,B,X );
OUTPUT ?
A) 1 1 2 B) 2 1 0 C) 2 0 2 D) 2 1 1
ANS: D
2
CHAR *FN();
MAIN() {
CHAR *S;
S = FN();
PRINTF("%S\N",S );
}
CHAR *FN()
{ RETURN "HELLO"; }
OUTPUT IS ?
ANS: C
3
INT I;
I+= 2;
PRINTF("I = %D\N", I );
OUTPUT IS ?
A) 12 B) 11 C) 10 D) 13
ANS: A
{
INT I;
I = F();
PRINTF("%D",I );
}
F()
{ RETURN 1,2,3; }
A) 1 B) COMPILATION ERROR C) 2 D) 3
ANS: D
5
WHAT IS THE DIFFERENCE BETWEEN ++*IP AND *IP++ ?
ANS: B
16
WHAT IS THE OUTPUT OF THE FOLLOWING PROGRAM ?
# INCLUDE <STDIO.H>
INT
MAIN ( VOID )
{
INT X, Y, Z;
X = 2, Y = 4;
Z = X && Y;
PRINTF("Z = %D\N", Z );
1) 1
2) 0
3) NONE OF THESE
4) 8
ANS = 1
17
WHAT IS THE OUTPUT OF THE FOLLOWING PROGRAM ?
# INCLUDE <STDIO.H>
INT
MAIN ( VOID )
{
INT X = 48;
PRINTF("X = %S\N", X );
1) 10
2)0
3) RUN TIME ERROR
4) COMPILATION ERROR
ANS = 3
18
WHAT IS THE OUTPUT OF THE FOLLOWING PROGRAM ?
# INCLUDE <STDIO.H>
# DEFINE ONE 1
# DEFINE TWO 2
INT
MAIN ( VOID ) {
1. ONE = 1, TWO = 2
2. TWO = 1, ONE = 2
3. COMPILATION ERROR
4. NONE OF THESE
ANS = 3
19
IF THE COMMAND LINE ARGUMENTS FOR THE FOLLOWING PROGRAM ARE
<A.OUT>
AND <GLOBALEDGESOFTWARELTD>, WHAT IS THE OUTPUT OF THE
PROGRAM ?
# INCLUDE <STDIO.H>
INT
1. GLOBALEDGESOFTWARELTD
2. G
3. COMPILATION ERROR
4. RUN TIME ERROR
ANS = 4
20
WHAT IS THE OUTPUT OF THE FOLLOWING ?
# INCLUDE <STDIO.H>
{
FUN( 12, ( 13, ( 14, 15 ) ) );
RETURN 0;
{
PRINTF("X = %D,Y = %D\N", X, Y );
1. X = 12, Y = 13
2. X = 14, Y = 15
3. X = 12, Y = 15
4. SYNTAX ERROR( TOO MANY ARGUMENTS TO FUN() )
ANS = 3
1. WHERE IS THE MBR STORED?
1. MAINTAINED BY OS
2. MBR IS IN BOOT.
3 MBR IS IN FIRST SECTOR OF HDD
4. NONE OF THE ABOVE.
2. WHERE IS THE PARTITION TABLE STORED?
1. BIOS
2. CMOS SETUP
3. MBR
4. STORED PER PARTITION.
3. WHERE IS THE BOOT RECORD STORED?
1. BIOS
2. CMOS SETUP
3. MBR
4. STORED PER PARTITION.
4. HOW MANY PRIMARY PARTITIONS CAN BE CREATED?
1. 1
2. 2
3. 3
4. 4
ANS : 4.
ANS: YES
7. CAN WE CREATE 2 EXTENDED PARTITIONS ?
ANS: NO.
ANS: YES.
ANS : 2. 8 BIT
ANS: B
1) MAIN(){
INT A;
CHAR *P;
A = SIZEOF(INT) * P;
PRINTF("%D\N",A);
}
A)COMPILE ERROR
C)4
D)COMPILER DEPENDENT
ANS:A
PRINTF("TRUE\N");
ELSE
PRINTF("FALSE\N");
}
A) TRUE
B) FALSE
C) CAN'T PREDICT
D) NONE OF THESE
ANS:B (?)
3) INT (*FUN())[]
A) FUNCTION RETURNING A POINTER TO AN ARRAY
D) COMPILER ERROR
ANS: A
4) MAIN(){
INT A=8,D;
INT *P;
P=&A;
D=A/*P;
PRINT("%D\N",D);
}
A) 1
B) 0
C) COMPILER ERROR
ANS: C
5)MAIN(){
CHAR *A="HELLO";
*A++ = 'H';
PRINTF("%S\N",A);
}
A) HELLO
B) ELLO
C) RUNTIME ERROR
D) COMPILER ERROR
ANS:B
6) MAIN(){
CHAR P[]="HELLO";
P[0]='H';
PRINTF("%S\N", P);
}
A) HELLO
B) HELLO
C) COMPILER ERROR
ANS:A
FLOAT D;
PRINTF("%D\N", MYSIZEOF(D) );
}
NOTE: ASSUME SIZEOF FLOAT IS 8 BYTES
A) 8
B) 4
C) 1
D) COMPILER ERROR
ANS:C
MAIN()
{ INT *P=10;
PRINTF("%D\N",*P);
}
A) 10
C) COMPILER ERROR
D) 5
ANS:B (?)
9)MAIN(){
INT I=-1;
I<<=2;
PRINTF("%D\N",I);
}
A) -1
B) -2
C) -4
D) 0
ANS:C
10) MAIN(){
INT I= 0XFFFFFFFF;
PRINTF("%D\N",I);
}
NOTE: SIZE OF INT IS 4 BYTES
A) -1
B) 65635
C) 100
D) ERROR
ANS:A
C QUESTIONS
1>
INT A=1,B=2;
PRINTF("WORLD\N");
ELSE
PRINTF("BANGALORE\N");
A> WORLD B> HELLO BANGALORE C> BANGALORE D> HELLO WORLD.
2>
MAIN()
{
INT I;
{
INT J=10;
J++;
PRINTF("J= %D\N", J);
}
}
WHAT IS O/P ?
3>
UNION TEST{
INT A;
};
MAIN(){
UNION TEST Q;
}
WHAT IS O/P?
A> 0 B> SYNTAX ERROR C> GARBAGE VALUE D>RUN TIME ERROR
ANS > C
4>
MAIN(){
B++;
ANS > D
MAIN(){
INT I=10,J=2;
DPRINT(I / J) ;
ANS > B.
ANS> B
ANS> D
4> IN GENERAL PURPOSE OS USER CANNOT CHANGE WHICH STATE OF
PROCESS.
A> PREMPTION
B> SLEEP
C> CREATION
D> READY
ANS> A
5> WHICH ADDRESSING SCHEME IS NOT COMMON FOR 8085 & 8086
ANS: B
JUNE-2004
P=(INT *)MALLOC(-10);
A) ALLOCATES 0 BYTES
C) COMPILATION ERROR
D) RUNTIME ERROR
ANS) B
2. MAIN()
{
FOR( PRINTF("A") ; PRINTF("B") ; PRINTF("C") ) ;
A) ABC
B) ABC ABC ABC .....(INFINITE TIMES)
C) A BC BC BC ....(INFINITE TIMES)
D) ERROR
ANS) C
3. MAIN()
{
INT I= 10 * FUN() ;
PRINTF("%D",I);
FUN()
{
RETURN 10 ;
A) 0
B) 10
C) 100
D) ERROR
ANS) C
4.
INT I= 10 * FUN() ;
MAIN()
{
PRINTF("%D",I) ;
FUN()
{
RETURN 10 ;
A) 0
B) 10
C) 100
D) ERROR
ANS) D
5. ASSUME SIZE OF INT TO BE 2 BYTES :
MAIN()
{
INT I = 100 ;
PRINTF("%D ",I) ;
A) 2 100
B) 2 101
C) 100 101
D) 101 100
ANS) A
COMPUTER FUNDAMENTALS :
B) LOADER
C) COMPILER
ANS) B
A) APPLICATION LAYER
B) NETWORK LAYER
C) INTERNET LAYER
ANS) C
D) HASH TABLE
ANS) D
A) ARRAYS
D) HASH TABLE
ANS) C
5.WHICH ONE OF THESE IS NOT A SCHEDULING TECHNIQUE IN
OPERATING SYSTEM?
A) LAST-COME-FIRST-SERVE SCHEDULING
B) FIRST-COME-FIRST-SERVE SCHEDULING
C) PREEMPTIVE SCHEDULING
ANS) A
6. DEMAND PAGING IS
7. PAGE FAULT IS
ANS) A
A) N -1
B) N
C) N + 1
D ) 2N
ANS) C
A) DEADLOCK DETECTION
B) DEADLOCK AVOIDANCE
C) DEADLOCK PREVENTION
ANS) B
A) FINITE AUTOMATA
C) TURING MACHINE
11. WHICH LAYER IN THE OSI MODEL IS RESPONSIBLE FOR END TO END
CONNECTIVITY ?
B) NETWORK LAYER
C) TRANSPORT LAYER
D) SESSION LAYER
ANS) C
JUL-04
ANS: YES
7. CAN WE CREATE 2 EXTENDED PARTITIONS ?
ANS: NO.
ANS: YES.
10. SLIDING WINDOW PROTOCOL LIES IN WHICH LAYER?
1. TRANSPORT LAYER 2. NETWORK LAYER 3. DATALINK LAYER 4.
APPLICATION LAYER
12. 8085 IS
1. 16-BIT 2. 8-BIT 3. 32-BIT 4. 20-BIT MICROPROCESSOR.
ANS : 2. 8 BIT
ANS: B
1) MAIN(){
INT A;
CHAR *P;
A = SIZEOF(INT) * P;
PRINTF("%D\N",A);
}
A)COMPILE ERROR
C)4
D)COMPILER DEPENDENT
ANS:A
PRINTF("TRUE\N");
ELSE
PRINTF("FALSE\N");
}
A) TRUE
B) FALSE
C) CAN'T PREDICT
D) NONE OF THESE
ANS:B (?)
3) INT (*FUN())[]
A) FUNCTION RETURNING A POINTER TO AN ARRAY
D) COMPILER ERROR
ANS: A
4) MAIN(){
INT A=8,D;
INT *P;
P=&A;
D=A/*P;
PRINT("%D\N",D);
}
A) 1
B) 0
C) COMPILER ERROR
ANS: C
5)MAIN(){
CHAR *A="HELLO";
*A++ = 'H';
PRINTF("%S\N",A);
}
A) HELLO
B) ELLO
C) RUNTIME ERROR
D) COMPILER ERROR
ANS:B
6) MAIN(){
CHAR P[]="HELLO";
P[0]='H';
PRINTF("%S\N", P);
}
A) HELLO
B) HELLO
C) COMPILER ERROR
ANS:A
FLOAT D;
PRINTF("%D\N", MYSIZEOF(D) );
}
NOTE: ASSUME SIZEOF FLOAT IS 8 BYTES
A) 8
B) 4
C) 1
D) COMPILER ERROR
ANS:C
8) MAIN()
{ INT *P=10;
PRINTF("%D\N",*P);
}
A) 10
C) COMPILER ERROR
D) 5
ANS:B (?)
9)MAIN(){
INT I=-1;
I<<=2;
PRINTF("%D\N",I);
}
A) -1
B) -2
C) -4
D) 0
ANS:C
10) MAIN(){
INT I= 0XFFFFFFFF;
PRINTF("%D\N",I);
}
NOTE: SIZE OF INT IS 4 BYTES
A) -1
B) 65635
C) 100
D) ERROR
ANS:A
C QUESTIONS
1>
INT A=1,B=2;
PRINTF("WORLD\N");
ELSE
PRINTF("BANGALORE\N");
2>
MAIN()
{
INT I;
{
INT J=10;
J++;
}
}
WHAT IS O/P ?
3>
UNION TEST{
INT A;
};
MAIN(){
UNION TEST Q;
}
WHAT IS O/P?
A> 0 B> SYNTAX ERROR C> GARBAGE VALUE D>RUN TIME ERROR
ANS > C
4>
REGISTER INT A,B;
MAIN(){
B++;
ANS > D
MAIN(){
INT I=10,J=2;
DPRINT(I / J) ;
ANS> D
ANS> B
ANS> D
A> PREMPTION
B> SLEEP
C> CREATION
D> READY
ANS> A
5> WHICH ADDRESSING SCHEME IS NOT COMMON FOR 8085 & 8086
ANS: B
JUNE-2004
P=(INT *)MALLOC(-10);
}
A) ALLOCATES 0 BYTES
C) COMPILATION ERROR
D) RUNTIME ERROR
ANS) B
2. MAIN()
{
FOR( PRINTF("A") ; PRINTF("B") ; PRINTF("C") ) ;
A) ABC
C) A BC BC BC ....(INFINITE TIMES)
D) ERROR
ANS) C
3. MAIN()
{
INT I= 10 * FUN() ;
PRINTF("%D",I);
FUN()
{
RETURN 10 ;
A) 0
B) 10
C) 100
D) ERROR
ANS) C
4.
INT I= 10 * FUN() ;
MAIN()
{
PRINTF("%D",I) ;
}
FUN()
{
RETURN 10 ;
A) 0
B) 10
C) 100
D) ERROR
ANS) D
MAIN()
{
INT I = 100 ;
PRINTF("%D ",I) ;
}
A) 2 100
B) 2 101
C) 100 101
D) 101 100
ANS) A
COMPUTER FUNDAMENTALS :
A) LINKER
B) LOADER
C) COMPILER
ANS) B
2. WHICH OF THESE IS NOT A LAYER IN OSI MODEL ?
A) APPLICATION LAYER
B) NETWORK LAYER
C) INTERNET LAYER
ANS) C
A) ARRAYS
D) HASH TABLE
ANS) D
4. WHICH OF THE FOLLOWING DATA STRUCTURES IS BEST SUITED FOR
DELETION ?
A) ARRAYS
D) HASH TABLE
ANS) C
A) LAST-COME-FIRST-SERVE SCHEDULING
B) FIRST-COME-FIRST-SERVE SCHEDULING
C) PREEMPTIVE SCHEDULING
ANS) A
6. DEMAND PAGING IS
ANS) C
7. PAGE FAULT IS
A) N -1
B) N
C) N + 1
D ) 2N
ANS) C
A) DEADLOCK DETECTION
B) DEADLOCK AVOIDANCE
C) DEADLOCK PREVENTION
A) FINITE AUTOMATA
C) TURING MACHINE
ANS) A
11. WHICH LAYER IN THE OSI MODEL IS RESPONSIBLE FOR END TO END
CONNECTIVITY ?
B) NETWORK LAYER
C) TRANSPORT LAYER
D) SESSION LAYER
ANS) C
1) WHAT IS BIG-ENDIAN.
A) MSB AT LOWER ADDRESS LSB AT HIGHER ADDRESS
ANS:A
2)WHAT IS LITTLE-ENDIAN.
A) MSB AT LOWER ADDRESS LSB AT HIGHER ADDRESS
ANS:B
3)8086 HAS
A)16 BIT DATA BUS ,16 BIT ADDRESS BUS
B)16 BIT DATA BUS,32 BIT ADDRESS BUS
ANS:A
A) FCFS ALGORITHM
C) ROUND-ROBIN ALGORITHM
ANS:C
5)ROUTER IS PRESENT AT
A)PHYSICAL LAYER
C)NETWORK LAYER
D)NONE OF ABOVE
ANS:C
D) CIRCULAR WAIT
ANS:D
ANS:D
B)1 0
C)1 1
D)0 0
ANS :C
9)INTERRUPT IS SERVICED
A)IMMEDIATLY WHEN IT OCCURS
B)AFTER THE COMPLETION OF CURRENT INSTRUCTION.
C)IGNORED
ANS:B
C QUESTIONS :
VOID MAIN()
{
CHAR *MESS[]={"HAVE","A","NICE","DAY","BYE");
PRINTF("%D \T %D",SIZEOF(MESS),SIZEOF(MESS[1]));
}
A. 16 4
B. 5 4
C. 20 4
D. ERROR
ANSWER: C
{
INT I,COUNT=0;
CHAR *P1="ABCDEFGHIJ";
CHAR *P2="ALCMENFOIP";
FOR(I=0;I<=STRLEN(P1);I++) {
IF(*P1++ == *P2++)
COUNT+=5;
ELSE
COUNT-=3;
}
PRINTF("COUNT=%D\N",COUNT);
A. 15
B. 6
C. 12
D. COMPILER ERROR
B. 0
C. -1
D.NONZERO
ANSWER : B
4.
MAIN(INT ARGC,CHAR *ARGV[])
{
PRINTF((ARGC > 1 ? "%C" : "%C",*++ARGV);
}
IF THE I/P STRING IS "GESL BANGALORE".
A. G
B. E
C. B
D. GESL
ANSWER: C
B. INT **A[5];
C. INT *(*A)[5];
D. U CON NOT DECLARE
ANSWER: C
QUESTIONS ON OS:
1.UDP IS A
A. RELIABLE PROTOCOL
B. UNRELIABLE PROTOCOL
C. CONNECTIONLESS PROTOCOL
D. BOTH B & C
ANSWER: D
B. CISC PROCESSOR
C. SISC PROCESSOR
ANSWER: A
B. A LOCAL VARIABLE
C. MUTEX
4.REPEATERS ARE IN
A. DATA LINK LAYER
B. PHYSICAL LAYER
C. NETWORK LAYER
D. TRANSPORT LAYER
ANSWER: B
B. CIRCUIT SWITCHING
C. MESSAGE SWITCHING
ANS : B ( NORMALLY )
5.WHAT DOES ACRONYM RISC STAND FOR ?
A)RAPID INSTRUCTION SET COMPUTERS
B. DENNIS RITCHIE
C. TIM PATTERSON *
D. KEN THOMPSON
D. AUTOEXEC.BAT
C. ROM-BIOS SOFTWARE
A.ORDINARY REGISTER
B.FLAGS REGISTER *
C.SEGMENT REGISTER
D.OFFSET REGISTER
C. 8 BITS LONG
D. 8 BYTES LONG
B. 4 BYTES LONG *
C. 8 BYTES LONG
D. 1 BYTE LONG
B. BASE POINTER
C. INSTRUCTION POINTER *
B. 16 BIT MICROPROCESSOR
D. A 32 BIT MICROPROCESSOR
B. EGA
C. XGA
D. BCA *
A. INT86()
B. INT86X() *
C. INTDOS()
D. INTDOSX() *
11.) CONVENTIONALLY ONE SCREENFUL OF CHARACTERS WOULD
REQUIRE HOW MANY BYTES:
A. 2000
B. 3000
C. 4000 *
D. 5000
ANS : A
A) SNMP B)
ANS : C
A) FDISK
B) DISK MANAGER ( DM ).
C) BOTH
ANS : C
ANS : A
B) THOMSON.
C) BARY B BREY.
D) BJARNE STROUSTRUP
ANS : D)
C PAPER
1. MAIN()
{ INT I;
I=(2,3);
PRINTF("%D",I);
ANS : 3
2. MAIN(){
CHAR STR[]="GESL";
PRINTF("%D %D",SIZEOF(STR),STRLEN(STR));
ANS: 5, 4
3. MAIN(){ FOR(I=0;I++;I<100) PRINTF("HELLO WORLD\N"); }
ANS: 0 TIMES.
6. MAIN(){
INT K=5;
PRINTF("%D\N",K);
ANS: 7
7. MAIN(){
INT *PTR1,*PTR2;
PTR1=(INT *)MALLOC(SIZEOF(INT));
PTR2=FUNC(20,10,PTR1);
PRINTF("%D %D\N",*PTR1,*PTR2);
}
INT X=A+B;
*C=A-B;
RETURN(&X);
INT I = 10, J ;
IF ( ( J = ~I ) < I )
PRINTF ( "TRUE" ) ;
ELSE
PRINTF ( "FALSE" ) ;
ANS : TRUE
ANS: 12
FILE *FP;
PRINTF("%D\N",SIZEOF(FP) );
ANS:4
11. MAIN()
INT A=10,20;
A^=B^=A^=B;
PRINTF("%D\N %D\N",A,B);
A)A=20,B=10 B)A=10,B=20 C)SYNTAX ERROR D)UNPREDICTABLE
12. MAIN() {
INT I=10;
SWITCH(I) {
}
A) HELLO B) HELLO C) HELLO WORLD HELLO WORLD D) SYNTAX ERROR.
13. MAIN() {
CHAR STR1[]="HELLO";
CHAR STR2[]="HELLO";
IF ( STR1==STR2 )
PRINTF("TRUE\N");
ELSE
PRINTF("FALSE\N");
ANS: FALSE.
A)TRUE B)FALSE C)ERROR D) UNPREDICTABLE.
14. MAIN()
# INCLUDE <STDIO.H>
INT I = 10 ;
PRINTF("%D\N", I/2 );
ANS : 5
# PRAGMA PACK(2)
STRUCT SIZE {
INT I;
CHAR CH ;
DOUBLE DB ;
};
MAIN () {