GATE Computer Science Exam Question Paper

Will you please provide the question paper of GATE exam for Computer Science stream?

[Quick Sam]

Here I am providing few questions of GATE Computer Science exam.
Which of the following transport layer protocols is used to support electronic mail?
(A) TCP
(B) IP
(C) SMTP
(D) UDP

In the IPv4 addressing format, the number of networks allowed under Class C addresses
(A) 214
(B) 27
(C) 224
(D) 221

Let G be a simple undirected planar graph on 10 vertices with 15 edges. If G is a connected graph,then the number of bounded faces in any embedding of G on the plane is equal to
(A) 3
(B) 4
(C) 5
(D) 6

Let W(n) and A(n) denote respectively, the worst case and average case running time of an algorithm executed on an input of size n. Which of the following is ALWAYS TRUE?
(A) A(n) = Ω (W(n))
(B) A(n) = Θ (W(n))
(C) A(n) = O (W(n))
(D) A(n) = o (W(n))

The amount of ROM needed to implement a 4 bit multiplier is
(A) 64 bits
(B) 128 bits
(C) 1 Kbits
(D) 2 Kbits
GATE Computer Science Question Paper




For more questions, here I am giving attachment

Will you please provide the question paper of GATE exam for Computer Science stream?

[Arun Vats]

Here I am providing few questions of GATE Computer Science exam.
1. Fill in the blanks:

(ii) Consider a 3-bit error detection and 1-bit error correction hamming code for
4-bit date. The extra parity bits required would be _________ and the 3-bit
error detection is possible because the code has a minimum distance of

(iii) Many microprocessors have a specified lower limit on clock frequency (apart
from the maximum clock frequency limit) because ______

(iv) Many of the advanced microprocessors prefetch instructions and store it in
an instruction buffer to speed up processing. This speed up is achieved
because __________

(v) A simple and reliable data transfer can be accomplished by using the
‘handshake protocol’. It accomplishes reliable data transfer because for every
data item sent by the transmitter ___________

(vi) In an 11-bit computer instruction format, the size of address field is 4-bits.
The computer uses expanding OP code technique and has S two-address
instructions and 32 two-address instructions and the number of zero-address
instructions it can support is __________

(vii)Macro expansion is done in pass one instead of pass two in a pass macro
assembler because _______

(viii) The purpose of instruction location counter in an assembler is ________

(ix) Complexity of Kruskal’s algorithm for finding the minimum spanning tree of
an undirected graph containing n vertices and m edges if the edges are
sorted is _______

(x) Maximum number of edges in a planar graph with n vertices is _________






For questions, here I am giving attachment