CS 201 - Spring 2005 (Under Construction)

Data Structures and Discrete Mathematics


Course description

This course is a blend of theory and practice. You will study some of the fundamental theoretical topics that are very useful 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 Java.

Think and Ask!

If you have problems with any topic, exercise question or assignment, DO ASK me or TA for help, we are here to make the course undersdood. DO NOT delay your questions. There is no such thing as a stupid question. The only obstacle to learning is laziness.

General Information

Midterm

Final Exam

Grading

Prerequisites

Teaching materials

Topics (subject to change)

Weekly Exercises (not graded)

(no need to hand in, but one question will appear in a test) For those exercises you can not find answers from book, please see here

Assignments and Projects (graded)

Rules and Policies

Back to Home Page.
By Bing Liu, Dec 8, 2004.