As you want to get GATE Computer Science Previous Papers for doing preparation of this exam so here I am giving you some questions of that paper:

A priority queue is implemented as a Max-Heap. Initially, it has 5 elements. The level-order
traversal of the heap is: 10, 8, 5, 3, 2. Two new elements 1 and 7 are inserted into the heap in that
order. The level-order traversal of the heap after the insertion of the elements is:
(A) 10, 8, 7, 3, 2, 1, 5 (B) 10, 8, 7, 2, 3, 1, 5
(C) 10, 8, 7, 1, 2, 3, 5 (D) 10, 8, 7, 5, 3, 2, 1

Consider the tree arcs of a BFS traversal from a source node W in an unweighted, connected,
undirected graph. The tree T formed by the tree arcs is a data structure for computing
(A) the shortest path between every pair of vertices.
(B) the shortest path from W to every vertex in the graph.
(C) the shortest paths from W to only those nodes that are leaves of T.
(D) the longest path in the graph.

Which one of the following is TRUE?
(A) The requirements document also describes how the requirements that are listed in the document
are implemented efficiently.
(B) Consistency and completeness of functional requirements are always achieved in practice.
(C) Prototyping is a method of requirements validation.
(D) Requirements review is carried out to find the errors in system design

For full question paper here is the attachment:

GATE Computer Science Previous Papers

Attached Files

GATE Computer Science Previous Papers.pdf (1.30 MB, 84 views)