CS173: Discrete Structures
Fall 2018, G. Carl Evans
Examinations

Weekly examlets will be given in class on Thursdays, starting in the third week of classes.

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 13 Sept 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 20 Sept 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
27 Sept 4.12-4.14, Chapter 5 Examlet 3 modular arithmetic
set theory
Group 1 A sheet
B sheet
A sheet
B sheet
#4: Relations 4 Oct Chapter 6 Examlet 4 relations Group 1 A sheet
B sheet
A sheet
B sheet
#5: Functions 11 Oct Chapters 7 and 8 Examlet 5 functions Group 1 A sheet
B sheet
A sheet
B sheet
#6: Graphs 18 Oct Chapter 9 Examlet 6 graphs Group 1 A sheet
B sheet
A sheet
B sheet
#7: Two-way bounding
Easy Induction
25 Oct 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
1 Nov Chapters 11 and 12 Examlet 8 unrolling
induction
Group 2 A sheet
B sheet
A sheet
B sheet
#9: Trees, Grammars 8 Nov 1.6, Chapter 13
excluding 13.6, 13.7
Examlet 9 tree induction Group 2 A sheet
B sheet
A sheet
B sheet
#10: Big-O
Recursion Trees
15 Nov 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 29 Nov Chapters 15, 16 Examlet 11 algorithms Group 2 A sheet
B sheet
A sheet
B sheet
#12: Contradiction
Collections of Sets
6 Dec Chapters 17, 18 Examlet 12 contradiction
collections of sets
Group 1 A sheet
B sheet
A sheet
B sheet
Final: State Diagrams
Countability
Wednesday
19 Dec
8:00-11:00am
Chapters 19, 20 Final examlet state diagrams
countability
N/A version 1 version 1