applytuio

a) SoC design involves dividing work between hardware and software as well as deciding the number of general-purpose and custom processors and co-processors to be used. What main factors influence these design decisions and the associated manual partition of envisaged workload over these resources? [5 marks] (b) A lossless compression algorithm converts fixed-size, 1 kByte blocks of data to a variable-sized block that is normally shorter. Suggest a suitable signature (argument and return types) for a software function that implements the algorithm. Draw a diagram showing the external wiring to the neighbouring SoC components for an appropriate, high-performance, hardware implementation. State any assumptions that guide your design approach. [6 marks] (c) A synchronous hardware module has separate input and output ports that each convey 32-bit words. Handshaking is required on both ports since it is unpredictable whether the module or its environment are ready to exchange data in either direction at any time. Give a diagram or RTL module definition for such a component and precisely describe the handshaking protocol in words. State the maximum throughput of your protocol. [5 marks] (d) Why might it be useful to have a formal specification of your protocol from part (c) during design and testing? What, if anything, might we infer about the number of words stored inside the module from the protocol? [4 marks] 13 Topical Issues (a) Compare and contrast the Internet of Things (IoT) with the conventional internet. [4 marks] (b) Describe how Bluetooth Low Energy (BLE) was designed to address the following IoT-related issues. Your answers should consider both BLE advertising and data channels. (i) Reduce the overall power consumption of peripherals. [6 marks] (ii) Handle radio channel contention from other IoT devices. [6 marks] (iii) Handle radio channel interference from other users of the same 2.4 GHz radio band such as WiFi.

(a) SoC design involves dividing work between hardware and software as well as deciding the number of general-purpose and custom processors and co-processors to be used. What main factors influence these design decisions and the associated manual partition of envisaged workload over these resources? [5 marks] (b) A lossless compression algorithm converts fixed-size, 1 kByte blocks of data to a variable-sized block that is normally shorter. Suggest a suitable signature (argument and return types) for a software function that implements the algorithm. Draw a diagram showing the external wiring to the neighbouring SoC components for an appropriate, high-performance, hardware implementation. State any assumptions that guide your design approach. [6 marks] (c) A synchronous hardware module has separate input and output ports that each convey 32-bit words. Handshaking is required on both ports since it is unpredictable whether the module or its environment are ready to exchange data in either direction at any time. Give a diagram or RTL module definition for such a component and precisely describe the handshaking protocol in words. State the maximum throughput of your protocol. [5 marks] (d) Why might it be useful to have a formal specification of your protocol from part (c) during design and testing? What, if anything, might we infer about the number of words stored inside the module from the protocol? [4 marks] 13 Topical Issues (a) Compare and contrast the Internet of Things (IoT) with the conventional internet. [4 marks] (b) Describe how Bluetooth Low Energy (BLE) was designed to address the following IoT-related issues. Your answers should consider both BLE advertising and data channels. (i) Reduce the overall power consumption of peripherals. [6 marks]

(a) Describe the way in which a problem should be represented in order to allow its solution using a heuristic search technique. [5 marks] (b) Define what it means for a search algorithm to be complete, and to be optimal. [2 marks] (c) Define what it means for a heuristic function to be admissible, and to be monotonic. [2 marks] (d) Describe the operation of the A? heuristic search algorithm. [5 marks] (e) Prove that the A? heuristic search algorithm is optimal when applied in conjunction with a monotonic heuristic. State the conditions under which the algorithm is also complete, and explain why this is the case.

(a) Give three examples of NLP tasks, apart from sentiment classification, that are typically treated as supervised classification problems. Describe the tasks briefly. [3 marks] (b) Describe the Nave Bayes classifier and how it would apply to sentiment classification. [5 marks] (c) What is the "nave" assumption behind Nave Bayes and does this assumption hold for language-based classification tasks? [3 marks] (d) What are the limitations of the bag-of-words features in sentiment classification? What other features would you use to address these limitations? Illustrate your suggestions with linguistic examples. [5 marks] (e) Discuss the evaluation of sentiment classification systems

(a) Explain the scenario in which a strictness analyser is used to optimise a program. Your answer should consider the following: for what languages strictness optimisation is useful, where it is beneficial to be able to place strict or non-strict annotations on a program (seeing the strictness analyser as a black-box oracle), and how such annotations can safely allow an optimiser to represent strict or non-strict values differently at run time. Give an example program which has different run-time space complexity before and after strictness optimisation. [5 marks] (b) One implementation for a strictness analyser determines strictness functions associated with each user-defined or built-in function. Given a user-defined function taking n integer arguments to an integer result, state the domain and range of its associated strictness function. How can such a strictness function be used to produce the strict or non-strict annotations in Part (a)? [3 marks] (c) Give a data structure suitable for representing strictness functions within a strictness analyser. Can ordinary functions be used? Would your data structure represent strictness functions (x, y, z). x(yz) and (x, y, z). (xy)(xz) differently? Would these two strictness functions enable different strictness optimisations in Part (a)? [4 marks] (d) Give the strictness functions for the following source-language functions. (i) The built-in addition and 3-argument conditional functions. [2 marks] (ii) A built-in parallel-if function, which evaluates all its three arguments in parallel, and returns a result as soon as enough of its arguments terminate. This includes returning value v when the second and third arguments evaluate to v even if the first argument is still computing

(a) Define the token game for basic Petri nets. [3 marks] (b) When is a basic Petri net safe from an initial marking?

(a) A continuous communication channel adds Gaussian white noise to signals transmitted through it. The ratio of signal power to noise power is 30 decibels, and the frequency bandwidth of this channel is 10 MHz. Roughly what is the information capacity C of this channel, in bits/second? [5 marks] (b) Explain the comb function, comb(t) = X(t), its role in the sampling theorem, its self-Fourier property, and the constraint on the spacing of the comb's tines that is required in both the signal domain and consequently in the Fourier domain in order to reconstruct exactly, from discrete samples, a signal having no frequency components higher than W.

(a) Explain the steps and the complexity of the Hirschberg algorithm and illustrate them with an example. [7 marks] (b) Give one example why the multiple alignment, as implemented in the software Clustal, needs a guide tree. [5 marks] (c) Explain what an amino acid exchange propensity matrix is and how you would construct it. [3 marks] (d) Explain with an example why a compression algorithm is often needed in genome assembly. [5 marks] 3 Computer Systems Modelling Consider a M/M/1 queueing system with an arrival rate > 0 and a service rate > 0 where = / < 1. (a) Derive the distribution for N, the total number of customers present in the queueing system in equilibrium. [6 marks] (b) Suppose that the queueing system is in equilibrium. For each of the following terms define the quantity and determine its value: (i) utilization (ii) throughput (iii) mean number of customers present in the system (iv) mean time spent by a customer in the system [8 marks] (c) Now suppose that the arrival rate and service rate are both scaled by a factor of s > 0. For each of the four quantities in part (b) determine their new values and explain your findings.

(a) In Mini-ML, define the relation of specialisation between (i) type schemes and types, A ( ) 0 [1 mark] (ii) type schemes and type schemes, A ( )A0 ( 0 ) [2 marks] (b) What is meant by the principal type scheme of a closed expression in Mini-ML? [2 marks] (c) State the Hindley-Damas-Milner Theorem for the Mini-ML typeability problem. [2 marks] (d) Define what is meant by a Mini-ML typing problem. Outline a type inference algorithm for Mini-ML that operates on typing problems. You should explain what is a solution and a principal solution for a typing problem, state the properties of the output of the algorithm and explain its overall structure. How does the algorithm make use of fresh type variables and of unification? Illustrate your answer by describing how the algorithm operates on function application expressions.

(a) Describe briefly six factors which might influence or constrain the design of a new processor. [6 marks] (b) The performance of a superscalar processor is often enhanced with hardware to support the following: branch prediction register renaming out-of-order execution the speculative reordering of load instructions strided prefetching (i) Sketch an assembly language program that would benefit from the use of all of these techniques when executed on a superscalar processor. Briefly describe how each of the techniques helps to improve the performance of your program. [10 marks] (ii) Briefly outline two example programs for which the adoption of the techniques listed would not provide a significant performance improvement.

. Write program that insert number from the keyboard, and find out the number is prime or not? Write complete C++ program to ask the user to enter 4 integers. The program must use a function to find the LARGEST integer among them and print it on the screen. Write c++ program to calculate the sum of all the elements in an array. : Write C program to print the Fibonacci series using for loop?

(a) (i) Suppose that FX(x) is a distribution function. Show the inverse transform result, namely that, if U is a random variable uniformly distributed in the interval (0, 1) then X = F 1 X (U) is a random variable with distribution function P(X x) = FX(x). [4 marks] (ii) Discuss the notion of a pseudo-random number generator for uniform random variables. Describe suitable algorithms for generating pseudorandom numbers. [6 marks] (iii) Using the inverse transform result in part (a)(i) derive a method to generate a stream of independent pseudo-random numbers from an exponential distribution with parameter > 0. What are the true mean and variance of these numbers in terms of ? [4 marks] (b) (i) Suppose that you conduct a simulation experiment to estimate the mean, , of a random quantity X from a sample of n values X1, X2, . . . , Xn. How would you estimate ? [2 marks] (ii) Now suppose that your simulation also yields a sample of n values Y1, Y2, . . . , Yn of the random quantity Y where E(Y ) = Y is a known number. How would you use the method of control variates to improve your estimator of ? Your answer should mention all quantities that may need to be estimated and in what way you will improve the estimation of

(a) Why does the formal security definition for collision-resistant hash functions require a key s and a security parameter n, even though most commonly used standard secure hash functions lack such input parameters? [4 marks] (b) If hs : {0, 1} {0, 1} `(n) is a collision-resistant hash function, do the following constructions Hs also provide collision-resistant hash functions? Explain your answers. [2 marks each] (i) Hs(x) = hs(x) k x (i.e. append x) (ii) Hs(x) = hs(x) k LSB(x) (i.e. append least significant bit of x) (iii) Hs(x) = hs(x | 1) (bitwise-or, i.e. set least significant bit of x to 1) (c) Use Euler's theorem to calculate 51 mod 8. [4 marks] (d) The standard Digital Signature Algorithm (DSA) uses a cyclic subgroup G Z p of the integers modulo a prime p, with prime order q, where q divides p 1. (i) Give two advantages of using a multiplicative subgroup of prime order, as opposed to just using Z p , in cryptographic schemes based on the Discrete Logarithm problem. [2 marks] (ii) Why is it possible to choose q substantially smaller than p, and what is an advantage of doing so?

(a) SoC design involves dividing work between hardware and software as well as deciding the number of general-purpose and custom processors and co-processors to be used. What main factors influence these design decisions and the associated manual partition of envisaged workload over these resources? [5 marks] (b) A lossless compression algorithm converts fixed-size, 1 kByte blocks of data to a variable-sized block that is normally shorter. Suggest a suitable signature (argument and return types) for a software function that implements the algorithm. Draw a diagram showing the external wiring to the neighbouring SoC components for an appropriate, high-performance, hardware implementation. State any assumptions that guide your design approach. [6 marks] (c) A synchronous hardware module has separate input and output ports that each convey 32-bit words. Handshaking is required on both ports since it is unpredictable whether the module or its environment are ready to exchange data in either direction at any time. Give a diagram or RTL module definition for such a component and precisely describe the handshaking protocol in words. State the maximum throughput of your protocol. [5 marks] (d) Why might it be useful to have a formal specification of your protocol from part (c) during design and testing? What, if anything, might we infer about the number of words stored inside the module from the protocol? [4 marks] 13 Topical Issues (a) Compare and contrast the Internet of Things (IoT) with the conventional internet. [4 marks] (b) Describe how Bluetooth Low Energy (BLE) was designed to address the following IoT-related issues. Your answers should consider both BLE advertising and data channels. (i) Reduce the overall power consumption of peripherals. [6 marks] (ii) Handle radio channel contention from other IoT devices. [6 marks] (iii) Handle radio channel interference from other users of the same 2.4 GHz radio band such as WiFi.