This preview shows pages 1–3. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: Computer Science Foundation Exam August 1, 2003 COMPUTER SCIENCE I Section I B No Calculators! Name: SSN: Score: In this section of the exam, there are three (3) problems You must do all of them. The weight of each problem in this section is indicated with the problem. The algorithms in this exam are written in C. Any algorithms that you are asked to produce should use a syntax that is clear and unambiguous. Partial credit cannot be given unless all work is shown. As always, be complete, yet concise, and above all be neat . Credit cannot be given when your results are unreadable. / 50 KEY Computer Science B Page 1 of 6 KEY 1. (15 points) Write a recursive function that will concatenate two singly-linked lists. Assume that each list has already been created and may or may not be empty. The function is to be implemented requiring only two parameters, which may be assumed to be pointers to the lists to be concatenated....
View Full Document
- Spring '09
- Computer Science