Global Edge Sample Paper

GLOBALEDGE SAMPLE PAPER

1. WHAT IS THE OUTPUT OF THE FOLLOWING CODE ?

INT MAIN( )

{

FOR( ; ;);

PRINTF("HELLO\N");

RETURN 0;

}

A. GIVE COMPILATION ERROR

B. PRINTS HELLO INFINITE TIMES

C. RUNS IN AN INFINITE LOOP WITHOUT PRINTING ANYTHING.

D. PRINTS HELLO ONCE.

ANS: C

2. OUTPUT OF THE CODE?

FUNC (INT *P)

{

P = (INT *)MALLOC(100);

PRINTF("P:%X",P);

}

INT MAIN( )

{

INT *PTR;

FUNC(PTR);

PRINTF("PTR:%X",PTR);

RETURN 0;

}

A. BOTH PRINTF STATEMENTS PRINTS SAME VALUES.

B. BOTH PRINT DIFFERENT VALUES.

C. GIVES COMPILE TIME ERROR.

D. GIVES RUN TIME ERROR.

ANS: B

3. OUTPUT OF THE CODE?

INT MAIN()

{

CHAR A[] = "WORLD";

PRINTF("%D %D\N",STRLEN(A),SIZEOF(A));

RETURN 0;

}

A. 5,5

B. 6,5

C. 5,6

D. 6,6

ANS: C

4. WHAT IS THE OUTPUT GENERATED?

MAIN()

{

CHAR *S = "HELLO";

PRINTF("%S",1(S));

}

A. HELLO

B. ELLO

C. E

D. NONE OF THESE.

ANS: B

5. INTERPRET THE GIVEN DECLARATION

CHAR ( * ( F ( ) ) [ ] )( )

A. F IS A POINTER TO FUNCTION RETURNING CHAR

B. F IS A POINTER TO AN ARRAY OF FUNCTION RETURNING A CHAR

C. INVALID DECLARATION

D. F IS A FUNCTION RETURNING POINTER TO ARRAY[] OF POINTER TO FUNCTION RETURNING CHAR.

ANS : D

1. A BINARY TREE OF HEIGHT H, H > 0 HAS

A. AT LEAST H AND ATMOST 2*H-1 ELEMENTS IN IT.

B. AT LEAST 2^H AND ATMOST (2^H)+1 ELEMENTZ IN IT.

C. AT LEAST 2^H -1 AND ATMOST H^2 ELEMENTS IN IT.

D. AT LEAST H AND ATMOST (2^H) - 1 ELEMENTS IN IT.

ANS: D

2. THRASHING IS

A. FLOODING OF PAGES IN THE MEMORY.

B. INCREASE IN REMOVAL OF PAGES FROM MEMORY.

C. INCREASE IN PAGE FAULTS LEADING TO DECREASE IN CPU UTILIZATION.

D. REMOVAL OF UNUSED PAGES FROM MEMORY MAKING SPACE FOR NEW ONES.

ANS: C

3. RECURSIVE DESCENT PARSER IS A TYPE OF

A. BOTTOM UP PARSER.

B. TOP DOWN PARSER.

C. NONE OF THESE.

D. BOTTOM DOWN PARSER.

ANS: B

4. ALLOCA() ALLOCATES MEMORY FROM

A. HEAP.

B. RESERVED MEMORY.

C. DATA SEGMENT.

D. STACK.

ANS: D

5. WHAT IS THE OCTAL EQUIVALENT OF DECIMAL (5468).

A. 12360.

B. 12560.

C. NONE OF THESE.

D. 12650.

ANS : C

GLOABALEDGE SAMPLE PAPER

1. MAIN()

{ INT I;

I=(2,3);

PRINTF("%D",I);

}

A)2 B)3 C)COMPILER ERROR D)SYNTAX ERROR.

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

3. MAIN(){ FOR(I=0;I++;I<100) PRINTF("HELLO WORLD\N"); }

A)100 TIMES B)0 TIMES C)INFINITE LOOP D)NONE OF THE ABOVE.

ANS: 0 TIMES.



ANS: INFINITE LOOP

5. MAIN(){ CHAR C; SCANF("%S",C); }

A)COMPILER DEPENDENT B)UNPREDICTABLE C)COMPILER ERROR D) SCANS THE I/P.

ANS: COMPILER DEPENDENT.

6. MAIN(){

INT K=5;

FOR(++K<5 && K++/5 || ++K<8);

PRINTF("%D\N",K);

}

A)5 B)6 C)7 D)8

ANS: 7

7. MAIN(){

INT *PTR1,*PTR2;

PTR1=(INT *)MALLOC(SIZEOF(INT));

PTR2=FUNC(20,10,PTR1);

PRINTF("%D %D\N",*PTR1,*PTR2);

}

INT *FUNC(INT A, INT B, INT *C)

{

INT X=A+B;

*C=A-B;

RETURN(&X);

}

A)BUG IN THE CODE. B)NO BUGS PRINTS CORRECTLY C)ERROR D) NONE OF THE ABOVE.

ANS: BUG IN THE CODE.

8). INT MAIN() {

INT I = 10, J ;

IF ( ( J = ~I ) < I )

PRINTF ( "TRUE" ) ;

ELSE

PRINTF ( "FALSE" ) ;

}

A) TRUE B) FALSE C) COMPILER DEPENDENT D) NONE OF THE ABOVE.

ANS : TRUE

9. HOW MANY BYTES ARE REQUIRED TO CREATE A 3*3 MATRIX USING DOUBLE POINTER

ANS: 12

10. TAKE INT=4,FLOAT=8,CHAR=1

MAIN() {

FILE *FP;

PRINTF("%D\N",SIZEOF(FP) );

}

A)2 B)4 C)COMPILER DEPENDENT D)ERROR

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

ANS : A=20 B=10

12. MAIN() {

INT I=10;

SWITCH(I) {

CASE 10: PRINTF("HELLO "); {

CASE 1 : PRINTF("WORLD ");

}

CASE 5: PRINTF("HELLO WORLD ");

}

}

A) HELLO B) HELLO C) HELLO WORLD HELLO WORLD D) SYNTAX ERROR.

ANS : HELLO WORLD HELLO WORLD

13. MAIN() {

CHAR STR1[]="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

16. #INCLUDE <STDIO.H>

# PRAGMA PACK(2)

STRUCT SIZE {

INT I;

CHAR CH ;

DOUBLE DB ;

} ;

MAIN () {

PRINTF ( "%D\N",SIZEOF(STRUCT SIZE) );

}

A)12 B)14 C)16 D)8

GLOBALEDGE PAPER

MAIN()

{ INT ARR[]={ 1,2,3,4 };

INT *PTR ;;;;

PTR++ = ARR;

PRINTF("%D,%D",PTR[2],ARR[2]);

RETURN 0;

}

WHAT IS THE OUTPUT :

A> COMPILE TIME ERROR :MULTIPLE TERMINATION STATEMENTS FOR POINTER

B> LVALUE REQUIRED FOR PTR

C> PRINTS 3 3

D> PRINTD 4 3

ANS B: LVALUE REQUIRED FOR PTR;

2>

MAIN()

{

CHAR S[10];

SCANF ("%S",S);

PRINTF(S);

}

WHAT IS THE OUTPUT IF INPUT IS ABCD :

A> PRINTS ABCD

B> COMPILER ERROR

C> PRINTS ABCD AND 6 JUNK CHARACTERS

D> PRINTD S

ANS A: PRINTS ABCD.

3>

MAIN()

{

CHAR C = 255;

PRINTF ("%D",C);

RETURN 0;

}

WHAT IS THE OUTPUT

A> ILLEGAL CHARACTER ASSIGNMENT

B> PRINTS -1

C> PRINTS 2

D> PRINTS 255

ANS B: PRINTS -1.

4>

MAIN()

{

INT I;

FOR (I=7;I<=0;I--)

PRINTF ("HELLO\N");

}

WHAT IS THE OUTPUT

A> PRINTS HELLO 7 TIMES

B> PRINTS HELLO 8 TIMES

C> PRINTS HELLO ONCE

D> PRINTS NOTHING

ANS B: PRINTS NOTHING.

5>

MAIN()

{

PRINTF( PRINTF ("WORLD") );

}

A> PRINTS WORLD

B> PRINTS PRINTF ("WORLD")

C> PRINTS NOTHING

D> COMPILER ERROR

ANS D: COMPILER ERROR.

COMPUTER CONCEPTS

1> A C SOURCE CODE FILE CAN BE

A> COMPILED ONLY

B> INTERPRETED ONLY

C> BOTH COMPILED AND INTERPRETED

D> NOTHING

ANS C : BOTH COMPILED AND INTERPRETED

2> C PROGRAMMING APPROACH IS

A> TOP DOWN

B> BOTTOM UP

C> BOTH TOPDOWN AND BOTTOM UP

D> NONE OF THE ABOVE

ANS A:TOP DOWN APPROACH

3> THE ACCESS TIME IS LESS FOR

A> HARD DISK

B> CACHE

C> REGISTERS

D> MAIN MEMORY

ANS C:REGISTERS

4>RESOLVING OF EXTERNAL VARIABLES IN A PROGRAM IS DONE AT

A>COMPLIE TIME

B>RUN TIME

C>LINK TIME

4>LOAD TIME

ANS C: LINK TIME.

5> INTERRUPTS INFORM PROCESS ABOUT

A> EVENTS EXTERNAL TO PROCESS ASYNCHRONOUSLY

B> EVENTS EXTERNAL TO PROCESS SYNCHRONOUSLY

C> BOTH A AND B

D> EVENTS INTERNAL TO A PROCESS

ANS A: EVENTS EXTERNAL TO PROCESS ASYNCHRONOUSLY

/* C QUESTION AND ANSWERS

ALL QUESTIONS ARE TESTED IN TURBO C COMPILER AND HAVE NOT BEEN

TESTED IN GCC OR (LINUX PLATFORM) */

----------------------------------------------------

1)

#INCLUDE<STDIO.H>

MAIN()

{

SCANF("%D");

PRINTF();

}

WHICH OF THE FOLLOWING IS CORRECT?

A)COMPILATION ERROR

B)RUN TIME ERROR

C)NO OUTPUT

D)DEPENDS ON THE COMPILER

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

ANS : B ( MACRO SUBSTITUTION 3 TIMES)

----------------------------------------------------------

3)

#INCLUDE<STDIO.H>

MAIN()

{

200;

PRINTF("TRICKY PROBLEM");

}

A)WARNING MESSAGE

B)COMPILATION ERROR

C)RUN TIME 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)PRINTF(CONST *CHAR *P,...);

C)PRINTF(CONST CHAR *P,...);

D)PRINTF(CONST *CHAR P,...);

ANS : C

-----------------------------------------------------------

/* QUESTIONS ON COMPUTER CONCEPTS */

1)WHICH OF THE FOLLOWING IS NOT A SYSTEM FILE?

A).SYS

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

B) LSB AT LOWER ADDRESS MSB AT HIGHER ADDRESS

C) MEMORY MGMT TECHNIQUE

D) NONE OF THE ABOVE

ANS:A

2)WHAT IS LITTLE-ENDIAN.





ANS:B

3)8086 HAS

A)16 BIT DATA BUS ,16 BIT ADDRESS BUS

B)16 BIT DATA BUS,32 BIT ADDRESS BUS

C)8 BIT DATA BUS,16 BIT ADDRESS BUS

D)8 BIT DATA BUS,8 BIT ADDRESS BUS

ANS:A

4) WHAT IS THE SCHEDULING ALGORITHM USED IN GENERAL OPERATING SYSTEMS.

A) FCFS ALGORITHM

B) HIGHEST PRIORITY FIRST ALGORITHM

C) ROUND-ROBIN ALGORITHM


ANS:C

5)ROUTER IS PRESENT AT

A)PHYSICAL LAYER

B)DATA LINK LAYER

C)NETWORK LAYER

D)NONE OF ABOVE

ANS:C

6)CONDITION FOR DEADLOCK OCCURANCE

A) MUTUAL EXCLUSION

B) NO PREMPTION

C) HOLD AND WAIT

D) CIRCULAR WAIT

E) ALL OF THE ABOVE

ANS:D

7)PCI STANDS FOR

A)PROGRAMMABLE COMPUTER INTERFACE

B)PERIPHERAL COMPUTER INTERFACE

C)PROGRAMMABLE CONTROL INTERFACE

D)PERIPHERAL COMPONENT INTERFACE

ANS:D

8)TOGGLE STATE IN J-K FLIP-FLOP IS

A)0 1

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

D)NONE OF THE ABOVE.

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

2.WHAT IS THE O/P OF THE FOLLOWING PROGRAME?

VOID MAIN()

{

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

ANSWER: B ( NOTE : STRLEN(P1) == I WHEN I=6)

3.WHAT DOES MAIN RETURN ON SUCCESSFUL EXECUTION?

A. 1

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

5. HOW DO U DECLARE A POINTER TO AN ARRAY OF POINTERS TO INT?

A. INT *A[5];

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

2.REAL TIME OS USES

A. RISC PROCESSOR

B. CISC PROCESSOR

C. SISC PROCESSOR

D. ANY OF THE ABOVE

ANSWER: A

3.RACE CONDITION COULD BE OVERCOME USING

A. A GLOBAL VARIABLE

B. A LOCAL VARIABLE

C. MUTEX

D. ALL OF THE ABOVE

4.REPEATERS ARE IN

A. DATA LINK LAYER

B. PHYSICAL LAYER

C. NETWORK LAYER

D. TRANSPORT LAYER

ANSWER: B

5.TELECOM NETWORKING USES

A. PACKET SWITCHING

B. CIRCUIT SWITCHING

C. MESSAGE SWITCHING

D. NON OF THE ABOVE

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


ANS (D)


#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)


MAIN()

{

MAIN() ;

}

A) COMPILATION ERROR

B) RUNTIME ERROR

C) EXECUTES UNTIL THE STACK OVERFLOWS(1)


ANS (C)


#DEFINE MAX "HELLO"

MAIN()

{

PRINTF(MAX) ;

}

A. COMPILATION ERROR

B. PREPROCESSING ERROR

C. RUNTIME ERROR

D. HELLO

ANS (D)


#DEFINE MAX MAIN()

MAIN()

{

MAX ;

PRINTF("HELLO WOLRD\N ") ; }



C. RUNTIME ERROR

D .EXECUTES UNTIL THE STACK OVERFLOWS


TYPEDEF INT *P ;

MAIN()

{

INT A = 90 ;

P P1 ;

P1 = &A ;

PRINTF("%D",*P1) ;

}

A. 90

B. COMPILATION ERROR

C. RUNTIME ERROR

D. NONE OF THE ABOVE

ANS (A)


MAIN()

{

INT I = 1 ;

PRINTF(I ?"ONE" : "ZERO") ;

}

A. ONE

B. ZERO

C.ERROR

D. BOTH AND B

ANS (A)


MAIN()

{

INT I = 1 ;

PRINTF("%D",I ? 1 : 0) ;

}

A. 1

B. 0

C. ERROR



MAIN()

{

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)


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)

C LVALUE IS REQUIRED IN FUN MAIN

D. ERROR !!

ANS (B)


MAIN()

{

VOID *PTR ;

INT A = 10 ;

PTR = &A ;

PRINTF("%D",*PTR) ;

}

1. ERROR

2. 10

3. 20

4. NONE

ANS (1)


MAIN()

{

VOID *PTR ;

INT A = 90 ;

CHAR *PTR1 = "HELLO" ;

PTR = A ;

PTR = PTR1 ;

}

A. EXECUTES W/O ANY ERROR


C. RUNTIME ERROR

D.NONE

ANS (A)


MAIN()

{

CHAR *P = "HELLOO" ;

CHAR *P1 = "STRCAT" ;

WHILE((*(P++) = *(P1++)) != '\0')

{

;

}

}

A. ERROR

B. ADDRESS IS COPIED

C. CONTENTS ARE COPIED

D . NONE

ANS (C)


INT G = 10 ;

MAIN()

{

INT A = 10 ;

PRINTF("%D",A) ;

}

INT G ;

A. 10

B. 11

C. ERROR

D. NONE

ANS (A)


MAIN()

{

INT A = 1 ;

INT B = 0 ;

A = A++ + --B * A++ ;

PRINTF("%D",A) ;

}

A. ERROR

B. NONE

C. 1

D .2

ANS (D)


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@

B. MAIN IS A VARIABLE OF STRUCT ST.

C. COMPILATION ERROR

D. RUN TIME ERROR

ANS (A)

-----------------------------------------------------


TYPEDEF STRUCT INFO

{

INT I;

CHAR B;

} NODE;

MAIN()

{

STRUCT INFO NODE1;

NODE1.I=55;

PRINTF("%D",NODE1.I);

}

A. 55

B. NOT POSSIBLE TO USE STRUCT INFO

C.COMPILATION ERROR

D. GARBAGE VALUE.

ANS (A)


STRUCT A

{

INT I;

INT DISPLAY()

{

PRINTF("HELLO WORLD\N");

}

};

MAIN()

{

STRCUT A VARA;

VARA.DISPLAY();

}

A. HELLO

B. HELLO WORLD

C. COMPILE TIME ERROR

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)


TYPEDEF INT *ABC;

TYPEDEF ABC XYZ[10];

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.

C) BOTH 1 AND 2 ARE CORRECT.

D) TYPEDEF STATEMENTS ARE IN WRONG ORDER.

ANSWER : B


UNION TAG

{

INT A;

CHAR X;

CHAR Y;

}NAME;

(ASSUME STORAGE IS LITTLE ENDIAN TECHNIQUE)

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;

PRINTF("P %U Q %U VAL %D ",P,Q,VAL);

}

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));

}

WHAT IS THE SIZE OF ABC?

A) 8

B) 7

C) 6

D) 5

ANSWER : B

24. WHAT IS THE OUTPUT OF THE FOLLOWING PROGRAM ?

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

27. WHAT WILL BE PRINTED ON THE SCREEN ?

#DEFINE S -50

MAIN()

{

INT S;

#IFDEF S

PRINTF("HELL\N");

#ELSE

PRINTF("HEAVEN\N");

#ENDIF

}

A. HELL

B. HEAVEN


D. HELLHEAVEN

28. WHICH OF 'ARRAYS' OR 'POINTERS' ARE FASTER ?

A. ARRAYS

B. POINTERS

C. BOTH TAKE SAME TIME

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 ?

A)ALL IDENTIFIERS ARE KEYWORDS

B)ALL KEYWORDS ARE IDENTIFIERS

C)KEYWORDS ARE NOT IDENTIFIERS

D)SOME KEYWORDS ARE IDENTIFIERS

ANS (A)

31

SELECT THE CHOICE WHICH IS WRONG ?

A)'VOLATILE' IS A RESERVED WORD

B)'VOLATILE' IS A KEYWORD

C)'VOLATILE' IS A DATA TYPE

D)'VOLATILE' IS A IDENTIFIER

ANS (C)

32

CONSIDER THE FOLLOWING PROGRAM

MAIN()

{

INT I,J;

I = 06;

J = 09;

PRINTF ("%D %D\N",I,J);

}

33

WHAT WOULD BE THE OUTPUT ?

A)6 9

B)6 11

C)06 09

D)COMPILATION ERROR

34)WHAT HAPPENS WHEN WE COMPILE THIS PROGRAM ?

# 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};

PRINTF(" %D", A[3]);

}

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;

FOR( I=0; ; 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;

PRINTF("I=%D , J=%D\N", I , J);

}

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;

PRINTF("I=%D , J=%D\N", I, J);

}

A) REDECLARATION ERROR

B) I=20 , J=10

C) I=20 , J=20 (ANS)

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

45) HEADER FILES USUALLY CONTAINS

A)ONLY DEFINITIONS

B)ONLY DECLARATIONS (ANS)

C)BOTH

D)COMPILED CODE FOR FUNCTIONS

46) INT MAIN()

{

INT I =3;

WHILE(I--)

{

INT I =10;

PRINTF("%D",I);

}

}

A) 10, 9, 8, 7, .....1

B) 10, 10, 10, 10, ...

C) 10, 10, 10 (ANS)

D) NONE

-47

CHAR S[] = "HELLO\0 WORLD";

PRINTF("%S...%D",S,STRLEN(S));

WHAT IS THE OUTPUT?

(A) HELLO...5

(B) HELLO\0 WORLD...12

(C) HELLO...12

(D) COMPILE TIME ERROR

ANS : (A)

-48

PRINTF("%%% S","HELLO");

WHAT IS THE OUTPUT?

(A) %%%S

(B) %%%

(C) %HELLO

(D) HELLO

ANS : (C)

(49).

WHAT DOES FGETC RETURN

(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);

}

O/P OF THE PROGRAM:

A. 0

B. GARBAGE VALUE

C. ERROR.

4.WARNING

ANS: B

-53

STRUCT NODE_TAG

{

INT I;

STRUCT NODE_TAG *PT;

} ;

MAIN()

{

PRINTF("%D",SIZE(NODE_TAG));

}

O/P OF THE PROGRAM:

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);

}

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);

}

O/P OF THE PROGRAM:

(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);

}

O/P OF THE PROGRAM:

(A). ERROR

(B). WARNING

(C). 5

(D).GARBAGE VALUE

ANS: (C)

-57

INT N;

SCANF("%D",N);

WHAT IS THE OUTPUT?

A)READ 1 INTEGER VALUE

B)COMPILE TIME ERROR

C)RUNTIME ERROR

D)READS 0

ANS (C)

58)

STRCHR(S,C)

WHAT THIS WILL DO?

A)RETURN POINTERTO FIRST 'C' IN 'S' OR NULL IF NOT PRESENT

B)RETURN POINTERTO LAST 'C' IN 'S' OR NULL IF NOT PRESENT

C)CONCATENATE C TO S IN THE BEGINNING

D)CONCATENATE C TO S AT THE END

ANS :A

(59) WHEN CALLOC() IS CALLED MEMORY IS INITIALISED TO

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)

(63) WHAT IS THE OUTPUT OF THE FOLLOWING ?

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()

{

CHAR *P = "WELCOME TO GESL\N";

*(P+10);

FPRINTF(STDERR,"%S",P);

RETURN 'C';

}

CHOICE(S) :

A) PRINTS "GESL" TO STDERR.

B) ERROR

C) GARBAGE

D) PRINTS "WELCOME TO GESL" TO SCREEN

67)

#DEFINE ISLOWER(C) ( 'A'<=(C) && (C)<='Z' )

#DEFINE TOUPPER(C) ( ISLOWER(C) ? (C)-('A'-'A') : (C) )

MAIN()

{

CHAR *P="MASONIC DOZENS DEIFY FORELOCK TOO ...";

WHILE(*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) () ;

CHAR MAIN(INT ARGC,CHAR *ARGV[],CHAR *ENVIRON[])

{

PFI A = MAIN;

PRINTF("%S",A);

}

CHOICE(S) :

A)COMPILE TIME ERROR

B)INFINITE LOOP

C)PRINTS SOME GARBAGE

D)RUN TIME ERROR

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

D) RUN TIME ERROR

ANS: C

4) STRUCT A

{

INT X;

FLOAT Y;

DOUBLE Z;

STRUCT A B;

};

A) NO ERROR

B) COMPILE ERROR

C) RUN TIME 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

C) INITIALIZED BY OPERATING SYSTEM

D) INITIALIZED BY THE LINKER

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

3) WHICH OF THE FOLLOWING SORTING MECHANISM PERFORMS BEST IN WORST

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 ^

B) CONTEXT FREE GRAMMERS ARE SUBSET OF CONTEXT SENSITIVE GRAMMER

C) CONTEXT FREE GRAMMER ALLOWS ^

D) ALL OF THE ABOVE

5) WHICH OF THE FOLLOWING IS NOT CORRECT

A) CANONICAL LR COMES UNDER BOTTOM UP PARSING TECHNIQUE

B) LL1 GRAMMER COMES IN PREDICTIVE PARSING

C) PREDICTIVE PARSING COMES IN TOP DOWN PARSING TECHNIQUE

D) LALR IS MORE POWERFULL THAN CANONICAL LR

ANS : D

***************************************************

***************************************************

***************************************************

***************************************************

1)

#INCLUDE<STDIO.H>

INT MAIN(VOID)

{

INT *INTPTR ;

INTPTR = (CHAR*)MALLOC(SIZEOF(10));

PRINTF("\N THE STARTING ADDRESS IS %D \N ",INTPTR);

RETURN 0;

}


B) RUNTIME ERROR

C) WILL GIVE A WARNING , BUT RUN ANY WAY

D) NEITHER WARNING NOR ERROR

CORRECT ANSWER : C

-----------------------------

2)#INCLUDE<STDIO.H>

INT MAIN(VOID)

{

FILE *FP1,*FP2;

INT C;

FP1 = FOPEN("TESTING","A");

FP2 = FOPEN("TESTING","W");

WHILE( (C = GETCHAR()) != '\N')

{

FPUTC(C,FP1);

}

RETURN 0;

}

/*A) COMPILATION ERROR

B) RUNTIME ERROR

C) CONTENTS OF FILE TESTING ARE APPENDED

D) CONTENTS OF FILE TESTING ARE OVERWRITTEN

CORRECT ANSWER : D */

-------------------------------------------

3.#INCLUDE<STDIO.H>

INT MAIN(VOID)

{

INT INTNUM1,INTNUM2,NUM = 1,I;

PRINTF("\NENTER FIRST NUMBER \N");

SCANF("%D",&INTNUM1);

PRINTF("\NENTER SECOND NUMBER \N");

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


-------------------------------------------------------

4).#INCLUDE<STDIO.H>

INT MAIN(VOID)

{

CHAR STR[5];

CHAR *NEWSTR;

PRINTF("\NENTER FIRST STRING \N");

SCANF("%S",&STR);

PRINTF("\N THE STRING YOU HAVE ENTERED IS %S ",STR);

NEWSTR = GETS(STR);

PRINTF("\N NUM = %S " , NEWSTR);

PRINTF("\N THE NEW STRING IS %S ",NEWSTR);

RETURN 0;

}


B) RUNTIME ERROR


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);

PRINTF("\N THE NEW STR IS %S " ,NEWSTR);

RETURN 0;

}


B) RUNTIME ERROR


D) SEGMENTATION FAULT


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 ?

A) NULL B) GARBAGE C) HELLO D) COMPILATION ERROR

ANS: C

3

INT I;

FOR( I=0; I<10-1; I+=2 );

I+= 2;

PRINTF("I = %D\N", I );

OUTPUT IS ?

A) 12 B) 11 C) 10 D) 13

ANS: A

4 WHAT IS THE OUTPUT OF THE FOLLOWING PROGRAM ?

MAIN()

{

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++ ?

A) BOTH INCREMENT VALUE

B) ++*IP INCREMENT VALUE AND *IP++ INCREMENT ADDRESS

C) BOTH INCREMENT ADDRESS

D) ++*IP INCREMENT ADDRESS AND *IP++ INCREMENT VALUE

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


# 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


# INCLUDE <STDIO.H>

# DEFINE ONE 1

# DEFINE TWO 2

# DEFINE ONE TWO

# DEFINE TWO ONE

INT

MAIN ( VOID ) {

PRINTF("ONE = %D, TWO = %D\N", ONE, TWO );

}

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

MAIN( INT IARGU, CHAR **ARGVAR ) {

PRINTF("OUTPUT = %S\N", *ARGVAR[1] );

}

1. GLOBALEDGESOFTWARELTD

2. G


4. RUN TIME ERROR

ANS = 4

20

WHAT IS THE OUTPUT OF THE FOLLOWING ?

# INCLUDE <STDIO.H>

VOID FUN( INT, INT );

INT MAIN ( VOID )

{

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

D)PROCESS TERM SCHEDULER

ANS:D

2) LONG TERM SCHEDULER IS ALSO KNOWN AS

A)CPU SCHEDULER B)JOB SCHEDULER C)MIDDLE TERM SCHEDULER D)NONE OF THESE

ANS:B

3)WHICH ONE IS NOT IN THE PROCESS STATE

A)READY B)RUN C)TERMINATED D)NONE OF THESE

ANS: D

4)SWITCHING THE CPU TO ANOTHER PROCESS REQUIRES SAVING THE STATE OF THE OLD PROCESS AND LOADING THE SAVED STATE IS CALLED

A)MODE SWITCH B)PROCESS SWITCH C)CONTEXT SWITCH D)NONE

ANS:C

5)WHICH ONE IS NOT IN THE COMPILATION STAGE

A)LEXICAL ANALYSER

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

2. TYPE OF MEMORY MANAGEMENT USED IN UNIX OS

A. SWAPPING B. DEMAND PAGING C . BOTH A AND B(1) D. NONE OF THE ABOVE

3. FILE SYSTEM SUPPORTED IN UNIX

A. EXT2 B. EXT3 C. A AND B (1) D . NONE OF THE ABOVE

4. NUMBER OF ADDRESS BITS IN 8086 PROCESSOR

A. 16 B. 20(1) C . 24 D. 12

5. WHICH IS THE DATA TYPE , WHICH DOES'NT DEPEND ON THE M/C

A. CHAR(1) B. INT C. FLOAT D.NONE

6

THE INT SIZE DEPENDS ON ?

A. ALU SIZE(1) B. OS C. NONE

***************************************************

***************************************************

OS QUESTIONS

1. WHICH IS THE MOST EFFICIENT PAGE REPLACEMENT ALGO -

A. LRU ( CORRECT - NOT V SURE )

B. LFU

C. FIFO

D. LIFO

2. COMPACTION COMES INTO PICTURE IN -

A. PAGING

B. SHEDULING

C. SEGMENTATION ( CORRECT )

D. FILE MANAGEMENT

3.WHICH SYSTEMS SUPPORT BOTH REAL MODE / PROTECTED MODE -

A. INTEL 386 AND HIGHER ( CORRECT)

B. INTEL 286 AND HIGHER

C. PENTIUM SERIES ONLY

D. NONE OF TEH ABOVE

4. HIGH PAGING ACTIVITY LEADS TO -

A. SWAPPING

B. COMPACTION

C. THRASHING ( CORRECT)

D. EXTERNAL FRAGMENTATION

5. WHICH ARE THE NECESSARY CONDITIONS FOR DEADLOCK

A. MUTUAL EXCLUSION

B. NON PREEMPTION

C. CIRCULAR WAIT

D. HOLD AND WAIT

E. ALL OF THE ABOVE ( CORRECT)

***************************************************

***************************************************

/* N/W QUESTIONS */

1) GATEWAY IS THE ONE WHICH

CHOICE(S) :

---------

(A) SUPPORTS MULTIPLE PROTOCOLS WITHIN SAME NETWORK

(B) ROUTES MESSAGES / PACKETS WITHIN SAME NETWORK , HAVING SINGLE PROTOCOL

(C) SUPPORTS MULIPLE PROTOCOLS OF TWO / MORE DIFFERENT NETWORKS

(D) ROUTES MESSAGES / PACKETS TO DIFFERNT NETWORKS,HAVING SAME PROTOCOL B/W THEM

2) SIZE OF ATM PACKET , IN BYTES

CHOICE(S) :

---------

(A)34

(B)53

(C)33

(D)32

3) WHERE IS THE BOOTSTRAP LOADER PRESENT PHYSICALLY ?

CHOICE(S) :

---------

(A) HDD

(B) BIOS ROM

(C) FIRST TRACK ZEROTH CYLINDER ZEROTH SECTOR

(D) ZEROTH TRACK ZEROTH CYLINDER FIRST SECTOR

4) MAJOR DIFFERENCE B/W SWITCHES & ROUTERS IS

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

ROUTERS PRESERVE BANDWIDTH.

(D)ROUTERS HAVE MORE INTELLIGENCE THAN SWITCHES IN ROUTING A PACKET & ABLE TO

ADJUST TO THE ENVIRONMENTAL CHANGES DYNAMICALLY

5) DIFFERENCE BETWEEN A HUB & A REPEATER

(A) HUB IS USED IN NETWORK LAYER & REPEATER AT PHYSICAL LAYER

(B) HUB & REPEATER BOTH ARE SAME

(C) HUB IS A REPEATER

(D) HUB DIVIDES BANDWITH AMONG VARIOUS MACHINES WHEREAS REPEATER DOESNOT

ANSWERS :

-------

1) (C) SUPPORTS MULIPLE PROTOCOLS OF TWO / MORE DIFFERENT NETWORKS

2) (B) 53

3) (B) BIOS ROM

4) (D)ROUTERS HAVE MORE INTELLIGENCE THAN SWITCHES IN ROUTING A PACKET & ABLE TO

ADJUST TO THE ENVIRONMENTAL CHANGES DYNAMICALLY

5) (D) HUB DIVIDES BANDWITH AMONG VARIOUS MACHINES WHEREAS REPEATER DOESNOT

***************************************************

***************************************************

1) THE DIFFERENT STAGES OF COMPILATION ARE

A. PREPROCESSOR, COMPILER, ASSEMBLER, LOADER, LINKER

B. PREPROCESSOR, COMPILER, ASSEMBLER, LINKER, LOADER (ANS)

C. PREPROCESSOR, ASSEMBLER, COMPILER, LINKER, LOADER

D. PREPROCESSOR, COMPILER, LINKER, ASSEMBLER, LOADER

2) ROUND ROBIN ALGORITHM IS USED IN

A. MEMORY MANAGEMENT

B. CPU SCHEDULING (ANS)

C. DEADLOCK DETECTION


3) MULTIPROGAMMING IS USED

A. TO MAXIMIZE CPU UTILIZATION (ANS)

B. TO INCREASE PROCESS EXECUTION TIME

C. TO SAVE MEMORY


4) DRAWBACK IN PAGING IS

A. INTERNAL FRAGMENTATION (ANS)

B. EXTERNAL FRAGMENTATION

C. BOTH (A) AND (B)


5) BELADY'S ANOMALY OCCURS IN WHICH PAGE REPLACEMENT ALGORITHM?

A. FIFO (ANS)

B. LRU

C. LFU

D. NONE

***************************************************

***************************************************

1) A RELOCATABLE CODE IS

A) PORTABLE CODE

B) CODE GENERATED FOR VIRTUAL ADDRESS

C) READY TO RUN ANYWHERE IN MEMORY

D) BOTH B & C (ANS)

2) MEMORY MANAGEMENT UNIT(MMU)

A) IS SOFTWARE

B) HARDWARE

C) BOTH A & B (ANS)

D) NONE

3) C IS A

A) LOW LEVEL LANGUAGE

B) HIGH LEVEL LANGUAGE

C) MIDDLE LEVEL LANGUAGE (ANS)

D) PORTABLE LANGUAGE

4) SYMBOL TABLE USED FOR

A)PREPROCESSING

B)GENERATING MACHINE CODE

C)RESOLVING EXTERNAL REFERENCES

D)BOTH B & C (ANS)

E) NONE

5)DISPATCHER IS USED IN

A)MEMORY MANAGEMENT

B)DEADLOCK

C)SCHEDULING (ANS)

D)NONE

6) USE OF VIRTUAL MEMORY

A) TO SUPPORT EXECUTABLES LARGER THAN MEMORY SIZE (ANS)

B) TO INCREASE SPEED OF EXECUTION

C) BOTH

D) NONE

***************************************************

***************************************************

COMPUTER CONCEPTS

-----------------

1 SPOOLING IS THE ACRONYM FOR

(A) SIMULTANEOUS PROCESSORS OPERATION ONLINE

(B) SIMULTANEOUS PERIPHERAL OPERATION ONLINE

(C) SIMULTANEOUS PERIPHERAL OPERATION OVER LINE

(D) SIMULTANEOUS PROCESSOR ONLINE OPERATION

ANS : (B)

------------------------------------------

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)

------------------------------------------

3 SOCKET IN NETWORK PROGRAMMING IS

(A) AN ELECTRICAL DEVICE

(B) IPC

(C) SYNCHRONIZATION TOOL

(D) NETWORK LAYER PROTOCOL

ANS : (B)

------------------------------------------

4 DMA STANDS FOR

(A) DIRECT MEMORY ACCESS

(B) DIRECTIONAL MOMENTARY ACESS

(C) DIRECTIONAL MAJOR DEVICE ACCESS

(D) DIRECT MINOR DEVICE ACCESS

ANS : (A)

------------------------------------------

5 LINUX

(A) HAS HIERARCHICAL FILE SYSTEM

(B) HAS FAT

(C) TREATS PERIPHERAL DEVICES AS FILES

(D) BOTH (A) & (C)

ANS : (D)

------------------------------------------

***************************************************

***************************************************

1. IN CASE MEMORY MAPED I/O WHICH ONE IS NOT TRUE

A. THERE A IS SEPERATE ADDRESS SPACE FOR I/O OPERATION

B. SPECIAL INSTRUCTION ARE USED FOR I/O DATA TRANSFER

C. MEMORY ADDRESS MAY OVERLAP

D. NONE OF THE ABOVE.

ANS. A

2 DMA REQUIRES

A.MOST OF THE CPU TIME

B.CASH

C.CPU INSTANTIATION.

D.MAIN MEMORY.

ANS C

3. SPECIAL I/O INSTRUCTION R REQUIRED FOR

A.MEMORY MAPPED I/O

B.I/O MAPPED I/O

C.BOTH OF THESE

D.NONE OF THESE

ANS A

4. OUT PUT OF COMPLIER IS

A.ASSEMBLY CODE

B.OBJECT CODE

C.MACHINE CODE

D.NONE OF THE ABOVE

ANS B.

5 WHICH ONE THESE IS ONCHIP MEM

A.MAINMEMORY

B.CASH

***************************************************

***************************************************

-------------------------------------------------------------------------------------------------

1.WHICH ONE OF THE FOLLOWING IS WRONG

A. 2'S COMPLEMENT(10110) = 01010 B. 4'S COMPLEMENT(1230)=2110

C. 8'S COMPLEMENT(7436)=1451 @ D. 5'S COMPLEMENT(4322)=0123

--------------------------------------------------------------------------------------------------

2.(128)BASE 10 = (1003)BASE R, WHAT IS THE VALUE OF R?

A. 3 B. 4

C. 5 @ D. 6

--------------------------------------------------------------------------------------------------

3. IN DESIGN OF INSTRUCTION SET

A. RISC USES MORE NO OF INSTRUCTIONS. B. CISC USES MORE NO.OF INSTRUCTIONS @

C. BOTH USES SAME NO. OF INSTRUCTION. D. RISC USES MOR THAN CISC

--------------------------------------------------------------------------------------------------

4. WHICH PHASE OF THE COMPILER CHECKS LEXICOGRAPHIC ERRORS

A. SYNTAX PHASE B. SEMANTIC PHASE

C. LEXICAL ANALYSIS @ D.CODE OPTIMIZATION

--------------------------------------------------------------------------------------------------

5. RANDOM ACCESSING IS POSSIBLE IN

A. READ ONLY MEMORY(ROM) B. RANDOM ACCESS MEMORY(RAM)

C. BOTH RAM AND ROM @ D. NONE OF THE ABOVE.

----------------------------------------------------------------------------------------------------

***************************************************

***************************************************

// COMPUTER CONCEPTS QUESTIONS

1.WHO IS CALLED THE FATHER OF COMPUTERS ?

A) BLAISE PASCAL

B) HERMAN HOLLERITH

C) ANTONY VAN

D) CHARLES BABBAGE

ANS .(D)

2.HOW MANY COLUMNS DID PUNCHED CARD HAVE ?

A) 24

B) 100

C) 80

D) 16

ANS.(C)

3.WHAT DOES THE ACRONYM FTP STAND FOR ?

A)FILE TRANSMISSION PROTOCOL

B)FILE TRANSFER PROTOCOL

B)FIFO TERMINATION POINTER

D)FILE TRACKING POINTER

ANS.(B)

4.WHICH COMPANY WAS INVOLVED IN THE DEVELOPMENT OF UNIX?

A)MICROSOFT

B)IBM

C)AT&T

D)HEWLETT PACKARD

ANS.(C)

5.WHAT DOES ACRONYM RISC STAND FOR ?

A)RAPID INSTRUCTION SET COMPUTERS

B)RAPID INTEGER SIGNALLING COMPUTERS

C)REDUCED INSTRUCTION SET COMPUTERS

D)RELIABLE INSTRUCTION SET COMPUTERS

ANS.(C)

***************************************************

***************************************************

1.) WHO IS THE ORIGINATOR OF MS-DOS

A. GARY KILDALL

B. DENNIS RITCHIE

C. TIM PATTERSON *

D. KEN THOMPSON

2.) WHICH OF THE FOLLOWING IS RESPONSIBLE FOR DISPLAYING THE

DOS PROMPT

A. RESIDENT PORTION OF COMMAND.COM

B. TRANSIENT PORTION OF COMMAND.COM *

C. SYSINIT MODULE OF IO.SYS

D. AUTOEXEC.BAT

3.) BOOTSTRAP LOADER PROGRAM IS A PROGRAM BELONGING TO:

A. ROM EXTENSION SOFTWARE

B. ROM STARTUP SOFTWARE *

C. ROM-BIOS SOFTWARE

D. ROM BASIC SOFTWARE

4.) WHETHER A PARTICULAR OPERATION IS SUCCESSFULLY CARRIED OUT BY

DOS OR NOT IS INDICATED BY THE VALUE STORED IN

A.ORDINARY REGISTER

B.FLAGS REGISTER *

C.SEGMENT REGISTER

D.OFFSET REGISTER

5.) IN A 80386 MICROPROCESSOR EACH CPU REGISTER IS

A.12 BITS LONG

B.16 BITS LONG *

C. 8 BITS LONG

D. 8 BYTES LONG

6.) EACH ADDRESS IN INTERRUPT VECTOR TABLE IS

A. 2 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 *


8.) THE 8088 IS A

A. 8 BIT MICROPROCESSOR

B. 16 BIT MICROPROCESSOR

C. 8/16 BIT MICROPROCESSOR *

D. A 32 BIT MICROPROCESSOR

9.) PICK THE ODD ONE OUT

A. VGA

B. EGA

C. XGA

D. BCA *

10.) A ROM-BIOS ROUTINE MAKES USE OF THE SEGMENT REGISTER

ES AND DS. TO CALL THIS ROUTINE WHICH FUNCTION WOULD YOU USE

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

1

IEEE STANDS FOR ?

A) INSTITUTE OF ELECTRICAL AND ELECTRONIC ENGINEERS

B) INFORMATION FOR ELECTRONICS AND ELECTRICAL ENGINEERS

C) INTERNATIONAL ELECTRONICS AND ELECRICAL ENGINEERS.

D) NONE OF THE ABOVE.

ANS: A

2

WHICH OF THE FOLLOWING PROTOCOL HELP US WHILE RECEIVING MAIL MESSAGES

OVER THE INTERNET ?

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 ?

A) EXTENDED BINARY CODED DECIMAL INTERCHANGE CODE

B) EXTENDED BIASED CODING DECIMAL INTERCHANGE CODE

C) EXTERNAL BIASED CODING DECIMAL INTERCHANGE CODE


ANS: A

5

C++ DESIGNED AND DEVELOPED BY ?

A) KERNINGHAN & RITCHIE.

B) THOMSON.

C) BARY B BREY.

D) BJARNE STROUSTRUP

ANS: D)

1) : TRUE */


MAIN()

{

INT A = 1;

#DEFINE P A

PRINTF("%D %D ",A++,P++) ;

}

A) 1, 0

B) 2, 0

C) 1 2


ANS (D)


#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)


MAIN()

{

MAIN() ;

}


B) RUNTIME ERROR

C) EXECUTES UNTIL THE STACK OVERFLOWS(1)


ANS (C)

GLOBAL EDGE LATEST FRESHER ENGINEER PLACEMENT SAMPLE QUESTION PAPER 5 2005


#DEFINE MAX "HELLO"

MAIN()

{

PRINTF(MAX) ;

}



C. RUNTIME ERROR

D. HELLO

ANS (D)


#DEFINE MAX MAIN()

MAIN()

{

MAX ;

PRINTF("HELLO WOLRD\N ") ; }



C. RUNTIME ERROR

D .EXECUTES UNTIL THE STACK OVERFLOWS


TYPEDEF INT *P ;

MAIN()

{

INT A = 90 ;

P P1 ;

P1 = &A ;

PRINTF("%D",*P1) ;

}

A. 90


C. RUNTIME ERROR


ANS (A)


MAIN()

{

INT I = 1 ;

PRINTF(I ?"ONE" : "ZERO") ;

}

A. ONE

B. ZERO

C.ERROR

D. BOTH AND B

ANS (A)


MAIN()

{

INT I = 1 ;

PRINTF("%D",I ? 1 : 0) ;

}

A. 1

B. 0

C. ERROR



MAIN()

{

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)


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)

C LVALUE IS REQUIRED IN FUN MAIN

D. ERROR !!

ANS (B)


MAIN()

{

VOID *PTR ;

INT A = 10 ;

PTR = &A ;

PRINTF("%D",*PTR) ;

}

1. ERROR

2. 10

3. 20

4. NONE

ANS (1)


MAIN()

{

VOID *PTR ;

INT A = 90 ;

CHAR *PTR1 = "HELLO" ;

PTR = A ;

PTR = PTR1 ;

}

A. EXECUTES W/O ANY ERROR


C. RUNTIME ERROR

D.NONE

ANS (A)


MAIN()

{

CHAR *P = "HELLOO" ;

CHAR *P1 = "STRCAT" ;

WHILE((*(P++) = *(P1++)) != '\0')

{

;

}

}

A. ERROR

B. ADDRESS IS COPIED

C. CONTENTS ARE COPIED

D . NONE

ANS (C)


INT G = 10 ;

MAIN()

{

INT A = 10 ;

PRINTF("%D",A) ;

}

INT G ;

A. 10

B. 11

C. ERROR

D. NONE

ANS (A)


MAIN()

{

INT A = 1 ;

INT B = 0 ;

A = A++ + --B * A++ ;

PRINTF("%D",A) ;

}

A. ERROR

B. NONE

C. 1

D .2

ANS (D)


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@

B. MAIN IS A VARIABLE OF STRUCT ST.


D. RUN TIME ERROR

ANS (A)

-----------------------------------------------------


TYPEDEF STRUCT INFO

{

INT I;

CHAR B;

} NODE;

MAIN()

{

STRUCT INFO NODE1;

NODE1.I=55;

PRINTF("%D",NODE1.I);

}

A. 55

B. NOT POSSIBLE TO USE STRUCT INFO

C.COMPILATION ERROR

D. GARBAGE VALUE.

ANS (A)


STRUCT A

{

INT I;

INT DISPLAY()

{

PRINTF("HELLO WORLD\N");

}

};

MAIN()

{

STRCUT A VARA;

VARA.DISPLAY();

}

A. HELLO

B. HELLO WORLD

C. COMPILE TIME ERROR

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)


TYPEDEF INT *ABC;

TYPEDEF ABC XYZ[10];

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.

C) BOTH 1 AND 2 ARE CORRECT.

D) TYPEDEF STATEMENTS ARE IN WRONG ORDER.

ANSWER : B


UNION TAG

{

INT A;

CHAR X;

CHAR Y;

}NAME;

(ASSUME STORAGE IS LITTLE ENDIAN TECHNIQUE)

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;

PRINTF("P %U Q %U VAL %D ",P,Q,VAL);

}

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));

}

WHAT IS THE SIZE OF ABC?

A) 8

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

27. WHAT WILL BE PRINTED ON THE SCREEN ?

#DEFINE S -50

MAIN()

{

INT S;

#IFDEF S

PRINTF("HELL\N");

#ELSE

PRINTF("HEAVEN\N");

#ENDIF

}

A. HELL

B. HEAVEN


D. HELLHEAVEN

28. WHICH OF 'ARRAYS' OR 'POINTERS' ARE FASTER ?

A. ARRAYS

B. POINTERS

C. BOTH TAKE SAME TIME

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 ?

A)ALL IDENTIFIERS ARE KEYWORDS

B)ALL KEYWORDS ARE IDENTIFIERS

C)KEYWORDS ARE NOT IDENTIFIERS

D)SOME KEYWORDS ARE IDENTIFIERS

ANS (A)

31

SELECT THE CHOICE WHICH IS WRONG ?

A)'VOLATILE' IS A RESERVED WORD

B)'VOLATILE' IS A KEYWORD

C)'VOLATILE' IS A DATA TYPE

D)'VOLATILE' IS A IDENTIFIER

ANS (C)

32

CONSIDER THE FOLLOWING PROGRAM

MAIN()

{

INT I,J;

I = 06;

J = 09;

PRINTF ("%D %D\N",I,J);

}

33

WHAT WOULD BE THE OUTPUT ?

A)6 9

B)6 11

C)06 09

D)COMPILATION ERROR

34)WHAT HAPPENS WHEN WE COMPILE THIS PROGRAM ?

# 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};

PRINTF(" %D", A[3]);

}

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;

FOR( I=0; ; 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;

PRINTF("I=%D , J=%D\N", I , J);

}

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;

PRINTF("I=%D , J=%D\N", I, J);

}

A) REDECLARATION ERROR

B) I=20 , J=10

C) I=20 , J=20 (ANS)

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

45) HEADER FILES USUALLY CONTAINS

A)ONLY DEFINITIONS

B)ONLY DECLARATIONS (ANS)

C)BOTH

D)COMPILED CODE FOR FUNCTIONS

46) INT MAIN()

{

INT I =3;

WHILE(I--)

{

INT I =10;

PRINTF("%D",I);

}

}

A) 10, 9, 8, 7, .....1

B) 10, 10, 10, 10, ...

C) 10, 10, 10 (ANS)

D) NONE

-47

CHAR S[] = "HELLO\0 WORLD";

PRINTF("%S...%D",S,STRLEN(S));

WHAT IS THE OUTPUT?

(A) HELLO...5

(B) HELLO\0 WORLD...12

(C) HELLO...12

(D) COMPILE TIME ERROR

ANS : (A)

-48

PRINTF("%%% S","HELLO");

WHAT IS THE OUTPUT?

(A) %%%S

(B) %%%

(C) %HELLO

(D) HELLO

ANS : (C)

(49).

WHAT DOES FGETC RETURN

(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);

}

O/P OF THE PROGRAM:

A. 0

B. GARBAGE VALUE

C. ERROR.

4.WARNING

ANS: B

-53

STRUCT NODE_TAG

{

INT I;


} ;

MAIN()

{

PRINTF("%D",SIZE(NODE_TAG));

}

O/P OF THE PROGRAM:

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);

}

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);

}

O/P OF THE PROGRAM:

(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);

}

O/P OF THE PROGRAM:

(A). ERROR

(B). WARNING

(C). 5

(D).GARBAGE VALUE

ANS: (C)

-57

INT N;

SCANF("%D",N);

WHAT IS THE OUTPUT?

A)READ 1 INTEGER VALUE

B)COMPILE TIME ERROR

C)RUNTIME ERROR

D)READS 0

ANS (C)

5

STRCHR(S,C)

WHAT THIS WILL DO?

A)RETURN POINTERTO FIRST 'C' IN 'S' OR NULL IF NOT PRESENT

B)RETURN POINTERTO LAST 'C' IN 'S' OR NULL IF NOT PRESENT

C)CONCATENATE C TO S IN THE BEGINNING

D)CONCATENATE C TO S AT THE END

ANS :A

(59) WHEN CALLOC() IS CALLED MEMORY IS INITIALISED TO

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)

(63) WHAT IS THE OUTPUT OF THE FOLLOWING ?

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()

{

CHAR *P = "WELCOME TO GESL\N";

*(P+10);

FPRINTF(STDERR,"%S",P);

RETURN 'C';

}

CHOICE(S) :

A) PRINTS "GESL" TO STDERR.

B) ERROR

C) GARBAGE

D) PRINTS "WELCOME TO GESL" TO SCREEN

67)

#DEFINE ISLOWER(C) ( 'A'<=(C) && (C)<='Z' )

#DEFINE TOUPPER(C) ( ISLOWER(C) ? (C)-('A'-'A') : (C) )

MAIN()

{

CHAR *P="MASONIC DOZENS DEIFY FORELOCK TOO ...";

WHILE(*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) () ;

CHAR MAIN(INT ARGC,CHAR *ARGV[],CHAR *ENVIRON[])

{

PFI A = MAIN;

PRINTF("%S",A);

}

CHOICE(S) :

A)COMPILE TIME ERROR

B)INFINITE LOOP

C)PRINTS SOME GARBAGE

D)RUN TIME ERROR

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

D) RUN TIME ERROR

ANS: C

4) STRUCT A

{

INT X;

FLOAT Y;

DOUBLE Z;

STRUCT A B;

};

A) NO ERROR

B) COMPILE ERROR

C) RUN TIME 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

C) INITIALIZED BY OPERATING SYSTEM

D) INITIALIZED BY THE LINKER

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

3) WHICH OF THE FOLLOWING SORTING MECHANISM PERFORMS BEST IN WORST

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 ^

B) CONTEXT FREE GRAMMERS ARE SUBSET OF CONTEXT SENSITIVE GRAMMER

C) CONTEXT FREE GRAMMER ALLOWS ^

D) ALL OF THE ABOVE

5) WHICH OF THE FOLLOWING IS NOT CORRECT

A) CANONICAL LR COMES UNDER BOTTOM UP PARSING TECHNIQUE

B) LL1 GRAMMER COMES IN PREDICTIVE PARSING

C) PREDICTIVE PARSING COMES IN TOP DOWN PARSING TECHNIQUE

D) LALR IS MORE POWERFULL THAN CANONICAL LR

ANS : D

***************************************************

***************************************************

***************************************************

***************************************************

1)

#INCLUDE<STDIO.H>

INT MAIN(VOID)

{

INT *INTPTR ;

INTPTR = (CHAR*)MALLOC(SIZEOF(10));

PRINTF("\N THE STARTING ADDRESS IS %D \N ",INTPTR);

RETURN 0;

}


B) RUNTIME ERROR

C) WILL GIVE A WARNING , BUT RUN ANY WAY

D) NEITHER WARNING NOR ERROR

CORRECT ANSWER : C

-----------------------------

2)#INCLUDE<STDIO.H>

INT MAIN(VOID)

{

FILE *FP1,*FP2;

INT C;

FP1 = FOPEN("TESTING","A");

FP2 = FOPEN("TESTING","W");

WHILE( (C = GETCHAR()) != '\N')

{

FPUTC(C,FP1);

}

RETURN 0;

}


B) RUNTIME ERROR

C) CONTENTS OF FILE TESTING ARE APPENDED

D) CONTENTS OF FILE TESTING ARE OVERWRITTEN


-------------------------------------------

3.#INCLUDE<STDIO.H>

INT MAIN(VOID)

{

INT INTNUM1,INTNUM2,NUM = 1,I;

PRINTF("\NENTER FIRST NUMBER \N");

SCANF("%D",&INTNUM1);

PRINTF("\NENTER SECOND NUMBER \N");

SCANF("%D",INTNUM2);

FOR(I = 0;I<=3;I++)

{

NUM = INTNUM1 * INTNUM2 * NUM;

}

PRINTF("\N NUM = %D " , NUM);

RETURN 0;

}


B) RUNTIME ERROR


D) JUNK VALUE


-------------------------------------------------------

4).#INCLUDE<STDIO.H>

INT MAIN(VOID)

{

CHAR STR[5];

CHAR *NEWSTR;

PRINTF("\NENTER FIRST STRING \N");

SCANF("%S",&STR);

PRINTF("\N THE STRING YOU HAVE ENTERED IS %S ",STR);

NEWSTR = GETS(STR);

PRINTF("\N NUM = %S " , NEWSTR);

PRINTF("\N THE NEW STRING IS %S ",NEWSTR);

RETURN 0;

}


B) RUNTIME ERROR


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);

PRINTF("\N THE NEW STR IS %S " ,NEWSTR);

RETURN 0;

}


B) RUNTIME ERROR


D) SEGMENTATION FAULT


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 ?

A) NULL B) GARBAGE C) HELLO D) COMPILATION ERROR

ANS: C

3

INT I;

FOR( I=0; I<10-1; I+=2 );

I+= 2;

PRINTF("I = %D\N", I );

OUTPUT IS ?

A) 12 B) 11 C) 10 D) 13

ANS: A

4 WHAT IS THE OUTPUT OF THE FOLLOWING PROGRAM ?

MAIN()

{

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++ ?

A) BOTH INCREMENT VALUE

B) ++*IP INCREMENT VALUE AND *IP++ INCREMENT ADDRESS

C) BOTH INCREMENT ADDRESS

D) ++*IP INCREMENT ADDRESS AND *IP++ INCREMENT VALUE

ANS: B

16


# 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


# 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


# INCLUDE <STDIO.H>

# DEFINE ONE 1

# DEFINE TWO 2

# DEFINE ONE TWO

# DEFINE TWO ONE

INT

MAIN ( VOID ) {

PRINTF("ONE = %D, TWO = %D\N", ONE, TWO );

}

1. ONE = 1, TWO = 2

2. TWO = 1, ONE = 2


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

MAIN( INT IARGU, CHAR **ARGVAR ) {

PRINTF("OUTPUT = %S\N", *ARGVAR[1] );

}

1. GLOBALEDGESOFTWARELTD

2. G


4. RUN TIME ERROR

ANS = 4

20

WHAT IS THE OUTPUT OF THE FOLLOWING ?

# INCLUDE <STDIO.H>

VOID FUN( INT, INT );

INT MAIN ( VOID )

{

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. 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. HOW MANY PRIMARY PARTITIONS CAN BE CREATED?

1. 1

2. 2

3. 3

4. 4

ANS : 4.

5. WHAT IS THE DIFFERENCE BETWEEN PRIMARY & EXTENDED PARTION?

1. BOTH ARE SAME

2. PRIMARY AND EXTENDED ARE IN LOGICAL PARTION

3. PRIMARY CANNOT BE SUBDIVIDED BUT EXTENDED CAN BE.

4. EXTENDED CANNOT BE SUBDIVIDED BUT PRIMARY CAN BE.

ANS 3.

6. CAN WE CREATE 2 PRIMARY DOS PARTIONS?

A)YES B)NO C)DEPENDS ON THE HARD DISK. D)NONE OF THE ABOVE.

ANS: YES

7. CAN WE CREATE 2 EXTENDED PARTITIONS ?


ANS: NO.

8. HOW MANY PARTITIONS CAN BE CREATED ON A GIVEN HARDDISK?

A) DEPENDS ON THE SIZE OF DISK. B) 24 C)4 D)26

9. CAN WE HIDE A PARTITION?

A) YES B) NO C) DEPENDS ON THE HARD DISK D) NONE.

ANS: YES.

10. SLIDING WINDOW PROTOCOL LIES IN WHICH LAYER?

1. TRANSPORT LAYER 2. NETWORK LAYER 3. DATALINK LAYER 4. APPLICATION LAYER

ANS : 3. DATALINK LAYER

11. WHICH IS THE HIGHEST PRIORITY INTERRUPT .

1. RST5.5

2. RST6.5

3. TRAP

4. HLD

12. 8085 IS

1. 16-BIT 2. 8-BIT 3. 32-BIT 4. 20-BIT MICROPROCESSOR.

ANS : 2. 8 BIT

13. PROTECTED MODE IS PRESENT IN WHICH PROCESSOR

1. 8085 2. 8086 3. 80386 4.8087

14. THE NO. OF ADDRESS LINES REQUIRED TO ADDRESS 4K OF MEMORY

A)11 B)12 C) 14 D) 16

ANS: B

15) WHERE IS CMOS SETUP STORED

A) HARD DISK B) BIOS C)CMOS RAM D) MBR.

ANS : CMOS RAM

1) MAIN(){

INT A;

CHAR *P;

A = SIZEOF(INT) * P;

PRINTF("%D\N",A);

}

A)COMPILE ERROR

B)RUN TIME ERROR

C)4

D)COMPILER DEPENDENT

ANS:A

2)#DEFINE SIZE SIZEOF(INT)

MAIN(){ INT I=-1;

IF( I < SIZE )

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

B) FUNCTION RETURNING AN ARRAY OF POINTERS

C) POINTER TO A FUNTION WHICH TAKES ARRAY AS ASRUMENT

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

D) RUN TIME 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

D) RUN TIME ERROR

ANS:A

7)#DEFINE MYSIZEOF(A) (&A+1) - &A

MAIN(

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

B) RUN TIME ERROR

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;

IF(A==B < PRINTF("HELLO "))

PRINTF("WORLD\N");

ELSE

PRINTF("BANGALORE\N");

WHAT IS THE O/P?

A> WORLD B> HELLO BANGALORE C> BANGALORE D> HELLO WORLD.

ANS > D> HELLO WORLD.

2>

MAIN()

{

INT I;

FOR(I=0; I< 10; I++)

{

INT J=10;

J++;

PRINTF("J= %D\N", J);

}

}

WHAT IS O/P ?

A> 10 TO 19 B> ERROR J UNDECLARED C> 10 TIMES 11 D> 10 - 18

ANS> C> 10 TIMES 11.

3>

UNION TEST{

INT A;

UNION TEST *P;

};

MAIN(){

UNION TEST Q;

PRINTF(" A= %D\N ", Q.A);

}

WHAT IS O/P?

A> 0 B> SYNTAX ERROR C> GARBAGE VALUE D>RUN TIME ERROR

ANS > C

4>

REGISTER INT A,B;

MAIN(){

FOR(A=0 ; A<5 ; A++)

B++;

}

A> 5 B> 4 C> 0 D> ERROR

ANS > D

5> # DEFINE DPRINT(EXPR) PRINTF(" EXPR= %D \N ", EXPR)

MAIN(){

INT I=10,J=2;

DPRINT(I / J) ;

}

A> 5 B > EXPR= 5 C> I / J= 5 D> ERROR.

ANS > B.

OPERATING SYSTEM CONCEPTS

1> VIRTUAL MEMORY IS

A> INFINITE, USER IS NOT CONSTRAINED WHILE WRITING PROGRAM.

B> FINITE IT IS LIMITED BY MAIN MEMORY + SWAP MEMORY.

C> INFINITE ,YES AS THE PROCESS NEEDS MEMORY IT IS ALLOCATED BY DEMAND PAGING.

D> FINITE ,IT IS LIMITED BY MACHINES ADDRESSING CAPACITY.

ANS> D

2> FIND THE CORRECT SENTENCE

A> UNIX IS MONOLITHIC MS-DOS IS MICROKERNEL

B> UNIX & MS-DOS ARE BOTH MONOLITHIC.

C> UNIX & MS-DOS ARE BOTH MICROKERNEL.

D> ALL ARE WRONG.

ANS> B

3> IN WHICH OSI LAYER PACKET SEQUENCING IS CHECKED

A> PHYSICAL LAYER

B> DATA LINK LAYER

C> NETWORK LAYER

D> TRANSPORT LAYER

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

A> REGISTER ADDRESSING

B> INDEXED ADDRESSING

C> REGISTER INDIRECT ADDRESSING

D> DIRECT ADDRESSING.

ANS: B

JUNE-2004

C WHAT IS THE OUTPUT OF THE FOLLOWING :

1. MAIN()

{

INT *P ;

P=(INT *)MALLOC(-10);

}

A) ALLOCATES 0 BYTES

B) ALLOCATES MEMORY, IF AVAILABLE

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 ", SIZEOF(I++));

PRINTF("%D ",I) ;

}

A) 2 100

B) 2 101

C) 100 101

D) 101 100

ANS) A

COMPUTER FUNDAMENTALS :

1. WHICH ONE OF THE FOLLOWING ALWAYS RESIDES IN THE MEMORY ?

A) LINKER

B) LOADER

C) COMPILER

D) ALL OF THE ABOVE

ANS) B

2. WHICH OF THESE IS NOT A LAYER IN OSI MODEL ?

A) APPLICATION LAYER

B) NETWORK LAYER

C) INTERNET LAYER

D) DATA LINK LAYER

ANS) C

3. WHICH ONE OF THE FOLLOWING DATA STRUCTURES IS BEST SUITED FOR SEARCHING ?

A) ARRAYS

B) SINGLY LINKED LIST

C) DOUBLY LINKED LIST

D) HASH TABLE

ANS) D

4. WHICH OF THE FOLLOWING DATA STRUCTURES IS BEST SUITED FOR DELETION ?

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

D) ROUND ROBIN SCHEDULING

ANS) A

6. DEMAND PAGING IS

A) ALL THE PAGES OF A PROCESS IS LOADED AT THE START

B) WHEN A SINGLE PAGE IS DEMANDED THEN ALL OTHER PAGES ARE ALSO LOADED

C) WHEN A PAGE IS REQUIRED THEN ONLY IT IS LOADED


ANS) C

7. PAGE FAULT IS

A) A PAGE IS REFERENCED THAT IS NOT IN THE MEMORY .

B) A PAGE IS REFERENCED THAT IS NOT IN THE DISK.

C) A PAGE BEING ADDED TO THE PROCESS.


ANS) A

8. IF THE NUMBER OF INTERNAL NODES IN A BINARY TREE IS N , THEN WHAT IS THE NUMBER OF EXTERNAL NODES ?

A) N -1

B) N

C) N + 1

D) 2N

ANS) C

9. "BANKER'S ALGORITHM" IS USED FOR :

A) DEADLOCK DETECTION

B) DEADLOCK AVOIDANCE

C) DEADLOCK PREVENTION

D) ALL OF THE ABOVE

ANS) B

10. WHICH OF THE FOLLOWING IS USED FRO DESIGNING A LEXICAL ANALYSER OF A COMPILER ?

A) FINITE AUTOMATA

B) PUSH DOWN AUTOMATA

C) TURING MACHINE


ANS) A

11. WHICH LAYER IN THE OSI MODEL IS RESPONSIBLE FOR END TO END CONNECTIVITY ?

A) DATA LINK LAYER

B) NETWORK LAYER

C) TRANSPORT LAYER

D) SESSION LAYER

ANS) C

JUL-04

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


3. WHERE IS THE BOOT RECORD STORED?

1. BIOS

2. CMOS SETUP

3. MBR


4. HOW MANY PRIMARY PARTITIONS CAN BE CREATED?

1. 1

2. 2

3. 3

4. 4

ANS : 4.

5. WHAT IS THE DIFFERENCE BETWEEN PRIMARY & EXTENDED PARTION?

1. BOTH ARE SAME

2. PRIMARY AND EXTENDED ARE IN LOGICAL PARTION

3. PRIMARY CANNOT BE SUBDIVIDED BUT EXTENDED CAN BE.

4. EXTENDED CANNOT BE SUBDIVIDED BUT PRIMARY CAN BE.

ANS 3.

6. CAN WE CREATE 2 PRIMARY DOS PARTIONS?


ANS: YES

7. CAN WE CREATE 2 EXTENDED PARTITIONS ?


ANS: NO.

8. HOW MANY PARTITIONS CAN BE CREATED ON A GIVEN HARDDISK?

A) DEPENDS ON THE SIZE OF DISK. B) 24 C)4 D)26

9. CAN WE HIDE A PARTITION?

A) YES B) NO C) DEPENDS ON THE HARD DISK D) NONE.

ANS: YES.

10. SLIDING WINDOW PROTOCOL LIES IN WHICH LAYER?

1. TRANSPORT LAYER 2. NETWORK LAYER 3. DATALINK LAYER 4. APPLICATION LAYER

ANS : 3. DATALINK LAYER

11. WHICH IS THE HIGHEST PRIORITY INTERRUPT .

1. RST5.5

2. RST6.5

3. TRAP

4. HLD

12. 8085 IS

1. 16-BIT 2. 8-BIT 3. 32-BIT 4. 20-BIT MICROPROCESSOR.

ANS : 2. 8 BIT

13. PROTECTED MODE IS PRESENT IN WHICH PROCESSOR

1. 8085 2. 8086 3. 80386 4.8087

14. THE NO. OF ADDRESS LINES REQUIRED TO ADDRESS 4K OF MEMORY

A)11 B)12 C) 14 D) 16

ANS: B

15) WHERE IS CMOS SETUP STORED

A) HARD DISK B) BIOS C)CMOS RAM D) MBR.

ANS : CMOS RAM

1) MAIN(){

INT A;

CHAR *P;

A = SIZEOF(INT) * P;

PRINTF("%D\N",A);

}

A)COMPILE ERROR

B)RUN TIME ERROR

C)4

D)COMPILER DEPENDENT

ANS:A

2)#DEFINE SIZE SIZEOF(INT)

MAIN(){ INT I=-1;

IF( I < SIZE )

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

B) FUNCTION RETURNING AN ARRAY OF POINTERS

C) POINTER TO A FUNTION WHICH TAKES ARRAY AS ASRUMENT

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

D) RUN TIME 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

D) RUN TIME ERROR

ANS:A

7)#DEFINE MYSIZEOF(A) (&A+1) - &A

MAIN(

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

B) RUN TIME ERROR

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;

IF(A==B < PRINTF("HELLO "))

PRINTF("WORLD\N");

ELSE

PRINTF("BANGALORE\N");

WHAT IS THE O/P?

A> WORLD B> HELLO BANGALORE C> BANGALORE D> HELLO WORLD.

ANS > D> HELLO WORLD.

2>

MAIN()

{

INT I;

FOR(I=0; I< 10; I++)

{

INT J=10;

J++;

PRINTF("J= %D\N", J);

}

}

WHAT IS O/P ?

A> 10 TO 19 B> ERROR J UNDECLARED C> 10 TIMES 11 D> 10 - 18

ANS> C> 10 TIMES 11.

3>

UNION TEST{

INT A;

UNION TEST *P;

};

MAIN(){

UNION TEST Q;

PRINTF(" A= %D\N ", Q.A);

}

WHAT IS O/P?

A> 0 B> SYNTAX ERROR C> GARBAGE VALUE D>RUN TIME ERROR

ANS > C

4>

REGISTER INT A,B;

MAIN(){

FOR(A=0 ; A<5 ; A++)

B++;

}

A> 5 B> 4 C> 0 D> ERROR

ANS > D

5> # DEFINE DPRINT(EXPR) PRINTF(" EXPR= %D \N ", EXPR)

MAIN(){

INT I=10,J=2;

DPRINT(I / J) ;

}

A> 5 B > EXPR= 5 C> I / J= 5 D> ERROR.

ANS > B.

OPERATING SYSTEM CONCEPTS

1> VIRTUAL MEMORY IS

A> INFINITE, USER IS NOT CONSTRAINED WHILE WRITING PROGRAM.

B> FINITE IT IS LIMITED BY MAIN MEMORY + SWAP MEMORY.

C> INFINITE ,YES AS THE PROCESS NEEDS MEMORY IT IS ALLOCATED BY DEMAND PAGING.

D> FINITE ,IT IS LIMITED BY MACHINES ADDRESSING CAPACITY.

ANS> D

2> FIND THE CORRECT SENTENCE

A> UNIX IS MONOLITHIC MS-DOS IS MICROKERNEL

B> UNIX & MS-DOS ARE BOTH MONOLITHIC.

C> UNIX & MS-DOS ARE BOTH MICROKERNEL.

D> ALL ARE WRONG.

ANS> B

3> IN WHICH OSI LAYER PACKET SEQUENCING IS CHECKED

A> PHYSICAL LAYER

B> DATA LINK LAYER

C> NETWORK LAYER

D> TRANSPORT LAYER

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

A> REGISTER ADDRESSING

B> INDEXED ADDRESSING

C> REGISTER INDIRECT ADDRESSING

D> DIRECT ADDRESSING.

ANS: B

JUNE-2004

C WHAT IS THE OUTPUT OF THE FOLLOWING :

1. MAIN()

{

INT *P ;

P=(INT *)MALLOC(-10);

}

A) ALLOCATES 0 BYTES

B) ALLOCATES MEMORY, IF AVAILABLE

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 ", SIZEOF(I++));

PRINTF("%D ",I) ;

}

A) 2 100

B) 2 101

C) 100 101

D) 101 100

ANS) A

COMPUTER FUNDAMENTALS :

1. WHICH ONE OF THE FOLLOWING ALWAYS RESIDES IN THE MEMORY ?

A) LINKER

B) LOADER

C) COMPILER

D) ALL OF THE ABOVE

ANS) B

2. WHICH OF THESE IS NOT A LAYER IN OSI MODEL ?

A) APPLICATION LAYER

B) NETWORK LAYER

C) INTERNET LAYER

D) DATA LINK LAYER

ANS) C

3. WHICH ONE OF THE FOLLOWING DATA STRUCTURES IS BEST SUITED FOR SEARCHING ?

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

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

D) ROUND ROBIN SCHEDULING

ANS) A

6. DEMAND PAGING IS

A) ALL THE PAGES OF A PROCESS IS LOADED AT THE START

B) WHEN A SINGLE PAGE IS DEMANDED THEN ALL OTHER PAGES ARE ALSO LOADED

C) WHEN A PAGE IS REQUIRED THEN ONLY IT IS LOADED


ANS) C

7. PAGE FAULT IS

A) A PAGE IS REFERENCED THAT IS NOT IN THE MEMORY .

B) A PAGE IS REFERENCED THAT IS NOT IN THE DISK.

C) A PAGE BEING ADDED TO THE PROCESS.


ANS) A

8. IF THE NUMBER OF INTERNAL NODES IN A BINARY TREE IS N , THEN WHAT IS THE NUMBER OF EXTERNAL NODES ?

A) N -1

B) N

C) N + 1

D) 2N

ANS) C

9. "BANKER'S ALGORITHM" IS USED FOR :

A) DEADLOCK DETECTION

B) DEADLOCK AVOIDANCE

C) DEADLOCK PREVENTION

D) ALL OF THE ABOVE

ANS) B

10. WHICH OF THE FOLLOWING IS USED FRO DESIGNING A LEXICAL ANALYSER OF A COMPILER ?

A) FINITE AUTOMATA

B) PUSH DOWN AUTOMATA

C) TURING MACHINE


ANS) A

11. WHICH LAYER IN THE OSI MODEL IS RESPONSIBLE FOR END TO END CONNECTIVITY ?

A) DATA LINK LAYER

B) NETWORK LAYER

C) TRANSPORT LAYER

D) SESSION LAYER

ANS) C

1) WHAT IS BIG-ENDIAN.





ANS:A

2)WHAT IS LITTLE-ENDIAN.





ANS:B

3)8086 HAS

A)16 BIT DATA BUS ,16 BIT ADDRESS BUS

B)16 BIT DATA BUS,32 BIT ADDRESS BUS

C)8 BIT DATA BUS,16 BIT ADDRESS BUS

D)8 BIT DATA BUS,8 BIT ADDRESS BUS

ANS:A

4) WHAT IS THE SCHEDULING ALGORITHM USED IN GENERAL OPERATING SYSTEMS.

A) FCFS ALGORITHM

B) HIGHEST PRIORITY FIRST ALGORITHM

C) ROUND-ROBIN ALGORITHM


ANS:C

5)ROUTER IS PRESENT AT

A)PHYSICAL LAYER

B)DATA LINK LAYER

C)NETWORK LAYER

D)NONE OF ABOVE

ANS:C

6)CONDITION FOR DEADLOCK OCCURANCE

A) MUTUAL EXCLUSION

B) NO PREMPTION

C) HOLD AND WAIT

D) CIRCULAR WAIT

E) ALL OF THE ABOVE

ANS:D

7)PCI STANDS FOR

A)PROGRAMMABLE COMPUTER INTERFACE

B)PERIPHERAL COMPUTER INTERFACE

C)PROGRAMMABLE CONTROL INTERFACE

D)PERIPHERAL COMPONENT INTERFACE

ANS:D

8)TOGGLE STATE IN J-K FLIP-FLOP IS

A)0 1

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

D)NONE OF THE ABOVE.

ANS:B

C QUESTIONS :

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

2.WHAT IS THE O/P OF THE FOLLOWING PROGRAME?

VOID MAIN()

{

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

ANSWER: B ( NOTE : STRLEN(P1) == I WHEN I=6)

3.WHAT DOES MAIN RETURN ON SUCCESSFUL EXECUTION?

A. 1

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

5. HOW DO U DECLARE A POINTER TO AN ARRAY OF POINTERS TO INT?

A. INT *A[5];

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

2.REAL TIME OS USES

A. RISC PROCESSOR

B. CISC PROCESSOR

C. SISC PROCESSOR

D. ANY OF THE ABOVE

ANSWER: A

3.RACE CONDITION COULD BE OVERCOME USING

A. A GLOBAL VARIABLE

B. A LOCAL VARIABLE

C. MUTEX

D. ALL OF THE ABOVE

4.REPEATERS ARE IN

A. DATA LINK LAYER

B. PHYSICAL LAYER

C. NETWORK LAYER

D. TRANSPORT LAYER

ANSWER: B

5.TELECOM NETWORKING USES

A. PACKET SWITCHING

B. CIRCUIT SWITCHING

C. MESSAGE SWITCHING

D. NON OF THE ABOVE

ANS : B ( NORMALLY )

5.WHAT DOES ACRONYM RISC STAND FOR ?

A)RAPID INSTRUCTION SET COMPUTERS

B)RAPID INTEGER SIGNALLING COMPUTERS

C)REDUCED INSTRUCTION SET COMPUTERS

D)RELIABLE INSTRUCTION SET COMPUTERS

ANS.(C)

1.) WHO IS THE ORIGINATOR OF MS-DOS

A. GARY KILDALL

B. DENNIS RITCHIE

C. TIM PATTERSON *

D. KEN THOMPSON

2.) WHICH OF THE FOLLOWING IS RESPONSIBLE FOR DISPLAYING THE DOS PROMPT

A. RESIDENT PORTION OF COMMAND.COM

B. TRANSIENT PORTION OF COMMAND.COM *

C. SYSINIT MODULE OF IO.SYS

D. AUTOEXEC.BAT

3.) BOOTSTRAP LOADER PROGRAM IS A PROGRAM BELONGING TO:

A. ROM EXTENSION SOFTWARE

B. ROM STARTUP SOFTWARE *

C. ROM-BIOS SOFTWARE

D. ROM BASIC SOFTWARE

4.) WHETHER A PARTICULAR OPERATION IS SUCCESSFULLY CARRIED OUT BY DOS OR NOT IS INDICATED BY THE VALUE STORED IN

A.ORDINARY REGISTER

B.FLAGS REGISTER *

C.SEGMENT REGISTER

D.OFFSET REGISTER

5.) IN A 80386 MICROPROCESSOR EACH CPU REGISTER IS

A.12 BITS LONG

B.16 BITS LONG *

C. 8 BITS LONG

D. 8 BYTES LONG

6.) EACH ADDRESS IN INTERRUPT VECTOR TABLE IS

A. 2 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 *


8.) THE 8088 IS A

A. 8 BIT MICROPROCESSOR

B. 16 BIT MICROPROCESSOR

C. 8/16 BIT MICROPROCESSOR *

D. A 32 BIT MICROPROCESSOR

9.) PICK THE ODD ONE OUT

A. VGA

B. EGA

C. XGA

D. BCA *

10.) A ROM-BIOS ROUTINE MAKES USE OF THE SEGMENT REGISTER ES AND DS. TO CALL THIS ROUTINE WHICH FUNCTION WOULD YOU USE

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

1.IEEE STANDS FOR ?

A) INSTITUTE OF ELECTRICAL AND ELECTRONIC ENGINEERS

B) INFORMATION FOR ELECTRONICS AND ELECTRICAL ENGINEERS

C) INTERNATIONAL ELECTRONICS AND ELECRICAL ENGINEERS.


ANS : A

2 WHICH OF THE FOLLOWING PROTOCOL HELP US WHILE RECEIVING MAIL MESSAGES OVER THE INTERNET ?

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 ?

A) EXTENDED BINARY CODED DECIMAL INTERCHANGE CODE

B) EXTENDED BIASED CODING DECIMAL INTERCHANGE CODE

C) EXTERNAL BIASED CODING DECIMAL INTERCHANGE CODE


ANS : A

5 C++ DESIGNED AND DEVELOPED BY ?

A) KERNINGHAN & RITCHIE.

B) THOMSON.

C) BARY B BREY.

D) BJARNE STROUSTRUP

ANS : D)

C PAPER

1. MAIN()

{ INT I;

I=(2,3);

PRINTF("%D",I);

}

A)2 B)3 C)COMPILER ERROR D)SYNTAX ERROR.

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.



ANS: INFINITE LOOP

5. MAIN(){ CHAR C; SCANF("%S",C); }

A)COMPILER DEPENDENT B)UNPREDICTABLE C)COMPILER ERROR D) SCANS THE I/P.

ANS: COMPILER DEPENDENT.

6. MAIN(){

INT K=5;

FOR(++K<5 && K++/5 || ++K<8);

PRINTF("%D\N",K);

}

A)5 B)6 C)7 D)8

ANS: 7

7. MAIN(){

INT *PTR1,*PTR2;

PTR1=(INT *)MALLOC(SIZEOF(INT));

PTR2=FUNC(20,10,PTR1);

PRINTF("%D %D\N",*PTR1,*PTR2);

}

INT *FUNC(INT A, INT B, INT *C)

{

INT X=A+B;

*C=A-B;

RETURN(&X);

}

A)BUG IN THE CODE. B)NO BUGS PRINTS CORRECTLY C)ERROR D) NONE OF THE ABOVE.

ANS: BUG IN THE CODE.

8). INT MAIN() {

INT I = 10, J ;

IF ( ( J = ~I ) < I )

PRINTF ( "TRUE" ) ;

ELSE

PRINTF ( "FALSE" ) ;

}

A) TRUE B) FALSE C) COMPILER DEPENDENT D) NONE OF THE ABOVE.

ANS : TRUE

9. HOW MANY BYTES ARE REQUIRED TO CREATE A 3*3 MATRIX USING DOUBLE POINTER

ANS: 12

10. TAKE INT=4,FLOAT=8,CHAR=1

MAIN() {

FILE *FP;

PRINTF("%D\N",SIZEOF(FP) );

}

A)2 B)4 C)COMPILER DEPENDENT D)ERROR

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

ANS : A=20 B=10

12. MAIN() {

INT I=10;

SWITCH(I) {

CASE 10: PRINTF("HELLO "); {

CASE 1 : PRINTF("WORLD ");

}

CASE 5: PRINTF("HELLO WORLD ");

}

}

A) HELLO B) HELLO C) HELLO WORLD HELLO WORLD D) SYNTAX ERROR.

ANS : HELLO WORLD HELLO WORLD

13. MAIN() {



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 );

}

A)10 B)5 C)ERROR D) WARNING.

ANS : 5

15. #INCLUDE <STDIO.H>

# PRAGMA PACK(2)

STRUCT SIZE {

INT I;

CHAR CH ;

DOUBLE DB ;

} ;

MAIN () {

PRINTF ( "%D\N",SIZEOF(STRUCT SIZE) );

}

A)12 B)14 C)16 D)8

Global Edge Sample Paper

Documents

Transcript of Global Edge Sample Paper