PC Design (a) Briefly portray the distinctions between a chip's point of interaction transport, a framework I/O transport (like PCI), and a fringe interface. Consider the transfer speed qualities and actual execution of each. [8 marks] (b) Show how four 64Mbit byte-wide DRAM chips could be connected to a basic 32-cycle microchip. Give a schematic graph showing the associations, and a timing graph to exhibit the activity of the control signals. [8 marks] (c) Why could gets to consecutive DRAM addresses be dealt with uniquely in contrast to non-successive ones? [4 marks] 2

3 Digital Communication I (a) Define the term multiplexing as applied to correspondence frameworks. [4 marks] (b) Describe three kinds of multiplexing, recognizing for each situation (I) systems by which images are related with specific channels; (ii) components by which transmitters are relegated channel asset; (iii) attributes of the multiplexed channels; (iv) applications which are fit to the sort of multiplexing.

Give a concise portrayal of the fundamental highlights of either Lex and Yacc or the relating Java instruments JLex and Cup. [5 + 5 marks] Represent their utilization by framing how you would build a parser for articulations made out of identifiers, whole numbers, unary less and paired administrators +, , and/. Your parser is supposed to make a parse tree in an arrangement of your decision addressing the articulation that is introduced to it. In the event that it helps, you might expect that articulations will be ended by composing a semicolon after them.

Portray exhaustively both Prim's and Kruskal's calculations for seeing as a base expense spreading over tree of an undirected chart with edges marked with positive expenses, and make sense of why they are right. [7 marks each] Look at the overall benefits of the two calculations. [6 marks] 7 Operating System Functions For what reason is it significant for a working framework to plan plate demands? [4 marks] Momentarily portray every one of the SSTF, SCAN and C-SCAN circle booking calculations. Which issue with SSTF truly does SCAN look to survive? Which issue with Check does C-SCAN look to survive? [5 marks] Consider a Winchester-style hard circle with 100 chambers, 4 twofold sided platters also, 25 areas for every track. Coming up next is the (time-requested) grouping of solicitations for circle areas: { 3518, 1846, 8924, 6672, 1590, 4126, 107, 9750, 158, 6621, 446, 11 } The circle arm is at present at chamber 10, moving towards 100. For every one of SSTF, Output and C-SCAN, provide the request wherein the above solicitations would be adjusted. [3 marks] Which variables do the above circle arm planning calculations overlook? How should these be considered? [4 marks] Talk about manners by which a working framework can build sensible volumes which are (a) more dependable and (b) better execution than the basic equipment.

Allow N to be the normal numbers {0, 1, 2 . . .}. What is implied by every one of the accompanying assertions? The subset S N is recursive. The subset S N is recursively enumerable. [5 marks] How might you broaden the meaning of recursive specification to sets of processable capacities? [3 marks] An arrangement of normal numbers is an all out work s : N N. The grouping is recursive if and provided that s is calculable. A limited arrangement of regular numbers is determined by a couple (l, x), where l N is the quantity of components, and x : [1, l] N is a capacity that characterizes those components. The case l = 0 characterizes the invalid succession. In every one of the accompanying cases, lay out whether the set characterized is recursively enumerable: (a) the arrangement of all recursive subsets of N [5 marks] (b) the arrangement of all recursive groupings of regular numbers [2 marks] (c) the arrangement of all limited successions of normal numbers

: Compose program that adds a succession of numbers to an exhibit and that figures the exchanging amount of all components in the cluster. a Java program that peruses a 1D cluster of whole numbers from standard info and brings it back.

Characterize the outright mistake x and relative blunder x in addressing a number x. How are these mistakes related? Which sort of blunder is related with the term loss of importance? Characterize machine epsilon m.

Believe the accompanying issue to be settled utilizing a Prolog program: Given a shut planar polygon chain addressed as a rundown of n vertices [v(x1,y1), v(x2,y2), . . . , v(xn,yn)] register the region of the encased polygon, and the direction of the chain. The region is registered by the line necessary 1/2 R x dyy dx where the vital is over the polygon chain. A nave arrangement is given by the accompanying system, which characterizes the predicate region. The objective area(Chain,Area) succeeds when Chain is the rundown of vertices, and the size of Area is the region of the polygon limited by the chain. The indication of Area is positive assuming the direction of the polygon is anticlockwise what's more, negative in the event that it is clockwise: area([X],0). area([v(X1,Y1),v(X2,Y2)|VS],Area):- area([v(X2,Y2)|VS],Temp), Region is Temp + (X1 * Y2 - Y1 * X2)/2. Make sense of how vertices are handled by this system. [4 marks] For what reason does this program execute wastefully? [3 marks] Compose an elective definition that is tail-recursive and utilizes aggregator factors. [10 marks] Make sense of why your elective definition executes all the more proficiently.

A disseminated framework is being intended to hold subtleties of arrangements for sake of its clients. The framework contains a solitary server holding the arrangements and various clients which communicate with the server over an organization supporting an questionable datagram-based convention like UDP. (a) The server is to give activities utilizing a distant methodology call (RPC) interact with precisely once semantics. For example, boolean addEntry (Client c, Client d, Appointment a); is utilized by client c to add a section to the journal of client d. Portray how this RPC framework can carried out, incorporate (I) how boundaries are marshaled and unmarshalled; (ii) how precisely whenever semantics are accomplished; (iii) how strings are utilized, both inside a client and inside the server. You might expect that the clients definitely realize a proper organization address to contact the server and that different components are utilized for validation also, for security overall. (b) The framework is to be stretched out to help conditional style gets to by giving three further tasks, void startTransaction (Client c); void abortTransaction (Client c); boolean commitTransaction (Client c); Characterize severe segregation and portray how, for this situation, it very well may be authorized by timestamp requesting

[TURN OVERCST.2001.6.10

12 Complexity Theory

(a) Show that any language that can be acknowledged by a nondeterministic machine

in time f(n) can likewise be chosen by a deterministic machine in space O(f(n)).

[4 marks]

(b) Show that any language that can be acknowledged by a nondeterministic machine

in space f(n) can likewise be chosen by a deterministic machine on schedule

O(c(f(n)+log n) ), for some steady c. [6 marks]

(c) Explain everything the above outcomes say to us about the consideration connections among

the intricacy classes: