CS 5333: Discrete Structures

CS 5333 - Discrete Structures
Spring 2007 Course Syllabus
MW 2:30 p.m. - 3:45 p.m. ECSS2.203
Course Homepage: http://www.utdallas.edu/~rxk011000/TEACH/S0753333/

	Instructor	TA
	Radha Krishnan	Xiaofeng Gao
Office	ES 4.225	ES 3.231
Phone	(972) 883-4106
Office Hours	MW 3:50 to 5:00 pm	Tues 1 to 3 pm EN 4.623 Thurs 1 to 3 pm EN 2.104b
Email	Radha.Krishnan@utdallas.edu	xiaofeng.gao@student.utdallas.edu

Catalog Statement: Mathematical foundation of computer science. Logic, sets, relations, graphs and algebraic structures. Combinatorics and metrics for performance evaluation of algorithms.

Textbook: "Discrete Mathematics and Its Applications", 5th edition, by Kenneth Rosen, McGraw Hill, 2003.

Course Content:
- Logic and Proof, Sets and Functions (Chapter 1)
- Algorithms (Chapter 2)
- Mathematical Reasoning, Induction and Recursion (Chapter 3)
- Counting (Chapter 4)
- Discrete Probability (Chapter 5)
- Advanced Counting Techniques (Chapter 6)
- Relations (Chapter 7)
- Graphs (Chapter 8)
- Other topics from text as time permits.
Points: 4 Quizzes (based on 4 HWs): 7.5 points each; 2 Exams: 30 & 40 points respectively.
Grade Determination: 95-100: A+; 90-94: A; 85-89: A- etc. (5-point steps down to <= 50: F)

Tentative Exam Schedule:

Test Date and Time Duration

1 2:30 pm Wednesday, February 28 75 minutes

2 2:00 pm Monday, April 30 120 minutes
Student Responsibilities:
- Regular class attendance has a strong correlation to good performance.
- I take academic honesty seriously -- so should you.
- The purpose of your being here is to LEARN! Never forget that.