1. A binary operation ⊕ on a set of
integers is defined as x⊕y=x2+y2. Which of
the following statements is TRUE about ⊕?
Next : Gate 2013 computer Science answer key Questions and answers (11-16)
a) Commutative but not associative
b) Both commutative and associative
c) Associative but not commutative
d) Neither commutative nor associative
Answer: a
2. Suppose p is the number of cars per minute passing through a certain road junction between 5 PM and 6 PM, and p has a Poisson distribution with mean 3. What is the probability of observing fewer than three cars during any given minute in this interval?
2. Suppose p is the number of cars per minute passing through a certain road junction between 5 PM and 6 PM, and p has a Poisson distribution with mean 3. What is the probability of observing fewer than three cars during any given minute in this interval?
a) 8/(2e3) b) 9/(2e3) c) 17/(2e3) d) 26/(2e3)
Answer: c
3. Which one of the following is NOT equal
a)
b)
c)
d)
Answer: a
4. The smallest integer that can be represented by an 8-bit number in 2’s complement form is
4. The smallest integer that can be represented by an 8-bit number in 2’s complement form is
a)
-256
b)
-128
c)
-127
d)
0
Answer: b
5.
In the following truth table, V=1 if and only if the input is valid
Inputs
|
Outputs
|
||||||
D0
|
D1
|
D2
|
D3
|
X0
|
X1
|
V
|
|
0
|
0
|
0
|
0
|
X
|
X
|
0
|
|
1
|
0
|
0
|
0
|
0
|
0
|
1
|
|
X
|
1
|
0
|
0
|
0
|
1
|
1
|
|
X
|
X
|
1
|
0
|
1
|
0
|
1
|
|
X
|
X
|
X
|
1
|
1
|
1
|
1
|
|
What function does the truth table represent?
a)
Priority
encoder
b)
Decoder
c)
Multiplexer
d)
Demultiplexer
Answer: a
6.
Which one of the following is the tightest upper bound that represents the
number of swaps required to sort n numbers using selection sort?
a)
O(log n)
b)
O(n)
c)
O(n log n)
d)
O(n3)
Answer: b
7. Which one of the following
is the tightest upper bound that represents the time complexity of inserting an
object a binary search tree of n nodes?
a) O(1)
b) O(log n)
c) O(n)
d) O(n log n)
Answer: c
8. Consider the languages L1=Φ and L2={a}. Which one
of the following represents L1L2*U L1*
?
a) {ε}
b) Φ
c) a*
d) { ε, a}
Answer: a
9.
What is the maximum number of reduce moves that can be taken by a bottom-up
parser for a grammar with no epsilon and unit-production, to parse a string
with no tokens?
a)
n/2
b)
n-1
c)
2n-1
d) 2n
Answer: c
10. A scheduling algorithm assigns priority proportional
to the waiting time of a process. Every process start with a priority zero (the
lowest priority ). The scheduler re-evaluates the process priorities every T
time units and decides the process to schedule. Which one of the following is
TRUE if the process have no I/O operations and all arrive at time zero?
a) This algorithm is equivalent to the first-come-first-serve
algorithm
b) This algorithm is equivalent to the round-robin
algorithm
c) This algorithm is equivalent to the
shortest-job-first algorithm
d) This algorithm is equivalent to the shortest-remaining-time-first
algorithm
Answer: bNext : Gate 2013 computer Science answer key Questions and answers (11-16)
No comments:
Post a Comment