2011 JJM/IT/IT-Portal/2011/GQP JJM/IT/IT-Portal/2011/GQP

Question Booklet Code

CS : COMPUTER SCIENCE

- I\'FORMATION TEC~OLOGY
.faximu/Il

+
Marks:

D
L------I
100

Duration: Three Hours

Read the following instructions carefully. 1. Do not open the seal of the Question Book!~r until you are asked to do so by the invigilator. 2. Take out the Optical Response Sheer CORS) from this Question Booklet without breaking the seal. If you find that the Question Booklet Coce printed at the right hand top corner of this page does not match with the Booklet Code on the ORS. exchange the booklet immediately with a new sealed Question Booklet. 3. Write your registration number, your name and name of the examination centre at the specified locations on the right half of the ORS. Also. using HE pencil, darken the appropriate bubble under each digit of your registration number a,'ld the letters corresponding to your test paper code (CS). Write your name and registration number in the space provided at the bottom of this page. This Booklet contains 20 pages including blank pages for rough work. After opening the seal at the specified time, please check all pages and report discrepancy, if any. There are a total of 65 questions carrying 100 marks. All these questions are of objective type. Questions must be answered on the left hand side of the ORS by darkening the appropriate bubble (marked A, B, C, D) using HE pencil against the question number. For each question darken the bubble of the correct answer. In case you wish to change an answer, erase the old answer completely. More than one answer bubbled against a question will be treated as an incorrect response. Questions Q.lQ.25 carry I-mark each, and questions Q.26 - Q.55 carry 2-marks each.

4. 5. 6.

7. 8.

Questions Q.48 - Q.51 (2 pairs) are common data questions and question pairs (Q.52, Q.53) and (Q.54, Q.55) are linked answer questions. The answer to the second question of the linked answer questions depends on the answer to the first question of the pair. If the first question in the linked pair is wrongly answered or is unattempted, then the answer to the second question in the pair will not be evaluated. Questions Q.56 - Q.65 belong to General Aptitude (GA). Questions Q.56 - Q.60 carry I-mark each, and questions Q.61 - Q.65 carry 2-marks each. The GA questions begin on a fresh page starting from page 16.

9.

10. Unattempted questions will result in zero mark and wrong answers will result in NEGATIVE marks. For Q.l - Q.25 and Q.56 - Q.60, % mark will be deducted for each wrong answer. For Q.26 - Q.51 and Q.61 - Q.65, % mark will be deducted for each wrong answer. The question pairs (Q.52, Q.53), and (Q.54, Q.55) are questions with linked answers. There will be negative marks only for wrong answer to the first question of the linked answer question pair, i.e. for Q.52 and Q.54, % mark will be deducted for each wrong answer. There is no negative marking for Q.53 and Q.55. 11. Calculator is allowed whereas charts, graph sheets or tables are NOT allowed in the examination hall. 12. Rough work can be done on the question paper itself. Additionally, blank pages are provided at the end of the question paper for rough work.

Name Registration Number

I CS

2011

CS

Q. 1 - Q. 25 carry one mark each. JJM/IT/IT-Portal/2011/GQP JJM/IT/IT-Portal/2011/GQP

Q.l Let P be a regular language and Q be a context-free language such that Q ~ P. (For example, let Pbe the language j'epresented by the regular expression which of the following is AL WAYS regular? (B) Q.2
p*q"'and

Q be

{p"ql1

n EN}).

Then

P-Q

(C)

2::-P

(D)

2::-Q

An algorithm to find the length of the longest monotonically increasing sequence of numbers in an alTay A[O: n -1] is given below. Let Li denote the length of the longest monotonically increasing sequence starting at index i in the alTay. Initialize LIl-1 = 1 . For all i such that 0 :S i :S n - 2 LI = {I

+1 Li+l

Otherwise if A[i] <A[i + 1]

Finally the length of the longest monotonically increasing sequence is Max ( La, ~, ... , Ln-1) Which of the following statements is TRUE?

J ~

Q.3

(A) The algorithm uses dynamic programming paradigm (B) The algorithm has a linear complexity and uses branch and bound paradigm (C) The algorithm has a non-linear polynomial complexity and uses branch and bound paradigm (D) The algorithm uses divide and conquer paradigm. A max-heap is a heap where the value of each parent is greater than or equal to the value of its children. Which of the following is a max-heap?

..

CS-D

2/20

2011

cs

Q. 1- Q. 25 carry one mark each. JJM/IT/IT-Portal/2011/GQP JJM/IT/IT-Portal/2011/GQP

Q.l Let P be a regular language and Q be a context-free language such that Q ~ P. (For example, let
P be the language j-epresented by the regular expression

p'q* and Q be {p"q"

(D) L;*-Q

n EN}).

Then

which of the following is AL WAYS regular? (A) Q.2

pnQ

(B)

P-Q

(C)

L:-P

An algorithm to find the length of the longest monotonically increasing sequence of numbers in an alTay A[O: n -1] is given below. Let
Li

denote the length of the longest monotonically increasing sequence starting at index i in

the alTay. Initialize LII_1 = 1. For all i such that 0 :::; i :::; n- 2

LI = {I + 1 Li+l

Otherwise if AU] <AU + 1]

Finally the length of the longest monotonically increasing sequence is Max ( 41' ~, ... , LII_1) Which of the following statements is TRUE?

Q.3

(A) The algorithm uses dynamic programming paradigm (B) The algorithm has a linear complexity and uses branch and bound paradigm (C) The algorithm has a non-linear polynomial complexity and uses branch and bound paradigm (D) The algorithm uses divide and conquer paradigm. A fnax-heap is a heap where the value of each parent is greater than or equal to the value of its children. Which of the following is a max-heap?

CS-D

2/20

2011

CS

Q.4

JJM/IT/IT-Portal/2011/GQP Char c[] = "GATE2011"; JJM/IT/IT-Portal/2011/GQP

char
*p
=

What does the following fragment of C program print?

c;

printf

("%8",

p[3]

- p[l]);
(C) 2011 (D) 011

(A) GATE2011 Q.5

(B) E20ll

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-bit register Rl. The effective address of the memory location is obtained by the addition of a constant 20 and the contents of register R2. Which of the following best reflects the addressing mode implemented by this instruction for the operand in memory? (A) Immediate Addressing (C) Register Indirect Scaled Addressing (B) Register Addressing (D) Base Indexed Addressing

Q.6

Let the page fault service time be 10 ms in a computer with average memory access time being 20 ns. If one page fault is generated for every 106 memory accesses, what is the effective access time for the memory? (A) 21 ns (B)30ns
(C) 23 ns

(D) 35 ns

Q.7

The lexical analysis for a modern computer language such as Java needs the power of which one of the following machine models in a necessary and sufficient sense? (A) Finite state automata (B) Deterministic pushdown automata (C) Non-deterministic pushdown automata (D) Turing machine

Q.8

If th"e difference between the expectation of the square of a random variable (E [ X 2 J) and the square of the expectation of the random variable ( E [ X Jf is denoted by R , then

(A)R =0
Q.9

(B)R

<0
K4

(C)R ~O

(D)R >0

K4 and Q3 are graphs with the following structures. Q3

Which one of the following statements is TRUE in relation to these graphs? (A) K4 is planar while Q3 is not (C) Q3 is planar while K3 is not Q.IO (B) Both K4 and Q3 are planar (D) Neither K4 nor Q3 is planar

A thread is usually defined as a "light weight process" because an operating system (OS) maintains smaller data structures for a thread than for a process. In relation to this, which of the following is TRUE? (A) (B) (C) (D) On per-thread basis, the OS maintains only CPU register state The OS does not maintain a separate stack for each thread On per-thread basis, the OS does not maintain virtual memory state On per-thread basis, the OS maintains only scheduling and accounting information
3/20

CS-D

Wil

CS

JJM/IT/IT-Portal/2011/GQP JJM/IT/IT-Portal/2011/GQP Q.11 The minimum number of D flip-flops

(A) 9 Q.12 (B) 8

needed to design a mod-258 counter is (C) 512 (D) 258

The simplified SOP (Sum of Product) form of the Boolean expression ( P + Q + R) .( P + Q + R) .( P + Q + R) is (A) (P.Q+R) (C) (P.Q + R) (B) (P+Q.R) (D) (P.Q + R)

Q.13

Consider a relational table with a single record for each registered student with the following attributes. 1. Registration_Num: Unique registration number of each registered student UID: Unique identity number, unique at the national level for each citizen 3. BankAccount_Num: Unique account number at the bank. A student can have multiple accounts or joint accounts. This attribute stores the primary account number. 4. Name: Name of the student 5. HosteCRoom: Room number of the hostel
2.

Which of the following options is INCORRECT? (A) (B) (C) (D) Q.14 BankAccounCNum is a candidate key Registration_Num can be a primary key UID is a candidate key if all students are from the same country If S is a superkey such that S UID is NULL then S U UID is also a superkey

Which one of the following circuits is NOT equivalent to a 2-input XNOR (exclusive NOR) gate? (A) (B)

(C)

(D)

~Lfr-

~[>-

CS-D

4/20

2011

JJM/IT/IT-Portal/2011/GQP Q.15 A computer handles several ir.:':-El!p<~L'::..-:=s of which JJM/IT/IT-Portal/2011/GQP

Which

the following are ;-':-:::'\~ fo:- this question. Interrupt from CPU teJ1i;:,c2:!.!T:::> 5---"I::X:raises intenupt if CPU te~!::.;;: :s 00 high) ImelTupt from Mouse r'::s=s ia:;=-.-"il''::';-: if the mouse is moved or a b:..::rild is pressed) IntelTupt from Keyboarc 2i5--=-:5 L-;.:.:::~ptwhen a key is pressed or r''' IntelTupt from Hard Dish. ~s=s Gi:::~pt when a disk read is com one of these will be hand:e.i.~ ~ IDGHEST priority? (B) Intenupt from Mouse (D) Intenupt from CPU te~"1!re sensor (SRS)

(A Intenupt from Hard Disk (C hnerrupt from Keyboard Q.16

\"hich one of the following is KOT desire-.i in a good Software Requirement S?Xi5cations document? (A) Functional Requirements (C) Goals of Implementation (B) Non-Functional Requireme~'-S (D) Algorithms for Software lm.?!ementation

Q.17

elements which permit cer: ' actions other HT\fL HyperText Markup Lang-ese) ~.2.S ~2..'1guage than describing the structure of the \\ec ':ccillTIent. Which one of the follo\\i~.:o tions is NOT supported by pure HTML (withom ~~ 5e:-' :::>:or client side scripting) pages? (A) (B) (C) (D) Embed web objects from differe::i: s::=s imo the same pagev' Refresh the page automatically a:T':-:- 9. s;,.c.:ified interval Amomatically redirect to another ?3.~e !-txl;! download Display the client time as part of :'1e ;,:?s=

Q.18

Which of th~ following pairs have

DIFITRE:\l expressive power?

(A) Deterministic finite automata (DFA]:l..Llc ~on-deterministic finite automata C\rA) (B) Deterministic push down automata DPD,-\) and Non-deterministic push down automata ='-~DA) d ~on-detenninistic single-tape Turing machine (C) Deterministic single-tape Turing macro (D) Single-tape Turing machine and multi' pe Turing machine. Q,19 A company needs to develop digital signz: processing software for one of its newest inventions. The software is expected to have 40000 lines of code. The company needs to detennine the effort in person-months needed to develop this software using the basic COCOMO model. The multiplicative factor for this model is gi\'en as 2.8 for the software development on embedded systems. while the exponentiation factor is gi\'en as 1.20. What is the estimated effort in person months') (A) 234.25 Q.20 (B) 932.50 (C 287.80 (D) 122.40

Let the time taken to switch between user and kernel modes of execution be tl while the time taken to switch between two processes be t2' Which of the following is TRUE?
(A)tl>[c (B) tl = [c (C) tl < [2

(D) nothing can be said about the relation bet\.\'een

[I

and

t2

CS-D

5/20

WII

cs

Q.21 A company needs to develop a strategy for software product development for which it has a choice JJM/IT/IT-Portal/2011/GQP JJM/IT/IT-Portal/2011/GQP of two programming languages L1 and L2. The number of lines of code (LOC) developed using L2 is estimated to be twice the LOC developed with Ll. The product will have to be maintained for five years. Various parameters for the company are given in the table below. Parameter LOC/10000 5~ years Language :{7,50,000 50,000 L2 LOC/10000 Language Ll 5 years ~ ~10,00,000 1,00,000

lopment ear

Total cost of the project includes cost of development and maintenance. What is the LOC for L1 for which the cost of the project using L1 is equal to the cost of the project using L2? (A) 4000 Q.22 (B) 5000 (C) 4333 (D) 4667

Consider different activities related to email. m1: Send an email from a mail client to a mail server m2: Download an email from mailbox server to a mail client m3: Checking email in a web browser Which is the application level protocol used in each activity? (A) (B) (C) (D) m1: ml: m1: ml: HTTP SMTP SMTP POP m2: m2: m2: m2: SMTP FTP POP SMTP m3: m3: m3: m3: POP HTTP HTTP IMAP

Q.23

If two fair coins are flipped and at least one of the outcomes is known to be a head, what is the probability that both outcomes are heads? ~ (D) 2/3 (A) 1/3 (B) 1/4 (C) 1/2 A layer-4 firewall (a device that can look at all protocol headers up to the transpOlt layer) CANNOT (A) block entire HTTP traffic during 9:00PM and 5:00AM (B) block all ICMP traffic (C) stop incoming traffic from a specific IP address but allow outgoing traffic to the same IP address (D) block TCP traffic from a specific user on a multi-user system during 9:00PM and 5:00AM

Q.24

Q.25

In a compiler, keywords of a language are recognized during (A) parsing of the program (C) the lexical analysis of the program (B) the code generation (D) dataflow analysis

CS-D

6/20

2011

CS

JJM/IT/IT-Portal/2011/GQP JJM/IT/IT-Portal/2011/GQP Q. 26 to Q. 55 carry two marks each.

Q.26 Database table by name Loar.._? ==:::-::'z :: giyen below.

Borrower
Ramesh uresh \lahesh "

What is the output of the followin; S SELECT count(*) FROM ( (SELECT BOITower, Bank_\~Q;";2~=;?ROM Loan_Records) AS S NATURAL JOIN (SELECT Bank_Manager. =--rell __~,t0'.1nt FROM Loan_Records) AS T ); (A) 3 Q.27 (B) 9 C)5 (D) 6

The following is the comment wriu;::i ~cr :: C fenction. /* This function compUCES ~~= ::-~~~s of a quadratic equa=~~~ a.xA2 + b.x + c = o. ~~2 :'~=~~on stores two real roc=s in *rootl and *root2 a~::' ::-E~~::-~S the status of val~c~~~of roots. It handles ==~::- ~~::2rent kinds of cases. (i) When coefficient a ~s =E::-~ ~rrespective of disc::-~=~~ant (ii) When discriminanc ~s ~=s~~~ve (iii) When discriminanc ~s =E::-~ (iv) When discriminant ~s ~2Qa~~ve. Only in case (ii) and (~~~ ~~e stored roots are va~~a. Otherwise 0 is stored in c~e ::-oots. The function retu::-ns o when the roots are va~~c a~a -1 otherwise. The function also ensures ::-ooc~ >= root2. int get_QuadRoots(floac a, float b, float c, float *rootl, float xroot2);
*/

A software test engineer is assigned the job of doing black box testing. He comes up with the following test cases, many of which are redundant.

b Test rootl 0.0 -1.0 -2.0 1.0 3.0 -3.0 1.0 2.0 -1.0 0.0 1.5 1 1.5 .0 3.0 9.0 Set -1 0 0 Expected Out ut Set c Return root2 Value -12.0 4.0 4.0 7.0 1.0 a Input

Which one of the following options provide the set of non-redundant tests using equivalence class partitioning approach from input perspective for black box testing? (A) Tl, T2. T3. T6 (C) T2, T4. T5. T6 (B) Tl, T3, T4. T5 (D) T2, T3, T4, T5

CS-D

7/20

WII

CS IS

Q.31 Definition of a language L \\ irh 2.1t:"~:!~-=<: (aj JJM/IT/IT-Portal/2011/GQP

JJM/IT/IT-Portal/2011/GQP
L=
(A) k+l
{ank I k

given as following.

> 0, and .: is ~ ?G'5l:J\ c integer constant}

S~I~5

What is the minimum number c; (B) n-f

~ed

in a DFA to recognize L?

(D. _

Q.32

Consider an instruction pipell!:e i:r-.: stages (51, 52, 53 and 54 ~:red between each stage and a circuit only. The pipeline regis:elS ~= -=~ Delays for the stages and for the ~:?=fu:.= :-egjsters are as given in the figure.

~r.t

~>i

~i
... ...

~ OJ >Q) Q) Q) Cll c 0.. a: .~ .~ .~ .96ns Q) 11 ns 8ns en en S3 S2 en ~Q) ~ Del2... Stage Stage Del 2.]' StagE Delay
Q) Q)

0 0

a ~ --: I?

c .9.~ Q)
Cll

What is the approximate speed 2: ~ ;:'l;-eline in steady state under ideal conditions when compared to the corresponding nor;-t::;-e ..:-e ,~lementation? (A) 4.0 Q.33 (B) 2.5
C) 1.1

(D) 3.0

Consider the matrix as given below.

047
0032 II
31
-~e

Which one of the following options p~o matrix? (A) 1. 4,3 Q.34

CORRECT values of the eigenvalues of the

(B)3,7,3

C 7,3,2

(D)I,2,3

Consider a relational table r with sufficier.: il!l.r.ll.ber of records, having attributes A ' ~ ' ... , All and let 1 "'::.p Ql: Q2:
"'::.n.

Two queries Ql and Q2 are

2' eLic-elow.

JTA, ... A, (aA,,=r(r))

A. (aC,SApsr2

where c is a const3li:
(r))

JTA, ..

where

CI

and

C:

2I"e.::o.:':1stants

The database can be configured to do ordered indexing on Ap or hashing on Ap' Which of the following statements is TRUE? (A) (B) (C) (D) Ordered Hashing Hashing Hashing indexing will always outperfom: rcs'"ring for both queries \\ ill always outperform ordered i::dexing for both queries \\ ill outperform ordered indexin~ Of! Q 1. but not on Q2 '.'.ill outperform ordered indexin~ 0:1 Q2. but not on Ql

CS-D

9120

JJM/IT/IT-Portal/2011/GQP JJM/IT/IT-Portal/2011/GQP Q.35 Four matrices Mi, M2, M) and

WI]

M4 of dimensions

pxq,

qXr,

rXs

and sXf

respectively

can be multiplied in several ways with different number of total scalar multiplications. For example the total number of scalar multiplications is when multiplied as ((Mi xM 2)X (M) xM4)),

pqr+ rst+ prt.

When multiplied

as

(((Mj xM2)xMJxM4),

the total number of scalar

multiplications is pqr

+ prs + pst.

If P = 10, q = 100, r = 20, s = 5, and t = 80 , then the mjnimum number of scalar multiplications needed is (A) 248000 Q.36 (B) 44000 (C) 19000 (D) 25000

Which of the given options provides the increasing order of asymptotic complexity of functions h, 12' 13 and 14 ? 11(n) = 2"
12 (n)

n3/2

hen) = n log2 n
(B)

14(n) =

n1og,,,

(A) 13,/2,/4,h (C) 12,/3,h,/4

Q.37

h,/2,h,/4

(D) 12,/3,/4,h

Consider evaluating the following expression tree on a machine with load~store architecture in which memory can be accessed only through load and store instructions. The variables a, b, c, d and e are initially stored in memory. The binary operators used in this expression tree can be evaluated by the machine only when the operands are in registers. The instructions produce result only in a register. If no intermediate results can be stored in memory, what is the minimum number of registers needed to evaluate this expression?

(A) 2 Q.38

(B) 9

(C) 5

(D) 3

Consider the following table of arrival time and burst time for three processes PO, PI and P2. Process PO P2 PI Oms Arrival 2ms 1 ms4 9 Burst ms ms time Time

The pre-emptive shortest job first scheduling algorithm is used. Scheduling is caJTied out only at arrival or completion of processes. What is the average waiting time for the three processes? (A) 5.0 ms (B) 4.33 ms (C) 6.33 ms (D) 7.33 ms

CS-D

10/20

2011

CS

Q.39

A deck of 5 cards (each canying a cis:ir.~: :-:umber from JJM/IT/IT-Portal/2011/GQP JJM/IT/IT-Portal/2011/GQP are then removed one at a time froiTi .r.:: deck. What
(A) 1 :5

1 to:5 :5 shuffled thoroughly. Two cards is the probability that the two cards are selected with the number on the first .:~d ~ing one higher thar: ~'1enumber on the second card? (C)1/4 (D) 2/5

Q.40

Consider a finite sequence of rancum \ ~_=s X = [xl' xz, .... Xn ]. Let j.lx be the mean and ax be the standard deviation of X. Let ::;oO:D-:', ~Inite sequence Y of equal length be derived from this as y, = a'" _\ + b , where a and b are ~;')si:i' e constants. Let

be the mean and ay be the standard

de\iation of this sequence. Which one o~ :.~efollowing statements is INCORRECT?

(A)

Index position of mode of

in X is L~=same as the index position of mode of

X

in
Y

Y.

(B) Index position of median of (C) (D) Q.41

i:1 .Y is :he same as the index position of median of

in

Y.

p, = apx +b

a,

= aax + b

Consider a database table T comaini:1~ :., 0 columns X and Y each of type creation of the table, one record eX=:. Y=: is inserted in the table.

integer.

After the

Let MX and MY denote the respectj' e ;::::..ximumvalues of X and Y among all records in the table at any point in time. Using MX and ~fY. ~e\\ records are inserted in the table 128 times with X and Y values being MX+ 1, 2*MY + 1 res;JC.::i\ely. It may be noted that each time after the insertion, values of MX and MY change. What will be the output of the follo\\ ing SQL query after the steps mentioned above are carried out? SELECT Y FROM T WHERE X=-:
C) 129
J( /

(A) 127

(B) 255

(D) 257
2 ..

Q.42

Given (A) 0

-1 , what will be the evaluation of the definite integral f . = ....; ,...--;

(B) 2 (C) -i

cas x I.,SIn a caSX-ISInX

x dx?

(D) i
z, and a

Q.43

Which one of the following options is CORRECT predicate

P(X)

given three positive integers x, yand

= -,(x

= 1) /\

V'y(=::(x

= y'" z) => (y = x) v (y = 1)

(A) (B) (C) (D) Q.44

P(x) being true means that x is a prime number

PCx) PCx)

being true means that xis a number other than 1 is always true inespective of the value of x

P(x) being true means that x has exactly two factors other than 1 and x

We are given a set of 11 distinct elements and an unlabeled binary tree with 11 nodes. In how many ways can we populate the tree with the given set so that it becomes a binary search tree? (A) 0 (B) 1 (C)
n!

(D)

_I n+1 . ZnC

11

CS-D

11/20

2011

CS

Q.45 On a non-pipelined sequential processor, a program segment, which is a part of the interrupt service JJM/IT/IT-Portal/2011/GQP JJM/IT/IT-Portal/2011/GQP routine, is given to transfer 500 bytes from an VO device to memory. Initialize the address register Initialize the count to 500 LOOP: Load a byte from device Store in memory at address given by address Increment the address register Decrement the count If count != 0 go to LOOP

register

Assume that each statement in this program is equivalent to a machine instruction which takes one clock cycle to execute if it is a non-load/store instruction. The load-store instructions take two clock cycles to execute. The designer of the system also has an alternate approach of using the DMA controller to implement the same transfer. The DMA controller requires 20 clock cycles for initialization and other overheads. Each DMA transfer cycle takes two clock cycles to transfer one byte of data from the device to the memory. What is the approximate speedup when the DMA controller based design is used in place of the interrupt driven program based input-output? (A) 3.4 (B) 4.4 (C) 5.1 (D) 6.7

Q.46

Consider the languages Ll, L2 and L3 as given below.

Ll={OP1'l
I

p, qEN}, Nand
p = q} and

L2 =
L3

{OPI 'I I p, q E

= {OPI '10' I p, q, r E Nand

p = q = r}. Which of the following statements is NOT TRUE?

(A) Push Down Automata (PDA) can be used to recognize Ll and L2 (B) Ll is a regular language (C) All the three languages are context free (D) Turing machines can be used to recognize all the languages

CS-D

12/20

2011

cs
Consider two binary operators .~. ~:: "," ., ith the precedence of operaof the operator i. Operator i is righ~ ~5..xiative while operator 1 is left the following represents the parse ~:-eef~T =\.pression (713i4 i312)? (B) -: i.Jwer than that ::. \Yhich one of

JJM/IT/IT-Portal/2011/GQP JJM/IT/IT-Portal/2011/GQP
Q.47

(A)

3
(C)

2 (D)

CS-D

13/20

2011

CS

JJM/IT/IT-Portal/2011/GQP JJM/IT/IT-Portal/2011/GQP Common Data Questions

Common Data for Questions 48 and 49: Consider the following circuit involving three D-type flip-flops configuration. used in a certain type of counter

D 0
c10ckl

o
clock

01

clock

Q.48

If all the flip-flops were reset to 0 at power on, what is the total number of distinct outputs (states) represented by PQR generated by the counter? (A) 3 (B) 4
(C) 5 (D) 6

Q.49

If at some instance prior to the occurrence of the clock edge, P, Q and R have a value 0, 1 and 0 respectively, what shall be the value of PQR after the clock edge?
(A) 000 (B) 001 (C) 010 (D) 011

Common Data for Questions 50 and 51: Consider the following recursive C function that takes two arguments. unsigned int foo(unsigned int n, unsigned int r) if (n>O) return ((n%r) + foo(n/r, r)); else return 0; } Q.50 What is the return value of the function (A) 9 Q.51 (B) 8

f 00 when f 00 when

it is called as

f 00 (513,
(D) 2

2)?

(C) 5

What is the return value of the function (A) 345

(B) 12

it is called as

f 00 ( 345,
(D) 3

10)?

(C) 5

CS-D

14/20

2011

CS

Linked Answer Questions JJM/IT/IT-Portal/2011/GQP JJM/IT/IT-Portal/2011/GQP

Statement for Linked Answer Questions E2 and 53: graph G(V,E) COmai:l5 :: ,n>~)
I:::;

An undirected

nodes nameC \~_r:"",vl1'

Vj )

Two no:L~

""vj

are

n = 4 is shown below.

connected if and only if 0

<I i - j

:2. '::2':[;

c:'~e (Vi'

is assig;1::':::: "eight i + j. As

Q.52

What will be the cost of the minirG~m sp:mning tree (MST) of S"'.!ch a graph with n noc..."S? (A)
I?
12

(11 n- -5 n)

(B) n- -/i-l
Vs

(C) 6n-l1

(D) 2n+l

Q.53

The length of the path from

ro v~ in:.he :\1ST of previous q:.:estion with n = 10 is (D) 41

(A) 11 (B) 25 (C) 31 Statement for Linked Answer Questions S4 and 55: Consider a network with five nodes, N 1 ro :\5. ~ shown below.

3
N5

4 2

N4

N3

The network uses a Distance Vector Routing protocol. Once the routes have stabilized, the distance vectors at different nodes are as following. Nl: (0, 1,7.8.4) N2: (1,0,6.7,3) N3: (7,6,0.2.6) N4: (8, 7, 2. Q. 4) N5: (4, 3, 6.4.0) Each distance vector is the distance of the best knO\\ n path at that instance to nodes, Nl to ~5, where the distance to itself is 0. Also, all links are symmetric and the cost is identical in both directions. In each round, all nodes exchange their distance vectors with their respective neighbors. Then all nodes update their distance vectors. In between two rounds, any change in cost of a link will cause the two incident nodes to change only that entry in their distance vectors. Q.54 The cost of link N2-N3 reduces to 2 (in both directions). After the next round of updates, what will be the new distance vector at node, N3?
(A) (3, 2, 0. 2. 5) (B) (3, 2, 0, 2, 6) (C) (7. 2, 0, 2, 5)

(D) (7, 2. 0. 2, 6)

Q.55

After the update in the previous question, the link N I-N2 goes down. N2 will reflect this change immediately in its distance vector as cost, co. After the NEXT ROUND of update. what will be the cost to N 1 in the distance vector of N3? (A) 3 (B) 9
(C) 10

(D)

co
15/20

CS-D

2011

CS

General Aptitude (GA) Questions JJM/IT/IT-Portal/2011/GQP JJM/IT/IT-Portal/2011/GQP Q. 56 - Q. 60 carry one mark each.
Q.56 Choose the most appropriate sentence. word from the options given below to complete the following

If you are trying to make a strong impression on your audience, you cannot do so by being understated, tentative or " (A) hyperbolic (B) restrained (C) argumentative (b) indifferent Q.57 Choose the word from the options given below that is most nearly opposite in meaning to the given word: Amalgamate (A) (B) (C) (D) Q.58 merge split collect separate

Which of the following options is the closest in the meaning to the word below: Inexplicable (A) Incomprehensible (B) Indelible (C) Inextricable (D) Infallible

Q.59

If Log (P) = (1/2)Log (Q) = (1/3) Log (R), then which of the following options is TRUE? (A) p2= Q3R2 (B) Q2= PR (C) Q2= R3p (D) R = p2Q2

Q.60

Choose the most appropriate sentence. I contemplated (A) (B) (C) (D) to visit having to visit visiting for a visit

word(s) from the options given below to complete the following Singapore for my vacation but decided against it.

Q. 61 to Q. .65 carry two marks each.

Q.61 A transporter receives the same number of orders each day. Cunently, he has some pending orders (backlog) to be shipped. If he uses 7 trucks, then at the end of the 4th day he can clear all the orders. Alternatively, if he uses only 3 trucks, then all the orders are cleared at the end of the lath day. What is the minimum number of trucks required so that there will be no pending order at the end of the 5th day? (A) 4 Q.62 (B) 5 (C) 6 (D) 7

A container originally contains 10 litres of pure spmt. From this container 1 litre of spirit is replaced with 1 litre of water. Subsequently, 1 litre of the mixture is again replaced with 1 litre of water and this process is repeated one more time. How much spirit is now left in the container? (A) 7.58 litres (B) 7.84litres (C) 7 litres (D) 7.29 litres
16/20

CS-D

011

CS

Q.63 Few school curricula include a unit 0 JJM/IT/IT-Portal/2011/GQP JJM/IT/IT-Portal/2011/GQP

students at some point in their Iiyes su

-ement and gri~h eath and partin!!.

d 'yet all

Based on the above passage \~hi.:-hto.;:'I': \\oc:ld not be included (A) (B) (C) (D) Q.64 ho\\' to write a letter of cone:)!:-".:e \~hat emotional stages are passed L:~c:.:~h in the healing ~ ?r:\\ hat the leading causes of de.:.,-::' how to give support to a grie":;;~ f.:-~,,:

w:! unit on bereavemenL

P, Q. Rand S are four types of d~~:-~0us :nicrobes recentl~ found in a human habitaL The area of. each circle with its diameter printe~ 'r: ~:-2.;::~ets represents the 2C--1h of a single micr<iJe surviving human immunity system within :::~~0~S 0~ entering the bod:,. ! :-,edanger to human beings varies proportionately with the toxicity. t:-0:ency :md growth attribucee to a microbe shown in the figure belo\\ :

'- 200 o '--Q) "0 (j) >, .~ en en '-~ O'l .IT 0'lCi:l .J:: "0 0 U Q) E Ci:l 600 Q)= 0 f'::t:: '400 Ci:l 0 ::J C 0 o 'x .0 Q) E "0 Ci:l E 800 en EE.8 >, 0.2 '0
:~ l.... CJ)

-Q)

1000

o
0.4
(A) P Q.65 (B) Q

30 mm)

S (20 mm)

0.6

0.8

Potency (Probability that microbe will overcome human immunity system)

A pharmaceutical company is contemplating the development of a vaccine against the most dangerous microbe. Which microbe should the company target in its first attempt? C R (D) S

The variable cost (V) of manufacturing a product \aries according to the equation Y= 4q, where q is the quantity produced. The fixed cost (F) of production of same product reduces with q according to the equation F = lOO/q. How many units should be produced to minimize the total cost (V+F)? (A) 5 (B) 4
(C) 7

(D) 6

END OF THE QLr=STION PAPER

CS-D

17/20