GATE Computer Science Last year Question Papers

Can you give me question paper for computer science subject of Graduate Aptitude Test in Engineering (GATE) ?

[Quick Sam]

Here I am giving you question paper for computer science subject of Graduate Aptitude Test in Engineering (GATE) below :

Q.1 Consider the following logical inferences.
I1: If it rains then the cricket match will not be played.
The cricket match was played.
Inference: There was no rain.
I2: If it rains then the cricket match will not be played.
It did not rain.
Inference: The cricket match was played.
Which of the following is TRUE?
(A) Both I1 and I2 are correct inferences
(B) I1 is correct but I2 is not a correct inference
(C) I1 is not correct but I2 is a correct inference
(D) Both I1 and I2 are not correct inferences

Q.2 Which of the following is TRUE?
(A) Every relation in 3NF is also in BCNF
(B) A relation R is in 3NF if every non-prime attribute of R is fully functionally dependent on every
key of R
(C) Every relation in BCNF is also in 3NF
(D) No relation can be in both BCNF and 3NF
Q.3 What will be the output of the following C program segment?
char inChar = ‘A’ ;
switch ( inChar ) {
case ‘A’ : printf (“Choice A\ n”) ;
case ‘B’ :
case ‘C’ : printf (“Choice B”) ;
case ‘D’ :
case ‘E’ :
default : printf ( “ No Choice” ) ; }
(A) No Choice
(B) Choice A
(C) Choice A
Choice B No Choice
(D) Program gives no output as it is erroneous

Q.4 Assuming P ≠ NP, which of the following is TRUE?
(A) NP-complete = NP (B) NP-complete ∩ P = 
(C) NP-hard = NP (D) P = NP-complete
Q.5 The worst case running time to search for an element in a balanced binary search tree with n2n
elements is
(A) Θ (n log n) (B) Θ (n2n) (C) Θ (n) (D) Θ (log n)
2012 COMPUTER SCIENCE & INFORMATION TECH. – CS
CS-A 3/20

Q.6 The truth table
X Y f (X, Y)
0 0 0
0 1 0
1 0 1
1 1 1
represents the Boolean function
(A) X (B) X + Y (C) X  Y (D) Y

Q.7 The decimal value 0.5 in IEEE single precision floating point representation has
(A) fraction bits of 000…000 and exponent value of 0
(B) fraction bits of 000…000 and exponent value of −1
(C) fraction bits of 100…000 and exponent value of 0
(D) no exact representation

Q.8 A process executes the code
fork();
fork();
fork();
The total number of child processes created is
(A) 3 (B) 4 (C) 7 (D) 8

Q.9 Consider the function f(x) = sin(x) in the interval x  [π/4, 7π/4]. The number and location(s) of the
local minima of this function are
(A) One, at π/2
(B) One, at 3π/2
(C) Two, at π/2 and 3π/2
(D) Two, at π/4 and 3π/2

Q.10 The protocol data unit (PDU) for the application layer in the Internet stack is
(A) Segment (B) Datagram (C) Message (D) Frame

Q.11 Let A be the 2 × 2 matrix with elements a11 = a12 = a21 = +1 and a22 = −1. Then the eigenvalues of
the matrix A19 are
(A) 1024 and −1024 (B) 1024√2 and −1024√2
(C) 4√2 and −4√2 (D) 512√2 and −512√2

GATE Computer Science Question Papers

I will write the next GATE exam for the first time. Will you please share the last year GATE computer science paper so I can understand the pattern for the exam?

[Quick Sam]

As per your request, I am forwarding you 2015 question paper of the GATE computer science exam with solution, hope it helps you.

Didn’t you buy _________ when you went shopping?
(A) any paper (B) much paper (C) no paper (D) a few paper
Answer: (A)

Which of the following combinations is incorrect ?
(A) Acquiescence – Submission
(B) Wheedle – Roundabout
(C) Flippancy – Lightness
(D) Profligate – Extravagant
Answer: (B)

Which of the following options is the closest in meaning to the sentence below?
She enjoyed herself immensely at the party.
(A) She had a terrible time at the party.
(B) She had a horrible time at the party.
(C) She had a terrific time at the party
(D) She had a terrifying time at the party
Answer: (C)

Based on the given statements, select the most appropriate option to solve the given question. If two floors in a certain building are 9 feet apart, how many steps are there in a set of stairs that extends from the first floor to the second floor of the building?
Statements:
(I) Each step is ¾ foot high.
(II) Each step is 1 foot wide.
(A) Statement I alone is sufficient, but statement

II alone is not sufficient.
(B) Statement II alone is sufficient, but statement I alone is not sufficient.
(C) Both statements together are sufficient, but neither statement alone is sufficient.
(D) Statement I and II together are not sufficient.
Answer: (D)

Which one of the following is True at any valid state in shift-reduce parsing?
(A) Viable prefixes appear only at the bottom of the stack and not inside
(B) Viable prefixes appear only at the top of the stack and not inside
(C) The stack contains only a set of viable prefixes
(D) The stack never contains viable prefixes
Answer: (B)

For computers based on three-address instruction formats, each address field can be used to specify which of the following:
S1: A memory operand
S2: A processor register
S3: An implied accumulator register
(A) Either S1 or S2 (B) Either S2 or S3
(C) Only S2 and S3 (D) All of S1, S2 and S3
Answer: (A)

Suppose two hosts use a TCP connection to transfer a large file. Which of the following
Statements is/are FALSE with respect to the TCP connection?
I. If the sequence number of a segment is m, then the sequence number of the subsequent segment is always m+1.
II. If the estimated round trip time at any given point of time is t sec, the value of the retransmission timeout is always set to greater than or equal to t ec.
III. The size of the advertised window never changes during the course of the TCP connection.
IV. The number of unacknowledged bytes at the sender is always less than or equal to the advertised window
(A) III only (B) I and III only (C) I and IV only
(D) II and IV only
Answer: (B)
GATE Computer Science 2015 solved paper





For complete question paper and their solution, download the attachment.