This action might not be possible to undo. Are you sure you want to continue?
2012
Question Boo,klet Cod~
I
CS : COMPUTER SCIENCE & INFORMATION TECHNOLOGY
Duration: Three Hours Read the following instrucrieus 1. 2. carefully. Booklet until you are asked Lo do so by the invigilator,
A~
~
Maxin tun I Math: .I 00.
Do not open the seal of the Question
Take out the Optical Response Sheet (ORS) from this Question Booklet without breaking the seam and read the instructions printed on the ORS carefully. If you find that the Question Booklet Code printed ar the right hand top comer of this page does not match with the Booklet Code on the ORS, exchange the booklet immediately with a new sealed Question Booklet. On the right half of the ORS, using ONLY a black. ink ball point pen, 0) darken the bubble corresponding to your test paper code and the appropriate bubble under each digit of your registration number and (ii) write your registration number. your name and name of the examination centre and put your signature at the specified location, This Question Booklet contains 20 pages including blank pages for Tough work. After you are permitted to open the seal, please check all pages and report discrepancies, if any. to the invigilator.
3.
4.
5.
There are a total of 65 questions carrying 100 marks. All these questions are of objective type. Each question has only one correct answer. Questions must be answered 011 the left handside of the ORS by darkening the appropriate bubble (marked A, B, C, D) using ONLY a black ink ball point pen against the question number. FOl" each question darken the bubble of the coned anSWCI". More than one answer bubbled against a question will be treated as an incorrect response.
Since bubbles darkened by the black ink ball point pen cannot the bubbles in the ORS very carefuHy. be erased, candidates should darken
6.
7.
Questions Q.l  Q..25 carry 1 mark each. Questions Q.16  Q.55 carry 2 marks each. The 2 marks questions include two pairs of common data questions and two pairs of 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 Questions Q.56  Q.65 belong to General Aptitude (GA) section and carry a total of t5 marks. Q.56  Q.60 carry 1 mark each. and questions Q.6J  Q.65 carry 2 marks each.
8.
9.
Unattempted questions will result in zero mark and wrong answers will result in NEGATIVE marks. For all 1 mark questions, Xi mark will be deducted for each wrong answer. For all 2 marks questions. % mark will be deducted for each wrong answer. However, in the case of the linked answer question pair, there wit [ be negative marks only for wrong answer to the first question and no negative marks for wrong answer to the second question. is allowed whereas charts, graph sheers or tables are NOT allowed paper itself. in the examinal ion hall. at the end of tile
to. Calculator
Il. Rough work can be done on the question question paper for rough work.
Blank pages are provided number
12. Before the start 01' the examination write your name and registration below using a black ink ball point pen,
in the space provided
Name
Registration Number
5 PtN6r¥TA
CS
13
Iv
14
IS
14
I
o
1111211
l"
A
2012
COMPUTER SCIENCE & INFORMATION TECH.  CS
Q. 1  Q. 25 carry one mark each.
Q.I.
Consider the following logical inferences, the~the cric;;t;;atch will not be plal'~ The cricket match was play.sAL Inference: There was no rain. T 12: If iLI.. then the cricket match will not be played. ~ins It did not rain. ._" Inference: The cricket match was_Elayed,
II:~
r
'Pq~~~ 4r =; clu'~
J
~
r
lcJ.f1
o
'YlBoth II and I2 are correct
Wh~f
the following is TRUE?
~ f~
.I
rv.3
3J'
inferencesu>" (B) Il is correct but h is not a correct inference (C) I[ is not correct but h is a correct inference CD) Both II and 12 are not correct inferences Which of the following is TRUE?
r¥p
(A) Every relation in 3NF is also in BCNF f.(B) A relation R is in 3NF if every nonprime attribute of R is fully functionally dependent
011
every
e
~
/,,_yy ofR
:,~eryrelation in BCNF is also in 3t{P"\ (D) No relation can be in both BCNF and 3NF
What will be the output of 'he following C program segment?
char inChar = 'A' switch ( in(har ) case 'A pri ntf case 'B' case 'C' pri ntf case '0' case 'E' default printf
I
{
("(hoi
ce A\ n")
;
("Choi ce B")
( " No Choice"
)
}
(A)
No Choice
Choice B No Choice CD) Program gives no output as it is erroneous Assuming P of. NP, which of the following is TRUE? (A) NPcomplete = NP..,.(C) NPhard = NP
hoice A hoice A
....______,
...., 
(B) NPcomplete n P CD) P = NPcomplete
=~ ~
Q.5
The worst case running time to search for an element in a balanced binary search tree with 172" elements is
(A)
e (Il log n)
(B)
o (112")
(C)
e (1'1)
(D)
e (log n)
CSA
2(~O
2012
COMPUTER SCIENCE & I
Q.6
The truth table
x
a
0 1 1
y
0
1
f (X, Y) 0 0
1 1 ~ (C) X EB Y
0 1
represents the Boolean function ~ The decimal value (B)X+Y
(D) Y
has
~
Win IEEE single precision
floating point representation
(A) fraction bits of Qqo_... QQD and exponent value of Q_ (B) fraction bits of ~ and exponent value of ~ (C) fraction bits of 100 ... 000 and exponent value of 0 (0) DO exact represen~ Q.8 A process executes the code fork(); forkr); The total number of 9:il.d_processes created is
(A)3 forkf);
Dill/I
\\
tr.
l!J
t
4' I
,
J'

lli 1& 24:
()
VItO ~
V· E
;J(D) 8
(B)4
~
{7
.. W
Q.9
Consider the function fCA:) sin(x) in the interval x = local minima of this function are
(A) One, at n/2 (B) One, at 3nl2 (C) Two, at n/2 and 31[12
[rr/4, 7rr/4J. The number and location(s) of the
____:l~
0 \ \I
I,
CD) Two, at n14 and 3nl2
oJ
Q.lO
The protocol data unit (PDU) for the application layer in the Internet stack is
(A) 0
(C)
'~
(D) {a. E}
l
J
J
cs ;\
2012
COMPUTER SCIENCE & INFORMATION TEC'H. 
cs
Q.I.3
What is the correct translation (A) .3x (real(x) v rational(x)) (real(x) M rationalfxj) .3x (real(x) 1\ ra~ional(x))p .3x (rational(x) 7 realtx) the basic
of the following statement into mathematical "Some real numbers are rational" ~
6B~
~

logic?
CD)
(@ Given
7
ER and relational
models,
which of the foliowing
is INCORRECT?
(A) An attribute of an entity can have more than one value '\
C.
~
attribute of a; entity can be composite')' r a row of a rel.ational table, an attribute can have more than one value .'" a row of a relational table, an attribute can have exactlY one v~L statements are TRUE about an SQL query?
I
~f
value
...., ~
Which 01 the following
E
Ail
0/
rJ'j {21
r'
\
P : An SQL query can contain aHA VINO clause even if it does Q: An SQL query can contain aHA VlNG clause only if it has,! R: All attributes used in the GROUP BY clause must appear in S : Not ail attributes used in the~Y clause needto_ap.p /" , n/rhe CAl! and R recurrence relation is
not have a GROUP BY clause GROUP, BY clause~ the SELECT cJause ar in the SELECT clause (D) Q and S
\'Y'
with
(Bl.f.
and S the optimal
(C) Q and R execution
c._7~v ~discs
Q.17
capturing
time of the Towers of Hanoi problem
(A) T(n)
= 2T(n
 2)
(C) T(n) =2T(n/2)
+r
t.: ~
+J..f'>
! ~n)
(B). T(n)
= 2T(n
=2T(n"": 1) +1
 1) +:..!l1
J
~
G)
graph,
_:l
Let G be a simple undirected planar graph~ertices then the number of bounded faces in any embedding (A) 3
,/
with 15 edges. If G is a connected of G on the plane is equal to (D) 6
(B) 4
(C) 5
Q.18
Let Wo;) and A(n) denote respectively, the worst case and average case running algorithm executed on an input of s.iz~ n: Which of the following is AL WAYS TRUE? (A) A(n) = Q (W(n)) ~A(I1) (B) ACn)
time of an, / ~
\
\
=0
(W(l1)~ to implement
CD) A(n)
= G (W(n» = 0 (Wen)
is CD) 2 Kbits
\.Y
\
Q.19
The amount of ROM needed (A) 64 bits
(B)
a 4 bit multiplier
C
J 28 bits
processors
(C) 1 Kbits
Q.20
Register (A) (B) (C) (D)
renaming
is done in pipelined
as an alternative to register allocation at compile time for efficient access to function parameters and local variables to handle certain kinds of hazar~ as part of address translat1o'r1""" ''" 0.5 each. The values of
0.21
Consider a random variable X that takes values + 1 and  J with probability the cumulati ve distribution function Ft.r) at x = 1 and + 1 are (A) 0 and 0.5 (B) () and 1
(C) 0.5 and 1
CD) 0.25 and 0.75
4/20
2012
COMPUTER
SCLENCE & INFORMATION
TECH.
CS
Q.22
Which of the following transport layer protocols is used to support electronic mail? (A) SM~ (B) IP ,. (C) TCP '" (b) UDP y
In the IPv4 addressing format, the number of networks allowed under Class C addresses is (A) 214 (B) 27 (C)
221
~
V
Which of the following problems are decidable? 1) Does a given program ever produce an output? 2) If L is a contextfree language, then, is L also contextfree? 3) If L is a regular language, then, is (A) L 2. 3. 4
(B) 1. 2
qg.,
L
also regular?
r
f
4) If L is a recursive Language, then, is L also recursive?
(C) 2,3,4
(D) 3.4
Q.25
Gi ven the language L = {@,
l!9£!.}, which of the following strings are in

L*?
1) Q.bq.g.~C/jJ@q.a V""'" 2) aaaabaaaa '
3) 4) ba(llIa~ (2£!Cl!J.(IIJ,bC.!:E
~l,1.aod4
L ~~!.:!,~ and ~
(B) 2,}And 4 )a (D)1, 3 and 4 )d
>e_;~
flft'
4)
'V\A.h..}/\
,
CSA
5120
2012
COMPUTER SCLBNCE & INFORMATION
TBCH.  CS
Q. 26 to Q. SS carry two marks each,
f)hiCh of the followinggraphs is isomorphicto
(A)
(C)
(D)
\f7
\
(frf'
C)~ ~"'!
~
o
/
Consider the foll~wing transactions with data items P and Q initialized to zero:.;.,f?
Tl~(£_~;:~Q);
0
'\
(,\
p:.Q + 1;
0
Ci>
A..'J>
yf'
\
\~\ ~\t
T"~~:~: (~~;then Q :=
19.,: 1Y \
'"
~A ~b~
I r(i,/ k 2.~
Ar'
\.
't)"
read C.8~; :\/ if Q = 0 then P := P + 1 ; wri te CP)~ ~ Anfiionserial interleaving of 'r, and Tz for concurrent execution leads to
Q.28
wr) a ~che~ule for whi~h a pr,ecedence graph cannot be drawn .
1 (B) 3 (C) 5
«t.\SV conflict
(A) a seriaJizabie schedule (B) a schedule that is not conflict serializable
f)
.".
X4
, ·1
I (, ~;_:..J~ ~
serializable schedule
The bisection method IS applied to compute a zero of the functionjix) = interval [1,9]. The method converges to a solution after iterations.
x =x: ~ 4111 the
\I~LJ
CD) 7
1
_.:y
t G. be a weig~1ted graph wit~l edge w. ights gl~eater,than.~~ and G b~ the graph conSlruct~d by e uanng the weights of edges 111 G:,Let T and T be the rrununum spanmng?~s of G and G ,
respectively, with total weights
(A)
t
:nd t'. Which of the following state'irutlts is TRUE?
,lith total weight £1 = t~with total weight'f < t2 (C) T' f:. T but total weight t = t}~ (D) None of the above /:
f
Y
&..,\
.10
f
J L1
~
{j) ~
_)
r'rJ ~ V
1
0
CS·A
6120
2012
COMPUTER SCIENCE & INFORMATION TECH.  CS
Q.30
What is the minimal form of the Karnaugh map shown below? Assume rhat X denotes a don't care term. ,,'0 ~~ 6"10 ab 01 J1 00 10 c
6i
1
,
,
{oOr
100
1:..$)0
!
X
X
1 . 1
tOO
~
c~Ol
X
i /
I
»:
(~u
(1.10
1
X·
Pl
P2
~~<C
»
r
(A) FCFS: PI, P2, P3 RR2: PI, P2, P3 iCFS: R._l, P2...P.LRR2: Pl, P3, P2
>oeD) FCFS:
)<QB) FCFS: PI, P3, P2 RR2: PI, P3, P2 PI, P3, P2 RR2: PI, P2, P3
Q.32
}
CSA.
2012
COMPLITER SClENCE&
I f'ORMAT10NTECH.
CS
Q.34
An Internet Service Provider (ISP) has the following chunk of f'IDRbased IP addresses available with it: 245.248.128.0/20. The rsp wants to give half of this chunk of addresses to Organization A, and a quarter to Organization B. while retaining the remaining with itself. Which of the following is a val id allocation of addresses to A and B? \
(S·A
8/20
t Q.36
.../
?i'fff) .( (
COMPUTER SCIENCE & lNFORMATION
TECH.  CS
Consider the program given below. ill a blockstructured pseudolanguage nesting of procedures permitted . Program
with~.g
and
Var ...
ma.in;~
l
procedure
Call A2; End Al
Var ...
AI;
(' Procedure
Var ...
A2;
pro~~~u~~ .A
Call AI; End A21 Call A21; End A2 End main ..
J
21'
Call AI;
Consider the calling chain: Main 7 Al 7 A2 7 A2l 7 Al _..,.' ~ .... The correct set of ac~
(A)
_
~
along with their access links is given by
(B)
POlNTER
ACCESS LINKS
FRAME POINTER
ACCESS LINKS
(C)
(D)
FRAME~ POLNTER
ACCESS LINKS FRAME POINTER ACCESS LINKS
CSA
9120
COMPUTER SCIENCE & INFORMATION TECH. _ CS
s!) Yl ~3
«> s

It) y
.2,
(A)
SDf
~
r~
SBDT
(e) SAeDf
CD) SAc€f_
,
;(. ~ ~
I
A file system with 30Q_ GByte disk uses. a file descriptor with ~ direct bLQc_kddresses, a
1 indirect block address and indirect block address. The size of each disk block is L28 Bytes and the size of each disk blocfiddress is, ~ The ~mpossible file size in this file system is
Ta:o~
CD) /
(A) 3 KBytes '~ . (B) 35 KBytes ~O~L. (C) 280 KBytes dependent on the size of the disk
1?<l""\¥
( ,_) \._ "
~~
f.
Consider the virtuall(,age reference string . 1, 2, 3, 2, q) 1, 3, 2. 4, l_ ",...... on a demand paged virtual memory system running on a computer system that has main memory size of 3 page frames which are initially empty. Let LRU FIFO and OPTIMAL denote the number of page faults under the corresponding page replacement po J Icy. Then , '.
fl.
c~ .) ,_~ ~ _I', tt. t I ~J~ r trf~
j
I
fi
~
~
+0 ~
_
\:":1 ~ 3j.)}lj2..J
(A) OPTIMAL < LRU < FIFO (e) OPTIMAL = .~3 Suppose RICA. B' and R2~'
~R1Jr\..,
~TIMAL < FIFO < LRU "7 (D) OPTIMAL = FIFO D) are two relation schernas. Let
rl
J
~.
I
)..
I
YNH
1.( ~
&J
#
'F
and
t'
/"1
be the corresponding
_/ ~ty
~
constrai nts, which of the following is AL WAYS TRUE?
~B(rl)  ITC(r1)
Q.!
'1:2
~
·
I
~;Jf
(B) TIcCrl)  I1sCr,)::: 0)0 (C) f1s(r,)::: TIC<rl)_A CD) ITB(rl)  TIC(r2) j: 0 'Kl
=0
A'
1I", (,;);

I/
I
'c;
Ii)
JL
t/
J
l!?
1
tM
..;>
CSA
10/20
,.
r ~
2012
COMPUTER SClENCE & INFORMATION
TECH.  CS
Consider a source computer (S) transmitting a file of size 10 bits to a destination computer (D) over a network of two routers (RI and R2) and three links (LI L}, and L3)' LI connects S to RI' k connects RI LO R2; and L_\connects Rz to D. Let each link be of length 100 km. Assume signals travel over each link at a speed of 108 meters per second. Assume that the link bandwidth on each link is I Mbps. Let the file be broken down into 1000 packets each of size 1000 bits ..Find the total sum of transmission and propagation delays in transmitting the file from S to D?
cp
Q.45
(B) 1010 IDS (C) 3000 ms (A) 1005 rns (D) 3003 ms Consider an instance ofTCP's Additive Increase Multiplicative Decrease (AIMD) algorithm where the window size at the start of the slow start phase is 2 MSS and the threshold at the start of the first transmission is 8 MSS. Assume that a timeout occurs during the fifth transmission. Find the congestion window size at the end of the tenth transmission.
(B) 14 M~_
(C) 7 MSS
(D) 12MSS
Consider the set of strings on({O,l} in which, ellery substring v[.w}Y'u.lu#s lli!.s at m9g_two zeros. For example, QQ..llJ.Q. and 01!:9IY are in the language, but l.QQ9JOis not. .;7~1 strings of length less than 3 are also ill the language. ~ partially completed DFA that accepts this language is shown below. f()'
v
roo 0 o..ll(} I 0 '~
ola
0, 1
1 The missing arcs in the DFA are
(A) 'I.._ (B)
00, 01 10 11
(C)
(y
()
00
01
O'{J
I
10
11
J
q
00
01 \
1
00
01 10
of
a
10
11
q
1
j
0
0
11
00 00 01 10 11
CS·A
!J)c....
1
Ol
10
11
~q
rO)t
...........
00
00
01
/
('Ol
10
11 L
01
0
10
11
(0 )
..:;...
0

""
0
(0) \.V
"J
q
11/20
COMPUTER SCIENCE & INFORMATION
TECH.  CS
The height of a tree is defined as the number of edges on the longest path in the tree. The function shown in the _pseudocodt0;LelQw is ~oked ~s,..hei gbt.(.r..oQl.) to compute the height of a binary tree rooted at the tree pointer root. ~ l> int height ~ _n) { if === NULL) return 1; if 1eft === NlJ..L1j if 7 ri'ght:~ NULL) return
V)
oG
en en )
else
V
v
en
return
~J ;
.::r..._ .
o;~
else
{ hl == hei ght (n 7 1eft) j lf Cn ~ right == NUl:L) return else { 112 = height (n) right); return
} }
C +h1)
e
~
II Box 1
V
II Box 2
}
(C) B1: heighten 7 right) B2: maxth I, b2) ~
CD) BJ: (1+ hei.ght(n
7 right))
B2: max(hl, h2)
CS·A
12/20
2012
COMPUTER S('[ENCE & INFORMAT[ON
TECH.  CS
Common Data Questions
Common Data for Questions 48 and 49: Consider the following C code segment. int at b, c = 0; void prtFun(void); ma..i n ( ) { stati c iD,t a '" 1_'i _.. t+un (" ,) ; pr .1/ . ,a += 1.;... prtFun( ); p ri__ f"!j:J {H in %d %d",.h}
I
b) ;
voi~ prtFun(void} { static int ~ =_..?b i nt b = 1.; a += ++b;pri ntfC" \n %d %d",
/
Line ~
2 "'/ q_
~V
} Q.48 What output will be generated by the given. code segment?
(A)
3 4 4
Q.49
(B)
I'" 2
4 6 6
_
(C)
CD)
2&
?
V
1 I
36 2
.J..
0
3 5 5
I ).
2
2
What output will be generated by the given code segment if: Line 1 is replaced by auto i nt a = 1 ~ Line 2 is replaced by'reg:fster i nt a = 2;
(A) (B)
(C)
2
(D)
3 4 4
1
1
4
6 6
4
6
2
2
4
4
2
2
0
2
2 2 0
'\(
.~
CSA
13f20
2012
COMPUTER SCLENCE & INFORMATION
TECH.  CS
Common Data for Questions 50 and 51:
Consider the following relations A, Band C:
Id
12 15
99
A Name Arun Shreya Rohit
B
Age
Id
15
Name
Shreya Han Rohit
c
Age; 124 40 ',20 , '+1/'
relational algebra
60
24 11
25 98
Id 10 99
Phone
Area
2200
2100
02
01
99
Q.50 How many ~s
Rohit
does the result of the following
expression
contain?
Assume
that the schema of AUB is the same as that of~ (AUB) f><l (~
(A)
7
~S
~
< 15 _<;.
.
"I
(C) 5
SQL query contain?
CD) 9
How many tuples does the result of the following
SELECT~ FROMA .. \ ~ WHERE AAge _> ALL (SELE T ~ ~ ~ FROMB _,_ WHERE~=
(A) 4
1 ('
~Arun')
(C)
=>
a
(D) 1
l~ ~
\)" g(....9v~
'1 ~ f2 f) 1.rV\1
1\ oa~
CSA
14/20
2012
COMPlITEJ{ SCIENCE & INFORMATION
TECI!  CS
Linked Answer Questions
Statement for Linked Answer Questions 52 and 53:
below,~al~e is also presented ~th the grar!!!!1M_.Entries that
For the grammar
need to be filled ar~ indicated. as E1.,._E2,aB~E3: ~ is the emp1y strjn~ separates alternate right band sldesof productions. 
$ i~ic~ P. "b \3. •
end of input, and,
I
S fa ~1> _§
A~
/n,
I
bA
().. \
a. J:i I
E
11 7
a S
A
d
f
.;::, (t..
Pr~ ~ .
b
:::::7 ~
$
r C) 'f'J\\._,
I
R~,
0
r f'ii Pt V> IS
t;.1JI
r.... I
\}
EIJ
E2
S7E
error
~
B
Q.52
A7S B7S
A7S B7S
/E3)
t19.~1\'t
A and Bare
;iJ
I...._...../
The FIRST and FOLLOW
~S1'(AL
~LLOWiA)_=_lh_b ~~v FOLLOWeB) {a, b. $}
t~?3}
=
sets for the nonterminals
'0\
~FlRST(B) L
(B) FIRST(A) = {a, b, $}? FIRST(B) = fa, b, e} FOLLOW(A) = {a, b} FOLLOW(B) = I$}
rr'
'oJ""
~'Ulf) P)
\VI.._.~ ?)
(C) FIRST(A)
 {a. b £}  ETRST(B).... ,FOLLOW(A) = f.;_QJv FOLLOW(B) =0 entries for El , B2, and E3 are
(D) FIRST(A) = {a, b} = FIRSTCB)o FOLLOW(A) = {a, b} ++__ :;".FOLLOWCB) = {a, b} S') C{ AbE>
Q.53
The appropriate
(A) BL: S 7 ..,.... A 7 S aAbB, E2: S .7 ~ B 7 S/"J
B3: B ~ S
t/
v
/
CB) El: S E2:. S E3: S
7 aAbB. S 7 E 7 bAaB, S 7 £ 7 E
_
~ [ rt'l f,'('" (... )) ~
/
S3 ...k. e$1
~, a
rs
dJ..,
~
::0
1: S 7 aAbB, S 7 E v E2: S 7 bAaB:;"'"S .7"£ v
E3:
B7S
)0
I
(D) El: A 7 S. S 7 e E2: B 7 S, S 7 E
E3: B

7 S
I
1
computer has a 256 KByte 4way se~ssocja[i~. write back data cache with brock size ofJ2_Byte.s.. The processor sends 32 bit addresses to the cache controller. Each cache tag directory entry contains, in addition to address tag, 2 valid bits, 1 modified bit and 1 replacement bit. ~Q.54
The number of bits in tile/tag field of ~n address is
(A)
11
(B) 14 is
(C) J 6
(D) 27
L
~
_·rftTO
Q.55
The size of the cache tag directory (A) 160 Kbils
(B) 136 Kbits
(C) 40 Kbits
(0) 32 Kbits
CSA
15/20
2012
COMPUTEK SCIENCE & [NFORMATION
TECH.
CS
General Aptitude (GA) Questions Q. 56  Q. 60 carry one mark each.
The cost function for a product in a firm is given by where q is the amount of production. The firm can sell the product at a market price of ~ 50 ,ge~nit. The number of units to be produced by the firm such that the profit is maxim.ized ~ ~ (A) 5 Q.57 (B) 10 alternative (C) 15 from the options
5l.
(D) 25
given below to complete the following
Choose the most appropriate sentence:
Despite several
(A) attempts Q.58
,/
the mission succeeded in its attempt to resolve the conflict. (B) setbacks
options is the closest
(C) meetings
in meaning
(D) delegations to the word given below?
Which one of the following
Mitigate
(A) Diminish Q.59 Choose the grammaticalJy
/_
(B) Divulge
(C) Dedicate CD) Denote
._/
a
INCORRECT sentence:
~
b
(A) They gave us the money back less tbe service charges of Three Hundred rupees. (B) This country's expenditure is not less than that of Bangladesh. (C) The committee initially asked for a funding of Fifty Lakh rupees. but later settled for a lesser sum. (D) This country's expenditure on educational reforms is very less.
Choose the most appropriate sentence: alternative from the options given below to complete the following
Q.~
~
Suresh's dog is the one
(A) that
f
was hurt in the stampede.
(e)
~hicll
~l!9
CD) whom'yJ
Q. 61  Q. 65 carry two marks each.
Q.61 Wanted Temporary, Parttime persons for the post of Field Interviewer to conduct personal interviews to collect and coUate economic data. Requirements: High Schoolpass, must be available for Day, Evening and Saturday work. Transportation paid, expenses reimbursed,
Which one of the following (A) (B) (C) (D) is the best inference from the above advertisement?
Genderdiscriminatory Xenophobic Not designed to make the post attracti ve Not genderdiscriminatory
C';h
"'2 A political party orders an arch for the entrance to the ground in which the annual convention is ~Obeing held. The profile of the arch follows the equation y ::::2x  O.lx" where y is the height of the arcl~meters. The maximum possible height of the arch is (A) 8 meters (B) 10 meters (C)
12 meters
(D)
14 meters
16/2(J
:'iA
2012
COMPUTER SCIENCE & INFORMATION TECH. 
cs
Q.63
An automobile plant contracted to buy shock absorbers from two suppliers X and Y. X supplies 60% and Y supplies 40% of the shock absorbers. All shock absorbers are stilljecled to a q_ualitytest. The ones that pass the quality test are considered reliable. OfX's shock absorbers, 96%are reliabfe. Of Y's shock absorbers, 72% are reliable. The probability that a randomly chosen shock absorber, which is found to be reliable, is made by Y
IS
~88 Q.64
(B) 0.334
(C) 0.667
(D) 0.720
Which of the following assertions are CORRECT? P: Adding 7 to each entryin a list adds 7 to the gjean of~st:f" Q: Adding 7 to each entry in a list adds 7 to the standard deviaucn.of.the ist Doubling each entry in a list doubles themea~ of tEe listT . S: Doubling each entry in a list leaves the standar deviation of the list unchanged
.60\~
R:
br:f1
?~
\.10·'.
(A:('i!J Q
Q.65(~.~equence
~)UV
(B) Q, ~
~
(D)
R,
s,XJ
of terms, AD CO FK JP, the next term is
(B) OW (C)PV
(D)PW
1'7

__ 
9H
1
I
'\
18
1
~
lJ
rr»
Ie..
,q
7
'0
)1
IJ,
,
n
~I ,
.£@ 3"
Cf, ~)
(J
~. jb
\;0
.~{)
IJ
.'
I~
A
100
t'}2..
)..e ,..
10
!3
C
I€
g
£.~
@
r
~J :;)
).~
CE,Ol)
®
~b
Ji
® ~ ?a: 1 CD
1
Jl
JL
([)~ \0
C\~
,..0
GJ ~)
J1
P)
4 J5
CSA
~
Pr
~
1'1)
'.'t
\~
~
~__..,
%
C/
7~1Y
%
c ~ &~ \J9'Q ,~
tJt! »
~J
/'
lh
17/20
~