About CS 173
Discrete Mathematical Structures is the introductory course for theory in Computer Science. You will learn the mathematical tools necessary to analyze and talk about problems that can or cannot be solved with a computer system. It is a necessity that you learn to write good proofs as well as understand the concepts in Discrete Math.
Also, we are trying out a few new instructional technologies and techniques in an effort to improve learning. These include virtual office hours, in-class voting devices, a Knowledge Center, and a "Problem of the Day" system. As this is an evolving system, it is subject to change. We will be lenient if you let us know when things don't work.
Staff
Dr. Cinda Heeren is teaching CS 173 this semester and is supported by three teaching assistants and eight section leaders. See the Contacts for their availability.
Readings
Textbook
The course text is Discrete Mathematics and its Applications (sixth edition), by Kenneth H. Rosen, published by McGraw-Hill. Copies of this text, and of the Student Solutions Guide, a companion book, are on reserve in the Grainger Engineering library. While the main text contains answers to odd-numbered problems, the Student Solutions Guide presents the same solutions in greater detail, and also provides sample identity sheets, exams, and solutions, for each chapter. You may purchase your own copy of the Student Solutions Guide through the bookstore. There is also a quite helpful web site for this text reachable via the title link just above, containing many additional resources. If you already have a copy of the fifth edition, you can still use it.Resources
Course Website
This website is a very important resource. Be sure to check the class homepage often, and in any case, at least once each day. Also, make sure to reload it (which might involve clearing your cache) to ensure you are seeing the most recent version. Important announcements will be posted as well as handouts, lecture slides, problem sets, and solutions. There is also an extensive list of links and other resources.Homework
Written homeworks will come out roughly once every week. Make sure you read and understand all Problem Set Policies.Exams
There will be two midterm exams and a final exam. See the Exams page for dates and times, posted as soon as available.
Grading Policies
Grades for the course will be computed using a point system according to the scale below. We will use the Illinois Compass system to record your exam and homework scores. This should give you a good idea of your composite score trajectory during the semester.
A 88+ points B 76-88 points C 64-76 points D 52-64 points F <52 points The following table indicates the number of points available for each activity in the course. The instructor reserves the right to add additional point opportunities for all students in the class during the semester.
~12 Weekly Problem Sets 3 points each 2 Midterm Exams (20 points each) 40 points Final Exam 30 points Weekly section attendance 1 point/section Do Your Own Work
You are NOT to copy solutions from ANY source (including, but not limited to, books, people, old class notes or handouts). Refer to the Campus Code regarding academic integrity; cheating will result in a reduced grade, or a grade of "F" for the course. If you are aware of any breach of academic integrity, it is your responsibility to report it to the instructor. Those not doing their own work hurt the majority.There may be designated problems on which you may work with your fellow students, but not with anybody outside of the class. For such designated problems, and only for such problems, if you have a significant discussion about the problem with another person, then you must indicate that fact in writing on your homework, listing the name(s) of the person(s) that you worked with. A necessary, but not sufficient, method of honest collaboration is for no party to leave the meeting with any notes
Themes
Discrete mathematical structures arise throughout every area of computer science, and provide tools that allow us to reason about computation. In this course we have two main goals:
- To learn about a number of different discrete structures (e.g., sets, relations, graphs, trees, etc.) that provide the mathematical formalizations for many computational problems.
- To gain more experience with mathematical arguments and proof techniques, which are essential in reasoning about computation.
We will cover:
- Propsitional Logic
- Set Theory
- Counting
- Discrete Probability
- Functions
- Growth and Big O
- Relations
- Graphs and Trees
A tentative schedule of sections of the book to be covered is available on the Schedule page.
Useful Tips
- Read the text, especially the worked out examples and intuition.
- Attempt the odd-numbered problems in the book and compare your answers with those given in the back of the text. For further explanation, read the solutions given in the Student Solutions Guide.
- When homework solutions are posted, read them carefully and make sure you understand any differences with your answers.
- Consult a TA, a section leader, or the professor to discuss any misunderstandings you may have.
- Check the availablility from time to time of online notes and tutoring materials.
- As always, START EARLY. Even a quick glance over the problems when they are released will help you.