CSC281 Syllabus

Discrete Mathematics for Computer Science


Credit hours: 3

Prerequisites: Math151 + CSC212


Goals of the course:  Summarized primarily as the ability to do valid mathematical reasoning; combinatorial analysis; and dealing with discrete structures (such as trees, graphs and finite-state machines).


Textbook(s): K.H. Rosen, Discrete Mathematics and Its Applications, 5/e, McGraw-Hill, 2003.


Topics (tentative):  Sets (§1.6); Sets Operations (§1.7); Functions (§1.8); Sequences and summation (§3.2); Integers and division (§2.4); Applications of number theory (§2.6); Methods of proof (§1.5); Mathematical induction (§3.3); Recursive definitions (§3.4); Basics of counting (§4.1); Pigeonhole principle (§4.2); Permutations and combinations (§4.3); Binomial coefficients (§4.4); Generalized permutations and combinations (§4.5); Recurrence relations (§6.1); Solving recurrence relations (§6.2); Generating functions (§6.4); Inclusion-exclusion (§6.5); Languages and grammars (§11.1); Finite-state machines with and without output (§11.2–3); Language recognition (§11.4); Turing machines (§11.5).  And if time permits then we'll cover selected topics in Graphs (§8), Trees (§9), and Relations (§7) in that order.


Evaluation: Homework, quizzes and attendance: 10 points; Midterm exams (2): 40 points (better of the two worth's 25pt); Final exam: 50 points.


Sample exams when I last taught this course.



CSC281_Midterm_II_Spring07.pdfCSC281_Midterm_II_Spring07عقيل محمد مصطفى عبدالرحمن العظ
CSC281_Midterm_I_Spring07.pdfCSC281_Midterm_I_Spring07عقيل محمد مصطفى عبدالرحمن العظ