What is a pipeline bubble and why might a branch instruction introduce one or more bubbles? [4 marks] (b) Explain, with the aid of an example, how conditional instructions may be used to reduce the number of bubbles in a pipeline. (d) What is an imprecise exception and why might a processor designer prefer it to a precise exception mechanism?You may assume that the initial table is of size 326 (containing bytes 0 to 266) and that the codes for "A", "B", "C" and "D" are 75, 76, 77 and 78, respectively. [11 marks] (b) Estimate how many bits the algorithm would use to encode a string consisting of 1000 repetitions of the character "A". However, a lot of software developer/house tends to ignore the process. Therefore, provide and explain 2 motivations on software design. 4 Computer Graphics and Image Processing (a) Describe the limitations of human vision in terms of: (i) spatial resolution (ii) luminance (iii) colour and explain the implications that each of these limitations has on the design of display devices. (b) Illustrate how Simula can be used to simulate a small restaurant with six tables, two waiters and small groups of customers arriving at random intervals. (e) Give a brief and rudimentary clarification of the standards of how the language coming about because of part. Compiler Construction Programming answers should be written in some notation approximating SML or OCaml. (a) Describe what is meant by tail recursion. User mike gives his folder project the following access-control list: You choose to involve accuracy and review rather than precision as the assessment metric for this assignment. For what reason does this choice check out, and how are the measurements For each of these three objects, list all inherited access-control entries, showing in parentheses the inheritance-control flag bits that are set (using the same notation as above). Close up views of the washing machine door and the grill on the stove. Lin Dodgson. Your partner needs to recruit two additional human annotators to re-mark your preparing information. For what reason could this be really smart, how might you measure arrangement in this undertaking, and how about this work on your classifier in any capacity? (b) Describe the purpose and four typical functions of a root kit. (f ) Summarize any issues connected with left-or right-cooperative administrators in the two methods (in executing the parser and in developing the apparatus) you illustrated to some degree (e) Working to 6 significant decimal digits only, compute w  when x  = 1.018, y  = 1.0038, z = 3.0628. Given m ' 0.5  1203 , how many significant decimal digits of w  can be relied on? [3 marks] on of a Turing machine that is specified by a quintuplet description. [4 marks] (c) (b) Eliminate tail recursion from foldl given below. Explain your answer. (* foldl : ('a -> 'b -> 'a) -> 'a -> 'b list -> 'a *) let rec foldl f accu l = match l with [] -> accu | a::l -> foldl f (f accu a) l [8 marks] (c) Eliminate tail recursion from the following mutually tail-recursive functions. Expla123in your answer. let rec is_even n = if n = 0 then true else is_odd (n - 1) and is_odd n = if n = 0 then false else is_even(n - 1) [8 marks] 4 CST.2016.3.5 4 Compiler Construction Consider writing a compiler for a simple language of expressions given by the following grammar, e ::= n (integer) | ? (read integer input from user) | e + e (addition) | e  e (subtraction) | e  e (multiplication) | (e, e) (pair) | fst e (first projection) | snd e (second projection) [6 marks] 2 ECAD Consider the following mysterious Verilog module. module mystery(c,r,a,s); input c,r,a; output [2:0] s; reg [2:0] s; always @(posedge c or posedge r) if(r) s<=0; else begin if(a && (s<7)) s<=s+1; else if(!a && (s>0)) s<=s-1; end endmodule (a) [4 marks] (c) What is the difference between branches, interrupts, software interrupts (initiated by a SWI instruction on the ARM) and exceptions