CS 132 Discrete Structures in Computer Science Syllabus Spring 2017

Instructor: Prof. Ping-Tsai Chung

Course Hours: Tuesday, Thursday, 3:00 4:50 PM Classroom: LLC 207 (Cook Lab)
Textbook: Discrete Mathematics and its Applications, Kenneth H. Rosen, McGraw-Hill,
Seventh Edition, ISBN 0-07-338309-0, 2012.
Contact Information: E-Mail: pchung@liu.edu Tel: (718) 488-107, Web Site:
http://myweb.brooklyn.liu.edu/pchung/
For Assignment Submission, Please submit your work to pingtsaichung@gmail.com
( i.e., ptchung@ieee.org).
Office: LLC 206R Office Hours: Tuesday, Wednesday 4:00 - 6:00 PM or by appointment.
Objective:
The objective of this course is to learn useful techniques for modeling problems in computer
science - The Mathematical Language of Computer Science.
Student Learning Outcomes:
(O1) Could obtain basic knowledge and applications of the Foundations: Propositional Logic,
Propositional Equivalences, Predicates, Quantifiers and the Rules of Inference.
(O2) Could have good thinking and analytical skills for Proof Methods and Strategy.
(O3) Could have a good understanding of Graphs & Trees and their Applications.
(O4) Could obtain basic knowledge and applications of Sets and Functions.
(O5) Could have a better thinking and analytical skills of Counting and their Applications.
(O6) Learned some applications that related to Programming Languages, Artificial
Intelligence, Computer Networks, Computer Security, and Databases.
(O7) Experienced on a Mini-project related to a Computer Application.
Participation/Course Grade: Attendance & Homework Assignments: 20%, Project: 25%
Midterm Exam: 25%, Final Exam: 30%.
Note that you could use either 6th edition of textbook (ISBN-13 978-0-07-288008-3 or 5th
edition of textbook (ISBN 0-07-242434-6). Important
You need to read the Section/Chapter that are corresponded to the contents that we covered in
the class.

Approximate Schedule of Topics:

Schedule

Chapters
(in 6th
Edition)

Topics Covered

Applications

Meeting

1 (Week
of 1/17)

Ch 1.1
Ch 1.4
Ch 1.6

The Foundations:
Propositional Logic,
Propositional
Equivalences,
Predicates and
Quantifiers; Rules of
Inference

Artificial
Intelligence

Homework 1

Ch 1.7
Ch 1.8
Ch 5.1

Introduction to
Proofs. Proof
Methods & Strategy;
Mathematical
Induction

Programming
Languages,
Program
Correctness

Homework 2

Ch 10.1
Ch 10.8

Graphs:
Introduction,
Terminology,
Representations,
Graph Isomorphism,
Connectivity, Euler
and Hamilton Paths,
Shortest-Path
Problems, Planar
Graphs, Graph
Coloring.

Applications of
Networks such
Internets, Ad-Hoc
Wireless
Networks, VLSI
Design, Computer
Vision

Homework 3

2 (Week
of 1/24)

3 (Week
of 1/31)
4 (Week
of 2/7)
5 (Week
of 2/14)
(2/21)
Tuesday
follows a
Monday
Schedule

6 (Week
of 2/28)

Class Review and

Project Distribution
7 (Week
of 3/7)

Midterm EXAM
(3/9)- Contents will be
discussed in the class

Spring Break (3/13 ~ 3/17) - No Class

8 (Week
of /21)

Ch 11.1
Ch 11.5

Trees An
Introduction,

Applications of
Networks,

Applications, Tree
Traversal, Spanning
Trees, Minimum
Spanning Trees

9 (Week
of 3/28)

Information
Theory, Artificial
Intelligence

Project Discussion
10
(Week of
3/31)

Ch 2.1
2.3, 2.5

Basic Structures:
Sets, Functions

Databases

11
(Week of
4/4)

Ch 4.5
Ch 4.6

Applications of
Congruence,
Cryptography

Cryptography

12
(Week of
4/11)
13
(Week of
4/18)
14
(Week of
4/25)

Ch 6.1
Ch 6.3

Counting: The
Basics, The
Pigeonhole Principle,
Permutations and
Combinations

Applications of
Security,
Internets

15
(Week of
5/2)

Class Review

Final EXAM (5/4)

Contents will be
discussed in the Class

Homework 4

Homework 5