ANSI-SPARC6 Programming Language Compilation Write notes on each of the following topics: (a) the implementation of labels and jumps in a recursive, block structured programming language [7 marks] (b) the implementation of arrays with non-constant bounds [7 marks] (c) problems in the specification and implementation of Algol own variables [6 marks] 7 Artificial Intelligence II Discuss any two methods for computing information about the three-dimensional layout of surfaces in a scene, given one or more images of the scene. Illustrate your answer with appropriate mathematical relationships and fragments of computer programs. [20 marks] 8 Databases Describe the ANSI-SPARC architecture for managing data, explaining how it enables data independence to be achieved. [6 marks] Outline the CODASYL/DBTG proposals for network database management, showing how they relate to the ANSI-SPARC architecture. [8 marks] In what ways do the DBTG proposals compromise data independence? [3 marks] What provision is made for data security in them? [3 marks] 3 [TURN OVER CST.93.13.4 9 Introduction to Functional Programming Consider the ML definition datatype 'a tree = Lf | Br of 'a * 'a tree * 'a tree; Say that a tree is balanced if, for each of its nodes of the form Br(v, t1, t2), the number of Br nodes in t1 differs from the number of Br nodes in t2 by at most one. Express this definition succinctly as an ML function of type 'a tree->bool. [2 marks] Show how to implement functional arrays using binary trees, such that the root holds the value of subscript 1, the left subtree holds the values of even subscripts, and the right subtree holds the values of odd subscripts. Explain how the update operation works, taking subscript 6 as an example. [5 marks] Give an informal proof that every functional array must be represented by a balanced tree. You may assume that the array contains no gaps, i.e. the defined subscripts are 1, . . . , n for some n > 0. [7 marks] Let the depth of a tree be defined by depth(Lf) = 0 and depth(Br(v, t1, t2)) = 1 + max{depth(t1), depth(t2)}. State and justify precise lower and upper bounds for the number of Br nodes contained in a balanced tree of depth d, for arbitrary d > 0. [6 marks] 10 Computation Theory Explain what is meant by the following: 'F is a recursively enumerable set each of whose elements is a total recursive function f : N N.' [3 marks] In each of the following cases state with reasons whether the set is recursively enumerable: (a) the set A of all total recursive functions a : N N such that a(n + 1) > a(n) for all n N [7 marks] (b) the set D of all total recursive functions d : N N such that d(n + 1) 6 d(n) for all n N

Describe the main features of the Data Language DAPLEX, paying particular attention to the following points: (a) schema definition and maintenance (b) primitive and derived data (c) entity specialisation (d) consistency constraints [9 marks] Explain how aggregates are handled in DAPLEX, paying particular attention to the following: (e) composition of many-valued functions (f ) calculation of averages (g) inverse functions (h) multiple inheritance [7 marks] The DAPLEX paper received a great deal of attention when it appeared in 1981. Why do you think that was, and why is the work largely forgotten today? [4 marks] 5 [TURN OVER CST.98.7.6 9 Security Describe the purpose of hash functions, message authentication codes and digital signatures, sketching a possible construction for each of them. [12 marks] A funds transfer system authenticates messages between its member banks by having the sending and receiving banks compute a MAC on each message using a key which each pair of correspondent banks in the system establishes monthly using public key techniques. The sending bank then computes a digital signature on the MAC using a long-term signing key. If the MAC is 32 bits long, is this arrangement more, or less, secure than signing a 128-bit hash of the message, and why? [5 marks] To what extent would matters be changed if all messages handled by the system were logged by a trusted third party? [3 marks] 10 Types Each natural number n N can be encoded in the polymorphic lambda calculus (PLC) by the beta-normal form Numn def = ( x : ( f : (f n x))), where the expression f n x is an abbreviation for the PLC expression inductively defined by f 0 x def = x and f n+1x def = f (f n x). For which PLC type nat does ` Numn : nat hold? [3 marks] Say that a function : N N is PLC-representable if there is a PLC expression F such that the following typing and beta-conversions hold: ` F : nat nat and F Numn = Num(n) (all n N). Show that the successor function, s(n) def = n + 1, is PLC-representable. [5 marks] Given a PLC-representable function and a number a N, show that the function inductively defined by (0) def = a and (n + 1) def = ((n)) is PLC-representable. [8 marks] Is every function N N PLC-representable? Justify your answer. [4 marks] 6 CST.98.7.7 11 Specification and Verification II Describe informally the meaning of the following four CTL operators:Data Science (djw1005) (a) Let xt be the number of new COVID infections on date t. We anticipate approximately exponential growth or decay, xt+1 (1 + )xt , and we would like to estimate from a dataset (x1, . . . , xT ). (i) Find the maximum likelihood estimator for for the model Xt+1 Poisson (1 + )xt [2 marks] (ii) Find the maximum likelihood estimator for for the model Xt+1 Normal (1 + )xt , (xt) 2 [3 marks] (iii) For the latter model, explain how to compute a 95% confidence interval for . Explain the resampling step carefully. [4 marks] (b) We don't actually know the number of new infections xt on date t: we only know the number of new positive test results, yt . We anticipate yt dow(t)xt , where dow(t) gives the day of the week for date t. We would like to estimate not only but also Mon, ..., Sun from the dataset (y1, . . . , yT ). (i) Propose a probability model for Yt+1 in terms of yt . [5 marks] (ii) Explain briefly how to estimate the parameters of your model. In your answer, you should consider whether or not the parameters are identifiable. [6 mark(a) Consider the definition of an approximation algorithm. (i) Explain the meaning of approximation ratio in the case of a maximisation problem. [2 marks] (ii) How is this definition adjusted to the case of a randomised approximation algorithm? [2 marks] (b) State the definition of PTAS and FPTAS. [4 marks] (c) Let G = (V, E) be an undirected graph. For any k 1, define G(k) to be the undirected graph (V (k) , E(k) ), where V (k) is the set of all ordered k-tuples of vertices from V and E (k) is defined so that (v1, v2, . . . , vk) is adjacent to (w1, w2, . . . , wk) if and only if {v1, v2, . . . , vk, w1, w2, . . . , wk} forms a clique. (i) Argue that the graph G(k) can be constructed in time polynomial in n (for any fixed value of k). [3 marks] (ii) Prove that the size of the maximum clique in G(k) is equal to the k-th power of the size of the maximum clique in G. [5 marks] (iii) Argue that if there is a polynomial-time approximation algorithm that has a constant approximation ratio for finding a maximum clique, then there is a polynomial-time approximation scheme (PTAS) for the problem. Hint: Your PTAS should be based on applying the given approximation algorithm with constant approximation ratio to G(k) for a proper choice of k > 0. Then use the equivalence in part (ii) to analyse its approximation ratio. [4 marks] 2 CST2.2019.9.3 2 Bioinformatics (a) Describe, with one example, the complexity of using dynamic programming in multiple alignment. [3 marks] (b) Describe the differences between genome assembly (i.e. using a reference genome) and genome de novo sequencing from a bioinformatics perspective. [5 marks] (c) The de Bruijn Graph is widely used in Bioinformatics. (i) Describe with one example how to construct the paired de Bruijn Graph. [5 marks] (ii) Describe the advantages of the paired de Bruijn Graph versus the non paired version of the de Bruijn Graph. [3 marks] (d) Discuss the advantages of using soft k-means versus hard clustering. [4 marks] 3 (TURN OVER) CST2.2019.9.4 3 Business Studies After graduation you created a venture with 10m in sales with a 20% profit margin. After investing 10 years of your life on this endeavour you have decided that it is time to sell. (a) Describe three exit routes available to you assuming you are not going to liquidate the company. [3 marks] (b) Discuss how you would go about identifying and choosing the exit route to pursue. [6 marks] (c) Identify your preferred exit route and discuss how you would go about managing the process. [11 marks] 4 CST2.2019.9.5 4 Comparative Architectures (a) As modern processors and system-on-chip (SoC) designs become more complex, so does the on-chip interconnect. (i) Why does the design of an on-chip network differ greatly from that of larger scale networks? [3 marks] (ii) Draw a diagram showing the datapath of an on-chip router with virtual channels. [3 marks] (iii) How do virtual channels help to reduce packet latency? [3 marks] (iv) For what reason, other than performance, may virtual-channel flow control be useful? [2 marks] (b) You have been asked to outline the design of a high-performance 16-core processor suitable for use in a server-class machine. Draw a clear block diagram illustrating your architecture. Include all the major building blocks, e.g. processor cores, caches, on-chip interconnects, memory controllers and the main off-chip interfaces. Provide a brief description of how cache coherence is maintained, what type(s) of on-chip interconnect are provided, a brief overview of the features of your individual cores and the characteristics of your caches. For each major component briefly justify your design decisions. [9 marks] 5 (TURN OVER) CST2.2019.9.6 5 Computer Vision (a) In early stages of machine vision systems, the isotropic operator shown on the right is often applied to an image I(x, y) in the following way: [2G(x, y)] I(x, y). What is the purpose of this operation? Which class of neurones in the retina does it mimic? How would the results differ if instead this operation: G(x, y) 2 I(x, y) were performed; or alternatively if this operation: 2 [G(x, y) I(x, y)] were performed? [6 marks] (b) Computer vision colour space is usually three-dimensional, just because human vision is tri-chromatic and therefore cameras are designed with three colour planes. But suppose we added a fourth colour plane, say yellow (Y), to the standard red, green, and blue (RGB) bands. Considering that these are linearly independent but not orthogonal vectors, what would be the added capability of RGBY space? What tests would reveal it? Present a version of the Retinex algorithm for RGBY space, explaining the purpose of each step in the algorithm. [8 marks] (c) Visual inference of surface shape depends on assumptions and prior knowledge, such as "faces are mostly convex". Explain the "rotating hollow mask illusion". Why does a face mask (as pictured below) appear to reverse its direction of rotation, once it is seen from the inside instead of the outside? What is the role of Bayesian inference when interpreting a face-like surface that is actually concave in presentation instead of convex? Should visual illusions like this be considered "features" or "bugs", and should one try to design them in to a computer vision system? [6 marks] 6 CST2.2019.9.7 6 Cryptography (a) (i) Choose and briefly describe one major application of elliptic-curve group operations in cryptography. [4 marks] (ii) What other group operation was previously (and still is) widely used for the same purpose? [2 marks] (iii) What is a major advantage of elliptic curve group operations over the group operation you named in Part (a)(ii)? [4 marks] (b) In the Galois field GF(28 ) modulo x 8 + x 4 + x 3 + x 2 + 1, calculate (i) the sum 0011 1001 plus 0110 1100; [2 marks] (ii) the product 0100 1011 times 0000 1001. [4 marks] (c) In Lamport's one-time password scheme, the user is given a list of passwords Rn, . . . , R0 generated using the following algorithm: R0 random for i := 1 to n Ri := h(Ri1) (i) State two properties required of function h. [2 marks] (ii) Complete the password verification algorithm implemented in the server by filling in the ellipses (...) below: Q := . . . while true P := read password if . . . . . . grant access else deny access [2 marks] 7 (TURN OVER) CST2.2019.9.8 7 Denotational Semantics (a) Suppose that (D, v) is a poset which is chain-complete but does not have a least element, and that f : D D is a continuous function. (i) Give an example of such (D, v) and f for which f has no fixed point. [1 mark] (ii) If d D satisfies d v f(d), prove that there is a least element e D satisfying d v e = f(e). [Hint: consider the method used to prove Tarski's fixed point theorem.] [7 marks] (b) (i) Define the notion of contextual equivalence for the language PCF. (You need not describe the syntax and semantics of PCF.) [2 marks] (ii) State the compositionality, soundness and adequacy properties of the denotational semantics of PCF. Explain why they imply that any two closed PCF terms of the same type with equal denotations are contextually equivalent. [8 marks] (iii) Give, without proof, an example of two contextually equivalent PCF terms that have unequal denotation. [2 marks] 8 CST2.2019.9.9 8 Hoare Logic and Model Checking This question is about modelling a program, defined below, consisting of two threads and a single (mathematical) integer variable X, initially set to 0. Each thread t has its own program counter given by pct , initially set to 0, which describes the current line for that thread. Thread 1 Thread 2 0: X := X+1 0: IF IS ODD(X) THEN STOP ALL 1: GOTO 0 1: GOTO 0 The program is executed by repeatedly carrying out execution steps, where one thread is non-deterministically selected, its entire current line is run, and its program counter is then updated appropriately. This continues until STOP ALL is executed, which immediately terminates the whole program. (a) The program state can be described by (pc1, pc2, X, stopped), where pc1, pc2, and X are mathematical integers, and stopped is a boolean which is true iff STOP ALL has been executed. Let S be the set of all such states. (i) Define S0, the set of initial states of the program, such that S0 S. [1 mark] (ii) Define a transition relation R S S describing the program's execution. [2 marks] (iii) Define a labelling function L that labels all states where the program has terminated with the atomic property term. [2 marks] (b) Explain why, taking the definitions from (a), the model Ma = (S, S0, R, L) is not a (finite) Kripke structure. [2 marks] (c) Draw the finite state automaton for a model Mb which is a Kripke structure, such that Ma and Mb are bisimilar. Justify your answer briefly. [Note: A full formal proof of bisimilarity is not required.] [5 marks] (d) (i) Give an LTL formula such that the judgement Mb corresponds to the statement "every execution of the program will eventually terminate". [2 marks] (ii) Either prove that Mb holds, or describe a counter-example trace. [2 marks] (e) Consider the CTL formula = AG(EF term). Determine whether this is equivalent to your definition of from Part (d). and are equivalent iff, for all Kripke structures M, (M ) iff (M ). Justify your answer. [4 marks] 9 (TURN OVER) CST2.2019.9.10 9 Information Theory (a) If I pick a number n that can be any integer from 1 to whose probability distribution of being selected is ( 1 2 ) n , and you ask a series of 'yes/no' questions which I will answer truthfully, how many such 'yes/no' questions should you expect to ask before discovering which number I have picked? Justify your answer by invoking a known series limit. What sequence of questions would be the most efficient to ask, and why? [4 marks] (b) An inner product space containing complex functions f(x) and g(x) is spanned by a set of orthonormal basis functions {ei}. Complex coefficients {i} and {i} therefore exist such that f(x) = X i iei(x) and g(x) = X i iei(x). Show that the inner product hf, gi = X i ii . [4 marks] (c) Consider a data sequence f[n] (n = 0, 1, . . . , 15) having Fourier coefficients F[k] (k = 0, 1, . . . , 15). Using the 16th roots of unity labelled around the unit circle as powers of w1 , the primitive 16th root of unity, construct a sequence of the wi that could be used to compute F[3] when an inner product is computed between your sequence of wi and the data sequence f[n]. Im Re w 0 =1 w 1 w 2 w w 3 4 w 5 w 6 w 7 w 8 w 9 w 10 w 11 w 12 w 13 w 14 w 15 [4 marks] (d) Explain how vector quantisation exploits sparseness to construct very efficient codes. Use the example of encoding a natural language lexicon with a 15 bit coding budget. Contrast the strategy of using codewords for single letters versus using codewords as pointers to a sparse index of combinations of letters. [4 marks] (e) A continuous signal f(t) has Fourier transform F(). Explain why computing derivatives of f(t) such as f 0 (t) or f 00(t) amounts simply to high-pass filtering. For the n th derivative f (n) (t), what exactly is this filtering operation when expressed in terms of F()? Show how this operation could be used to define derivatives of non-integer order (for example the 1.5 th derivative). [4 marks] 10 CST2.2019.9.11 10 Mobile and Sensor Systems A mobile phone software developer is programming her own behaviour tracking app and she wants to make it suitable for use in areas with intermittent and low bandwidth cellular connectivity. (a) Explain the precautions the developer can take to make the app work well in this environment. Describe examples of mechanisms which can help with this. [5 marks] (b) The app uses various sensors to monitor user activity and its surrounding environment. In particular, it uses the microphone to monitor location ambience (surrounding sounds). Describe a suitable machine learning approach and discuss system considerations. [6 marks] (c) Describe how the developer can use location data to provide mobility prediction and how mutual information can improve the mobility prediction algorithm. [4 marks] (d) A very able user wants to test the app for privacy leaks before using it on their own phone. What techniques can be used? Illustrate each technique's specific purpose and the assumptions it is predicated on. [5 marks] 11 (TURN OVER) CST2.2019.9.12 11 Optimising Compilers (a) Describe the phase-order problem in a compiler and illustrate your answer with some example code. [4 marks] (b) You are advising a semiconductor design company on building a compiler for their latest processor. The processor has the following features: Sixteen 64-bit registers (r0-r15) and sixteen 32-bit registers (s0-s15), the latter corresponding to the lower 32 bits of each of the 64-bit registers. A one-cycle branch delay slot after each control-transfer instruction (i.e. the instruction after a branch is executed before the branch takes effect). Complex arithmetic instructions that implicitly use r15 as their first source operand. What are the challenges of code generation for this processor, given these features and how can they be addressed within the compiler? [8 marks] (c) To ease compilation, the chief designer suggests that the processor's instructions could be executed directly in SSA form (i.e. all destination registers unique). This would use a small cache to provide fast access to the most recently used virtual registers. Discuss the advantages and disadvantages of such an approach from the compiler writer's viewpoint. [8 marks] 12 CST2.2019.9.13 12 Principles of Communications (a) Describe max-min fair share allocation of resources, explaining what it can be used for. [10 marks] (b) The Transmission Control Protocol (TCP) can be seen as a distributed optimisation of the dynamic resource allocation problem. Describe how capacity at bottlenecks (congested points in the network) is effectively allocated in proportion to demands, and how this is equivalent to the joint optimisation of user and network utilities. [10 marks] 13 (TURN OVER) CST2.2019.9.14 13 Quantum Computing A Boolean formula with n variables in it can be seen as defining a function f : {0, 1} n {0, 1}, and we say that is satisfiable if there is some x {0, 1} n such that f(x) = 1. (a) Explain how f can be suitably represented as a unitary operation Uf on a complex space of dimension 2n+1. [3 marks] (b) Suppose that we are given a blackbox implementing Uf . Describe how this would be used to form the Grover iterate which can be repeated to find a value x such that f(x) = 1. [5 marks] (c) If there is exactly one value x such that f(x) = 1, how many iterations of the Grover iterate would you use to find this value? What is the probability of finding it? [3 marks] (d) If there are M distinct values such that f(x) = 1, how many iterations of the Grover iterate would you use to find one of these values? What is the probability of finding one of them? [3 marks] (e) If you are able to turn an arbitrary formula into an implementation of the corresponding unitary operator Uf , how would you use this to give an algorithm for determining whether is satisfiable or not? Give an estimate of the running time of your algorithm in terms of n. [6 marks] 14 CST2.2019.9.15 14 Types (a) In System F, give a Church encoding for (i) the Boolean type, (ii) the definition of the True and False constants, and (iii) the type and definition of the if-then-else operation. [3 marks] (b) In System F, give (i) a Church encoding Nat for the natural numbers, (ii) a Church encoding for the Zero : Nat and Succ : Nat Nat constructors, and (iii) a type and definition for the iteration operator Iter for natural numbers. [3 marks] (c) (i) In System F, give a Church encoding for (i) an OptionA type, (ii) the definitions of the None : OptionA and Some : A OptionA operations, and (iii) the type and definition of the case operation on options. (ii) Assume that n : B and s : A B, and then (A) Prove that Case [B] n sNone = n (B) Prove that Case [B] n s (Some x) = s x [5 marks] (d) In System F, define a predecessor operation Pred : Nat Nat, which returns Zero if given Zero as an argument, and return n if given Succ n as an argument. [Hint: The option type may be useful in formulating this definition.] [8 marks] (e) In System F, define a subtraction operator Sub : Nat Nat Nat, which is defined to be saturating. That is, Sub m n returns the difference if m n, and returns 0 otherwise.When Sever receives ciphertext, each letter in the ciphertext is decrypted as follows: a. x = dk'(y) (y - k') mod 52. b. After decrypting the ciphertext, the Server must display (ciphertext, plaintext) pair on the screen. c. For each message, server also sends acknowledgement message to client. 11)Client displays plaintext and ciphertext before it transmits ciphertext out through the socket. 12) Server displays ciphertext and plaintext after it receives ciphertext through the socket and decrypts it. 2. You can use any programming language of your choice. However, make sure to include the procedure how to compile and run your program as comments in the source code. (It is also a good idea what kinds of IDE you use to complete the project. Give condition for tracking down the most likely arrangement of grammatical feature (POS) labels that could be used by a stochastic POS tagger. You ought to accept a bigram model. [5 marks] (b) Given the accompanying preparation information, show the evaluations that sounds acquired, all things considered for the probabilities in the situation you gave: the_DT0 green_AJ0 bottle_NN1 leaked_VVD ._PUN the_DT0 suppliers_NN2 bottle_VVB water_NN1 ._PUN green_AJ0 water_NN1 suppliers_NN2 bottle_VVB ._PUN [4 marks] (c) Explain what is implied by the terms smoothing and backoff with regards to stochastic POS labeling. [4 marks] (d) One normal wellspring of blunders in stochastic POS taggers is that things happening preceding different things (for example sailboat trai... Assume you have the following definition for class Restaurant.

class Restaurant {

private int rating;

private double averagePrice;

private String name;

public int getRating(){

return(this.rating);

}

public double getAveragePrice() {

return (this.averagePrice);

}

public void setRating(int rating){

this.rating = rating;

}

public void setAveragePrice(double avePrice) {

this.averagePrice = avePrice;

}

}

What is static method called modifyRatingBasedOnPrices that takes three arguments. The first one is an ArrayList of objects of type Restaurant. The second is a double. The third argument is an integer. The method searches in the ArrayList used as the first argument for a restaurant with an ave... Consider two bunches An and B each facilitating different applications. All applications send bursty traffic among An and B over a connection E. Under what conditions is circuit exchanging more proficient to use rather than parcel exchanging? [2 marks] (b) Compare the connection state and distance-vector conventions with regards to message intricacy, handling intricacy and heartiness. [6 marks] (c) Cambridge University is going to open another School with three new offices A, B and C. The IPv4 address prefix of the new School is 128.232.1.0/24 and it is anticipating that every office should have the accompanying number of hosts: Office A: somewhere in the range of 40 and 60 hosts Office B: somewhere in the range of 100 and 120 hosts Division C: somewhere in the range of 20 and 30 hosts (I) The college wishes to allot a subnet for every division. Give conceivable IPv4 subnet covers for each new office. [3 marks] (ii) Later, the School opens a fourth office D with 30 hosts. Give conceivable IPv4 subnet veils to oblige every one of the four offices. [2 marks] (iii) Finally, the School opens a fifth office E of comparable size to B. Give conceivable IPv4 subnet veils to oblige each of the five offices. [4 marks] (iv) Are there any pragmatic issues with your response to Part (c)(iii)? Momentarily examine an elective answer for oblige every one of the five offices.

Compose program that prompts the client to peruse two numbers and shows their aggregate. Your program ought to incite the client to peruse the number once more on the off chance that the info is mistaken.

Make program that prompts the client for a number and afterward shows a message demonstrating if the number is an ideal square.

Compose program that prompts the client to enter in a number addressing the quantity of components in a whole number exhibit. Make the cluster and brief the client to enter in values for every component involving a for circle.

(a) Why is it essential to focus on working on the normal case (for example the most usually utilized tasks and assets) while planning a microchip? (b) What is the significant distinction between an extremely lengthy guidance word (VLIW) processor and a progressively booked superscalar processor? What sway does this have on the intricacy of the execution for each situation? [4 marks] (c) When planning a VLIW processor, for what reason could variable-length guidance groups be liked over fixed-length directions? (d) Some VLIW processors contain extra equipment to allow memory reference hypothesis. (I) What advancement does memory reference hypothesis license?

(ii) Briefly portray the extra equipment expected to help this sort of theory. Consider two bunches An and B each facilitating different applications. All applications send bursty traffic among An and B over a connection E. Under what conditions is circuit exchanging more proficient to use rather than parcel exchanging? [2 marks] (b) Compare the connection state and distance-vector conventions with regards to message intricacy, handling intricacy and heartiness. [6 marks] (c) Cambridge University is going to open another School with three new offices A, B and C. The IPv4 address prefix of the new School is 128.232.1.0/24 and it is anticipating that every office should have the accompanying number of hosts: Office A: somewhere in the range of 40 and 60 hosts Office B: somewhere in the range of 100 and 120 hosts Division C: somewhere in the range of 20 and 30 hosts (I) The college wishes to allot a subnet for every division. Give conceivable IPv4 subnet covers for each new office. [3 marks] (ii) Later, the School opens a fourth office D with 30 hosts. Give conceivable IPv4 subnet veils to oblige every one of the four offices. [2 marks] (iii) Finally, the School opens a fifth office E of comparable size to B. Give conceivable IPv4 subnet veils to oblige each of the five offices. [4 marks] (iv) Are there any pragmatic issues with your response to Part (c)(iii)? Momentarily examine an elective answer for oblige every one of the five offices.

Compose program that prompts the client to peruse two numbers and shows their aggregate. Your program ought to incite the client to peruse the number once more on the off chance that the info is mistaken.

Make program that prompts the client for a number and afterward shows a message demonstrating if the number is an ideal square.

Compose program that prompts the client to enter in a number addressing the quantity of components in a whole number exhibit. Make the cluster and brief the client to enter in values for every component involving a for circle.

(a) Why is it essential to focus on working on the normal case (for example the most usually utilized tasks and assets) while planning a microchip? (b) What is the significant distinction between an extremely lengthy guidance word (VLIW) processor and a progressively booked superscalar processor? What sway does this have on the intricacy of the execution for each situation? [4 marks] (c) When planning a VLIW processor, for what reason could variable-length guidance groups be liked over fixed-length directions? (d) Some VLIW processors contain extra equipment to allow memory reference hypothesis. (I) What advancement does memory reference hypothesis license?

(ii) Briefly portray the extra equipment expected to help this sort of theory. : Gaussian commotion of force ghostly thickness N0, and normal sent power P. (a) Is there any cutoff to the limit of such a channel assuming that its sign to-commotion proportion P N0W will be for arbitrary reasons expanded? Assuming this is the case, what is that cutoff? [2 marks] (b) Is there any breaking point to the limit of such a channel if, leaving N0 and P unaltered, its data transfer capacity W in Hertz can be for arbitrary reasons expanded? Provided that this is true, what is that cutoff?