Discrete Mathematics - CSCI2427 - Fall 2008 - Robert Hochberg, instructor

Discrete Mathematics

Instructor - Robert Hochberg
Office- STC C-121
Phone- 328-9685
Email- hochberg@cs.ecu.edu Text - Essential Discrete Mathematics for Computer Science by Feil and Krone Office Hours
MW 10-12
W 3:30-4:30

General Notes

Each chapter should be read in advance of the classes on that chapter.
Remember that any time you read a technical book, you should have pencil and paper nearby
It is important to do the transcript as you go. Please don't do it all at once at the end.

**Course Schedule** (*subject to change*)
Chapter	Section 1 (MWF class)	Section 2 (MW class)	Notes and Assignments
0 - Proofs	8/20-8/25	8/20-8/25	Homework due Monday, 9/1, in class: * Transcript * Even numbered problems, #2-16, on pages 12-13 Plese write each problem up neatly, in complete sentences, with a reasonable mixture of mathematical symbols and English words. Please click here for a few sample write-ups.
1 - Sets	8/27 - 9/3	8/27 - 9/3	Homework due Monday, 9/15, in class * Transcript * Problems #2, 6, 12, 14, 20, 25, 26, 30, 32 (give a proof), 40, 46, 48, 58
2 - Functions and Relations Notes from 9-8	9/5-9/15	9/8-9/15	Homework due Monday, 9/22, in class * Transcript * Problems #2, 4, 8, 10, 12, 14, 20, 24, 26, 32, 34, 36.
Exam Review	Chapters 0, 1 and 2 HW Solutions Section 1 Review Notes	Section 2 Review Notes
3 - Boolean Algebra	9/17-10/6	9/17-10/8	Homework due Monday, 10/20 * Transcript * Problems #2, 3, 7, 13(show work), 14, 15(show work), 45, 46, 50, 51, 53, 54
4 - Induction Notes from 10/24	10/10-10/24	10/15-10/27	Homework due Wednesday, 10/29 * Transcript * Problems 3, 5, 11, 13, 24, 25, 28, 33.
5 - Number Theory Notes Java Program to do RSA			Homework due Wednesday, 11/19 * Transcript * Problems 2, 4, 10, 14, 19, 23, 31, 32 Also, do these: A: Find gcd(580, 722) using the Euclidean Algorithm B: Find phi(722), phi(1000) and phi(1001), where that's the Euler phi-function from page 111 C: Compute 238⁷⁴³⁸ mod 7 D: Compute 238^₇₄₃₈ mod 20
Exam 2 Review	Chapters 3 and 4 HW solutions
6 - Recursion
7 - Solving Recurrences
8 - Counting
9 - Matrices
10 - Graphs