GATE Computer Science and IT Previous Paper

Give me question paper for GATE Computer Science and Information technology examination in a PDF file format ?

[Quick Sam]

Here I am giving you question paper for GATE Computer Science and Information technology examination in a PDF file attached with it .

Q.1 A binary operation ⊕ on a set of integers is defined as 2 2 y x y x + = Å . Which one of the following
statements is TRUE about ⊕?
(A) Commutative but not associative (B) Both commutative and associative
(C) Associative but not commutative (D) Neither commutative nor associative

Q.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 3 cars during any given minute in this interval?
(A) 8/(2e3) (B) 9/(2e3) (C) 17/(2e3) (D) 26/(2e3)

Q.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

Q.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

Q.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(n2)

Q.7 Which one of the following is the tightest upper bound that represents the time complexity of
inserting an object into a binary search tree of n nodes?
(A) O(1) (B) O(log n) (C) O(n) (D) O(n log n)

GATE Computer Science and IT Paper