04/26: Solutions to the final with point assignment here
04/23: Solutions to review sheet 3 here
04/22: Solutions to the last part of review sheet 2 here and here
04/14: Solutions to part of today's review sheet Here The remaining exercises will be
discussed in our last class.
04/11: Solutions to today's review sheet Here
04/04: Extra office hours available every day after 4:30 in 543NI by professor Sadaka
03/31: Here is a collection of
solutions to problems you were assigned for homework. You should consider it as
an help to decide if you need to drop this class. You should try to solve them
and see if your solutions matches up with mine. Pay attention to possible typos.
02/20: Next homework-set is due this Thursday; bring question for Wednesday:
there will be a review section.
02/08: New policy: I will drop your worst 2 quizzes if we will have at least 8
quizzes; otherwise I'll drop only one.
02/08: New policy: I will collect a copy of your homework each Thursday (keep a
copy for your own record)
02/02: Class canceled again, quiz moved to tomorrow
01/28: Final: April 25th 8-10am
01/28: Next quiz moved to Wed
01/23: Just discovered an English typo in the notes on knights and knaves;
fixed.
01/20: First quiz next Monday, it will cover up to union, intersection and
difference of two sets
01/19: Revised version of syllabus on-line. Quiz next Monday.
01/13: more explanations on today's class
here
01/11: Office hours moved from Jan 17th to Jan 20th 10-11:30
This is an approximate list of topic that will be covered in this course, when
completed each topic will be green
(the numbers refer to sections in Rosen's book):
1.1 Propositional logic
1.2 Propositional equivalences
2.1 Sets
2.2 Set operations
2.3 Functions
11.1 Boolean functions
11.2 Representing Boolean functions
11.3 Logic gates
2.4 Sequences and summations
4.1 Mathematical induction
4.3 Recursive definitions and structural induction
5.1 The basics of counting
5.3 Permutations and combinations
5.4 Binomial coefficients
7.1 Recurrence relations
7.2 Solving linear recurrence relations
7.5 Inclusion-exclusion
7.6 Applications of inclusion-exclusion
9.1 Graphs and graph models
9.2 Graph terminology
9.3 Representing graphs and graph isomorphism
9.4 Connectivity
10.1 Introduction to trees
10.4 Spanning trees
Homeworks
01/10 pp. 16-18, #2 (e,f), 3 (c,d), 5 (a,b,c,h), 7 (b,d,f), 17, 23, 27;
01/19 pp. 28 #9, 15; prove as many equivalences as you can from tables on page
24 and 25.
01/20 pp. 119-120, #1, 4, 12, 24, 29; pp. 130-132, #1-3, 18, 19, 29, 30
01/26 pp. 146-147, #1, 2, 7, 10-13, 15, 16, 17, 19 (a-c), 29-32, 35. Some of the
exercises are hard, I will try to explain some of them in class tomorrow; read
chapter 2.3 in the book to have a list of synonyms to the concept defined in
class today.
01/31: p. 756, #1, 2, 5(a,b), 9, 10, 13
02/03: p. 760, #1, 3, 12, 13. pp. 765-766, #1, 3, 6, 7, 8.
02/08: p. 161, #3, 7, 10
02/21: p. 280, #10, 19, 21, 13, 16, 23, 25, 20, 22; p. 308, #12, 13, 15, 16
03/09: pp. 344-345, #1, 7, 8, 11, 12, 16, 21, 27, 31-33; pp. 360-361, #2, 3, 5,
6, 13, 17,19, 20, 27, 30, 31
03/10: p. 369, #3, 4, 7, 9, 13-15. I will discuss more chapter 5.4 next
Monday.
03/20: pp. 456-459, #1 (a,b), 5 (a-e), 9 (a, c, e, g),25, 27, 29, 40, 41, 42.
pp. 471, #3(c,d,e,f), 4(a,b,c,d,e,f), 7,8 ,11.
03/28: pp. 596-597, #13, 15, 21. pp. 608-610, #1, 5, 13, 23, 25, 26, 29, 31-33, 34-37.
03/31: pp. 618-620, #5, 9, 34-37, 39, 41, 57, 67
04/11: pp. 693-694, #1, 11a, 12a, 17-19. pp. 630-631, #6, 29-32.
Grades
Grades are now expressed /100.
Best 5 quizzes is the average of your quizzes having dropped your worst two.
Course grade is the best between 20%M 40%Q 40%F and 10%M 30%Q 60%F.