1.

The following sequence of operations is performed on a stack: PUSH (10), PUSH (20), POP, PUSH (10), PUSH (20), POP, POP, POP, PUSH (20), POP The sequence of values popped out is: (a) 20, 10, 20, 10, 20 20, 10 (b) 20, 20, 10, 10, 20 (c) 10, 20, 20, 10, 20 (d) 20, 20, 10,

2.The weighted external path length of the binary tree in figure is _____

3. The arithmetic expression : (a+ b )* c -d / e** f is to be evaluated on a two- address machine, where each operands, the number of registers required to evaluate this expression is ______. The number of memory access of operand is __________. 4.For the 8086 microprocessor: (A) RQ/GT (P) Used by processor for holding the bus for consecutive instruction cycles. (B) LOCK (Q) Used for extending the memory or I/O cycle times (C) HOLD (R) Used for getting hold of processor bus in minimum bus mode (D) READY (S) Used for requesting processor bus in minimum bus mode. 5.The total size of address space is a virtual memory systems is limited by (a) the length of MAR (b) the available secondary storage (c) the available main memory (d) all of the above (e) none of the above 6.The TRAP interrupt mechanism of the 8085 microprocessor: (a) executes an instruction supplied by an external device through the INTA signal (b) executes an instruction from memory location 20H (c) executes a NOP (d) none of the above 7. The ALE line of an 8085 microprocessor is used to: (a) latch the output of an I/O instruction into an external latch (b) deactivate the chip-select signal from memory devices (c) latch the 8 bits of address lines AD7-AD0 into an external latch (d) find the interrupt enable status of the TRAP interrupt (e) None of the above 8.Indicate all the true statements from the following: (a) Recursive descent parsing cannot be used for grammar with left recursion. (b) The intermediate form the representing expressions which is best suited for code optimization is the post fix form. (c) A programming language not supporting either recursion or pointer type does not need the support of dynamic memory allocation. (d) Although C does not support call by name parameter passing, the effect can be correctly simulated in C. (e) No feature of Pascal violates strong typing in Pascal.

9. If F1 F2 and

F3

are propositional formulae

such that
are both tautologies, then which of the following is true: (a) Both F1 and F2 are tautologies (b) The conjunction F1 F2 is not satisfiable (c) Neither is tautologous (d) Neither is satisfiable (e) None of the above 10Which one of the following is the strongest correct statement about a finite language over some finite alphabet ? (a) It could be undecidable (b) It is Turing-machine recognizable (c) It is a context-sensitive language (d) It is a regular language (e) None of the above 11.Find the maximum clock frequency at which the counter in figure, can be operated. Assume that the propagation delay through each flip-flop and AND gate is 10 ns. Also assume that the setup time for the JK inputs of the flip- flops is negligible.

12.Consider a 3-bit error detection and 1-bit error correction hamming code for 4-bit date. The extra parity bits required would be ________ and the 3-bit error detection is possible because the code has a minimum distance of ________ 13.A simple and reliable data transfer can be accomplished by using the handshake protocol. It accomplishes reliable data transfer because for every data item sent by the transmitter __________. 14.All digital circuits can be realized using only (a) Ex-OR gates (b) Multiplexers (c) Half adders (d) OR gates 15.Which of the following problems is not NP-hard? (a) Hamiltonian circuit problem (b) The 0/1 Knapsack problem (c) Finding bi-connected components of a graph (d) The graph colouring problem 16. A computer system has 6 tape drives, with n process completing for them. Each process may need 3 tape drives. The maximum value of n for which the system is guaranteed to be deadlock free is: (a) 2 (b) 3 (c) 4 (d) 1 17.Which of the following regular expression identifies are true?

18.The access times of the main memory and the Cache memory, in a computer system, are 500 n sec and 50 n sec, respectively. It is estimated that 80% of the main memory request are for read the rest for write. The hit ratio for the read access only is 0.9 and a write-through policy (where both main and cache memories are updated simultaneously) is used. Determine the average time of the main memory. 19.Suppose we have a database consisting of the following three relations: FREQUENTS (CUSTOMER, HOTEL) SERVES (HOTEL, SNACKS) LIKES (CUSTOMER, SNACKS) The first indicates the hotels each customer visits, the second tells which snacks each hotel serves and the last indicates which snacks are liked by each customer. Express the following query in relational algebra: print the hotels that serve a snack that customer Rama likes. 20.For the initial state of 000, the function performed by the arrangement of the J-K flip-flops in figure is:

(a) Shift Register None of the above

(b) Mod-3 Counter

(c) Mod-6 Counter

(d) Mod-2 Counter

(e)

21.A certain moving arm disk storage, with one head, has the following specifications. Number of tracks/recording surface = 200 Disk rotation speed = 2400 rpm Track storage capacity = 62,500 bits The average latency of this device is P msec and the data transfer rate is Q bits/sec. Write the value of P and Q. 22.In the three-level memory hierarchy shown in the following table, pi denotes the probability that an access request will refer to Mi

If a miss occurs at level Mi , a page transfer occurs from M i+1 to M i and the average time required for such a page swap is Ti . Calculate the average time tA required for a processor to read one word from this memory system. 23.An ISAM (indexed sequential) file consists of records of size 64 bytes each, including key field of size 14 bytes. An address of a disk block takes 2 bytes. If the disk block size is 512 bytes and there are 16 K records, compute the size of the data and index areas in terms of number of blocks. How many levels of tree do you have for the index? 24.Draw the state transition of a deterministic finite state automaton which accepts all strings from the alphabet {a,b } , , such that no string has 3 consecutive occurrences of the letter b.

25.Let ({p,q},*) be a semigroup where p p=q . Show that: 1. p * q= q * p and 2. q * q = q