SB-CS Set A (1)
SB-CS Set A (1)
©ê◊ËŒflÊ⁄U ∑§Ê ŸÊ◊/Name of Candidate : ________________________ ©ê◊ËŒflÊ⁄U ∑§ „SÃÊˇÊ⁄U/Signature of Candidate : ___________________
PART - A 6. Rakesh is standing at a point. He walks
20 m towards the East and further 10 m
GENERIC towards the South, then he walks 35 m
towards the West and further 5 m towards
the North, then he walks 15 m towards
Directions (1-2) : Use following diagrams to the East. What is the straight distance in
answer question number 1 to 2 : metres between his starting point and the
point where he reached last ?
(A) 0 (B) 5
(C) 10 (D) 15
(C) T(n)=2T(n−1)+n
48. The following type definition is for
(D) T(n)=T(n/3)+T(2n/2)+n
a __________.
type pointer=↑node
44. y=10 cos (1800 πt)+20 cos (2000 πt) node = record
+10 cos (220 πt). Find the modulation
index (µ) of the given wave. data : integer
link : pointer
(A) 0.3 (B) 0.5
(C) 0.7 (D) 1
end;
(A) Structure
45. Match the following :
(B) Link List
List - I List - II (C) Stack
W. Condition coverage 1. Black-box testing
(D) Doubly link list
X. Equivalence class 2. System testing
partitioning
Y. Volume testing 3. White-box testing 49. Let P(x) be “x is perfect”, F(x) be “x is your
friend” and the domain be all people. The
Z. Alpha testing 4. Performance testing
statement, “At least one of your friends is
(A) W-2, X-3, Y-1, Z-4 perfect” is :
(B) W-3, X-4, Y-2, Z-1 (A) ∀x (F(x) → P(x))
(C) entity
56. The maximum number of times the
(D) structured analysis decrease key operation performed in
Dijkstra’s algorithm will be equal
to __________.
(C) frame no
(D) physical address
(A) 1−2−3−4−5−6−7−8−
70. A bottom-up parser generates __________. 6−4−2−8−1
(A) Rightmost derivation (B) 1−2−3−4−5−6−7−8
(C) 1−2−3−4−5−6−7−8−
(B) Rightmost derivation in reverse 1
(C) Leftmost derivation (D) 8−7−6−5−4−3−2−1
78. Which of the following sorting algorithms 82. The equivalent relational algebra
has the lowest worst-case complexity ? expression for the query “Find the names
of suppliers who supplied all the items to
(A) Merge sort (B) Bubble sort all the customers”.
(A) ¬ t/t ∈ supplier (Q(t))
(C) Quick sort (D) Insertion sort
(B) ∀ t [ Sname] / t ∈ supplier (Q(t))
(C) t/¬ t ∈ supplier (Q(t))
(D) ∀ t / ( ~Q(t))
79. A protected variable which can be
accessed and changed by particular set of
operation is called : 83. The number of un-labeled non-isomorphic
graphs with four vertices is :
(A) interrupt (B) monitor
(A) 12 (B) 11
(C) semaphore (D) IPC (C) 10 (D) 9
(C) R/5 Hz (D) R/5 kHz (C) Both Input and Output facility
(D) No input and Output facility
(A) device that allows wireless devices (C) Print all data of relation R when
to connect to a wired network C=10
(B) wireless devices itself (D) Print A, B, C from relation B when
(C) both device that allows wireless C=10
devices to connect to a wired
network and wireless devices itself
109. What does the following code do ?
(D) all the nodes in the network
int a, b;
105. A sequence of statement of the form x=y a=a+b;
op z is called a :
b=a−b;
(A) Three address code
a=a−b;
(B) Syntax tree
(C) Postfix notation (A) leaves a and b unchanged
(D) Operator (B) a doubles and stores in a
(C) b doubles and stores in a
106. One root of x3−x−4=0 lies in (1, 2). In
(D) Exchanges a and b
bisection method, after first iteration the
root lies in the interval __________.
(A) (1, 1.5) 110. In __________, machine is executing
(B) (1.5, 2) operating system instruction :
(C) (1.25, 1.75) (A) System mode (B) User mode
(D) (1.75, 2)
(C) Normal mode (D) Safe mode
(A) 9D (B) 42
119. Integration testing, Unit Testing & System
(C) DF (D) DE
Testing are __________ .
(A) Fundamental logic of Testing
115. If A and B are two sets. A binary relation (B) Level Testing
from set A and set B is any subset of
the __________. (C) Core Testing
(D) Testing Suites
(A) Cartesian Product A×B
(B) Union A ∪ B
120. Let Bn denote the number of full binary
(C) Intersection A ∩ B trees with n vertices. Then a recurrence
(D) Addition A+B relation for Bn is :
(A) Bn=Bn−1 +O(1)
(B) Bn=2Bn−1 +O(1)
116. Which notation gives the lower bound of
a function ? (C) Bn=Bn−1 +O(n)
(B) ○ - notation
-o0o-
(C) Ω - notation
(D) None of the these