Colorado State University Computer Science Department, CSU

Syllabus for CS201: Discrete Structures - Spring '97

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)

Important Information

Important Dates

Here are some important dates. Others will be announced in class as the semester progresses.

Grading

Various components of the class are described in the following sections. Grades will be based on the following items, weighted as follows:

Class Meetings

A section of the text book will be assigned to each class meeting. Before each class, you should read the material and work on as many of the exercises for that section as you have time for. The text book includes answers to all odd-numbered problems. Class meetings will consist mostly of discussions of the topics and exercises of your choosing. After covering a chapter, there will be an in-class quiz over the contents of that chapter. The quiz will be composed of questions that are very similar to the exercises in the chapter. Consider each class meeting as a review for the quiz! Obviously, it will be very important for you to attend class. Even if you fully understand the concepts and exercises, your attendance in class will be valuable. You will learn exactly which exercises the instructor deems important and you will contribute to the discussions in class.

Exams

There will be ten quizzes, given after covering each chapter. A comprehensive final exam will also be given.

Hardware and Software

There are no hardware or software requirements for the class. Maple or some other symbolic math package would be helpful. Student version of Maple are available for PCs. See http://www.maplesoft.com/ for more information. The student version is also on sale at the CSU Bookstore. At CSU, Maple is available on eagle. If running from an X-Window terminal in the CS department, do

On-line Information

The class WWW page is at http://www.cs.colostate.edu/~cs201. If you are unable to access this, let the instructor know immediately. Other arrangements can be made for you to receive the necessary material. The newsgroup csu.cs.201 is available for our use. If you want to ask a question of the class, find a study partner, let others know about a particularly interesting web site you have found, or any other thing you want to share with the class, you are welcome to post a note to this newsgroup. I will also be posting notes regarding any changes to the schedule.

Due Dates, Rescheduling, and Late Policy

If you are unable to take a quiz or exam at the scheduled time, you must notify me as soon as possible. Rescheduling will be possible only in exceptional circumstances. Guidelines can be found in the Computer Science Department's Student Information Student Information Sheet. See the sections Attendance Policy and University Calendar and Incomplete Grade Policy.

Course Schedule

Here is a tentative schedule for the semester. The order of topics will probably remain the same, but the dates may shift. Each entry contains a date, a list of topics, and a reading assignment from Rosen's book.
anderson@cs.colostate.edu
Copyright © 1997 Chuck Anderson