Portray one potential construction (for example Mythical person) of an article fifile. Represent your

reply by considering the type of article fifile which could result from the

following C program.

int a = 1, b = - 1;

extern int g(int);

extern int c;

int f() { return g(a-b) + c; }

It isn't important to consider the specific guidance grouping, simply issues

concerning its cooperation with the item fifile design. [10 marks]

(b) Describe how a linker takes a succession of such projects and delivers an

executable fifile. [4 marks]

(c) Compare and differentiation static and dynamic connecting in a framework utilizing your article

fifile design. [6 marks]

4CST.2001.6.5

7 Prolog for Artifificial Intelligence

A weighted parallel tree can be defifined involving compound terms in the accompanying manner.

A hub of the tree is addressed by the term n(V, L, R), where V represents the

worth of the hub, and L and R represent the left and right branches, separately.

A terminal hub has the R and L parts launched to the invalid rundown.

Given an info tree T, compose a Prolog program that builds a tree of something very similar

shape as T, however in which the worth of every hub has been set to the worth of the

greatest worth hub in T.

[Note: Maximum imprints are accessible just for programs that play out this assignment in

one recursive plunge of the info tree, and which utilize something like four clauses.]

It is expected to develop a ML structure addressing the tree of all conceivable games. Every hub of the tree need to comprise a reachable board state, with the root being the vacant board, and the leaf hubs comparing to won, lost or drawn games. Characterize the ML datatype tree which you could use to address this game tree. [3 marks] Characterize the trademark mktree : unit->tree to gather the whole game tree, making sense of mindfully the way that it works. There isn't any need on your execution to be proficient in both space or time. [10 marks] Momentarily talk ways wherein your execution of mktree might be made more noteworthy green. [4 marks] Characterize a capacity Owins : tree->int what while applied to the total tree will yield the amount of marvelous games wherein O wins. [3 marks] 3 [TURN OVER CST.Ninety seven.1.Four 6 Foundations of Computer Science An established coordinated chart has vertices recognized by numbers. Every vertex v has a left replacement given through left(v) and a legitimate replacement given through proper(v), in which left what's more, correct are ML highlights of kind int->int. The chart comprises of the root and all vertices reachable through ways from the establishment. Characterize a datatype G that would be utilized to represent this sort of diagram with given root, furthermore, left and right capacities, and diagram an element mkgraph(root, left, appropriate) that can make upsides of kind G. Show that such qualities can be utilized to address each limited and boundless charts. [4 marks] A course through the chart is addressed with the guide of a bool posting with certifiable and misleading demonstrating left and appropriate edges, individually. Characterize the trademark remaining : G - > bool list - > int with a reason to yield, for guaranteed diagram, the ID of the vertex came to through pursuing the provided guidance from the root. [3 marks] In a spic and span application, wherein last is over and over alluded to as, it is expected for it to return each the recognizable proof of a definitive vertex and a count of how consistently this remarkable vertex has been returned. Characterize another variant of the datatype G, containing changeable values, that could be utilized. [3 marks] Represent utilizing this datatype with the guide of characterizing the new varieties of mkgraph and remaining. [10 marks] 4 CST.97.1.5 Segment C 7 Discrete Mathematics Allow us to say that a limited incomplete request (A, v) is tree-like if, for each a ? A, the arrangement (of its ancestors) x ? A both is unfilled or has a totally one of a kind maximal component. Comparably, pictorially, this holds when the Hasse graph of An is created

Let's look at why some brand name items cost more than their generic alternatives. Consider DiGiorno Pizza versus some other generic frozen, rising-crust pizza. DiGiorno's slogan is "It's not delivery. It's DiGiorno." Consumers can also buy generic frozen, rising-crust pizza. The manufacturers of the generic pizza do not engage in advertising. Assume that the average total cost of producing DiGiorno and the generic pizza is the same. 1. Create a graph showing for DiGiorno, a monopolistically competitive firm. 2. Create a separate graph for the generic pizza brand, also a monopolistically completive firm. (Hint: The generic brand has a more elastic demand curve.) 3. Who has the stronger incentive to maintain strict quality control in the production process - DiGiorno or the generic firm? Why?