CSc 262 Final Examination Saturday, 12 December 1998 4-7 PM Suggested answers will be posted on CSCKAY shortly after 7.
Name_ 1. (25 pts) In this question I ask you to provide the details of the activation records for the Pascal program belo
CSc 262 1.
(20 pts) Suppose that Algol allowed parameters to be passed in three ways, by value, by reference, and by name. What would be the output of the following program if, in procedure M, x is passed by value, y by re
CSc 262 Final Examination Thursday 11 December 1997 8 AM >SUGGESTED ANSWERS<, 1. (20 pts) Write a recursive LISP function entryn such that evaluating the expression (entryn n alist) returns the nth entry in the list alist, if it has at least n entrie
12 November 1997 Suggested answers available after test.
Closed book, closed notes.
1. (40 pts) Below is a Pascal program to list the moves in solving the Towers of Hanoi problem. Certain statements in the program have c
Possible answers to the test are below the test. CSc 262 Test 1 Friday, 19 September 1997
Each question worth 20 points. 1. You are designing a pseudo-code for a machine with 512 words of data memory, 512 words of a separate program memory, where ea
CSc Test 1 Friday 25 September 1988 ANSWERS 1. (15 pts) Given the assignment x=2-3*4-5, for each of a), b), and c) below, find a set of precedence and hierarchy rules for the operatores "-" and "*" such that a) x=-15 b) x=-9 c) x=5 a) Higher preceden
23 October 1998
>ANSWERS< 1. (15 pts) Suppose we have the program ONE below, which is written in some programming language, say ELBONIAN. PROGRAM ONE; INTEGER GLOBAL; INTEGER ARRAY LIST[1.3]; PROCEDURE SUB(PARAM1:INTEGER; PA
CSc 262 Test 3 20 November 1998 >SUGGESTED ANSWERS< 1. (40 pts) In this question I ask you to provide the details of the activation records for the Pascal program below. Beside each statement in the program is the (hypothetical) decimal address for t