CPSC 220 (Spring 2002)
[General Info] · [Lectures] · [Assessment] · [Assignments] · [Quizzes] · [Exams]
Latest News (04/04/13):
- The extra study session has now been scheduled for Wed, 14 April, 12:00-13:00 in LSK 200. The session will be lead by Holger - please bring any problems you have questions on or that you may want to work on. (Apologies for the late announcement, we had trouble getting a room booked.)
- Holger is offering office hours on Tue, Wed, and Thu (13-15 April) 16:00-17:00 (CICSR/CS 187).
Latest News (04/04/08):
- Midterm 2 & Assignment 7 are available for pickup outside Holger's Office (CICSR 187)
- All Marks to date (everything except Assignment 8) are posted on the newsgroup (or will be very shortly)
- FINAL EXAM: Final: Friday, April 16, 15:30 - 18:30 (3:30 pm - 6:30 pm) LSK 201
- Extra Study Session: Time/Location TBA (probably Tue, 13 April)
Latest News (04/04/02):
Assignment 8 is now available here; it is due on Thursday(!), 04/08, 18:00.
Latest News (archives):
Previous "Latest News" announcements are located here.
General / Administrative Information
Course number & title: CPSC 220 (202): Introduction to Discrete Structures
Prerequisites: One of CPSC 126, CPSC 128. Time: Mon, Wed, Fri 13:00-14:00
Room: Angus 110
Instructor: Holger Hoos (office: CICSR/CS 187; office hours: by appointment )
GTAs: Jocelyn Smith, Dave Tompkins
UTAs: Steve Herbert, Nelson Leong
Course Newsgroup: ubc.courses.cpsc.220
Problems accessing the ubc.courses.cpsc.220 newsgroup? Look under Usenet News and at the FAQ.
Course Description
"An introduction to computer science applications of discrete mathematics. Sets; logic; functions and relations; induction; program correctness; mathematical rigour; algorithms and applications." The primary purpose of this course is to provide students with the ability to construct mathematical proofs and to tell whether or not a proof is correct. These abilities are of critical importance in computer science since they underly the production, discussion, and verification of correctly functioning computers and programs. This course also provides students with a toolbox of mathematical techniques and concepts that are fundamental to most areas of of computer science. Such areas include programming languages, computer graphics, software engineering, hardware design, and the analysis of algorithm efficiency. Course Text
The course is based on the following text-book: Susanna S. Epp, Discrete Mathematics with Applications, Brooks/Cole, 1996. The text is available from the bookstore. Both, the second and (new) third editions can be used.
Lectures
The lectures will be mostly based on the book by Susanna S. Epp (see above). Lecture Topics
- Module 1: Logic and Formal Arguments
- Module 2: Sequences and Proof by Induction
- Module 3: Set theory
- Module 4: Relations and Functions
- Module 5: Counting
- Module 6: Recursion
- Module 7: Finite State Machines
Tutorials (participation optional)
The tutorials are an important component of the course. They offer valuable opportunities to clarify course material and deepen your understanding and mastery of important topics and techniques. We highly recommend that every student be enrolled in one tutorial section and regularly attend that session.
.
Assessment
Final grades will be determined approximately as follows: - homework assignments - 10%
- in-class quizzes - 15%
- mid-term exams - 35%
- final exam - 40%
In order to pass the course a student must obtain a passing average for the examination portion of the course and pass the final examination. (The course grading scheme may be modified at the discretion of the instructor.) EVALUATION SCHEDULE
Homework Assignments
There will be 8 homework assignments, which will be posted Friday evening on the course webpage, and which have to be handed in the following Friday before 18:00.
Late assignments will not be accepted. The purpose of the homework assignments is to confirm and exercise your understanding of the material, and to help you prepare for the quizzes and exams.
You are free to collaborate with others in solving the homework problems, but the solution you submit for marking must be written by you alone (not copied from another source), and you must acknowledge any collaboration that you participated in.
- Assignment 1 (due Fri, 04/01/23, 18:00)
- Assignment 2 (due Fri, 04/02/06, 18:00)
- Assignment 3 (due Fri, 04/02/27, 18:00)
- Assignment 4 (due Fri, 04/03/05, 18:00)
- Assignment 5 (due Fri, 04/03/12, 18:00)
- Assignment 6 (due Fri, 04/03/26, 18:00)
- Assignment 7 (due Fri, 04/04/02, 18:00)
- Assignment 7 (due Thu, 04/04/08, 18:00)
Quizzes
There will be three short in-class quizzes. The purpose of the quizes is to provide additional assessment of your mastery of the material. The problems on quizzes will be of the same types as those you will have worked on in previous homework, and thus should not present any surprises.The quizzes are closed-book, but you may use a letter size, two sided, sheet with handwritten notes.
- The first quizz will be on Monday, 04/01/19, during the last 15min of class. The quizz will cover material from Module 1 (first two weeks of classes).
- Quiz 2: Wednesday, Feb 11th
- Quiz 3: Monday, March 8th
Exams
The midterm exams are closed-book, but you may use a letter size, two sided, sheet with handwritten notes.
- Midterm 1: Monday, Feb 2. 19:00 - 20:15 (7 pm - 8:15 pm) Woodward IRC - Room 5
- Midterm 2: Monday, March 22. 19:00 - 20:15 (7 pm - 8:15 pm) Woodward IRC - Room 5.
- Final: Friday, April 16, 15:30 - 18:30 (3:30 pm - 6:30 pm) LSK 201
last update 04/04/08, dt