wing

This was supposed to be done in three stages: (i) gathering requirements and data, (ii) designing a Low Fidelity (Lo-Fi) prototype, and (iii) implementing a High Fidelity (Hi-Fi) prototype. Explain the difference between Functional requirements, Non-Functional requirements, and Data requirements. and Data requirements for the Weather App. ] (b) Explain what Heuristic Evaluation (HE) is. Evaluate the page provided in the figure below using Heuristic Evaluation by explaining which heuristics have been violated and how, and provide a severity rating with reasons.

(c) Explain what GOMS analysis is used to predict. List the steps involved in a GOMS analysis and describe what the GOMS Keystroke-Level Model (KLM) is. Explain three limitations of GOMS analysis. 6 CST0+CST1.2018.3.7 6 Interaction Design (a) During a practical session you were asked to create a working Weather App for a chosen primary stakeholder that works on a desktop or a laptop. This was supposed to be done in three stages: (i) gathering requirements and data, (ii) designing a Low Fidelity (Lo-Fi) prototype, and (iii) implementing a High Fidelity (Hi-Fi) prototype. Describe the four different kinds of stakeholder in a CUSTOM analysis. For each, provide an example stakeholder from the Weather App. [8 marks] (b) Explain what Lo-Fi Prototyping is and what Wizard-of-Oz Prototyping is. List three different kinds of Lo-Fi prototypes other than Wizard-of-Oz Prototyping. Discuss why Lo-Fi Prototyping is considered to be advantageous over Hi-Fi Prototyping. [6 marks] (c) A company has designed two screen layouts for the home page of a Weather App illustrated in the figure below (Layout A and Layout B). Explain what Hick's Law and Fitts' Law predict. Use Hick's Law and Fitts' Law to compare the two screen layouts (Layout A and Layout B), and explain which layout you think would be faster for users to use and why.

This question offers with stochastic approaches N(t), t zero where N(t) represents the number of activities within the time c programming language [0, t]. (a) (i) Define a Poisson technique N(t), t 0 of price > zero. [2 marks] (ii) Show that N(t) Pois(t) for every constant t > 0. You may additionally use the end result that limn(1 x/n) n = e x with out evidence. [4 marks] (iii) Let X1 be the time of the first occasion of the Poisson procedure N(t). Show that X1 Exp(). (iv) Now given that N(t) = 1 derive the distribution of the time of the single occasion in [0, t]. [4 marks] (b) Suppose that events of a Poisson method of rate are independently selected at random with chance p > 0. Show that the method of selected occasions is likewise a Poisson manner and establish its price. [2 marks] (c) Describe how your result from component (b) can be used to simulate a nonhomogeneous Poisson method whose rate characteristic (t) is such that (t) for all t 0. [6 marks] 4 CST2.2018.8.5 4 Computer Vision (a) Explain how every of the subsequent equations or expressions can be used for detecting and estimating visible motion in a spatio-temporal photograph series I(x, y, t). Include on your solution the call used to explain every of those preferred classes of motion extraction models: (i) I(x, y, t) t = v I(x, y, t)

(a) A processor's most important memory is usually carried out the usage of DRAM. (i) Describe a regular DRAM cellular. [2 marks] (ii) Show, with the useful resource of a diagram, how DRAM is organised, making reference to devices, ranks, banks and arrays. [4 marks] (iii) Describe the difference between an open-web page and closed-page row-buffer coverage and the types of get entry to styles they advantage. [2 marks] (b) The MOSI cache coherence protocol provides a new owned (O) nation to the fundamental MSI protocol.When a cache protecting a line in M nation snoops a read request from every other cache, it transitions to O nation and forwards the facts to the requestor. Subsequent snoops for read requests also are fulfilled by this owner cache. An owned line is dirty and simplest one cache can maintain a line in O kingdom at any time. (i) Describe the difference between cache coherence and reminiscence consistency. [2 marks] (ii) Draw a country transition diagram for the MOSI protocol, the use of a new motion Forward to suggest facts being forwarded from one cache to some other. [6 marks] (iii) Draw a table showing how the country of a line in one cache limits the states the same line will have in a one of a kind cache. [2 marks] (iv) Give two benefits of adding this greater owned country to the simple MSI protocol.

(a) At the bottom degree, what is the number one purchaser of electrical energy in digital logic today? Give a components for the predicted electricity or energy use for a CMOS gate. [2 marks] (b) A matrix (a 2-dimensional array) is saved on-chip in static RAM. What primary factors make a contribution to the time and energy had to transpose it? [4 marks] (c) Assume now a square matrix is to be held in DRAM. (i) When may it's beneficial to store a couple of-copies of a given matrix in distinctive DRAM banks? [1 mark] (ii) When might or not it's beneficial to keep a couple of-copies of the matrix (or every other example records structure) in one DRAM bank? [2 marks] (iii) One manner to avoid transposing a matrix is truly to keep an annotation that it's been transposed and to then switch over the row and column arguments for every operation. Why would possibly bodily performing the transpose in the end advantage performance? Where would the annotation be held? [2 marks] (d) A computation operates on rectangular matrices of length one zero five one zero five . The internal loop, to be elevated in hardware, has the subsequent simple shape: for (int i= ...) for (int j= ...)

DD[i, j] = ff(SS[i-1, j], SS[i, j-1])

(i) Are there any loop-carried dependencies? What does this suggest for overall performance optimisation? [1 mark] (ii) If the DRAM timings are 11-11-eleven, which means row activation, column activation and writeback each take eleven clock cycles, estimate roughly the minimum time for a naive implementation of the computation. Assume a simple linear facts format. State all in addition assumptions. [6 marks] (iii) What determines whether or not it's miles possible or a great concept to carry out the operation 'in area' (ie. The use of the equal reminiscence for DD and SS)?

The 2d die is also biased, and has specific numbers: its distribution is Pr(n) = qn with n four, 5, 6, 7, 8, nine. Evil Robot flips the coin. If he gets a head then he rolls the first die, otherwise he rolls the second. He then tells you the outcome. You see most effective the quantity obtained and not anything else. He does this m times, so you have a look at a sequence of m numbers in the variety 1 to 9. Your goal is to estimate p and the distributions of each die, given the m numbers. In the subsequent, n is the vector of m determined numbers (n1 nm) T , is the set of parameters p, p1, . . . , p6, this fall, . . . , q9 and we define q = 1 p. (a) Write down an expression for the distribution Pr(nwherein n 1, . . . , 9. [2 marks

This question offers with stochastic approaches N(t), t zero where N(t) represents the number of activities within the time c programming language [0, t]. (a) (i) Define a Poisson technique N(t), t 0 of price > zero. [2 marks] (ii) Show that N(t) Pois(t) for every constant t > 0. You may additionally use the end result that limn(1 x/n) n = e x with out evidence. [4 marks] (iii) Let X1 be the time of the first occasion of the Poisson procedure N(t). Show that X1 Exp(). (iv) Now given that N(t) = 1 derive the distribution of the time of the single occasion in [0, t]. [4 marks] (b) Suppose that events of a Poisson method of rate are independently selected at random with chance p > 0. Show that the method of selected occasions is likewise a Poisson manner and establish its price. [2 marks] (c) Describe how your result from component (b) can be used to simulate a nonhomogeneous Poisson method whose rate characteristic (t) is such that (t) for all t 0. [6 marks] 4 CST2.2018.8.5 4 Computer Vision (a) Explain how every of the subsequent equations or expressions can be used for detecting and estimating visible motion in a spatio-temporal photograph series I(x, y, t). Include on your solution the call used to explain every of those preferred classes of motion extraction models: (i) I(x, y, t) t = v I(x, y, t)

(a) A processor's most important memory is usually carried out the usage of DRAM. (i) Describe a regular DRAM cellular. [2 marks] (ii) Show, with the useful resource of a diagram, how DRAM is organised, making reference to devices, ranks, banks and arrays. [4 marks] (iii) Describe the difference between an open-web page and closed-page row-buffer coverage and the types of get entry to styles they advantage. [2 marks] (b) The MOSI cache coherence protocol provides a new owned (O) nation to the fundamental MSI protocol.When a cache protecting a line in M nation snoops a read request from every other cache, it transitions to O nation and forwards the facts to the requestor. Subsequent snoops for read requests also are fulfilled by this owner cache. An owned line is dirty and simplest one cache can maintain a line in O kingdom at any time. (i) Describe the difference between cache coherence and reminiscence consistency. [2 marks] (ii) Draw a country transition diagram for the MOSI protocol, the use of a new motion Forward to suggest facts being forwarded from one cache to some other. [6 marks] (iii) Draw a table showing how the country of a line in one cache limits the states the same line will have in a one of a kind cache. [2 marks] (iv) Give two benefits of adding this greater owned country to the simple MSI protocol.

(a) At the bottom degree, what is the number one purchaser of electrical energy in digital logic today? Give a components for the predicted electricity or energy use for a CMOS gate. [2 marks] (b) A matrix (a 2-dimensional array) is saved on-chip in static RAM. What primary factors make a contribution to the time and energy had to transpose it? [4 marks] (c) Assume now a square matrix is to be held in DRAM. (i) When may it's beneficial to store a couple of-copies of a given matrix in distinctive DRAM banks? [1 mark] (ii) When might or not it's beneficial to keep a couple of-copies of the matrix (or every other example records structure) in one DRAM bank? [2 marks] (iii) One manner to avoid transposing a matrix is truly to keep an annotation that it's been transposed and to then switch over the row and column arguments for every operation. Why would possibly bodily performing the transpose in the end advantage performance? Where would the annotation be held? [2 marks] (d) A computation operates on rectangular matrices of length one zero five one zero five . The internal loop, to be elevated in hardware, has the subsequent simple shape: for (int i= ...) for (int j= ...)

DD[i, j] = ff(SS[i-1, j], SS[i, j-1])

(i) Are there any loop-carried dependencies? What does this suggest for overall performance optimisation? [1 mark] (ii) If the DRAM timings are 11-11-eleven, which means row activation, column activation and writeback each take eleven clock cycles, estimate roughly the minimum time for a naive implementation of the computation. Assume a simple linear facts format. State all in addition assumptions. [6 marks] (iii) What determines whether or not it's miles possible or a great concept to carry out the operation 'in area' (ie. The use of the equal reminiscence for DD and SS)?