CSI2350: Discrete Structures (Fall 2007)

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 2:00pm – 3:20pm at Rogers 104

Instructor: Dr. Eunjee Song

Office Hours: Monday & Wednesday 1:30 – 3:00pm, Thursday & Friday 11:00am – noon, or by appointment

Office: Rogers 220.17

E-mail: Eunjee_Song(AT)baylor.edu

Tel: 254.710.1498

Teaching Assistant: Joel Anderson (Grading & Tutoring)

Tutoring Hours/Locations

Monday 4:00-5:00pm @ 104

Wednesday 9:30-10:30am @ 113, 4:00-6:00pm @ 104

Tuesday & Thursday 10:00-11:am @ 113

E-mail: Joel_Anderson(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;

· Links to related material.

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

Assignments

Homework (written) assignments are due on Thursday of every week (except HW #2 & #15). 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.

Every homework assignment is due at the beginning of the class on the assigned due date.

Evaluation:

Students will be evaluated on homework and five exams. Homework will be for each week. Note that this will be true even on exams and the days following exams. Each homework assignment will consist of 10 – 20 problems. Your homework grade will be the percent you get credit. Your lowest test grade on a partial exam will be replaced by your homework average.

The course will have four partial exams and one comprehensive exam. The last partial exam and the comprehensive exam will both be given on the final. Each exam will count 20%. NOTE! The comprehensive exam cannot be replaced by your homework average. NOTE! The homework average will replace your lowest exam score even if the homework average is lower than your lowest exam score.

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

Remarks on Written Work

Essays and answers to essay/discussion questions on assignments/exams must be coherent, succinct, readable, and grammatically correct English prose. Part of the grading for such questions reflects this. However, a simple answer, such as 15 or A, without any explanation may receive a grade of zero if wrong. If part of the explanation is correct, the answer may receive partial credit.

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)

The course meets at 2:00-3:20 pm on Tuesdays and Thursdays.

Up-to-date schedule will be posted on Blackboard.

Time

Topic

Text Reading

Assignments (Due Date)

Week 1

Binary and Hexadecimal

Handout



R - HW 1 -		Email assignment

Week 2

Propositional Logic

Sections 1.1-1.4

T - HW 2 -	Handout Section 5.6 Problems 2,4,20,32,42,56,64,80,88,98 * added on 8/23: show how a function power (see pg. 208) works when n=25 (i.e., show the status of variables p, y, and result for each while-loop iteration).

R - HW 3 -	Handout Section 5.7 Problems 6,14,38,54 Section 1.1 Problems 10,14,22,36,50,62

Week 3

Introduction to Proofs

Section 1.5-1.7

R - HW 4 -

Week 4

EXAM #1

Sets

Sections 2.1-2.2

R - HW 5 -

Week 5

Functions
Algorithms

Sections 2.3-3.3

R - HW 6 -

Week 6

Integers and Matrices

Sections 3.3-3.7

R - HW 7 -

Week 7

EXAM #2

Recursion and Induction

Sections 4.1-4.2

R - HW 8 -

Week 8

See Week 7

Sections 4.3-4.5

R - HW 9 -

Week 9

Counting

Chapter 5

R - HW 10 -

Week 10

Probability

Chapter 6

R - HW 11 -

Week 11

Relations

Chapter 8

R - HW 12 -

Week 12

Exam #3
Graphs

Sections 9.1-9.3

R - HW 13 -

Week 13

Graphs and Paths

Chapter 9

R - HW 14 -

Week 14

Introduction to Trees
Thanksgiving

Sections 10.1-2

T - HW 15 -

Week 15

Tree Operations

Chapters 10 (if time)

R - HW 16 -

Week 16

Dead week

FINAL EXAM : December 11, 2:00pm

Comments: email your comments.

Last major modification: August 20, 2007