| Instructor: Peter Breznay | Location: Computer Science Lab (MAC 122) | |
| Office Hours: MW 2:30-3:30 pm | Office: CH C324 | |
|
and by appointment | Phone: 465-2170 |
Text:
R.
Johnsonbaugh, Discrete Mathematics HTML, XHTML and CSS,
7th Edition, Pearson- McGraw Hill, 2009
Discrete Mathematics Lecture Notes, available in the Phoenix bookstore
Schaum’s Discrete Mathematics and Matrix Operations.
| Topic | Content Description |
|---|---|
| 1 | Review of basic algebra, exponents, logarithms. |
| 2 | Positional Number Systems. Conversions, binary, decimal, octal and hexadecimal number system. |
| 3 | Basics of Linear Algebra. Matrices. Transpose and conjugate matrix, symmetric and self-adjoint matrices. |
| 4 | Operations on Matrices. Row and column echelon form. |
| 5 | Gauss-Jordan normal form. Systems of simultaneous linear equations. Diagonal matrices, inverse matrix, determinant. |
| 6 | Mathematical Logic. Propositions, connectives, compound statements. |
| 7 | Truth tables, implications. Hypothesis and conclusion. Laws of inference. |
| 8 | Quantified statements. Propositional Logic. |
| 9 | Summation notation. Counting methods. Mathematical proofs. |
| 10 | Mathematical induction. Divisibility Proofs. |
| 11 | Sets. Union, intersection and complement. Venn diagrams. |
| 12 | Cardinality. Power set. Direct product. |
| 13 | Counting Techniques. Multiplication principle. Permutations. Factorial. |
| 14 | Combinations and variations. Combinatorics. Pigeon hole principle. |
Grading Policy: Homeworks 50%, Midterm 20%, Final 30%
Assignments:
Problem Sets