CS173: Discrete Structures
Spring 2018, Margaret Fleck
Examinations


Reading Day makeups

A final round of makeups will be held the morning of Reading Day (Thursday May 3rd) in 0216 Siebel. These are only for folks who MISSED the regular offering, not people who took these examlets but did badly. (See the final exam instructions below for how to retake one examlet where you did badly.) Please arrive on the following schedule:

If you are making up examlet 12 plus an earlier examlet, you'll arrive at 9:30 and stay through to the 10:15 makeup for examlet 12. Notice that these late makeups for examlets 9 and 10 will be recorded at 80% of their face value. The examlet 11 and 12 makeups are for full credit.

If you have a conflict with this schedule, please contact Margaret right away.


Final Exam

The final exam will be 9-11am on Friday May 11th. (The official exam period starts at 8am but we only need two hours.) Room assignments are based on the first letter of your last name, as follows:

Please go to the correct room (seating is tight for some of them) and bring your icard.

If you wish to retake one of examlets 1-12 (up to a cap of 80%), you must fill out the retake selection form by 11pm on Tuesday the 8th.

When the exam starts, we will first pass out the 4-page final (aka examlet 13 plus the review examlet). When you turn that in, you'll show your icard and (optionally) pick up your retake. You'll have 1.5 hours of working time (1 hour for the final, 30 minutes for the optional retake). But plan to be in the room for two hours due to delays at the turn-in table, especially in ECE 1002.


Basic examlet instructions

Weekly examlets will be given in class on Thursdays, starting in the third week of classes. There will be two sittings of each exam, one at 9:30 and one at 10:10. The class is divided into two groups, based on the first letter of your last name.

The table below shows which time each group should report.

Before the first examlet, you must read the exam instructions and the exam logistics information. These instructions will NOT be reprinted with each examlet.

The listed chapters and skills are the new skills for each examlet. The examlet will focus on these new skills. However, be aware that you're still expected to remember concepts from earlier in the term.

Study problems should be done before the corresponding examlet. You do not need to turn in your solutions. Write up your answers, as if you planned to turn them in. Then check your work against the annotated solutions. Actually writing up the answers is important, since it forces you to work through the details and practice composing a polished proof.

You are encouraged to compare study problem solutions with your classmates, bring them into office hours to consult with course staff, etc. High-level discussion on Piazza is ok, as is discussion of very specific issues and possible bugs. However, significant pieces of solutions should be posted only privately to the course staff.

The information (e.g. skills list, study problem) for each examlet should be viewed as tentative until a week before the examlet date. We don't expect large changes but there might be small ones.


 
Examlet Date Textbook sections Skills list Study Problems 9:30 sitting Examlet Solutions
#1: Prerequisites and Logic 1 Feb Chapters 1 and 2
excluding 1.5-1.6
Examlet 1 math prerequisites
logic
Group 1 A sheet
B sheet
A sheet
B sheet
#2: Number theory 8 Feb Chapters 3 and 4
excluding 4.12-4.14
Examlet 2 proofs
number theory
Group 1 A sheet
B sheet
A sheet
B sheet
#3: Modular arithmetic
Set theory
15 Feb 4.12-4.14, Chapter 5 Examlet 3 modular arithmetic
set theory
Group 1 A sheet
B sheet
A sheet
B sheet
#4: Relations 22 Feb Chapter 6 Examlet 4 relations Group 1 A sheet
B sheet
A sheet
B sheet
#5: Functions 1 Mar Chapters 7 and 8 Examlet 5 functions Group 1 Only sheet Only sheet
The contents of examlets 5 and 6 were somewhat non-standard this term, due to the GEO strike.
#6: Graphs 8 Mar Chapter 9 Examlet 6 graphs Group 1 A sheet
B sheet
A sheet
B sheet
#7: Two-way bounding
Easy Induction
15 Mar 1.5, Chapter 10, 11.1-11.7 Examlet 7 two-way bounding
easy induction
Group 2 A sheet
B sheet
A sheet
B sheet
#8: Induction
Recursive Definition
29 Mar Chapters 11 and 12 Examlet 8 unrolling
induction
Group 2 A sheet
B sheet
A sheet
B sheet
#9: Trees, Grammars 5 Apr 1.6, Chapter 13
excluding 13.6, 13.7
Examlet 9 tree induction Group 2 A sheet
B sheet
makeup
A sheet
B sheet
makeup
#10: Big-O
Recursion Trees
12 Apr 13.6, 13.7, Chapter 14 Examlet 10 recursion trees
inequality induction
Group 2 A sheet
B sheet
A sheet
B sheet
#11: Algorithms, NP 19 Apr Chapters 15, 16 Examlet 11 algorithms Group 2 A sheet
B sheet
A sheet
B sheet
#12: Contradiction
Collections of Sets
26 Apr Chapters 17, 18 Examlet 12 contradiction
collections of sets
Group 2 A sheet
B sheet
A sheet
B sheet
Final: State Diagrams
Countability
Friday
11 May
8-11am
Chapters 19, 20 Final examlet state diagrams
countability
N/A version 1
version 2
version 1
version 2