exam2-review.doc.docVIP

CSE452 Exam II Review Logic Programming and Data Abstraction: Explain the purpose of the cut (!) in Prolog. How does it relate to not? (Textbook problem, 14.8) Write Prolog rules to define a version of the member predicate that will generate all members of a list during backtracking, but without generating duplicates. Note that the cut and not based versions of Section 14.19 (pg. 529) will not suffice; when asked to look for an uninstantiated member, they find only the head of the list. Explain the difference between row-major and column-major layout for contiguously allocated arrays. Why does a programmer need to know which layout the compiler uses? Why do most language designers consider row-major layout to be better? Control Flow and Subroutines (6.21) Given the following description for binary search: [Bentley] “We are to determine whether the sorted array X[1..N] contains the element T. Binary search solves the problem by keeping track of a range within the array in which T must be if it is anywhere in the array. Initially, the range is the entire array. The range is shrunk by comparing its middle element to T and discarding half the range. The process continues until T is discovered in the array or until the range in which it must lie is known to be empty.” In your favorite programming language, write the code to produce the binary search according to the above requirements: What looping construct was the most useful for your program? Give the loop invariant(s) for your solution (indicate where you placed the invariant(s))? (8.8) Write (in a language of your choice) a function or a procedure that will produce 4 different effects depending on whether the parameters are passed by value, by reference, by value-result, or by name. (8.16) Why do you suppose that variable-length argument lists are so seldom used in high-level programming languages? OO and Concurrency Name three important benefits of abstraction. What happens to the implementation of a class