CS 201 Fall 2002

CS 201 (Fall 2002)

Data Structures and Discrete Mathematics I

Course description

This course is a blend of theory and practice. You will study some of the fundamental theoretical topics in Computer Science. These include mathematical induction, set and function theory, run time analysis, combinatorics, and logic. You will also learn some basic data structures and algorithms, and do programming projects to strengthen your programming skills and to apply theory in practice. In addition, you will also study the basics of object-oriented programming using C++.

General Information

Instructor: Bing Liu
- Email: me
- Tel: (312) 355 1318
- Office: SEO 931
Lecture times:
- 12:30pm - 01:45pm, Mon & Wed
- 01:00pm - 01:50pm, Fri
Location: 3F LC
Office hours: 3:00-5:00pm Mon and Wed (or by appointment)
Teaching Assistants: TBA.
- Office: TBA
- Email: TBA

Grading

Final Exam: 30%
Midterm: 30%
Projects and assignments: 20%
Quizes: 20%
In addition, you must pass the final to pass the course.

Prerequisity

MATH 180
C or better in CS 102 or C or better in CS 107
Credit is not given for CS 201 if the student has credit in MCS 261

Teaching materials

Required texts
- Data Structures and Algorithm Analysis in C++, by M. Weiss
- Mathematical Structures for Computer Science, by G. Gersting
Recomm. Text: Any C++ book.

Topics (subject to change)

Mathematical induction and recursion
Run time analysis
C++ classes
Linked lists, stacks and queues
Set and function theory
Basics of hashing
Propositional and predicate logic
Combinatorics
Introduction to trees and graphs

Assignments and Projects

Coming up ...

Rules and Policies

Statute of limitations: No grading questions or complaints, no matter how justified, will be listened to one week after the item in question has been returned.
Cheating: Cheating will not be tolerated. All work you submitted must be entirely your own. Any suspicious similarities between students. work (this includes homework, exams and program) will be recorded and brought to the attention of the Dean. The MINIMUM penalty for any student found cheating will be to receive a 0 for the item in question, and dropping your final course grade one letter. The MAXIMUM penalty will be expulsion from the University.
MOSS: Sharing code with your classmates is not acceptable!!! All programs will be screened using the Moss (Measure of Software Similarity.) system.
Late assignments: Late assignments will not, in general, be accepted. They will never be accepted if the student has not made special arrangements with me at least one day before the assignment is due. If a late assignment is accepted it is subject to a reduction in score as a late penalty.
Classroom Conduct: Classroom discussions and questions are a valuable part of the learning process and are encouraged. However, students who repeatedly talk among themselves disrupting the class lecture will be asked to leave.

Back to Home Page.

By Bing Liu, on Aug 21, 2002