When will there be a performance benefit in scheduling two non-interactive applications on the same hyperthreaded processor core so that they run in parallel rather than running sequentially, one job one after the other? [4 marks] A software module controls a car park of known capacity. () and exit() are triggered when cars enter and leave via the barriers. Give pseudocode for the enter and exit procedures (i) if the module is a monitor [8 marks] (ii) if the programming language in which the module is written provides only semaphores [4 marks] (b) Outline the implementation of (i) semaphores [4 marks] (ii) monitors [4 marks] {P(x, x)} {P(x, f(x))} {P(x, y), P(y, z), P(x, z)}

[6 marks] Suppose: The underlying bit channel has a capacity of B, a delay and error rate 0. The compression ratio is C < 1. [4 marks] (d) Give two examples of a successor-state axiom that might appear in the knowledge base. One of these should in addition address the ramification problem. Explain how it does this.With the three datasets you have decided to use multiple tools in your Hadoop environment, an external hive table called "Company" in the default database using Company_data.csv , use a separate folder for file in HDFS. After Completing your hive table make sure you can access it, secondly upload the Company_Emp_data.csv and the Sales_data.csv to a HDFS folder. Suppose that v is a value; is the following equation always

valid? A company XYZ has a finance department which requires a service to be high available. You will need to 1) complete the requirement analysis (with reasonable assumptions); 2) design the solution for the department; 3) implement the solution; and 4) adjust the design and implementation to meet the new requirements. (b) the set D of all complete recursive capacities d : N ! N to such an extent that d(n + 1) 6 d(n) for all n 2 N [10 marks] 4 CST.93.13.5 11 Complexity Theory Make sense of the connection among number and polynomial duplication. [2 marks] Demonstrate the way that the last option can be diminished to an addition issue which can be tackled by lattice increase. [4 marks] 2 CST.2014.4.3 2 Artificial Intelligence I This question relates to binary constraint satisfaction problems (CSPs). A CSP has a set X = {x1, . . . , xn} of variables, each having a domain Di = {v1, . . . , vni } of values. In addition, a CSP has a set C = {C1, . . . , Cm} of constraints, each relating to a subset of X and specifying the allowable combinations of assignments The rules should not use structural congruence (). [5 marks] Enumerate the ways in which a transition crof the form P|Q R can be inferred from transitions of P and/or Q, and indicate the form of R in each case. [5 marks] Hence show that if P|Q R1, then there exists R2 such that Q|P R2 and R1 R2. [5 marks] CST.2000.4.5 6 Data Structures and Algorithms Describe in detail both Prim's and Kruskal's algorithms for finding a minimum cost spanning tree of an undirected graph with edges labelled with positive costs, and explain why they are correct. [7 marks each]