|
home—info—lectures—exams—archive
Reading is to be completed by the beginning of the week. (Though it's okay to have read the first half of the assigned reading by Monday, and the second half by Wednesday.)
This syllabus is tentative; updates will be mentioned in class. Be sure to check back regularly. Assignments are not finalized until 1.5 weeks before the due-date.
week of … | reading | due | soln |
---|---|---|---|
Sep.01 | §1.1, 1.2 | Fri: hw01—Propositional Logic, Boolean Algebra | hw01-soln.html |
Sep.08 | §1.3 | Fri: hw02—Quantifiers | hw02-soln.html |
Sep.15 | §1.4, 1.5 | Fri: hw03—First Order Logic | hw03-soln.html |
Sep.22 | §1.6, 1.7 | Fri: hw04—Proof Strategies | hw04-soln.html |
Sep.29 | §2.1,2.2, start 2.3 | -- | |
Oct.06 | §2.3 | Fri: hw05—Set basics | hw05-soln.html |
Oct.13 | hw06-soln.html | ||
Oct.20 | § 2.4 | Mon: exam |
exam01-soln.html |
Oct.27 | §3.1-§3.3 | Wed: hw07—sums | hw07-soln.html |
Nov.03 | §5.1-5.3 (5ed: §4.1-4.3) | hw08-soln.html | |
Nov.10 | §5.1-5.3 (5ed: §4.1-4.3) | Fri: hw09—sums, induction | hw09-soln.html |
Nov.17 | §5.4,5.5, and Cardinality pp.158-160
(5ed: §4.4; look up “Cardinality”) |
Fri: hw10—induction | hw10-soln.html |
Nov.24 | gobble gobble | ||
Dec.01 | §12.1-12.3 | Fri: hw11—counting; cardinality | hw11-soln.html |
Dec.08 | §9.1-9.4,9.6 | Fri: hw12—FSMs; matching | hw12-soln.html |
Final exam sheduled for Dec.18 (Thu) 10:15–12:15.
Homeworks are graded on
clarity of presentation,
1
which includes use of standard notations.
Short correct answers much better than long correct answers
(which are, in turn, much better than long correct answers that contain both
necessary and superfluous statements).
Example of some answers, from best to worst:
Some extra credit will be offered for participating in Project Euler problems, based on the difficulty of the problems and the quality (and clarity) of your solution. You can submit at most two problems per week for extra-credit this way.
1We don't actually care much about whether you know whether the rationals are closed under exponentiation. But we do need you to be able to take the definitions and work with them in a proof to reach the desired conclusion, in a straightforward way. ↩
2A math major might mention that specifically, it contradicts the theorem that integers have a unique prime factorization. ↩
home—info—lectures—exams—archive
©2008, Ian Barland, Radford University Last modified 2008.Dec.15 (Mon) |
Please mail any suggestions (incl. typos, broken links) to ibarlandradford.edu |