GATE CS Computer Science Question Paper 2014 Answers Solution Free Download PDF 2014 Free Download PDF.
GATE i.e. Graduate Aptitude Test in Engineering Computer Science 2014 Exam Has been Conducted by IISc Bangalore IIT Bombay IIT Delhi IIT Guwahati IIT Kanpur IIT Kharagpur IIT Madras IIT Roorkee. This GATE CS 2014 examination is the procedure to get the admission in M.Tech
GATE Computer Science i.e. CS Question Paper, This GATE CS 2014 Question will help all the students for their exam preparation, here the question type is MCQ i.e multiple choice question answers, if this GATE CS 2014 question paper in pdf file for GATE CS you can download it in FRCS, if GATE Computer Science 2014 paper in text for GATE CS you can download GATE CS 2014 page also just Go to menu bar, Click on File->then Save.
GATE CS 2014 Question paper Free Download PDF is available in www.oldquestionpapers.net which has been provided by many students this GATE Computer Science 2014 paper is available for all the students in FRCS and also GATE CS 2014 question paper fully solved i.e with answer keys and solution.
You can get daily updates on GATE CS 2014 from www.oldquestionpapers.net here you can also check similar links for other related study materials on GATE Computer Science exam. Here GATE CS 2014 question is also available in English.
GATE CS Question Paper 2014 Answers
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