CS381 -- Introduction to Discrete Structures

Term: Spring 2011
Lecture: 3 hours; 3 credits
Prerequisites: MATH 102M or equivalent
Instructor: Professor S. Olariu
Office: E&CS 3300
Phone: 757-683-3915

Office Hours: Tuesday and Thursday 4:30 pm - 5:30 pm

COURSE DESCRIPTION: This course offers an introduction to discrete structures specifically designed for the students in the sciences and engineering. In addition, the course is preparatory to computer science courses CS361 and CS390 and possibly other senior-level offerings. While no previous computing experience is assumed beyond CS150, an adequate background in mathematics is desirable as some of the concepts and illustrative examples assume familiarity with mathematical terminology compatible with MATH 102M or equivalent.

TOPICS AND GOALS: This course is designed as an introduction to the discrete structures that are most useful for computer science. The first major focus is to familiarize the student with the basics of logical reasoning, the cornerstone of dealing with all mathematical objects that are the subject matter of this class. The second major focus is to acquaint the student with those fundamental techniques and structures that will turn out to be key to understanding the basics of of computer organization and algorithms. The mastery of the the structures discussed in class will be reinforced by a number of assignments of graded difficulty.

The course consists of four major modules:

• Logic and fundamental rules of inference;
• Set theory and applications;
• Relations and functions;
• Recursion and recursive definitions;
• Applications to computer science: case studies.

GRADING SCHEME:

• Three intermediate in-class tests, each 15%
• Five assignments 25%
• Final examination 30%

TEXT:

• K. H. Rosen, Discrete Mathematics and Its Applications, 6th Edition, McGraw-Hill, 2007.

ADDITIONAL NOTES:

1. This course is meant to give the participants hands-on experience with various discrete structures. The students should expect to spend a significant amount of time solving the various assignments and other assigned homework. Please note that assigned work is due at the beginning of class and that late homework will not be accepted;
2. Past experience with CS381 shows that student performance is strongly correlated with class participation;
3. The topical coverage will follow the textbook as closely as possible. However, there will be instances in which the material covered in class is not addressed in the text. Such will be the case, for example, with computer-related concepts that will be provided in my lectures only. In case you must miss a class, please make sure to check with a classmate;
4. All tests and exam are closed book, closed notes. Access to the Internet is not allowed during the exams;
5. The students are expected to fully comply with the Old Dominion University Honor Code. Submitting anything that is not your own work without proper attribution is considered plagiarism and constitutes an honor code violation. It is not acceptable to copy written work from any other source (including other students), unless explicitly allowed in the assignment statement. In cases where using resources such as the Internet is allowed, proper attribution must be given. Students may still provide legitimate assistance to one another. You are encouraged to form study groups to discuss course topics. Students should avoid discussions of solutions to ongoing assignments and should not, under any circumstances, show or share solutions to an ongoing assignment. Please see the ODU Honor Council’s webpage at http://orgs.odu.edu/hc/ for other concrete examples of what constitutes cheating, plagiarism, and unauthorized collaboration. The students are responsible for knowing the rules. If you are unclear about whether a certain activity is allowed or not, please contact the instructor.

Back to Prof. Olariu's Home Page