CSc 398
Final Examination
Wednesday 12 May 1999
Page 1
!SUGGESTED ANSWERS! 1. (35 points) (I try very hard never to use the same test question twice. The economics professor can use the same question twice, because the answers change. Anyway, I a
CSc 398
Mid-Term Examination
Wednesday 15 March 2000
>SUGGESTED ANSWERS< 1. The original fibonacci sequence is 1,1,2,3,5,8,., where the next number is the sum of the previous two entries. In general, a sequence starting with any two positive numbe
CSc 398
Mid-Term Test
19 March 1999
Page 1
>ANSWERS< 1. (15 points) Assume that T is an array of numbers. Write three different code fragments, each using a different collection method, to find the sum of the squares of the numbers in T. T:=0. S
CSc 398
Final Examination
Thursday 18 May 2000
>SUGGESTED ANSWERS<
1.
(10 pts)
Assume that thread priority behaves the way the book
says they do, and answer the following question TWICE, the first
time assuming the underlying machine is a PC and the secon