Computer Science Department, CSU

CS201: Discrete Structures - Spring '97

What's New?

Exercises for Chapter 10, including extra credit problems due May 7th. Quiz on Chapter 10 is May 7th.

Course Description

Discrete structures are sets of distinct or unconnected elements. They are used whenever objects are counted, when relationships between finite sets are studied, and when processes involving a finite number of steps are analyzed. The kinds of problems solved using discrete structures include: How many ways are there to choose a valid password on a computer system? What is the probability of winning a lottery? Is there a link between two computers in a network? What is the shortest path between two cities using a transportation system? How many steps are required to sort a set of numbers? In this course you will learn techniques for solving such problems by developing your ability for mathematical reasoning, combinatorial analysis, and algorithmic thinking. (from preface of text book) See the class syllabus (below) for details on class procedures, including the class schedule, grading policy, and exams.

Important Information

Meets: M/W/Th/F, 12:10-1:00 PM, E203 ENGR
Taught by: Chuck Anderson, anderson@cs.colostate.edu
- Phone: 970-491-7491. FAX: 970-491-2466
- Office Hours: 225 USC, M/W/F, 2:00--4:00 PM
Graduate Teaching Assistant: George Anderson,
- Office Hours: Third Floor, Lab Op Desk, Tuesday, 11:00AM - 1:00 PM and Saturday, 1:00PM - 3:00PM.
Text:
- Discrete Mathematics and Its Applications, by Kenneth H. Rosen
  Third Edition, (McGraw-Hill, 1995), ISBN 0-07-053965-0
Prerequisites: To register for CS201, you must have taken CS151. While taking CS201 you must also take M160.
Syllabus, containing details of schedule, grading, and other procedures
Exercises you should understand.
The Computer Science Department's Student Information Sheet

Additional Information That May Be Helpful

Maple

anderson@cs.colostate.edu