Question

17. Given the following definition of function £, what does the expression "t (1: 2: 3]::" return? let rec f listl match listl with 1 I head::rest -> head f resti b. 6 c. 120 d. 123 456 e. g. 14; 5; 6] h. (6; 5; 4] i. Error message j. None of the above 18. Which of the following is the correct meaning of the C declaration "double (*a [n]) "? a is an array of n pointers to doubles b. a. a is a pointer to an array of n doubles a is an array of n pointers to functions returning doubles d. a is a function returning a pointer to an array of n doubles e. None of the above c. 19. (CIRCLE ALL THAT APPLY) For a language supporting both static and dynamic array bounds, in which of the following array allocation situations would the compiler NOT allocate the array on the stack? A global array variable for which the bounds are static and known at compile time A local array variable for which the bounds are static and known at compile time A local array variable for which the bounds are static and known at run time A local array variable for which the bounds are dynamic and known at run time None of the above a. b. c. d. e. 20. The "mark-and-sweep" algorithm for garbage collection (used in the runtime environment for languages such as OCaml and Java) uses which of the following techniques to minimize the need for additional storage during execution of the algorithm? a. Locks and keys b. Pointer reversal c. Reference counts d. Tombstones e. None of the above Page 4 of 5

Answer 1

18) f. [1; 2 ; 3 ]

19) c
Explanation: Its a function pointer

20) b and d
Explanation: static variables are known at compile time and dynamic things are at run time.

20) Pointer Reversal and Reference Counts
Explanation: Garbage collection uses Automatic Reference Counting & Pointer Reversal technique

Thanks, PLEASE COMMENT if there is any concern.