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: Full Name: Signature: Student Number: Section: Math 103 Final Exam April 2006 2.5 hours. • No calculators, books, notes, or electronic devices of any kind are permitted. • Unless otherwise indicated, show all your work. Answers not supported by calculations or reasoning may not receive credit. Messy work will not be graded. Read each question carefully to be sure you are answering the question being asked. Rules governing formal examinations: 1. Each candidate must be prepared to produce, upon request, a Library/AMS card for identification; 2. Candidates are not permitted to ask questions of the invigilators, except in cases of supposed errors or ambiguities in examination questions; 3. No candidate shall be permitted to enter the examination room after the expiration of one-half hour from the scheduled starting time, or to leave during the first half hour of the examination; 4. Candidates suspected of any of the following, or similar, dishonest practices shall be immediately dismissed from the examination and shall be liable to disciplinary action; (a) Having at the place of writing any books, papers or memoranda, calculators, computers, sound or image players/recorders/transmitters (including telephones), or other memory aid devices, other than those authorized by the examiners; (b) Speaking or communicating with other candidates; (c) Purposely exposing written papers to the view of other candidates or imaging devices. The plea of accident or forgetfulness shall not be received; 5. Candidates must not destroy or mutilate any examination material; must hand in all examination papers; and must not take any examination material from the examination room without permission of the invigilator; and 6. Candidates must follow any additional examination rules or directions communicated by the instructor or invigilator. Problem # Value Grade 1 6 2 5 3 12 4 6 5 7 6 7 7 7 Total 50 1 Formulae N X k =1 k = N ( N + 1) 2 , N X k =1 k 2 = N ( N + 1)(2 N + 1) 6 , N X k =1 k 3 = N ( N + 1) 2 2 , N X k =0 r k = 1- r N +1 1- r Z b a f ( x ) dx...
View Full Document
This note was uploaded on 01/23/2011 for the course MATH 100,200,30 taught by Professor Dr.alejandrocortas during the Winter '10 term at The University of British Columbia.
- Winter '10