CSI2350: Discrete Structures (Fall 2008)

Description (taken from the University Catalog)

An introduction to the foundations of discrete structures as they apply to computer science, focusing on providing a solid theoretical foundation for further work. Topics include sets, ordered structures, graph and trees, functions, proof techniques, number systems, logic, Boolean algebra, etc.

Prerequisite(s): CSI 1430 or concurrent enrollment; and mathematical preparation sufficient to take calculus at the college level.

Objective

An "A" level student will

be able to use truth tables and Boolean algebra to examine propositions and equivalent statements.
understand basic set theory and how it applies to the mathematics of computing
be able to demonstrate basic concepts of proofs
understand the binary, octal, decimal and hexadecimal number systems as they apply to computing
know how graphs, directed graphs and trees are used in computing
understand the basic principles of counting and probability

Day, Time and Location: Tuesday, Thursday 9:30am – 10:45am at NVCC 4126

Instructor: Dr. Eunjee Song

Office Hours: MW 1:30-3:00pm, TR 1:00-2:00pm

Office: Rogers 220.17

E-mail: Eunjee_Song(AT)baylor.edu

Tel: 254.710.1498

Teaching Assistant: Ms. Lei Meng (E-mail: Lei_Meng(AT)baylor.edu)

Textbook (Required)

Kenneth H. Rosen, Discrete Mathematics and Its Applications, 6th edition, McGraw-Hill (2006), ISBN 0-07-331271-1 (hardback).

Textbook Solutions Manual (Suggested)

Kenneth H. Rosen, Student’s Solutions Guide to accompany Discrete Mathematics and Its Applications, 6^th Edition, McGraw Hill.

Textbook Web Page (Highly Suggested)

The authors' web site, http://www.mhhe.com/rosen/, contains:

Guides to writing proofs;
Common mistakes in discrete mathematics;
Links for tutoring help;
A bulletin board;
L inks to related material.

Access to this site requires the Activation ID / Password from the textbook.

Assignments

Homework (written) assignments are due at the beginning of the class on the assigned due date. All work must be your own. Homework assignments should not be done in groups. Duplicate assignments, all or in part, will receive negative grades. There is no late period for assignments in this course.

Grading:

Final Exam: 30%

Homework: 15%

Other Exams: 15% each, 45% total

Quizzes and Attendance: 10%

The Baylor University attendance policy will be strictly enforced! Leaving early or arriving late will be counted as an absence.

Remarks on Written Work

All work must be neat and legible. Illegible or poorly formatted work receives no credit. We reserve the right to define what is or is not legible or easily read.

Schedule (Tentative)

Up-to-date schedule and new announcements will be posted on Blackboard. All students are required to check the course page on Blackboard at least once a day.

Date	Topic	Text Reading
Week 1 (8/26, 28)	Introduction Number representations	Handout
Week 2 (9/2, 4)	Foundations: Logic & Proofs	Chapter 1
Week 3 (9/9, 11)	Basic Structures: Sets, Functions, Sequences, and Sums	Chapter 2
Week 4 (9/16, 18)	EXAM #1
Week 5 (9/23, 25)	Fundamentals: Algorithms, Integers, and Matrices	Chapter 3
Week 6 (9/30, 10/2)	Induction and Recursion	Chapter 4
Week 7 (10/7, 9)	EXAM #2
Week 8 (10/14, 16)	Counting	Chapter 5
Week 9 (10/21, 23)	Discrete Probability	Chapter 6
Week 10 (10/28, 30)	Relations	Chapter 8
Week 11 (11/4, 6)	Exam #3
Week 12 (11/11, 13)	Graphs – Part 1	Chapter 9
Week 13 (11/18, 20)	Trees	Chapter 10
Week 14 (11/25, 27)	Graphs – Part 2 Thanksgiving	Chapter 9
Week 15 (12/2, 4)
Week 16	Study days
FINAL EXAM : Tuesday, December 16, 9:00am

Comments: email your comments.

Last major modification: August 25, 2008