ICS 241: Discrete Mathematics for Computer Science II (Fall 2009)

 

Day, Time and Location

MWF 10:30a.m. – 11:45a.m. at POST 126 (Friday: recitation)

 

Instructor: Kyungim Baek

Office: POST 314F

Office Hours: Mondays 1p.m. – 4p.m. or by appointment

E-mail: kyungim(AT)hawaii.edu

Tel: 808.956.8560

 

TA: Jade (Yu) Cheng

Office: POST 303-3

Office Hours: Tuesdays and Thursdays 11a.m. – 12p.m. or by appointment

E-mail: yucheng(AT)hawaii.edu

 

Description:

Recurrence relations and their solutions, divide-and-conquer relations, equivalences and partitions, elementary notions of the graph theory, connectedness, subgraphs and isomorphisms of graphs, shortest path problems, trees and their applications, tree traversal, spanning trees, Boolean algebra, introduction to formal languages and automata theory.

 

Prerequisites: ICS 141 or consent.

 

Textbook

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

 

Lecture Schedule (tentative)

 

Date

Topics

Assignment Due

week1 (8/24, 26)

Introduction, Program Correctness

 

week2 (8/31, 9/2)

Recurrence relation , Divide-and-Conquer

HW 0

week3 (9/9)

Inclusion and Exclusion, Relations

 

week4 (9/14, 16)

n-ary Relations, Closure of Relations

HW 1

week5 (9/21, 23)

Equivalence Relations, Exam I

 

week6 (9/28, 30)

Partial Ordering

HW 2

week7 (10/5, 7)

Graphs: Representation & Isomorphism

 

week8 (10/12, 14)

Graph Connectivity,

Euler and Hamiltonian Paths

HW 3

week9 (10/19, 21)

Shortest Path Problems, Exam II

 

week10 (10/26, 28)

Planar Graphs, Graph Coloring,

Trees, Tree Traversal

HW 4

week11 (11/2, 4)

Spanning Trees, Minimum Spanning Trees

 

week12 (11/9)

Boolean Algebra

HW 5

week13 (11/16, 18)

Boolean Algebra, Exam III

 

week14 (11/23, 25)

Languages and Grammars,

Finite-State Machines

 

week15 (11/30, 12/2)

Language Recognition

HW6

week16 (12/7, 9)

Turing Machines, Review

 

 

Grading

Ÿ    Homework assignments: 25%

Ÿ    Exams: 45%

Ÿ    Final Exam: 30% (Monday Dec. 14, 9:45a.m. – 11:45a.m.)

 

NO MAKEUP EXAMS. A missed exam will be credited as a zero.

 

Ÿ    A: 88 £ total grade

B: 77 £ total grade < 88

C: 65 £ total grade < 77

D: 55 £ total grade < 65

F: 0 £ total grade < 55

 

Late Policy

If you hand in late work without approval of the instructor you may receive zero credit. Homework is due at the beginning of class on the assigned due date.

 

Cooperation on Assignment

You are allowed to discuss strategies for solving assignments with other students, however collaboration on solutions/codes, sharing or copying of solutions/codes is not allowed. This policy will be strictly enforced.

CHEATING WILL BE PUNISHED WITH AN F GRADE AND REPORTED TO THE DEAN. (This policy will be equally applied to those who copy other’s work and who allow their work to be copied.)

 

You may consult public literature (books, articles, etc) for information, but you must cite each source of ideas you adopt.

 

Web Page

All class materials will be posted on the class web page at Laulima (https://laulima.hawaii.edu/).