gate 2005 computer science engineeringmedia.careerlauncher.com.s3.amazonaws.com/acads... · gate...

CS Branch GATE Paper 2005

Page : 1

GATE 2005

Computer Science Engineering

Q.1 to Q.30 Carry One Mark Each

1. What does the following C-statement declare? int ( *f) (int * );

(A) A function that takes an integer pointer as argument and return an integer (B) A function that takes an integer as argument and an return integer pointer (C) A pointer to a function that takes an integer pointer as argument and returns an integer (D) A function that takes an integer pointer as argument and returns a function pointer

2. An Abstract Data Type (ADT) is

(A) same as an abstract class (B) a data type that cannot be instantiated (C) a data type for which only the operations defined on it can be used, but none else (D) all of the above

3. A common property of logic programming languages and functional languages is

(A) both are procedural language (B) both are based on 1- calculus (C) both are declarative (D) both use Horn-classes

4. Which of the following are essential features of object-oriented programming languages?

(i).Abstraction and encapsulation (ii). Strictly-typedness

(iii).Type- safe property coupled with sub-type rule (iv).Polymorphism in the presence of inheritance

(A) 1 and 2 only (B) 1 and 4 only (C) 1, 2 and 4 only (D) 1, 3 and 4 only


Page : 2

5. A program P reads in 500 integers in the range (0, 100) representing the scores of 500 students. It then prints the frequency of each score above 50. What would be the best way for P to store the frequencies? (A) An array of 50 numbers (B) An array 0f 100 numbers (C) An array of 500 numbers (D) A dynamically allocated array of 550 numbers

6. An undirected graph G has n nodes. Its adjacency matrix is given by an n × n square matrix

whose 1. diagonal elements are 0’s, and 2. non-diagonal elements are 1’s.Which one of the following is TRUE?

(A) Graph G has no minimum spanning tree (MST) (B) Graph G has a unique MST of cost n – 1 (C) Graph G has multiple distinct MSTs, each of cost n – 1 (D) Graph G has multiple spanning trees of different costs

7. The time complexity of computing the transitive closure of a binary relation on a set of n

elements is known to be (A) O (n) (B) O (n log n)

(C) O (n3/2) (D) O (n3)

8. Let A, B and C be non-empty set and let X=(A-B)-C and Y=(A-C)-(B-C)

Which one of the following is TRUE? (A) X=Y (B) YX

(C) XY (D) none of these


Page : 3

9. The following is the Hasse diagram of the poset [{a, b, c, d, e}; ≤],

The poset is

(A) not a lattice (B) a lattice but not a distributive lattice (C) a distributive lattice but not a Boolean algebra (D) a Boolean algebra

10. Let G be a simple connected planar graph with 13 vertices and 19 edges. Then, the number of

faces in the planar embedding of the graph is (A) 6 (B) 8

(C) 9 (D) 13

11. Let G be a simple graph will 20 vertices and 100 edges. The size of the minimum vertex cover of

G is 8. Then, the size of the maximum independent set of G is (A) 12 (B) 8

(C) Less than 8 (D) More than 12

12. Let f(x) be the continuous probability density function of a random variable X. The probability

that a < X ≤b, is (A) f(b-a) (B) f(b) − f(a)

(C) ∫ f(x)dx

(D) ∫ x f(x)dx

13. The set {1, 2, 4, 7, 8, 11, 13, 14} is a group under multiplication modulo 15. The inverses of 4 and 7 are respectively. (A) 3 and 13 (B) 2 and 11

(C) 4 and 13 (D) 8 and 14

b

a

d

e

c


Page : 4

14. The grammar A AA |(A)|e is not suitable for predictive-parsing because the grammar is (A) ambiguous (B) left-recursive

(C) right-recursive (D) an operator-grammar

15. Consider the following circuit

Which one of the following is TRUE?

(A) f is independent of X (B) f is independent of Y (C) f is independent of Z (D) Bone of X. Y, Z is redundant

16. The range of integers that can be represented by an n bit 2’s complement number system is (A) −2 to ( 2 – 1 ) (B) −(2 - 1 ) to (2 – 1) (C) −2 to 2 (D) −(2 + 1 ) to (2 − 1 )

17. The hexadecimal representation of 657 is

(A) 1AF (B) D78

(C) D71 (D) 32F

18. The switching expression corresponding to f ( A,B,C,D)

= ∑(1,4,5,9,11,12,) is (A) BC D + A C D+ AB D (B) ABC +ACD+B C D

(C) ACD + A BC + AC D (D) A BD+ ACD +BCD

f

Z

Y

X


Page : 5

19. Which one of the following is true for a CPU having a single interrupt request line and a single interrupt grant line? (A) Neither vectored interrupt nor multiple interrupting devices are possible (B) Vectored interrupts are not possible but multiple interrupting devices are possible (C) Vectored interrupts and multiple interrupting devices are both Possible (D) Vectored interrupt is possible but multiple interrupting devices are not possible

20. Normally user programs are prevented from handling I/O directly by I/O instructions in them. For CPUs having explicit I/O instructions, such I/O protection is ensured by having the I/O instructions privileged. In a CPU with memory mapped I/O, there is no explicit I/O instruction. Which one of the following is true for a CPU with memory mapped I/O? (A) I/O protection is ensured by operating system routine(s) (B) I/O protection is ensured by a hard ware trap (C) I/O protection is ensured during system configuration (D) I/O protection is not possible

21. What is the swap space in the disk used for?

(A) Saving temporary html pages (B) Saving process data (C) Storing the super-block (D) Storing device drivers

22. Increasing the RAM of a computer typically improves performance because (A) Virtual memory increases (B) Larger RAMs are faster (C) Fewer page faults occur (D) Fewer segmentation faults occur

23. Packets of the same session may be routed through different paths in: (A) TCP, but not UDP (B) TCP and UDP

(C) UDP, but not TCP (D) Neither TCP, nor UDP

24. The address resolution protocol (ARP) is used for:

(A) Finding the IP address from the DNS (B) Finding the IP address of the default gateway (C) Finding the IP address that corresponds to a MAC Address (D) Finding the MAC address that corresponds to an IP Address


Page : 6

25. The maximum window size for data transmission using the selective reject protocol with n bit frame sequence numbers is:

(A) 2n (B) 2n – 1

(C) 2n – 1 (D) 2n – 2

26. In a network of LANs connected by bridges, packets are sent from one LAN to another through

intermediate bridges. Since more than one path may exist between two LANs, packets may have to be routed through multiple bridges. Why is the spanning tree algorithm used for bridge-routing? (A) For shortest path routing between LANs (B) For avoiding loops in the routing paths (C) For fault tolerant (D) For minimizing collisions

27. An organization has a class B network and wishes to form subnets for 64 departments. The subnet

mask would be: (A) 255.255.0.0 (B) 255.255.64.0

(C) 255.255.128.0 (D) 255.255.252.0

28. Which one of the following is a key factor for preferring B+ -trees to binary search trees for

indexing database relations? (A) Database relations have a large number of records (B) Database relations are sorted on the primary key (C) B+ -trees require less memory than binary search trees (D) Data transfer from disks is in blocks

29. Which one of the following statements about normal forms is FALSE? (A) BCNF is stricter than 3NF (B) Loss less, dependency-preserving decomposition into 3NF is always possible (C) Loss less, dependency-preserving decomposition into BCNF is always possible (D) Any relation with two attributes is BCNF

30. Let r be a relation instance with schema R=(A,B,C,D). We define r1=∏A,B,C(r)and r2=∏A.D(r). Let

S =r1 * r2 where * denotes natural join. Given that the decomposition of r into r1 and r2 is lossy, which one of the following is TRUE? (A) s ⊂ r (B) r ∪ s=r

(C) r ⊂ s (D) r*s=s


Page : 7

Q.31 – Q.80 Carry Two Marks Each

31. Consider the following C-program void foo (int n, int sum) { int k = 0, j = 0; if( n = = 0) return; k = n % 10; j = n / 10; sum = sum + k; foo (j, sum); printf (“%d”,k); } What does the above program print?

(A) 8, 4, 0, 2, 14 (B) 8, 4, 0, 2, 0

(C) 2, 0, 4, 8, 14 (D) 2, 0, 4, 8, 0

32. Consider the following C-program

double foo (double); /* Line 1 */ int main() { double da, db; // input da db = foo(da); } double foo(double a) { return a; }

The above code compiled without any error or warning. If Line 1 is deleted, the above code will show (A) no compile warning or error (B) some compiler-warning not leading to unintended results (C) some compiler-warning due to type-mistake eventually leading to unintended results (D) compiler errors

33. Post order traversal of a given binary search tree, T produce the following sequence of keys

10, 9, 23, 22, 27, 25, 15, 50, 95, 60, 40, 29 Which one of the following sequences of keys can be the result of an inorder traversal of the tree T?

(A) 9, 10, 15, 22, 23, 25, 27, 29, 40, 50, 60, 95 (B) 9, 10, 15, 22, 40, 50, 60, 95, 23, 25, 27, 29 (C) 29, 15, 9, 10, 25, 22, 23, 27, 40, 60, 50, 95 (D) 95, 50, 60, 40, 27, 23, 22, 25, 10, 9, 15, 29


Page : 8

34. A Priority-Queue is implemented as a Max-Heap Initially, it has elements. The level- order traversal of the heap is given below 10, 8, 5, 3, 2

Two new elements ‘1’ and ‘7’ are inserted in the heap in that order. The level-order traversal of the heap after the insertion of the elements is

(A) 10, 8, 7, 5 ,3 ,2 ,1 (B) 10, 8, 7, 2, 3, 1, 5

(C) 10, 8, 7, 1, 2, 3, 5 (D) 10, 8, 7, 3, 2, 1, 5

35. How many distinct binary search trees can be created out of 4 distinct keys?

(A) 5 (B) 14

(C) 24 (D) 42

36. In a complete k-ary, every internal node has exactly k children. The number of leaves in such a

tree with n internal nodes is (A) n k (B) (n – 1) k + 1

(C) n(k – 1) + 1 (D) n(k – 1)

37. Suppose T (n) = 2T (n/2) + n, T (0) = T (1) = 1. Which one of the following is FALSE?

(A) T(n) = O(n2) (B) T(n) = θ(n log n)

(C) T(n) = Ω(n2) (D) T(n) = O(n log n)

38. Let G (V, E) an undirected graph with positive edge weights. Dijkstra’s single-source shortest

path algorithm can be implements using the binary heap data structure with time complexity? (A) O ( | V |2 ) (B) O( | E | + |V| log|V| )

(C) O(|V|log|V|) (D) O((|E| + |V|) log |E|

39. Suppose there are log n sorted lists of n/log n elements each. The time complexity of producing

a sorted list of all these elements is : (Hint: Use a heap data structure)

(A) O(n log log n) (B) θ(n log n)

(C) Ω(n log n) (D) Ω(n3/2)

40. Let P, Q, and R be three atomic prepositional assertions. Let X denote RQP )( and Y

denote )()( RQRP .Which one of the following is a tautology? (A) X ≡ Y (B) XY

(C) YX (D) YX


Page : 9

41. What is the first order predicate calculus statement equivalent to the following? Every teacher is liked by some student (A) )]],()()[()()[( xylikesystudentyxteacherx (B) )]],()()[()()[( xylikesystudentyxteacherx (C) )]],()([)()[()( xylikesystudentxteacherxy

(D) )]],()()[()()[( xylikesystudentyxteacherx 42. Let R and S be any two equivalence relations on a non-empty set A. Which one of the following

statements is TRUE? (A) R∪S, R∩S are both equivalence relations (B) RS is an equivalence relation (C) RS is an equivalence relation (D) Neither RS nor RS is an equivalence relation

43. Let f:BC and g:AB be two functions and let h=f o g . Given that h is an onto function.

Which one of the following is TRUE? (A) f and g should both be onto functions (B) f should be onto but g need not be onto (C) g should be onto but f need not be onto (D) both f and g need not be onto

44. What is the minimum number of ordered pairs of no-negative numbers that should be chosen to

ensure that there are two pairs (a, b) and (c, d) in the chosen set such that a ≡ c mod 3 and b ≡ d mod 5 (A) 4 (B) 6

(C) 16 (D) 24

45. Consider three decision problems P , P and P . It is known that P is decidable and P is

undecidable. Which one of the following is TRUE? (A) P is decidable if P is reducible to P (B) P is undecidable if P is reducible to P (C) P is undecidable if P is reducible to P (D) P is decidable if P is reducible to P ’s complement


Page : 10

46. Consider the set H of all 3x3 matrices of the type

e

cd

fb

a

000

Where a, b, c, d, e and f are real numbers and abc ≠ 0. Under the matrix multiplication operation, the set H is

(A) a group (B) a monoid but not a group (C) a semigroup but not a monoid (D) neither a group nor a semigroup

47. Which one of the following graph is NOT planar

(A) G (B) G

(C) G (D) G

퐆ퟏ: 퐆ퟐ:

퐆ퟑ: 퐆ퟒ:


Page : 11

48. Consider the following system of equations in three real variables andxx ,, 21 3 ,x

132 321 xxx

2523 321 xxx

- 34 321 xxx

This system of equation has (A) no solution (B) a unique solution (C) more than one but a finite number of solutions (D) an infinite number of solutions

49. What are the eigen values of the following 2x2 matrix?

2 14 5

(A) -1 and 1 (B) 1 and 6

(C) 2 and 5 (D) 4 and -1

50. Let 2 0

1( ) ( )(1 )

i

iG x g i x

x

,where |x|<1. What is g(i)?

(A) i (B) i+1

(C) 2i (D) 2i

51. Box P has 2 red balls and 3 blue balls and box Q has 3 red balls and 1 blue ball. A ball is selected

as follows: (i) select a box (ii) choose a ball from the selected box such that each ball in the box is equally likely to be chosen. The probabilities of selecting boxes P and Q are 1/3 and 2/3, respectively. Given that a ball selected in the above process is a red ball, the probability that it comes from box P is: (A) 4/19 (B) 5/19

(C) 2/9 (D) 19/30

52. A random bit string of length n is constructed by tossing a fair coin n times and setting a bit to 0

or 1 depending on outcomes head and tail, respectively. The probability that two such randomly generated strings are not identical is (A)

(B) 1 −

(C) !

(D) 1 −


Page : 12

53. Consider the machine M :

The language recognized by M is (A) {w ∈ {a, b} ∗/every a in w is followed by exactly two b′} (B) {w ∈ {a, b} * every a in w is followed by at least two b’} (C) {w ∈ {a, b}* w contains the substring ‘abb’} (D) {w∈ {a,b}* w does not contain ‘aa’ as a substring}

54. Let N and N denote the classes of languages accepted by non-deterministic finite automata and

non-deterministic push-down automata, respectively. Let D and D denote the classes of languages accepted by deterministic finite automata and deterministic push-down automata, respectively. Which one of the following is TRUE? (A) D ⊂ N and D ⊂ N (B) D ⊂ N and D = N

(C) D = N and D = N (D) D = N and D ⊂ N

55. Consider the languages L1= {a b c ∣ n, m > 0} and L = {a b c ∣ n, m > 0}

Which one of the following statement is FALSE? (A) L ∩ L is a context-free language (B) L ∪ L is a context-free language (C) L and L are context-free language (D) L ∩ L is a context sensitive language

56. Let L be a recursive language, and let L be a recursively enumerable but not a recursive

language. Which one of the following is TRUE? (A) L is recursive and L is recursively enumerable (B) L is recursive and L is not recursively enumerable (C) L and L are recursively enumerable (D) L is recursively enumerable and L is recursive

b

a

b

b

a

a,, b

a

a

퐛퐜


Page : 13

57. Consider the languages

L = {ww ∣ w ∈ {0, 1} ∗}

L = {w # w ∣ w ∈ {0, 1} ∗}, where # is a special symbol

L = {ww ∣ w ∈ {0, 1}*}

Which one of the following is TRUE? (A) L is a deterministic CFL (B) L is a deterministic CFL (C) L is a CFL, but not a deterministic CFL (D) L is a deterministic CFL

58. Consider the following two problems on undirected graphs

α : Given G (V, E), does G have an independent set of size ∣V∣-4?

β : Given G (V, E), does G have an independent set of size 5?

Which one of the following is TRUE? (A) α is in the P and β is NP-complete (B) α is NP-complete and β is in P (C) Both α and β are NP-complete (D) Both α and β are in P

59. Consider the grammar E E + n|E × n|n

For a sentence n + n × n, the handles in the right-sentential form of the reduction are (A) n, E + n and E + n × n (B) n, E + n and E + E × n (C) n, n + n and n + n × n (D) n, E + n and E × n

60. Consider the grammar S (S) | a Let the number of states in SLR(1), LR(1) and LALR(1) parsers for the grammar be n1 n2 and n3 respectively. The following relationship holds good (A) n1 < n2 < n3 (B) n1 = n3 < n2

(C) n1 = n2 = n3 (D) n1 ≥ n3 ≥ n2


Page : 14

61. Consider line number 3 of the following C –program. int main( ) { | * Line 1 * | int I,N; | * line 2 * | fro(I=0, I<N,I++); | * Line 3 * | } Identify the compiler’s response about this line while creating the object-module (A) No compilation error (B) Only a lexical error

(C) Only syntactic errors (D) Both lexical and syntactic errors

62. Consider the following circuit involving a positive edge triggered D FF.

Consider the following timing diagram. Let Ai represent the logic level on the line A in the i-th clock period.

let represent the complement of A. the correct output sequence on Y over the clock periods I through 5 is

(A) A A A A A (B) A A A ′A A

(C) A A A A A (D) A A A A A

CLK

X 0 1 2 3 4 5

A

Y

D Q

Q’ CLK

Z

Y


Page : 15

63. The following diagram represents a finite state machine which takes as input a binary number form the least significant bit.

Which one of the following is TRUE? (A) It computes 1 s complement of the input number (B) It computes 2 s complement of the input number (C) It increments the input number (D) It decrements the input number

64. Consider the following circuit

The flip-flops are positive edge triggered D FFs. Each state is designated as a two bit string Q Q . Let the initial state be 00. The state transition sequence is

(A) 00→11→01 (B) 00→11

(C) 00→10→01→11

(D) 00→11→01→10

Y

D

Q’ CLK

Y

A

0/0 0/1

Qa Q0

1/0 1/1


Page : 16

65. Consider a three word machine instruction ADD A[RO] , @B The first operand (destination)"A [RO]" uses indexed addressing mode with R0 as the index register. The second operand (source) “@B” uses indirect addressing mode. A and B are memory addresses residing at the second and the third words, respectively. The first word of the instruction specifies the opcode, the index register designation and the source and destination addressing modes. During execution of ADD instruction, the two operands are added and stored in the destination ( irst operand). The number of memory cycles needed during the execution cycle of the instruction is (A) 3 (B) 4

(C) 5 (D) 6

66. Match each of the high level language statements given on the left hand side with the most

natural addressing mode from those listed on the right hand side. 1. A [1] = B[J]; (a) Indirect addressing 2. while [* A ++]; (b) Indexed addressing 3. int temp = *x; (c) Autoincrement

Codes: (A) (1, C), (2, B), (3, A) (B) (1, A), (2, C), (3, B)

(C) (1, B), (2, C), (3, A) (D) (1, A), (2, B), (3, C)

67. Consider a direct mapped cache of size 32KB with block size 32 Bytes. The CPU generates 32 bit

addresses. The number of bits needed for cache indexing and the number of tag bits are respectively (A) 10, 17 (B) 10, 22

(C) 15, 17 (D) 5, 17

68. A 5 stage pipelined CPU has the following sequence of stages:

IF – Instruction fetch from instruction memory, RD – Instruction decode and register read, EX – Execute: ALU operation for data and address computation, MA – Data memory access – for write access, the register read at RD stage it used, WB – Register write back. Consider the following sequence of instructions: I : L R0, Loc 1; R0 < = M 1oc 1 I : A R0, R0; R0 < = R0 + R0 I : A R2, R0; R2 < = R2 – R Let each stage take one clock cycle.


Page : 17

What is the number of clock cycles taken to complete the above sequence of instructions starting from the fetch of I ? (A) 8 (B) 10

(C) 12 (D) 15

69. A device with data transfer rate 10 KB/sec is connected to a CPU. Data is transferred byte-wise. Let the interrupt overhead be 4 msec. The byte transfer time between the device interface register and CPU or memory is negligible. What is the minimum performance gain of operating the device under interrupt mode over operating it under program controlled mode? (A) 15 (B) 25

(C) 35 (D) 45

70. Consider a disk drive with the following specifications 16 surfaces, 512 tracks/surface, 512

sectors/track, 1 KB/sector, rotation speed 3000 rpm. The disk is operated in cycle stealing mode whereby whenever one byte word is ready it is sent to memory; smilarly, for writing, the disk interface reads a 4 byte word from the memory in each DMA cycle. Memory cycle time is 40 nsec. The maximum percentage of time that the CPU gets blocked during DMA operation is (A) 10 (B) 25

(C) 40 (D) 50

71. Suppose n processes P1, …… , Pn share m identical resource units, which can be reserved and

released one at time. The maximum resource requirement of process Pi is sp where si > 0. Which one of the following is a sufficient condition for ensuring that deadlock does not occur? (A) ∀ i, si < m (B) ∀ i, si < n

(C) ∑ s < ( 푚 + 푛) (D) ∑ s < ( m ∗ n)

72. Consider the following code fragment:if(fork( ) == 0)

{ a = a + 5; printf (′%푑, %푑\푚”, 푎, &푎); } else { a – 5; printf (′%푑, %푑\푛”, 푎, &푎); let u, n be the values printed by the parent process, x, y be the values printed by the child process. Which one of the following is TRUE? (A) u = x + 10 and v = y (B) u = x +10 and v ≠ y

(C) u + 10 = x and v = y (D) u + 10 = x and v ≠ y

73. In a packet switching network, packets are routed from source to destination alone single path

having two intermediate nodes. If the message size is 24 bytes and each packet contains a header of 3 bytes, then the optimum packet size is: (A) 4 (B) 6

(C) 7 (D) 9


Page : 18

74. Suppose the round trip propagation delay for a 10 Mbps Ethernet having 48-bit jamming signal is 46.4 µs. The minimum frame size is (A) 94 (B) 416

(C) 464 (D) 512

75. Let E1 and E2 be two entities in an E/R diagram with simple single-valued attributes. R1 and R2 are two relationships between E1 and E2, where R1 is one-to-many and R2 is many-to-many. R1 and R2 do not have any attributes of their own. What is the minimum number of tables required to represent this situation in the relational model? (A) 2 (B) 3

(C) 4 (D) 5

76. The following table has two attributes A and C where A is the primary key and C is the foreign key referencing A with on-delete cascade.

The set of all tuples that must be additionally deleted to preserve referential integrity when the tuple (2,4) is deleted is:

(A) (3,4) and (6,4) (B) (5,2) and (7,2)

(C) (5,2) (7,2) and (9,5) (D) (3,4) (4,3) and (6,4)


Page : 19

77. The relation book (title, price) contains the titles and prices of different books. Assuming that no two books have the same price, what does the following SQL select title from book as B where (select count (*) fom book as T where T.price>B. Price) <5

(A) Titles of the four most expensive books (B) Title of the fifth most inexpensive book (C) Title of the fifth most expensive book (D) Titles of the five most expensive books

78. Consider a relation scheme R= (A,B,C,D,E,H) on which the following functional dependencies

hold: {A→ B, BC →D, E →C, D →A}. What are the candidate keys of R? (A) AE, BE (B) AE, BE, DE

(C) AEH, BEH, BCH (D) AEH, BEH, DEH

Common Data for Questions Q79 and Q80

Consider the following data path of a CPU.

The, ALU, the bus and all the registers in the data path are of identical size. All operations including incrementation of the PC and the GPRs are to be carried out in the ALU. Two clock cycles are needed for memory read operation – the first one for loading address in the MAR and the next one for loading data from the memory but into the MDR.

ALU

S T

GPRs

PC IR

MDR MAR


Page : 20

79. The instruction “add R0, R1” has the register transfer interpretation R0 < = R0 + R1. The minimum number of clock cycles needed for execution cycle of this instruction is (A) 2 (B) 3

(C) 4 (D) 5

80. The instruction “call Rn, sub” is a two word instruction. Assuming that PC is incremented during

the fetch cycle of the first word of the instruction, its register transfer interpretation is Rn < = PC + 1; PC < = M [PC]; The minimum number of CPU clock cycles needed during the execution cycle of this instruction is (A) 2 (B) 3

(C) 4 (D) 5

Statement for Linked Answer Questions Q81 and Q82

Let s and t be two vertices in a undirected graph G + (V, E) having distinct positive edge weights. Let[X,Y] be a partition of V such that s ∈ X and t ∈ Y. Consider the edge e having the minimum weight amongst all those edges that have one vertex in X and one vertex in Y.

81. The edge e must definitely belong to:

(A) the minimum weighted spanning tree of G (B) the weighed shortest path from s to t (C) each path from s to t (D) the weighted longest path from s to t

82. Let the weight of an edge e denote the congestion on that edge. The congestion on a path is

defined to be the maximum of the congestions on the edges of the path. We wish to find the path from s to t having minimum congestion. Which one of the following paths is always such a path of minimum congestion? (A) a path from s to t in the minimum weighted spanning tree (B) a weighted shortest path from s to t (C) an Euler walk from s to t (D) a Hamiltonian path from s to t


Page : 21

Statement for Linked Answer questions Q83 and Q84

Consider the following expression grammar. The semantic rules for expression calculation are stated next to each grammar production. E number E.val=number.val |퐸 ′ + ′ 퐸 E(1).val = E(2).val + E(3).val |퐸 ′ × ′ E E(1).val = E(2).val × E(3).val

;

83. The above grammar and the semantic rules are fed to a yacc tool (Which is an LALR (1) parser generator) for parsing and evaluating arithmetic expressions. Which one of the following is true about the action of yacc for the given grammar? (A) It detects recursion and eliminates recursion (B) It detects reduce-reduce conflict, and resolves (C) It detects shift-reduce conflict, and resolves the conflict in favor of a shift over a reduce

action (D) It detects shift-reduce conflict, and resolves the conflict in favor of a reduce over a shift

action

84. Assume the conflicts in Part (a) of this question are resolved and an LALR (1) parser is generated for parsing arithmetic expressions as per the given grammar. Consider an expression 3 × 2 + 1. What precedence and associativity properties does the generated parser realize? (A) Equal precedence and left associativity; expression is evaluated to 7 (B) Equal precedence and right associativity; expression is evaluated to 9 (C) Precedence of ′ × ′ is higher than that of ′ + ′, and both operators are left associative;

expression is evaluated to 7 (D) Precedence of ′ + ′ is higher than that of ′ × ′, and both operators are left associative;

expression is evaluated to 9


Page : 22

Statement for Linked Answer Questions Q85 and Q86

We are given 9 tasks T1, T2 ….. T9. The execution of each task requires one unit of time. We can execute one task at a time. Each task Ti has a profit Pi and a deadline di profit Pi is earned if the task is completed before the end of the di

th unit of time.

85. Are all tasks completed in the schedule that given maximum profit? (A) All tasks are completed (B) T1 and T6 are left out

(C) T1 and T8 are left out (D) T4 and T6 are left out

86. What is the maximum profit earned?

(A) 147 (B) 165

(C) 167 (D) 175

Statement for linked Answer Question Q87 and Q88

Consider the following floating point format

Mantissa is a pure fraction is sign – magnitude form.

87. The decimal number 0.239 × 2 has the following hexadecimal representation (without normalization and rounding off : (A) OD 24 (B) OD 4D

(C) 4D OD (D) 4D 3D

88. The normalized representation for the above format is specified as follows. The mantissa has an

implicit 1 preceding the binary (radix) point. Assume that only 0’s are padded in while shifting a field. The normalized representation of the above number (0.239× 2 ) is: (A) OA 20 (B) 11 34

(C) 4D D0 (D) 4A E8

Task T1 T2 T3 T4 T5 T6 T7 T8 T9

Profit 15 20 30 18 18 10 23 16 25

Deadline 7 2 5 3 4 5 2 7 3

Excess – 64 Exponent Mantissa Sign bit

15 14 87 0

gate 2005 computer science engineeringmedia.careerlauncher.com.s3.amazonaws.com/acads... · gate...

Documents