2018 2019 EduVark GATE (Computer Science) Previous Papers

#1
April 13th, 2015, 10:36 AM
 Unregistered Guest User Posts: n/a
GATE (Computer Science) Previous Papers

I want to get GATE Computer Science Previous Papers for doing preparation of this exam so will you please provide me that ?
 Similar Threads Thread Thread Starter Forum Replies Last Post Unregistered General Discussion 1 April 7th, 2017 05:07 PM Unregistered General Discussion 0 August 17th, 2015 09:28 AM Unregistered General Discussion 0 June 5th, 2015 02:40 PM Unregistered General Discussion 1 July 21st, 2014 10:48 AM Unregistered General Discussion 1 July 16th, 2014 12:41 PM soniya11 General Discussion 2 July 16th, 2014 12:15 PM Unregistered General Discussion 1 July 16th, 2014 08:21 AM Unregistered General Discussion 1 July 14th, 2014 04:58 PM Unregistered General Discussion 1 July 13th, 2014 01:44 PM Unregistered General Discussion 1 July 4th, 2014 03:46 PM Unregistered General Discussion 1 July 4th, 2014 09:59 AM Unregistered General Discussion 1 June 26th, 2014 09:43 AM Unregistered General Discussion 1 June 21st, 2014 05:00 PM Unregistered General Discussion 1 June 20th, 2014 10:26 AM RICHARD MORACHA General Discussion 1 February 9th, 2013 11:13 AM

#2
April 13th, 2015, 03:29 PM
 Nitin Sharma Super Moderator Join Date: Mar 2012 Posts: 23,403
Re: GATE (Computer Science) Previous Papers

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, 10 views)

 Forum Jump User Control Panel Private Messages Subscriptions Who's Online Search Forums Forums Home Education Discussion     General Discussion     Entrance Exams     Career and Jobs

All times are GMT +5.5. The time now is 11:03 AM.

 Contact Us - EduVark - Archive - Top Partners : StudyChaCha | Management Forum