Consider the following ML function assertion: a laugh cat (b,f) (x::xs) = f(x,(cat(b,f) xs)); (i) Give the
Question:
Consider the following ML function assertion: a laugh cat (b,f) (x::xs) = f(x,(cat(b,f) xs)); (i) Give the type of the characteristic cat. (ii) Using the function cat outline a function filter such that filter p l returns the ones elements in a list l that satisfy the predicate p. (iii) Using the characteristic cat define a feature cmap such that cmap f l applies characteristic f to every element in listing l. (b) Consider the subsequent ML characteristic assertion: a laugh ana (p,g) b = if p(b) then [] else permit val (a,b1)=g(b) in a::(ana (p,g) b1) give up; (i) Give the type of the feature ana.(ii) Using the characteristic ana define a function zip that converts a couple of lists right into a listing of pairs. (iii) Using the feature ana define a characteristic amap such that amap f l applies function f to each detail in list l.
(c.) (a) Describe an effective calculation to determine if two confined line portions in a aircraft move. You would possibly receive that the stop points of each line are given as x-y organizes. (b) Describe exhaustively a gifted calculation to track down the curved shape of a group of focuses mendacity on a plane. Show that the intricacy of the Graham check utilized in
the calculation is O(n) and that the calculation all in all has intricacy O(n log n). (c) Discuss how it is possible to kill a substantial range of the focuses before the curved frame calculation is positioned.
Explain why show devices have all of the earmarks of being ready to recreate (nearly) all of the sunglasses of the range utilizing just red, inexperienced and blue light. (b) Describe a calculation (other than thresholding) with the intention to trade over a greyscale picture (eight portions for every pixel) to a bi-degree excessive assessment picture (1 digit for every pixel), with similar wide variety of pixels, at the same time as conserving however much detail as can be anticipated. (c) Explain what specular and diffuse reflection are in fact. State and make feel of situations for running out approximations for each in a PC.
(d) (a) Explain the differences (illustrating every with a small application) among (i) static and dynamic binding (scoping); (ii) static and dynamic typing.
(b) Java is sometimes said to be "dynamically typed" in that a variable whose type is (magnificence) C may be assigned a value of (magnificence) D provided that D extends C; conversely a variable of type D can be assigned a price of kind C the use of a cast. By thinking about garage layouts, give an explanation for why the former project is continually valid and the latter every now and then invalid.
(c) A new programming language has the belief of "statically scoped exceptions" wherein the program
exception foo;
void f()
attempt
void g() raise foo;
attempt
g();
except (foo) C2
besides (foo) C1
might execute C1 in place of C2 because the former become in scope at the boost point. By analogy with statically scoped variables, or in any other case, provide an explanation for how such exceptions might be carried out on a stack.
Expert Answer:
