The Boolean function in sum of products form where K-map is given below (figure) is:___________

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 ________

Many microprocessors have a specified lower limit on clock frequency (apart from the maximum clock frequency limit) because ______

Many of the advanced microprocessors prefetch instructions and store it in an instruction buffer to speed up processing. This speed up is achieved because _________

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 __________.

In an 11-bit computer instruction format, the size of address field is 4-bits. The computer uses expanding OP code technique and has 5 two-address instructions and 32 two-address instructions and the number of zero-address instructions it can support is _________

Macro expansion is done in pass one instead of pass two in a pass macro assembler because _________

The purpose of instruction location counter in an assembler is _______

Complexity of Kruskal’s algorithm for finding the minimum spanning tree of an undirected graph containing n vertices and m edges if the edges are sorted is __________

Maximum number of edges in a planar graph with n vertices is ________

The operation which is commutative but not associative is:

All digital circuits can be realized using only

Bit-slice processors

PCHL is an instruction in 8085 which transfers the contents of the register pair HL to PC. This is not a very commonly used instruction as it changes the flow of control in rather ‘unstructured’ fashion. This instruction can be useful in implementing.

Start and stop bits do not contain an ‘information’ but are used in serial communication for

Which of the following problems is not NP-hard?

A 2-3 tree is tree such that

(a) all internal nodes have either 2 or 3 children
(b) all paths from root to the leaves have the same length

The number of internal nodes of a 2-3 tree having 9 leaves could be

A non-planar graph with minimum number of vertices has

Following algorithm(s) can be used to sort n integers in the range [1...n³] in O(n) time

At a particular time of computation the value of a counting semaphore is 7. Then 20 P operations and 15 V operations were completed on this semaphore. The resulting value of the semaphore is:

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:

Which of the following is an example of a spooled device?

For a context-free grammar, FOLLOW(A) is the set of terminals that can appear immediately to the right of non-terminal A in some “sentential” form. We define two sets LFOLLOW(A) and RFOLLOW(A) by replacing the word “sentential” by “left sentential” and “right most sentential” respectively in the definition of FOLLOW(A).

Which of the following statements is/are true?

Consider the SLR(1) and LALR (1) parsing tables for a context free grammar. Which of the following statements is/are true?

Which of the following predicate calculus statements is/are valid:

Which of the following is/are tautology

Which of the following regular expression identifies are true?

If G is a context-free grammar and w is a string of length l in L(G), how long is a derivation of w in G, if G is Chomsky normal form?

Context-free languages are

In which of the cases stated below is the following statement true?

 “For every non-deterministic machine M1 there exists an equivalent deterministic machine M2 recognizing the same language“.  

Write short answers to the following:
(i) Which of the following macros can put a macro assembler into an infinite loop?

 .MACRI M1,X .MACRO M2, X
 ..IF EQ,X .IF EQ, X
 M1 X+1 M2X
 .ENDC .ENDC
 .IF NE, X .IF NE, X
 WORD X .WORD X + 1
 .ENDC .ENDC
 .ENDM .ENDM 

Give an example of a call that does so.

Mention the pass number for each of the following activities that occur in a two pass assembler

(a) object code generation
(b) literals added literal table
(c) listing printed
(d) address resolution of local symbols

How many edges are there in a forest with p components having n vertices in all?

Assume that the last element of the set is used as partition element in Quicksort. If n distinct elements from the set [1…..n] are to be sorted, give an input for which Quicksort takes maximum time.

Which page replacement policy sometimes leads to more page faults when size of memory is increased?

(a) Consider addition in two’s complement arithmetic. A carry from the most significant but does not always correspond to an overflow. Explain what is the condition for overflow in two’s complement arithmetic.
(b) A priority encoder accepts three input signals (A, B and C) and produce a two-bit output (X₁,X₀) corresponding to the highest priority active input signal. Assume A has the highest priority followed by B and C has the lowest priority. If none of the inputs are active the output should be 00. design the priority encoder using 4:1 multiplexers as the main components.
(c) Design a 3-bit counter using D-flip flops such that not more than one flip-flop changes state between any two consecutive states.

(a) 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.
(b) Three devices A, B and C are corrected to the bus of a computer, input/output transfers for all three devices use interrupt control. Three interrupt request lines INTR₁, INTR₂ and INTR₃ are available with priority of INTR₁ > priority of INTR₂ > priority of INTR₃.
Draw a schematic of the priority logic, using an interrupt mask register, in which Priority of A > Priority of B > Priority of C.

A microprocessor is capable of addressing 1 megabyte of memory with a 20-bit address bus. The system to be designed requires 256 K bytes of RAM, 256 K bytes of EPROM, 16 I/O devices (memory mapped I/O) and 1 K byte of EERAM (electrically erasable RAM).

(a) Design a memory map (to reduce decoding logic) and show the decoding logic if the components available are:

 Type         Size         Speed
 RAM         6 K × 8     140 n sec
 EPROM       256 K × 8   150 n sec
 EERAM       256 × 8     500 n sec-read 3µsec-write 

(b) The micro processor is operating at 12.5 mHz and provides time equivalent to two clock cycles for memory read and write. Assuming control signals similar to 8085, design the extra logic required for interfacing EERAM.

Consider the function F(n) for which the pseudo code is given below:

     Function F(n)
     begin
     F1 ← 1
     if(n=1) then F ← 3
     else For i = 1 to n do
                       begin
                       C ← 0
     For               j = 1 to F(n – 1) do
                       begin C ← C + 1 end
                       F1 = F1 * C
     end
                       F = F1
     end
     [n is a positive integer greater than zero] 

(a) Derive a recurrence relation for F(n)
(b) Solve the recurrence relation for a closed form solutions of F(n).

Let T be a Depth First Tree of a undirected graph G. An array P indexed by vertices of G is given. P[V] is the parent of vertex V, in T. Parent of the root is the root itself.

Give a method for finding and printing the cycle formed if the edge (u,v) of G not in T (i.e., e ∈ G − T) is now added to T.

Time taken by your method must be proportional to the length of the cycle.

Describe the algorithm in a PASCAL – like language. Assume that the variables have been suitably declared.

Suggest a data structure for representing a subnet S of integers from 1 to n. Following operations on the set S are to be performed in constant time (independent of cardinality of S).

(i) MEMBER(X):       Check whether X is the set S or not
(ii) FIND-ONE(S):    If S is not empty, return one element of the set S 
                     (any arbitrary element will do)
(iii) ADD(X):        Add integer x to set S
(iv) DELETE(X):      Delete integer x from S. 

Give pictorial examples of your data structure. Give routines for these operations in an English like language. You may assume that the data structure has been suitably initialized. Clearly state your assumptions regarding initialization.

(a) What type of parameter passing mechanism (call-by-value, call-by-reference, call-by-name, or-by-value result) is the following sequence of actions truing to implement for a procedure call P(A[i]) where P(i:integer) is a procedure and A is an integer array?

 1. Create a new local variable, say z.
 2. Assign to z the value of A[i].
 3. Execute the body of P using z for A[i]
 4. Set A[i] to z. 

Is the implementation correct? Explain and correct it if necessary. You are supposed to make only small changes.

(b) Show the activation records and the display structure just after the procedures called at lines marked x and y have started their execution. Be sure to indicate which of the two procedures named A you are referring to.

 Program Test;
   Procedure A;
     Procedure B;
       Procedure A;
     ……
   end a;
 begin
   y:A;
   end B;
 begin
   B;
   end A;
 begin
   x:A;
 end Test. 

(a) Write syntax directed definitions (semantic rules) for the following grammar to add the type of each identifier to its entry in the symbol table during semantic analysis. Rewriting the grammar is not permitted and semantic rules are to be added to the ends of productions only.

        D → TL;
        T → int
        T → real
        L → L, id
        L → id   

(b) Write 3-address intermediate code (quadruples) for the following boolean expression in the sequence as it would be generated by a compiler. Partial evaluation of Boolean expressions is not permitted. Assume the usual rules of precedence of the operators.

 (a + b) > (c + d) or a > c and b < d  

(a) Draw the precedence graph for the concurrent program given below:

   S1
   parbegin
       begin
       S2:S4
       end;
       begin
       S3;
       parbegin
       S5;
       begin
          S6:S8
          End
       parend
   end;
   S7
  parend;
  S9  

(b) Let the page reference and the working set window be c c d b c e c e a d and 4, respectively. The initial working set at time t = 0 contains the pages {a, d, e}, where a was referenced at time t = 0, d was referenced at time t = -1, and e was referend at time t = -2. determine the total number of page faults and the average number of page frames used by computing the working set at each reference.

(a) How is redundancy reduced in the following models?

 (i) Hierarchical
 (ii) Network
 (iii) Relational 

Write a one line answer in each case.

(b) 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.

(a) If G is a group of even order, then show that there exists an element a ≠ e, the identity in g, such that a² = e

(b) Consider the set of integers {1,2,3, 4,6,8,12,24} together with the two binary operations LCM (lowest common multiple) and GCD (greatest common divisor). Which of the following algebraic structures does this represent?

 (i) group            (ii) ring
 (iii) field          (iv) lattice  

(a) Uses Modus ponens (A, A →|= B) or resolution to show that the following set is inconsistent:

 (1) Q(x) → P(x)V ~ R(a)
 (2) R(a) ~ Q(a)
 (3) Q(a)
 (4) ~ P(y) 

Where x and y are universally quantified variables, a is a constant and P, Q, R are monadic predicates.

(b) Let S be the set of all integers and let n > 1 be a fixed integer. Define for a, b ∈ S, a R biff a-b is a multiple of n. Show that R is an equivalence relation and finds its equivalence classes for n = 5.

Which of the following three statements are true? Prove your answer.

(i) The union of two recursive languages is recursive.
(ii) The language {O"|n is a prime} is not regular.
(iii) Regular languages are closed under infinite union.