GATE 2007 IT Solution Keys

I have posted these solution keys here because all the books, available in the market, have lots of wrong solutions. Most of the students, like me, find themselves in dilemma and waste a lot of time in finding the correct keys. These solution keys are those which I had corrected while preparing for GATE Computer Science 2012 Exam. You will find most of these solution keys to be correct, except few for which I could not find the correct solution. Still I suggest you that please keep your mind open while using these keys.

GATE 2007 IT Solution Keys

1.    C
2.    B
3.    D
4.    D
5.    D
6.    A
7.    D
8.    A
9.    A
10.   B
11.   B
12.   C
13.   C
14.   D
15.   D
16.   D
17.   C		 18.   D
19.   D
20.   D
21.   A
22.   D
23.   D
24.   A
25.   C
26.   D
27.   C
28.   D
29.   C
30.   B
31.   C
32.   B
33.   D
34.   C		 35.   A
36.   B
37.   B
38.   C
39.   B
40.   A
41.   B
42.   A
43.   D
44.   B
45.   D
46.   A
47.   D
48.   D
49.   B
50.   B
51.   B		 52.   B
53.   A
54.   B
55.   B
56.   C
57.   C
58.   D
59.   C
60.   A
61.   C
62.   C
63.   D
64.   A
65.   D
66.   C
67.   C
68.   B		 69.   D
70.   A
71.   B
72.   C
73.   C
74.   C
75.   A
76.   D
77.   C
78.   A
79.   C
80.   B
81.   A
82.   B
83.   C
84.   A
85.   A

Comments 1

  1. I have found a quetion from paper of GATE IT 2007 that the answer of the Q.29 is C given by you. I have found it as B. Some other searches shows me the answer D. I would like to know the correct answer. The quetion is as follws:
    When searching for the key value 60 in a binary search tree, nodes containing the key values 10, 20, 40, 50, 70, 80, 90 are traversed, not
    necessarily in the order given. How many different orders are possible in which these key values can occur on the search path from the root to the node containing the value 60?
    (A) 35 (B) 64 (C) 128 (D) 5040

    Reply

Leave a Reply

Your email address will not be published.