Professional Documents
Culture Documents
Sb-Gs Minutes: Gomputer Sgienge
Sb-Gs Minutes: Gomputer Sgienge
crfr b Tflr Crahfea srgeeil 61 qra S 16 d t Read the foll owing instructions carefully before you beg in to ansu,er the q uestions.
?e * q6& I
SEAL
PART - A 6 Rakesh is standing at a point. He walks
20 m towards the East and further 10 m
GENERIC ton ards the South, then he walks 35 m
tou'ards the West and further 5 m towards
the North, then he walks 15 m towards
Directions (1-2) : Use following diagrams to the East. \{lhat is the skaight distance in
answer question number 1 to 2 : metres between his starting point and the
point where he reached last ?
o (A) o "(B) 5
(c) 10 (D) 1s
Io
t E
\{
=-!t
Directions (9-13) : Read the information given Directions (1&18) : Read the information given
below and on the basis of the information, below and on the basis of the information,
select the correct alternative for each question select the correct alternative for each question
given after the information. given after the inf ormation.
There are five persons P, Q, R" S and T. One is M and N are good at hockey and volleyball.
football player, one is chess player, one is hockey O and M are good at hockey and baseball.
player. P and S are unmalried ladies and do not P andN are good at cricket and volleyball. O, P
participate in any game. None of the ladies plays and Q are good at football and basketball.
chess or football. There is a married couple in
which T is the husband. Q is the brother of R
and is neither a chess player nor a hockey player.
14. Who is good at the lalgest number of
games ?
t \ki'o-
? L1:t-(t'*d-
CI. ^l^
q '?,(\*,rru
Directions (19-21) : Read the information given 23. A cuboid of dimension 24 cm x 9 cm x 8 cm
below and on the basis of the infolmation, is melted and smaller cubes of side 3 cm
select the cortect alternative for each question are formed. Find how many such cubes
given after the information. can be formed :
(ii) Q gets a north facing flat and is not next 24. Instead of walking along two adjacent
to S. sides of a rectangular field, a boy took a
short cut along the diagonal and saved a
(iii) S and U get diagonally opposite flats' distance equal to hal{ the longer side. Theo
the ratio of the shorter side to the longer
(i") R next to U, gets a south facing flat and T
side is :
gets a north facing flat'
(A) 1/2 (B) 2/3
(c)"1/4 (D) 3/4
19. \fhose flat is between Q and S ?
20. The flats of which of the other pairs than " (A) 2/5 {t Y"^ e
A a- ic(
+t
v *--*1\'
av
u
..rL U
s Y,v {
fit
['u l.
27. lzlogo25-21ogr0 3*1ogr, 18 equals : 31. A cylindrical vessel 60 cm in diameter is
partially fiJled with water. A sphere 30 cm
(A) 18 L^(
d
ffi,",- in a diameter is dropped into it. The
increase in the level of watel in the vessel
(B) 1
+> ,A
/a
1S \l - q n
,l
3 t. v 2cm 3cm f
,L. ri
(c) logro --1
(A) (B) -,a
1
(c) 4cm "(D) 5cm
(D) None of these
-{\ r< t,.x!|,'
!
x.f, 1
^tV
29. lt x:p, y=qthen which of following are
L--
ftx 2-.,x l9 + A*++9.+ }xl&X rr,
p and q respectively for pair of equations Directions (33-34) : Read the information given t
3x -7y +10:0 atd y-2x-3:0 : below and on the basis of the information,
select the correct alternative for each question
30. The students in a class are seated 2018 5032 1794 9432
2019 49't5 1668 9744
3528
4015
8529
9015
3628
,13:t1
1'1247
12518
5158
6328
according to their marks in the previous 2420 5628 2392 9969 4263 10725 4426 't3624 6449
examination. Once it so happens that four
of these students get equal marks and
therefore the same rank. To decide their *App - Appeared *Pass - Passed
seating arrangement the teacher wants to
write down all possible arrangements, one
in each of separate bits of paper, in order 33. In which of the following years was the
to choose one of these by lots. How manv pelcentage passed to appeared candidates
bits of paper are required ? from semi-urban area the least ?
(A) e (B) 1.2 (A) 2015 (B) 201.6
4..- )-
L
)
34. What approximate value was the 39. Identify the correct spelling out of the given
percentage drop in the number of options :
gg L> semi-urban candidates appeared from
9r9 20"16 to 2077 ? . (A) Managable (B) Manageable
\
(A) 1s (B) 10
tq\
l"r-u1 rP (l .(c) 5 (D) 8 (C) Mangaeble (D) Managible
,.-i ^S
gtv"
35. He was not only accused of theft
of conspiracy.
\ \Y,, 40. "Going by the that many
,
\./. r (A) rather . (B) but also hands make light work, the school
\r (c) but even (D) rather than involved all the students in the
a task." The words that best fill the blanks
in the above sentence are :
\P 36. ,,The dress him so well that
v8 she immediately him on his . (A) principle, principal
appearance." The words that best fill the
blanks in the above sentence are : (B) principal,principle
. (A) complemented, complemented
(B) complimented, complemented
(C) principle,principle
,(D) Time stamp based protocol (A) device that allows wireless devices
to connect to a wired network
(B) wireless devices itself
44 For which one of the following sequences
CAN NOT be a degree sequence of a graph (C) both device that allows wireless
of order 5 ? devices to connect to a wired
network and wireless devices itself
(A) 3,3,2,2,2 (B) 3,3,3,3,2 (D) all the nodes in the network
(c) 3,3,3,2,2 (D) 4,3,3,2,2
0 p- q p- r (A) M
q- p 0 q- , 1S
(B) 2M
r* p r- q 0 (C) logM
(D) None of these
52. An analog signal having 3 kHz bandwidttr 55. For a hamming code of parity bit m=5,
is sampled at 1.5 times the Nyquist rate. what is the total bits and data bits ?
The successive samples are statistically (A) (255,247) (B) (127,71e)
independent. Each sample is quantized
into one of 256 equally likely levels. The (c) (31,26) (D) (0, 8)
information rate of the source is :
(A) 3 kbps (B) 72kbps 57. Which of the following sorting algorithms
(C) 256 kbps (D) 9 kbps has the lowest worst-case complexity ?
(A) Merge sort (B) Bubble sort
53. A bottom-up parser generates
(C) Quick sort , (D) Insertion sort
(A) Rightmostderivation
58. What is WPA ?
(B) Rightrnost derivation in reverse
(A) wi-fi protected access
(C) Leftmostderivation
(B) wired protected access
(D) Leftmost derivation in reverse
(C) wired process access
(B) FonvardEngineering
76. If the Value of Register A:9B h & Carry
(C) Forward Testing :1. What will be the value of Register
(D) ReverseEngineering A after executing the RORC instruction
t 1 time ?
(A) h
AB (B) cD h
72. The maximum number of times the (c) EF h (D) AC h
decrease key operation performed in
Dijkstra's algorithm will be equai 77. Dijkstra's Algorithm cannot be applied on
to
(A) Total number of vertices (A) Directed and weighted graphs
(B) Total number of edges (B) Graphs having negative weight
function
(c) Number of vertices - 1
(c) Unweighted graph
e (D) Number of edges -1 " (D) Undirected and unweighted graphs
80, 100 elements can be sorted in 100 sec using 84. When factorizing the Boolean equation
bubble sort. In -100 sec, approximately
elements can be sorted Y : AE + AB, the result wi1l be :
(A) 100 (B) 200
I
(c) (A) AB (B) AB
300 '(D) 400
,(C) A (D) B
u"x 9 \1" 12
t V7
_7 .--..
()
It
\CIq ;\'ev w g: -\
7r . qW -(a- a 6,y8
87. DELETE [FROM] table IWHERE 93. Convert (503201)5 into (?).
conditionl; from the slmtax if you omit the (A) 121.22231 (B) 11000011
WHERE clause.
(A) A11 rows in the table are deleted'
. (c) 21.22230"t \ (D) 22323307
Atgu + W g tB"
fo u8
q( Bd oo
{_2,
,so L
99. Write Recurrence of Quick Sort in worst 103. What will be the result of following
case, relational algebra expression ?
(A) T(n) :11', - 1, *, ?tA, B (oc:10(R))
(B) r(n) :11,, - 1; * (A)
', Print columns A & B from relation R
(c) r(n) : 2r(n - 1) + n when C = 10
(D) r(n) =r(n/3) +r(2n/2) +n (B) Print C:10 from relation R
(C) Print all data of relation R when
100. Which of the following Boolean
C:10
expressions is not logically equivalent to (D) Print A, B, C from relation B when
all of the rest ? c:10
(A) ab + (qd)' + cd + bd' =l
(B) a (b + c) + cd o v+a,-* ccl 104. The following circuit depicts the
(C) ab + ac + (cd)' implementation of
,tr-A + A{} I
(D) bd' + c'd' + ab + cd g,g
A + $--a i
B
\.)
^')- -t3
A-',1)
Y 131 -
107. The bit rate of digital communication 111. A binary tree of depth K is called a full
system is R kbit/s. The modulation used is binary tree of depth K, if it has exactly
32-QAM. The minimum bandwidth nodes.
required for lSl free transmission is :
(A) K -x(B) 7k
(A) Hz
R/"to (B) R/10 kHz
(c) R/5 Hz (D) R/5 kHz . (c) 2k -'t (D) 2k-1
108. Assume that a DBA issued the {ollowing 112. In machine is executing
create table command :
operating system instruction :
create table A (Aid, .. ..... . .)
. (\) System mode (B) User mode
storage (initial 20480, next 20480,
pctincrease 0 );
Throughput
1.09. II integer means to 2 bytes of storage then x(D)
maximum value of a signed integer is :
(A) 216 - 1. (B) 2't5 - "1
f'" i\ \
v
115. If the size of the logical address space is 118. IAtrhich is the layer that converts packets
2' and the page size is 2n addressing to Frames and Frames to Packets in the
units, then the high order m-n bits of i OSI model ?
logical address designate the
(A) Physical Layer
(A) offset
(B) Data Link Layer
(B) page no
(c) Network Layer
(C) frame no
116. Following are implicitly provided in 119. I4rhat does the following code do ?
C
Frogramming language int a, b; 1 -a b
i
:
/
(.\) Output facility a=a*b; )\
1(r.a "h
(B) lnput facilih, d
b:a-b; 't
(C) Both lnput and Output facility
a: a*b)
(D) No input and Output facility
(A) leavesaandbunchanged
(A)
I:" r t'12
sitr\tlrd\dd 120. The bit transmission rate in a pulse coded
modulation system with number of
quantization levels 8 and maximum signal
(B)
), r [n
12 sin\drd\dd
frequenry 4000Ilz is given by :
(A) kbps
16 (B) 24kbps
(C) 32 kbps (D) 8 kbps
(c)
l: !; I,u sinodrdodg
-o0o-
(D)
I:" !; to 12 cosedrdedd
C/Page l5 SP ACE FOR ROUGH WORK
SB-CS
-lV=IS I
I
tr o 9>sl )
e = 9r*t1 3'"1+ o
\
)-r 6
* \ \9L
+4-
/qS
D
\
6
19 sB' t7 7 L
\1 6o
iass
\
1e4s\
1'loo
Lqa S- o
Y 6 lB -3
qY -?-
I -2-
Y
Y
1 ">
L
C/Page 16 SB-CS
SEAL