Looking for GATE-2015 previous question papers? CS01 Computer Science and Information Technology 2015 GATE question paper is given here under. You can download this question paper for preparing your upcoming GATE-2016 exams.
Exam Type: GATE-2016
Department : CS01 Computer Science and Information Technology
Question Paper Type : 2015 GATE Previous / Old Exam Paper
Attachment Type : PDF
Some Samples of PDF file is given below:
Q. 3 Match the following:
(P) Prim’s algorithm for minimum spanning tree (i) Backtracking
(Q) Floyd-Warshall algorithm for all pairs shortest paths (ii) Greedy method
(R) Mergesort (iii) Dynamic programming
(S) Hamiltonian circuit (iv) Divide and conquer
(A) P-iii, Q-ii, R-iv, S-i (B) P-i, Q-ii, R-iv, S-iii
(C) P-ii, Q-iii, R-iv, S-i (D) P-ii, Q-i, R-iii, S-iv
Q.5 The height of a tree is the length of the longest root-to-leaf path in it. The maximum and minimum
number of nodes in a binary tree of height 5 are
(A) 63 and 6, respectively (B) 64 and 5, respectively
(C) 32 and 6, respectively (D) 31 and 5, respectively
Exam Type: GATE-2016
Department : CS01 Computer Science and Information Technology
Attachment Type : PDF
Some Samples of PDF file is given below:
Q. 3 Match the following:
(P) Prim’s algorithm for minimum spanning tree (i) Backtracking
(Q) Floyd-Warshall algorithm for all pairs shortest paths (ii) Greedy method
(R) Mergesort (iii) Dynamic programming
(S) Hamiltonian circuit (iv) Divide and conquer
(A) P-iii, Q-ii, R-iv, S-i (B) P-i, Q-ii, R-iv, S-iii
(C) P-ii, Q-iii, R-iv, S-i (D) P-ii, Q-i, R-iii, S-iv
Q.5 The height of a tree is the length of the longest root-to-leaf path in it. The maximum and minimum
number of nodes in a binary tree of height 5 are
(A) 63 and 6, respectively (B) 64 and 5, respectively
(C) 32 and 6, respectively (D) 31 and 5, respectively
0 comments:
Pen down your valuable important comments below