solved: Explain how the operation insert (c, v) into T can be correctly…
Explain how the operation insert (c, v) into T can be correctly…Explain how the operation insert (c, v) into T can be correctly implemented inthe {S0, R, T} database. [4 marks](c) Explain how the operation insert (a, c) into R can be correctly implemented inthe {S0, R, T} database. [4 marks](d) For an OLTP database, discuss the performance implications of this so-calledoptimisation. Evil Robot’s dream of lasting romance remains, alas, just a dream. His latestobsession is a toasted sandwich-maker called SN00005833. In order to win heraffections he plans to buy her a chocolate muffin from her favourite shopFat Finbar’sWorld of Cakebefore stealing a bunch of flowers from the local cemetery, giftwrapping the presents, and presenting both gifts to her. Evil Robot’s internal systemshave been constructed using the situation calculus and a theorem prover.(a) Describe the situation calculus, concentrating on the fundamental elements thatyou would expect to see independently of any specific problem. [5 marks](b) Suggest two logical formulae that might appear in Evil Robot’s knowledge basein order to describe the initial state for the above problem. [2 marks](c) Give two examples of a possibility axiom that might appear in the knowledgebase. [4 marks](d) Give two examples of a successor-state axiom that might appear in theknowledge base. One of these should in addition address the ramificationproblem. Explain how it does this. [6 marks](e) Give one example of a unique names axiom and one example of a unique actionsaxiom that might appear in Evil Robot’s knowledge base for this problem.Explain why such axioms are required Given a model of a scene represented as a set of triangles in three-dimensional spacedefining its surfaces, consider the problem of rendering it on a raster display. Writebrief notes on:(a) the data that would be stored for each triangle; [2 marks](b) perspective projection from an arbitrary viewpoint; [5 marks](c) clipping the data to a suitable viewing frustrum; This question relates to binary constraint satisfaction problems (CSPs). A CSP hasa set X = {x1, . . . , xn} of variables, each having a domain Di = {v1, . . . , vni} ofvalues. In addition, a CSP has a set C = {C1, . . . , Cm} of constraints, each relatingto a subset of X and specifying the allowable combinations of assignments to thevariables in that subset.(a) Give general definition of a solution to a CSP. [1 mark](b) Given a binary CSP, define what it means for a directed arc xi ? xj betweenvariables xi and xj to be arc consistent. [2 marks](c) Give n example of how a directed arc xi ? xj can fail to be arc consistent.Explain how this can be fixed. [2 marks](d) Describe the AC-3 algorithm for enforcing arc consistency. [5 marks](e) Prove that the time complexity of the AC-3 algorithm is O(n2d3) where d is thesize of the largest domain. [3 marks](f ) Suggest a way in which the concept of arc consistency, also known as2-consistency can be extended to sets of three, rather than two variables. In theremainder of the question we will refer to this as 3-consistency. [1 mark](g) Give an example of how a set of three variables might fail to be 3-consistent,and show how 3-consistency might then be imposed. [2 marks](h) Suggest a modified version of the AC-3 algorithm that can be used to enforce3-consistency Image transcription textShow working wherever possible. Stickto the variable names given in thequestion. Problem 1) Perf… Show more… Show more Image transcription textQ4) a) Design and sketch a 4 bit sign -magnitude binary subtractor to subtractB[B; B2B,Bo] from A[A3A… Show more… Show more Computer ScienceEngineering & TechnologyNetworking COMPUTER S 310