CS136-final exam-Spring08

CS136-final exam-Spring08 - CS 136 Final Exam Spring 2008...

Info iconThis preview shows pages 1–3. Sign up to view the full content.

View Full Document Right Arrow Icon
CS 136 Date: 15-Aug-2008 Time: 12:30 - 3:00p.m. Permitted Aids: None Final Exam Spring 2008 [Place sticker here.] Last Name: __________________________ Given Name: __________________________ Student ID: __ __ __ __ __ __ __ __ Cheating is an academic offense. Your signature on this exam indicates that you understand and agree to the University’s policies regarding cheating on exams. Signature: ____________________________ Instructions: (Read carefully before the exam begins): 1. Place answers in this booklet. If you need more space for an answer, use the last page with an appropriate reference. 2. Before you begin, make certain that you have 12 pages. 3. You are encouraged to read through the entire exam before you begin to answer questions. You do not need to answer the questions in order. 4. The exam will be marked out of 78. There are 3 bonus marks available for a total of 81 marks. 5. Questions will not be interpreted. Proctors will confirm or deny errors only. If you consider the wording of a question to be ambiguous, state your assumptions clearly and proceed to answer the question to the best of your ability. 6. Documentation is always appreciated, but is not required unless explicitly requested. Design recipes are not required. 7. Please write neatly. You are communicating with your markers. 8. For questions requiring C code, you do not need to write #include statements and you may assume malloc returns a non-null result. Q # Marks Available Marks Earned Grader Initials 1 10 2 7+3Bonus 3 16 4 14 5 12 6 19 Total 78 + 3 Bonus
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Page 2 of 12 CS 136 Final Exam July 24, 2008 Spring 2008 1. [10] Memory and Pointers I Write a C function named makeJoy such that struct foo *ohJoy = makeJoy() creates the data structure represented by the box-and- pointer diagram shown on the right. Your code must include an appropriate structure
Background image of page 2
Image of page 3
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 10/02/2011 for the course CS 136 taught by Professor Becker during the Spring '08 term at Waterloo.

Page1 / 12

CS136-final exam-Spring08 - CS 136 Final Exam Spring 2008...

This preview shows document pages 1 - 3. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online