Channel 1: For what value of is the capacity of this channel minimal? What is the channel capacity in that case?

--------- Furthermore, informations below can be guide but to be optional ----------------

[2 marks] 8 CST.2019.15.5 5 Computer Vision Explain the Bayesian approach to solving problems in computer vision. Explain the notion of an Inverse Problem and how computer vision can be regarded thereby in a formal sense as inverse graphics. Jot down Bayes' rule in general form, and explain the interpretation of its terms as: probability of the image, given the object probability of the object, given the image What is the role of the "prior?" You may assume that the initial table is of size 256 (containing bytes 0 to 255) and that the codes for "A", "B", "C" and "D" are 15, 16, 17 and 10, respectively. [12 marks] (b) Estimate how many bits the algorithm would use to encode a string consisting of 1000 repetitions of the character "A". [8 marks] 4 Comparative Programming Languages (a) Discuss to what extent a programmer can expect a program that conforms to a standard to generate identical results when run under different conforming compilers on different machines. [6 marks] (b) ALGOL 60 provided call by value and call by name, Pascal provided call by value and call by reference, and ALGOL-W provided a variety of calling methods including call by result and call by value-result. Briefly describe the calling mechanisms just mentioned and discuss why most modern programming languages provide only call by value. [8 marks] (c) Discuss the reasons why languages such as Fortran, Algol and PL/I designed in 1950s and 1960s are less widely used than languages designed in the last 80 years. [6 marks] 3 [TURN OVER CST.2004.3.4 5 Operating Systems II (a) What problem do real-time scheduling algorithms try to solve? [2 marks] (b) Describe one static priority and one dynamic priority real-time scheduling algorithm. You should discuss the issue of admission control, and comment on the data structures that an implementation would need to maintain and on how these would be used to make scheduling decisions.are a data structure protected by a mutual exclusion lock. (i) What scheduling problem could arise here? [2 marks] (ii) How could this problem be overcome? [2 marks] (d) The designer also wishes the real-time system. In this processor, headings ought to be controlled to a particular pack before they are implanted in an issue pad. What should the two major targets of a good directing system be.

In the eAlgorithms (a) The Post Office of Maldonia issued a new series of stamps, whose denominations in cents are a finite set D N\{0}, with 1 D. Given an arbitrary value n N\{0} in cents, the problem is to find a minimum-cardinality multiset of stamps from D whose denominations add up to exactly n. In the context of solving the problem with a bottom-up dynamic programming algorithm. . . (i) Give and clearly explain a formula that expresses the optimal solution in terms of optimal solutions to subproblems. [Note: If your formula gives only a scalar metric (e.g. the number of stamps) rather than the actual solution (e.g. which stamps), please also explain how to obtain the actual optimal solution.] [4 marks] (ii) Draw and explain the data structure your algorithm would use to accumulate the intermediate solutions. [2 marks] (iii) Derive the big-Theta space and time complexity of your algorithm. [1 mark] (b) Repeat (a)(i)-(a)(iii) for the following problem: A car must race from point A to point B along a straight path, starting with a full tank and stopping as few times as possible. A full tank lets the car travel a given distance l. There are n refuelling stations so A, s1, s2, . . . , sn B along the way, at given distances d0 = 0, d1, d2, . . . , dn from A. The distance between adjacent stations is always less than l. The problem is to find a minimum-cardinality set of stations where the car ought to refill in order to reach B from A. [7 marks] Note:

(a) What is an information reserve and how can it contrast from a guidance store? (b) What factual properties of memory access reserves exploit to convey further developed execution? (c) What effect will a working framework oversaw setting switch have on reserve hit rate? Legitimize your response. (d) Modern work area and server processors support concurrent multithreading (additionally called hyperthreading). At the point when will there be an exhibition benefit in booking two non-intelligent applications on the equivalent hyperthreaded processor center so they run in equal as opposed to running consecutively, one work one after the other? After, consider different versions of an optimising compiler, each of which uses IEEE standard representation for all variables. Give two reasons why they might compile a floating-point program into code that, when run, produces differing results. [2 marks] 6 CST.2016.1.7 6 The owner (patient) may read from its own EHR. A qualified and employed doctor may read and write the EHR of a patient registered with him/her. (iv) Object: The solution to online coursework. Policy: The coursework setter has read and access. A candidate has no access until after the marks have been published. [8 marks each] 4 CST.2019.13.5 5 Computer Graphics and Image Processing (a.1) Explain why display devices appear to be able to reproduce (almost) all the colours of the spectrum using only red, green and blue light. [4 marks]