Search

9 Jun 2014: REF(A) a; REF(B) b;. Recall that Simula uses the semantically incorrect principle that. ... if B<:A then REF(B)<:REF(A). and consider now the following Simula code.

9 Jun 2014: b) How will your compiler generate code from expressions of the form E1 E2?[4 marks]. ... a(1). a(a). b(3). b(a). c(A,B) :- b(B),!,a(A). c(X,_) :- a(X),b(X). (i ) List all the solutions to the query

9 Jun 2014: a) fields;. (b) local variables;. (c) parameters;. (d) return values;. (e) visibility modifiers. ... 2 marks]. (b) Describe (with the aid of a diagram where appropriate) the representation inmain memory of:.

9 Jun 2014: finite, #. (Inj(A,B). )=. (#B#A. )(#A)! 6. CST.2007.2.7. 6 Discrete Mathematics II. (a) Let V be a set of propositional variables, and let FV be the set ... A B) (B A)Rule MP. A A BB. where A,B,C FV.

9 Jun 2014: Booleans b B = {truetruetrue, falsefalsefalse}Integers n Z = {.,1, 0, 1,. ... Operations op ::= | Expressions. e ::= skipskipskip | n | b | e1 op e2 | ififif e1 thenthenthen e2 elseelseelse e3 | fnfnfn x e | e1 e2 | x | fixfixfix e.

9 Jun 2014: a, b)(a, b) R (a, b) (b, c). (a, c). and let R• U U be the relation inductively defined by the rules. ... a, b)(a, b) R (b, c). (a, d)(a, b), (c, d) R.

9 Jun 2014: Show how totranslate an arbitrary propositional formula to an equivalent polynomial, describingthe translations of A, A B, A B, A B and A B. ... 5 marks]. Use this translation to show that (A B) (B A) is a tautology.

9 Jun 2014: a=0;. b=1;. for(i=0; i<5; i++) {. a=ab;. b=a-b;. }. [10 marks].

9 Jun 2014: A B Pr(c|A, B) B C Pr(d|B, C)> > 0.5 > > 0.2> 0.6 > 0.9 > 0.8 > 0.8 0.7 0.1. ... a) Explain why the representation of the joint distribution of A, B, C and Dusing the Bayesian network is preferable to a direct tabular representation.

9 Jun 2014: A Pr(b|A) B Pr(c|B) B C Pr(d|B, C)> 0.1 > 0.2 > > 0.6 0.15 0.95 > 0.5. > ... 0.4 0.3. (a) Write down an expression for the full joint distribution of the random variablesA, B, C and D.

9 Jun 2014: 6 marks]. (b) What is the labelled circuit diagram which corresponds to the following snippetof Verilog? ... b <= t;. end. end. endmodule. (i) What is wrong with the code above?

9 Jun 2014: 3 marks]. Let f (AB),g (BC) be relations between A and B, B and C respectively.Define the inverse relation f1 between B and A and the product relation (f ... If A,B are both finite,|A| = a, |B| = b, how many elements are there in (AB), (A B), (A B)?

9 Jun 2014: a=1;. b=1;. for(i=1; i<n; i++) {. a=ab;. b=a-b;. } [9 marks]. ... b) Reduced instruction set computers typically achieve high performance byoptimising the common case.

9 Jun 2014: B, C andthe end-of-file mark w, such text can be arithmetically encoded using only 3-bitarithmetic. ... 101 101000010 |-w---A---A---B---B-(C)CC+| => C. Your answer should include a brief description of how the decoding algorithm works.[20 marks].

9 Jun 2014: S A B eofA A B | B aB (A) | b [6 marks]. ... b a b ( b a ) eof [5 marks]. 3 [TURN OVER.

9 Jun 2014: 4 marks]. (b) Define promotion and demotion in the context of partial order planning, andexplain why they are needed. ... 1. 2. 3. c. a. a. b b. a. a c.

9 Jun 2014: else. if a > b then stein (a - b) b c. ... else stein (b - a) a c;. fun gcd a b = stein a b 1;.

9 Jun 2014: Booleans b B = {truetruetrue,falsefalsefalse}Integers n Z = {.,1, 0, 1,. ... e ::= skipskipskip | n | b | e1 op e2 | ififif e1 thenthenthen e2 elseelseelse e3 | := e |! | e1; e2 |whilewhilewhile e1 dododo e2. Define [[e]] to be the function that takes

9 Jun 2014: a c b a a 0 0 0 1b d b b e 0 1 1 1c e d e a 0 0 0 1d b d b a 0 1

9 Jun 2014: 6 marks]. (b) Draw the reachable transition system of the CCS process P , where. ... Pdef= a.P b.(b.nil a.nil). [2 marks]. (c) Illustrate the use of the algorithm of part (a) by giving a derivation whichdecides whether or not the CCS process