CS 173 [B], Spring 2015
Exams
Please familiarize yourself with exam instructions before coming to the exams.Final Exam
Friday 5/8/2015 7:00 PM to 9:00 PM in DCL-1320 & LMS-151Students in Discussion Sections BDA, BDB and BDC: go to DCL-1320.
Students in Discussion Sections BDD and BDE: go to LMS-151.
Students in Discussion Sections BDD and BDE: go to LMS-151.
Topics: The exam will focus on the material from Lectures 08-15 and 22-28.
(Consult the Lectures schedule for the topics covered in these lectures. The relevant Discussion-Section Booklet chapters are 5 through 12, and 15 through 19, excluding 17.) For your convenience, here is a rudimentary check-list that lists the concepts covered in these lectures. Also see the "Resources" note below.
Make-up Examlet
During the 2-hour final exam, in addition to the actual exam, you will have the option of attempting a make-up examlet. The score from this examlet will be scaled to 80% (i.e., out of 36 instead of 45), and if it is higher than your lowest examlet score, it will replace that examlet score.Topics for the optional make-up examlet: Lectures 04-07 and 18-20.
Resources: The primary references for the course are the lecture slides and the textbook. You should practice the problems from the following sources:
- In-lecture Clicker questions.
- Problems from homeworks, examlets, recap quizzes and pre-lecture quizzes.
- Problems from the discussion-section booklet (including those not covered during the discussion sections).
- Self-study problems.
- Practice problems from previous terms. Here are some from the "Exams" page of previous terms (you can find more from the "Prior Terms" link above).
- Fall'12 [B] Midterm 2 [Solutions]
- Midterm 2 Practice Problem Set [Solutions]
- Spring'13 [B] homework on functions [Solutions]
- Fall'14 [A] examlet on graphs (with solutions)
- Fall'14 [B] examlet on induction/recursion (with solutions)
- Fall'14 [A] examlet on algorithms (with solutions)
- Spring'13 [B] homework on state-diagrams [Solutions]
Examlets
All examlets are in class, at the very beginning of the lecture (please come on time!). The examlet schedule is posted on the Lectures table.Examlet 7
Tuesday, May 5. Covers Chapters 15, 16 and 19 (Algorithms, State-Diagrams). Lectures 22, 23, 24, 25 and 26 (excluding countability). See HW7 solutions (plus problems on Moodle), and chapters 15 and 18 of the discussion section booklet. Also, self-study problems on algorithms and state diagrams.[Solutions: Part A, Part B]
Examlet 6
Tuesday, Apr 21. Covers Chapters 18 and 14 (Combinations, Big-O). Lectures 18, 19, 20 and 21. See HW6 solutions (plus problems on Moodle), and chapter 17 of the discussion section booklet. Also, self-study problems on collections of sets.[Solutions: Part A, Part B]
Examlet 5
Tuesday, Apr 7. Covers Chapters 12-13 (Recursion, Trees). Lectures 15, 16 and 17. Also, self-study problems: recursion, recursion trees and trees.[Solutions: Part A, Part B]
Examlet 4
Thursday, Mar 19. Covers Chapters 9-11 (Graphs, Induction). Lectures 11, 12, 13 and 14. Also, self-study problems: graphs, 2-way bounding/coloring and induction.[Solutions: Part A, Part B]
Examlet 3
Thursday, Feb 26. Covers Chapters 6-8 (Relations, Functions). Lectures 7, 8, 9 and 10 (excluding counting number of functions and proof by contradiction). Also, self-study problems: relations and functions.[Solutions: Part A, Part B]
Examlet 2
Thursday, Feb 12. Covers Chapter 4 (Numbers). Lecture 4 and Lecture 5. Also, self-study problems: numbers and modular arithmetic.[Solutions: Part A, Part B]
Examlet 1
Thursday, Jan 29. Covers Chapter 2 (Logic). Lecture 1 and Lecture 2 (last part on "Moving Quantifiers" excluded). Additional resource: Self-study problems.[Solutions: Part A, Part B]