Distinguish the temperament and figure of each unmitigated logic. Utilizing the absolute logic rules, decide if the it are substantial or invalid to follow contentions. Assuming the logic is invalid, list the rule(s) it disregards.

a)

No M is P

All S are M

Some S are P A few felines are amicable. All clocks give the current time. A few entertainers don't have the foggiest idea the proper behavior. No falsehood indicator is awesome. In view of the propositional structure given, decide the [indicated proposition] and decide if it is comparable to the first. Some S are not P. [determine its obverse] A software module controls a car park of known capacity. Lastly If Mrs Adebambo was going to a purchase based on expenses to revenue she wants to see who the big earners are - show a grid with the salary of all the employees of company with the lowest percentage of Salary to Revenue ordered descending . Clustered superscalar processors parcel practical units into bunches. Information NO COPYING sending inside a bunch works as ordinary permitting subordinate guidelines to execute on successive clock cycles. Correspondence between groups ordinarily causes an unexpected setback of 1 or 2 clock cycles. You would find the name of that company from your previous query. () and exit() are triggered when cars enter and leave via the barriers. Give pseudocode for the enter and exit procedures (ii) if the module is a monitor [6 marks] (iii) if the programming language in which the module is written provides only semaphores [7 marks] (I) What issue does grouping endeavor to settle? (ii) Assume a processor has two symmetric groups that contain both utilitarian units and an issue cradle. In this processor, directions should be controlled to a specific bunch before they are embedded in an issue cushion. What should the two fundamental objectives of a decent guiding strategy be? In a proposed, next-generation banking system a number of transactions are to be scheduled to run concurrently: Debit (D) transactions to make payments from customer accounts to a credit card company. Interest (I) transactions to add daily interest to customer account balances. Transfer (T) transactions which first check whether the source account contains sufficient funds then either abort or continue the transfer from source to destination accounts. Customer x is running a T to transfer 1000 from A to B. Customer y is running a T to transfer 200 from B to A. (a) Discuss the potential for interference between any of these transactions. [7 marks] (b) Demonstrate the effect of concurrency control based on strict two-phase locking in relation to the discussion in (a). [8 marks] Consider finite strings over the alphabet {A, B, C}. Say that a string is valid if it does not contain either of the substrings AA, AB. List the invalid strings of length 3. Let (n) be the number of valid strings of length n. Show that for all n > 0 (n + 2) = 2.(n + 1) + (n). [7 marks] Describe an algorithm (other than thresholding) which will convert a greyscale image (64 bits per pixel) to a bi-level black and white image (2 bit per pixel), with the same number of pixels, while retaining as much detail as possible. [11 marks] (i) Explain what specular and diffuse reflection are in the real world. State and explain equations for calculating approximations to both in a computer. (a) (I) Define the thought of least pre-fixed point fix(f) of a consistent endofunction f on an area and express Tarski's proper point hypothesis for it. [ (ii) State Scott's proper point acceptance guideline. [

) program to compute the value of a given position in Pascal's Triangle (See image). Outline the implementation of (i) semaphores [4 marks] (ii) monitors [6 marks] [5 marks] 6 CST.2019.7.6 3 Further Java (a) Describe the operation of wait() and notifyAll(). Ensure that your answer explains when locks are acquired and released. [2 marks] (b) A future is a mechanism to store the eventual result of a computation done in another thread. The idea is that the computation is run asynchronously and the calling thread only blocks if it tries to use a result that hasn't been computed yet. The way to compute any given position's value is to add up the numbers to the position's right and left in the preceding row. For instance, to compute the middle number in the third row, you add 1 and 1; the sides of the triangle are always 1 because you only add the number to the upper left or the upper right (there being no second number on the other side).