Welcome to Scribd, the world's digital library. Read, publish, and share books and documents. See more
Download
Standard view
Full view
of .
Look up keyword
Like this
0Activity
0 of .
Results for:
No results containing your search query
P. 1
CS-GATE-2011

CS-GATE-2011

Ratings: (0)|Views: 0|Likes:
Published by Rodriguez Arthurs

More info:

Published by: Rodriguez Arthurs on Dec 13, 2011
Copyright:Attribution Non-commercial

Availability:

Read on Scribd mobile: iPhone, iPad and Android.
download as PDF, TXT or read online from Scribd
See more
See less

12/13/2011

pdf

text

original

 
CS-Paper Code-B
GATE 2011
 
www.gateforum.com
 
 © All rights reserved by Gateforum Educational Services Pvt. Ltd. No part of this document may be reproduced or utilized in any form without thewritten permission. Discuss GATE 2011 question paper at
www.gatementor.com
.
1
Q. No. 1 – 25 Carry One Mark Each
 1. The simplified SOP (Sum of Product) form of the Boolean expression
( ) ( ) ( )
PQR.PQR.PQR
+ + + + + +
is(A)
( )
PQR
+
(B)
( )
PQR
+
(C)
( )
PQR
+
(D)
( )
PQR
+
 Answer: - (B)Exp: - 
 
( )
( )
fPRPQ
= + +
 
PQR
= +
 Alternate method
( ) ( ) ( ) ( ) ( ) ( )
+ + + + + + = + + + + + +
PQR.PQR.PQRPQR.PQR.PQR
 
( ) ( )
( )
PQRPQRPQRPQRRPQRPQPQRPQQRPQRPQR
= + + = + + = + = += + = +
 2. Which one of the following circuits is NOT equivalent to a 2-input XNOR(exclusive NOR) gate?(A) (B)(C) (D)Answer: - (D)Exp: -All options except option ‘D’ gives EX-NOR gates3. The minimum number of D flip-flops needed to design a mod-258 counter is(A) 9 (B) 8 (C) 512 (D) 258Answer: - (A)Exp: - 
n
2258n9
=
 4. A thread is usually defined as a ‘light weight process’ because an operatingsystem (OS) maintains smaller data structures for a thread than for a process. Inrelation to this, which of the followings is TRUE?
QRP1011100011110
 
CS-Paper Code-B
GATE 2011
 
www.gateforum.com
 
 © All rights reserved by Gateforum Educational Services Pvt. Ltd. No part of this document may be reproduced or utilized in any form without thewritten permission. Discuss GATE 2011 question paper at
www.gatementor.com
.
2
(A) On per-thread basis, the OS maintains only CPU register state(B) The OS does not maintain a separate stack for each thread(C) On per-thread basis, the OS does not maintain virtual memory state(D) On per thread basis, the OS maintains only scheduling and accountinginformationAnswer: - (A)5. K4 and Q3 are graphs with the following structuresWhich one of the following statements is TRUE in relation to these graphs?(A) K4 is planar while Q3 is not (B) Both K4 and Q3 are planar(C) Q3 is planar while K4 is not (D) Neither K4 not Q3 is planarAnswer: - (B)Exp: - 
Both K
4
and Q
3
are planar6. If the difference between the expectation of the square of random variable
( )
2
EX
and the square of the expectation of the random variable
( )
2
EX
isdenoted by R then(A)
R0
=
(B) R<0 (C)
R0
(D) R>0Answer: - (C)7. The lexical analysis for a modern computer language such as Java needs thepower of which one of the following machine models in a necessary and sufficientsense?(A) Finite state automata(B) Deterministic pushdown automata(C) Non-Deterministic pushdown automata
K4Q3
4
K
 
3
Q
 
 
CS-Paper Code-B
GATE 2011
 
www.gateforum.com
 
 © All rights reserved by Gateforum Educational Services Pvt. Ltd. No part of this document may be reproduced or utilized in any form without thewritten permission. Discuss GATE 2011 question paper at
www.gatementor.com
.
3
(D) Turing machineAnswer: - (A)Exp: -Lexical Analysis is implemented by finite automata 8. Let the page fault service time be 10ms in a computer with average memoryaccess time being 20ns. If one page fault is generated for every 10
6
memoryaccesses, what is the effective access time for the memory?(A) 21ns (B) 30ns (C) 23ns (D) 35nsAnswer: - (B)
 
Exp: -P = page fault rateEA = p × page fault service time
( )
666
1pMemoryaccesstime11101012029.9ns1010
+ ×
= × × + ×
 9. Consider a hypothetical processor with an instruction of type LW R1, 20(R2),which during execution reads a 32-bit word from memory and stores it in a 32-bitregister R1. The effective address of the memory location is obtained by theaddition of constant 20 and the contents of register R2. Which of the followingbest reflects the addressing mode implemented by this instruction for theoperand in memory?(A) Immediate Addressing (B) Register Addressing(C) Register Indirect Scaled Addressing (D) Base Indexed AddressingAnswer: - (D)Exp: -Here 20 will act as base and content of R
2
will be index 10. What does the following fragment of C-program print?
( )
char c"GATE2011";char *p =c;printf"%s", p+p3p1;
=
 (A) GATE2011 (B) E2011 (C) 2011 (D) 011Answer: - (C)

You're Reading a Free Preview

Download
scribd
/*********** DO NOT ALTER ANYTHING BELOW THIS LINE ! ************/ var s_code=s.t();if(s_code)document.write(s_code)//-->