Discrete Structures

**To the Bottom of the
Page**

Instructor: Dr. Shieu-Hong Lin

Class Time: **T
TH **at **Busn 209**

· Contact Dr. Lin in advance to set up an appointment.

· Monday to Thursday: 8:30am~10:30am.

Course Syllabus: compact version

**About the reading reports:**

· **Effort (2
points):** How much time have you spent for the reading?
What percentage of the contents in the reading do you think you understand?
Have you come to the class this week? **Assessment**: The student is
expected to **(i)** have attended the class this week at least
once (0.5 point), and**(ii) have either **gained a good understanding
of **80% or more of the contents** **or** have spent at
least **three hours** in the reading (1.5 points).

· **Reflection on
the reading (2 points)**: Put down 1~2 paragraphs of your thoughts such as notes of new
insight you gained, interesting things encountered, questions of things you
don’t understand, and so forth.** ****Assessment**: the student is
expected to show substantial evidence of understanding or effort of trying to
understand the contents in the reading.

*****************************************************************************************************

**Week 1: Introduction
to Propositional Logic**

- Reading
#1, due Thursday,
**Feb. 9****:**(i) Carefully read Sections 1.1 and 1.3 in Discrete*Mathematics and Its Applications*, 7th Ed. Submit your report online under Canvas. (ii) Read Section 1.2 if it takes**less than****3 hours**for you to read 1.1 and 1.3 in (i). **Homework #1,**Thursday,**Feb. 9****: Please click here**to download**propositional logic.**Either**hand in your work on paper**in the class or**scan and upload an electronic version**under Canvas.**Clarification on Homework #1****:**(i) For problem #1 and #3, your compound proposition should only be composed of the three atomic propositions D4, D100 and D400, parentheses as needed, and the logic operators ˄, ˅, and ̚ as needed. Don’t use other logic operators. (ii) For problem #5, please do include 8 rows in the truth table, corresponding to all the 8 possible combinations of truth values for three independent atomic propositions. Do so even though the truth values D4, D100 and D400 are dependent and some of the 8 combinations could not happen.

******************************************************************************************************* **** **

**Week ****2:
Algebraic Laws and Logical Equivalence in Propositional Logic**

- Reading #2, due Thursday,
**Feb. 16****:**(i) Review Sections 1.1 and 1.3 in Discrete*Mathematics and Its Applications*, 7th Ed. again. (ii) Read Section 1.2 and Section 1.4. **Homework #2,**due Thursday,**Feb. 16****: Please click here**to download**propositional logic**.

Showcase: An Eclipse logic program for solving Sudoku puzzles

******************************************************************************************************* **** **

**Week ****3:
Introduction to Predicate Logic. **

- Reading #3, due Thursday,
**Feb. 23****:**Read Sections 1.4 and 1.5 in Discrete*Mathematics and Its Applications*, 7th Ed. **Homework #3**, due Thursday,**March. 2****: Please click here**to download**predicate logic**.

** **** **

**Power point class notes** available under
**Files** in our Canvas class site.

References: (i) Set operations in Python

** **** **

**TAs: **William Gertsch,
Ho Leung**. **

**TA hours in MATH lab (Grove 10): Wednesday and Thursday
3:00~4:00pm starting from Wednesday Feb. 8.**

** **** **

**To
the Top of this Page**