|
Computer Science 341
Discrete Mathematics
Andrew Yao |
Fall 1998 |
Directory
General Information |
Assignments |
Solutions |
Handouts |
Final Exam |
Course Newsgroup |
What's New?
An introduction to discrete mathematics, particularly those brances of importance
in computer science, including probability theory, analysis of algorithms,
combinatorics, and graph theory. Topics covered include discrete sums, recurrence
relations, generating functions, asymptotics, and special functions. Applications
include the study of trees, permutations, strings, maps, and graphs. Students
will use computer algebra systems and other pertinent computational tools, in
order to verify and develop analytic results throughout the course.
Prerequisites COS 126, MAT 103 and MAT 104.
General Information
Lectures: MW at 1:30pm-2:50pm, Room 105, Computer Science Building.
Professor: Andrew Yao,
321 CS Building, 258-5182,
yao@cs
TA: Xiaohu Qie, 315 CS building, qiexh@cs Office hours:
Tuesdays 2:30-4:00pm
TA: Xiaodong Wen, 412 CS building, wxd@cs Office
hours: Fridays 3:30-5:00pm
Precepts: None