Wednesday, April 8
Today, after our quiz, we will continue in Rosen 10.2, 10.3: Graph Theory.
Special simple graphs
Last time we defined three special simple graphs: Kn, Cn, and Wn.
Wednesday, April 15
You have an online quiz, covering recent material, due by 10:00 a.m.,
Friday.
The exercise list for Fridays test was posted on Bb, on Monday.
Today we will finish our discussion of connec
Monday, April 6
Today we will continue in Course Notes Chapter 2, Rosen Chapter 10: Graph Theory.
Rosen 10.2 #1, 3, 5, 7, 11, 18, 20, 21, 23, 25, 26, 36, 37, 39, 41, 51, 57
On Wednesday we will have a
Monday, April 20
Today we will begin discussion of trees, the topic in Course Notes 2.4 and Rosen (7e) 11.1.
Exercises: Rosen (7e) 11.1 #1, 3, 5, 7, 9, 17, 19
Todays class will consist mainly of a recitati
Friday, April 10
Today we will eventually begin Course Notes 2.2 (Rosen
10.4): Connectivity
Exercises: Rosen (7e) 10.4: #1, 3, 5, 11, 15, 19, 21, 23,
31, 33
GRAPH ISOMORPHISM
Two graphs G = (V,
Monday, February 2
Today we will finish discussion of the transitive closure of a relation.
Try these exercises: Rosen (7e): 9.4 #17, 19, 23, 25
Last time we introduced the connectivity relation R*.
Wednesday, April 1
Today we will give a brief intro to the use of Karnaugh maps in minimizing the sum of products
expansion for a Boolean function of degree three or four.
Rosen 12.4 #5, 6, 7, 9, 12, 14
Friday, April 3
Today we will finish the exercise from the end of class last time, and then begin Course
Notes Chapter 2: Graph Theory.
Rosen 12.4 #5, 6, 7, 9, 12, 14
Rosen 10.2 #1, 3, 5, 7, 11, 18,
Wednesday, February 18
Today we will continue discussing partially ordered sets:
Course Notes Chapter 1, Section 4; Rosen (7e) 9.6.
Try these exercises: Rosen (7e) 9.6 #21, 23, 25, 33, 35
You have an
Wednesday, April 22
Today we will finish Mondays discussion (counting elements of
trees), and begin Rosen 11.3, Course Notes 2.5: traversing
ordered trees.
Exercises: Rosen (7e) 11.3 #1 17 odd;
Course Notes p
Friday, February 13
You have an online quiz, covering the things we discussed on Wednesday, due by
10:00 a.m. , Monday.
Today we will continue discussing equivalence relations (Course Notes Chapter 1, Section
Wednesday, Feb 4
1. Suppose R is reflexive.
Prove/disprove:
A. s(R) is reflexive
B. t(R) is reflexive.
2. Suppose R is symmetric.
A. Prove/disprove: r(R) is symmetric.
B. Prove/disprove: t
Friday, March 6
Today we will continue our discussion of Boolean algebra (Course Notes Chapter 3, Rosen
(7e) Chapter 12).
Try these exercises: Rosen 12.2: #3, 5, 13, 15, 17
Here is your exercise from the
Friday, March 20
Today we will continue in Course Notes Chapter 3, Section 3: Abstract Boolean Algebras.
For this material, we will rely almost exclusively on the Course Notes, not Rosen.
Exercises: 3.2.2, 3.
Wednesday, February 25
There is one topic from partial orders that we havent yet gotten to: well ordered
relations.
We will cover that today.
Course Notes Chapter 1, Section 4; Rosen (7e) 9.6.
Try these
Monday, January 12
Today we will talk about properties of relations, and other things from the beginning
of course notes Chapter 1.
The related material from Rosen (7e) is in 9.1.
Try these exercises
Monday, February 16
Today we will continue discussing equivalence relations and partitions (Course Notes
Chapter 1, Section 3), and then begin covering partially ordered sets (Chapter 1, Section 4).
Try these exer
Wednesday, January 21
Today we will continue to discuss operations on relations.
Try the following exercises:
Course notes 1.7.1, 1.7.2, 1.7.3, 1.8.1, 1.10.1, 1.10.2, 1.10.3, 1.10.4.
You have an online quiz d
Friday, January 16
We will continue talking about properties of relations, and other things from the
beginning of course notes Chapter 1.
The related material from Rosen (7e) is in 9.1 and 9.3.
Try these
Monday, March 2
Today we will fill in a few details about partial orders, and possibly begin discussion of
Boolean algebra (Course Notes Chapter 3, Rosen (7e) Chapter 12).
Try these exercises: Rosen (7e) 12.1
Wednesday, January 28
Last time we talked about the reflexive closure r(R) and the symmetric closure s(R) of a
relation.
Today we will introduce some ideas helpful for the more complicated discussion of the
tran
Monday, January 26
Soon we will begin discussion of closures of relations.
Today we will introduce some ideas helpful for that discussion.
Try the following exercises:
Course Notes 1.13.1, 1.14.1
Rosen (7e) 9.
Friday, January 23
Last time, we introduced composition of relations, including the following theorem:
For relations on a set A, composition is an associative operation.
That is, if R, S, T are relations on A, t
Monday, March 16
Today we will begin Course Notes Chapter 3, Section 3: Abstract Boolean Algebras.
For this material, we will rely almost exclusively on the Course Notes, not Rosen.
Exercises: 3.2.2, 3.5.1, 3
Monday, March 23
Today we will continue proving identities in Boolean Algebra, and introduce the concept of
Boolean atoms.
Practice exercises for Test 3 (Friday)
Rosen (7e) 12.1 #1, 3, 5*, 9, 11, 13, 15-23 o
Wednesday, March 18
Today we will continue in Course Notes Chapter 3, Section 3: Abstract Boolean Algebras.
For this material, we will rely almost exclusively on the Course Notes, not Rosen.
Exercises: 3.2.2,
Friday, January 30
Last time we discussed the reflexive and symmetric closures of a relation R on a set A, and
introduced the idea of a path (which will be useful when we discuss the transitive closure).
You