Indian Institute of Technology Mumbai (IIT-M) 2005 M.E Information Technology GATE IT - Question Paper

(C) S5 =Ti + (12 + 14) .T3&SiO = (12 + 13 + 14) .T2 + (Ii + 13) .T4+ (12 + 14). T5
(D) S5 = Ti + (12 + 14) . T3 & Sb = (12 + 13) . T2 + 14. T3 +(Ii + 13) . T4 + (12 + 14) . T5
46. A line L in a circuit is stated to have a stuck at 0 fault if the lien permanently has a logic
value 0. Similarly a line L in a circuit is stated to have a stuck at one fault if the line permanently
has a logic value 1. a circuit is stated to have a multiple stuck at fault if 1 or more lines have
stuck at faults. The total number of distinct multiple stuck at faults possible in a circuit with N
lines is:
(A) 3” (B) 3”' — one (C) 2”' — one (D) 2”'
(A) (1053.6)8
(B) (1053.2)8
(C) (1024.2)8
(D) None of these

49. An instruction set of a processor has 125 signals which can be divided into five groups of
mutually exclusive signals as follows:
Group 1: 20 signals, Group 2: 70 signals, Group 3: two signals, Group 4: 10 signals, Group 5:
23 signals.
How many bits of the control words can be saved by using vertical microprogramming over
horizontal microprogramming?
(A) 0
(B) 103
(C) 22
(D)55
50. In a binary tree, for every node the difference ranging from the number of nodes in the left
and right subtrees is at most 2. If the height of the tree is h > 0, then the minimum number
of nodes in the tree is:
(A) T(n)=8(logn)
(C) T(n)=8(n)
(B) T(fl)r=8(fi)
(D) T(n) = 8(nlogn)
52. Let G be a weighted undirected graph and e be an edge with maximum weight in G.
Suppose there is a minimum weight spanning tree in G containing the edge e. Which of the
subsequent statements is always TRUE?
(A) There exists a cutest in G having all edges of maximum weight
(B) There exits a cycle in G having all edges of maximum weight
(C) Edge e cannot be contained in a cycle
(D) All edges in G have the identical weight
53. The subsequent C function takes 2 ASCII strings and determines whether 1 is an
anagram of the other. An anagram of a string s is a string found by permuting the letters in
s.
mt anagram (char *a, char *b){

Earning:   Approval pending.