Question 5:
Option (D) is the correct answer.
A legal ground substitution can be defined as a substitution which maps all the domain variables to ground, i.e. variable-free, terms. In the given example, all three substitutions (S1, S2 and S3) fulfills the requirement of a legal ground substitution.
So, all the given options are true.
Please comment in case of any doubt.
Please upvote if this helps.
Incorrect Question 5 0/5 pts S3 = [y/g(h(a,b))] Consider the following substitutions: S1 = [y/f(a,g(h(a,b)))] S2...
Incorrect Question 8 0/5 pts Consider the following clause: {P(a,x,h(g(z))), P(z,h(y),h(y))} After unification the following clause is obtained (A) P(a,h(g(a)), h(g(a)))} (B) P(a,h(g(x)),(g(a)))} (C) The original clause is not unifiable (D) None of these. (A) (B) (C) (D)
Incorrect Question 7 0/5 pts Which of the following proposition is true? (A) The clause {P(a,x,f(g(y))), P(z,f(z),f(u))} is unifiable and the set MGU = {[z/a], [x/f(a)], [u/g(y)]} is the most general unifier for it. (B) The clause (P(f(a),g(x)), P(7.7)} is not unifiable. (C) The clause {P(a,x), P(z,f(z))} is unifiable and the set MGU {[z/a], [x/f(a)]) is the most general unifier for it. (D) All of the above. (A (B) (C) (D)
Given the following sequence of instructions: lw $s2, 0($s1) //1 lw $s1, 40($s3) //2 sub $s3, $s1, $s2 //3 add $s3, $s2, $s2 //4 or $s4, $s3, $zero //5 sw $s3, 50($s1) //6 a. List the read after write (current instruction is reading certain registers which haven’t been written back yet) data dependencies. As an example , 3 on 1 ($s2) shows instruction 3 has data dependency on instruction 1 since it is reading register $s2. b. Assume the 5...
Incorrect Question 11 0/5 pts Consider the following resolution process: Resolution Process: 5.-R(a.y) -R(y,a) v R(aa) 3, with [x/a) [z/a) Original Set of Clauses: 6.-R(a,y) -R(ya) resolve 1 and 5 1. -R(aa) 7. Raf(a)) 2 with [x/a) 2. R(x.f(x)) 8. R(a,f(a)) --R(f(a),a) 6 with [y/f(a)] 3. -R(X.X) -R(Y.Z) ROX.) 9. R(f(a),a) resolve 7 and 8 4. -R(X.) R(x,x) 10.-R(af(a)) R(f(a),a) 4 with [x/a) [y/a) 11. -R(a,f(a)) resolve 9 and 10 12. Raf(a)) 2 with [x/a) 13. Empty Clause 11, 12...
Problem Consider three processes A, B, and C which have statements S1, S2 and 53 respectively. These statements should execute in a particular fashion. S3 should be executed only after executing S1 and S2. Statements S1 and 52 can be executed in any order. Implement the above using binary semaphore variables X1 and X2 which are initially set to zero. O A: S1; signal (x1); B: S2; signal (X2); C: wait(x1); wait (X2); S3;
Q4 only: Question 3. Consider the region of R3 given by V is bounded by three surfaces. Si is a disc of radius 1 in the plane z -0. S3 is a disc of radius 2 in the plane z 3 and a) Make a clear sketch of V. (Hint: You could consider the cross-section of S2 with y-0, and then use the circular symmetry. (b) Express V in cylindrical coordinates. (c) Calculate the volume of V, working in cylindrical...
Consider the topology below with 9 hosts (A, B, C, D, E, F, G, H, 1), 4 switches (S1, S2, S3, S4) and 3 routers (R1, R2, R3). The numbers near links between routers R1, R2, R3 represent the cost of the respective link. В. С R 3 D E H b) Number the switch interfaces as you see fit (you can write the numbers on the figure), and assign MAC addresses to all of the adapters (you may simplify...
Question 7 (1 point) S3 S1 S2 3 0 5 1 D1 D2 Loanable funds real interest rate 12 Refer to the figure above. In the 2000 elections George Bush made a proposal to give away the budget surpluses in lower taxes. If the economy started at point 0, then the effect of such a policy would be: to move the economy to point 2 to move the economy to point 4 nothing, the economy would stay at point 0...
EXERCISE 2.4 1. Given $1 = {3,6,9, 52 = (a, b), and S3 = {m, n}, find the Cartesian products: (0) Sy x 52 (b) $2 x S3 (C) 53 x 51 5. If the domain of the function y=5+ 3x is the set (* 1<x< 9), find the range of the function and express it as a set. EXERCISE 2.3 3. Referring to the four sets given in Prob. 2, find: (a) S, US (c) S2 S3 () 54...
3. (30 pts.) Implement the following ASM Func (X, Y, Z, start, U, done) X[O:7], Y[0:7], input start; .Output U[0:7], done Registers A(0:7], B[0:7], C[0:7); . Si: If start' goto S1; S2: A <= X 11 B <= Y 11 C <= (00000000) 11 done <= 0; S3: A <= Add (A, B) 11 C Inc (C); <= .S4: If A' [7] goto S3; · SS: U <= C 11 done <= 1 11 goto S1; end Func Design a...