COMP 202 Study Guide - Final Guide: Function Overloading, Local Variable, Radix
1 Oct 2018
School
Department
Course
Professor
First Name:Last Name:
McGill ID:Section:
Faculty of Science
COMP-202B - Introduction to Computing I (Winter 2010) - All Sections
Final Examination
Friday, April 30, 2010 Examiners: Milena Scaccia [Section 1]
9:00–12:00 Mathieu Petitpas [Sections 2 and 3]
Instructions:
•DO NOT TURN THIS PAGE UNTIL INSTRUCTED
•This is a closed book final examination; notes, slides, textbooks, and other forms of documentation
are not allowed. However, translation dictionaries (for human languages only) are permitted.
•Non-programmable calculators are allowed (though you should not need one).
•Computers, PDAs, cell phones, and other electronic devices are not allowed.
•Answer all questions on this examination paper and return it. If you need additional space, use pages
22-23 or the booklets supplied upon request and clearly indicate where each question is continued. In
order to receive full marks for a question, you must show all work unless otherwise stated.
•This final examination has 26 pages including this cover page, and is printed on both sides of the
paper. Pages 24-26 contain information about useful classes and methods.
1 2 3 4 Subtotal
/4 /6 /5 /5 /20
5 6 Subtotal
/15 /10 /25
7 8 9 Subtotal
/25 /20 /10 /55
Total
/100
1
COMP-202B - Winter 2010 - Final Examination Page 2
Section 1 - Short Questions
1. In one or two sentences, explain each of the following concepts. BE BRIEF; overly long answers[4]
will be grounds for mark deductions.
(a) Off-by-one error
(b) Local variable
(c) Method overloading
(d) Garbage collection
COMP-202B - Winter 2010 - Final Examination Page 3
2. In one or two sentences, explain the differences between the concepts in each of the following pairs.[6]
BE BRIEF; overly long answers will be grounds for mark deductions.
(a) An if statement and a while statement
(b) Classes and objects
100
COMP 202 Full Course Notes
Verified Note
100 documents
Document Summary
Comp-202b - introduction to computing i (winter 2010) - all sections. Mathieu petitpas [sections 2 and 3: do not turn this page until instructed, this is a closed book nal examination; notes, slides, textbooks, and other forms of documentation are not allowed. 22-23 or the booklets supplied upon request and clearly indicate where each question is continued. In order to receive full marks for a question, you must show all work unless otherwise stated: this nal examination has 26 pages including this cover page, and is printed on both sides of the paper. Pages 24-26 contain information about useful classes and methods. [4: in one or two sentences, explain each of the following concepts. Be brief; overly long answers will be grounds for mark deductions. (a) off-by-one error (b) local variable (c) method overloading (d) garbage collection. [6: in one or two sentences, explain the differences between the concepts in each of the following pairs.
