|
|
|
|
|
SYLLABUS
COURSE TITLE: Discrete Structures 1
COURSE NUMBER: CS 202
SEMESTER: Spring 2001
REFERENCE NUMBER: 3232
TIME AND ROOM: Thursday 4-6:45, R117
PREREQUISITE: Math 165, Pre-calculus
INSTRUCTOR: Dr. Deborah Bennett
OFFICE HOURS: Tuesday 2-3, 4-6, Thursday 2-4
TELEPHONE NUMBER: (201) 200–2201
E-MAIL ADDRESS: dbennett@njcu.edu
OFFICE: Grossnickle 227
COURSE DESCRIPTION: This course introduces basic theoretical tools for describing algorithmic processes and includes such topics as propositional logic, set theory, and graphs. (3 credits)
COURSE OBJECTIVES/LEARNING OUTCOMES: Students will develop a foundation in the quantitative and logical underpinning of computer science.
REQUIRED TEXTBOOK: Anderson, James. 2000. Discrete Mathematics with Combinatorics. Pearson Publ.
COURSE REQUIREMENTS: Reading should be completed before each section is covered in class. Homework will be assigned at each class and should be completed prior to the next class. Students are responsible for any work missed due to absence.
COURSE CALENDAR/DEADLINE DATES:
Assignments and Reading
Chapter 1 Truth tables, Logic, and Proofs
Chapter 2 Set Theory
EXAM 1 February 15
Chapter 3 Logic, Integers, and Proofs
EXAM 2 March 8
Chapter 4 Functions and Matrices
Chapter 5 Algorithms and Recursion
EXAM 3 April 5
Chapter 6 Graphs
Chapter 8 Counting and Probability
EXAM 4 April 26
FINAL EXAM Thursday, May 10, 4-6 p.m.
EVALUATIONS AND GRADING: There will be four in-class exams (each worth 18.75%) and a final exam (worth 25%). There are no make-up exams. Your final course grade will be determined from your numerical average: 90–100 is an A, 80–89 is a B, 70–79 is a C, 60–69 is a D, and below 60 is an F.
Dr. Bennett's Page | MATH DEPT | COURSE PAGE | NJCU
Last revised 1/21/2001
Copyright 1999