Introduction to Discrete
Structures
CS 214-01 – Fall 2004
Instructor: Dr.
Ramazan Aygün
Office: Technology
Hall N360
Email: raygun@cs.uah.edu
Phone: 824-6455
Office Hour: MT 2:
Meeting day(s): MW
Location: N308
The objective of this course is to introduce the student to
the fundamental concepts in discrete mathematics for building a background for
other courses in computer science.
CS121 and MA171.
Judith L. Gersting, Mathematical Structures for Computer Science, Addison-Wesley, Fifth Edition
Title |
Reading Chapters |
Statements, symbolic representation, and tautologies |
1.1 |
Propositional logic |
1.2 |
Quantifiers, predicates, and validity |
1.3 |
Proof techniques & Induction |
2.1, 2.2 |
Recursion and Recurrence Relations |
2.4 |
Sets & Counting |
3.1, 3.2 |
Pigeonhole Principle & Permutations |
3.3, 3.4 |
Combinations & Probability |
3.4, 3.5 |
Relations |
4.1 |
Functions |
4.4 |
Matrices |
4.5 |
Graphs & Trees |
5.1, 5.2 |
Finite-state machines |
8.2 |
20% Homeworks
10% Projects
20% Midterm 1,
20% Midterm 2,
30% Comprehensive final exam,