dm2 ch0 intro hlmt1 handout

Course Introduction

Nguyen An Khuong,Huynh Tuong Nguyen

0.1

Chapter 0Course Introduction

Discrete Mathematics II

Nguyen An Khuong, Huynh Tuong NguyenFaculty of Computer Science and Engineering

University of Technology, VNU-HCM

Course Introduction


0.2

Contents

Course Introduction


0.3

Aims

The first part of this course introduces CSE students to thebasic concepts of logic (e.g., theories, models, logicalconsequence, and proof); and the basic of integer linearprogramming.

In the second part, students will be learned mathematicalmodeling through automata and formal language.

This is the mathematical foundations for many CS areas, e.g.,algorithm analysis & design, database, artificial intelligence,etc.

Applications of logic in CSE will be highlighted.

Course Introduction


0.4

Contents

5 chapters, 45 hours of class lectures, HW & exercices.

Chapter 1. (Advanced) Propositional Logic: Declarativesentences; Natural deduction; Propositional logic as a formallanguage; Semantics of propositional logic; Normal forms;SAT solvers.

Chapter 2. (Advanced) Predicate Logic: The need for aricher language; Predicate logic as a formal language; Prooftheory of predicate logic; Semantics of predicate logic;Undecidability of predicate logic; Expressiveness of predicatelogic.

Chapter 3. Mathematical Modeling: Constraints, objectivesin ILP.

Chapter 4. Automata: DFA, NFA. Chapter 5. Formal Language: Expression, Context.

Course Introduction


0.5

Grading

2-3 Assignments (Projects): 20% Midterm (MCQ and written; 60 minutes; tentatively after 3first chapters): 30%

Final (Written, 120 minutes): 50%

HW and Attendance

The course is very intensive and will move fast. It will be veryeasy to become confused and to fall behind. So readingmaterials in advance and regular attendance should bemaintained.

After each lecture, there will be homework problems based onthe reading and lecture material. HW will typically be due 6days after instructor hand the set out.

All homework in this class will be written using themathematical typesetting program LATEX, submitted viaSAKAI.

Doing HW is essential in order to successfully complete themidterm and final exams.

Course Introduction


0.6

Assignment Contents

construct correct mathematical reasoning design digital circuits verify the correctness of computer programs, softwareverification

distinguish between valid and invalid mathematical statement artificial intelligence

Course Introduction


0.7

Required Texts/Materials

Electronic copies of [2-6] are available on the WWW, or uponrequest to instructors. (Download links embedded!)

1. Handouts (Obtained via SAKAI after classes.)

2. Michael R.A. Huth and Mark D. Ryan.Logic in ComputerScience (2nd Ed.), Cambridge University Press, 2004.(Chapters 1, 2)

3. Michael R.A. Huth and Mark D. Ryan. Logic in ComputerScience: Solutions to designated exercises (2nd Ed.),Cambridge University Press, 2004. (Chapters 1, 2)

4. Peter Linz. An Introduction to Formal Languages andAutomata (3rd Ed.) Jones and Bartlett, 2001. (Chapters 1-6)

5. Peter Linz. An Introduction to Formal Languages andAutomata: Instructors Manual (3rd Ed.) Jones and Bartlett,2001. (Chapters 1-6)

6. John E. Hopcroft, Rajeev Motwani and Jeffrey D. Ullamn.Introduction to Automata Theory, Languages, andComputation (3rd Ed.), Prentice Hall, 2006. (Chapters 1-5)

Course Introduction


0.8

Instructors

1. Nguyn An Khng, [email protected]

2. Hunh Tng Nguyn, [email protected]

3. Bi Hoi Thng, [email protected]

4. Vng B Thnh, [email protected] (SAKAIAdmin.)

Course Introduction


0.9

Tentative Schedule

Notice that the 1st week stars from Monday, January 19,2015.And there will be no class during the Lunar New Yearvacation, from February 12 - March 01, 2015.

Week Topic Lecturer Note01 Ch0. Intro + Demo 1 NAKhuong02 Ch1. Propositional Logic NAKhuong03 Ch1. Propositional Logic (cont.) NAKhuong04 Ch2. Predicate Logic NAKhuong05 Ch2. Predicate logic (cont.) NAKhuong06 Ch3. ILP NAKhuong07 ILP (cont.) and Review NAKhuong08 Review (cont.) and Midterm NAKhuong09 Demo. 2a BHThang10 Demo. 2b BHThang11 Ch4. Automata HTNguyen12 Ch4. Automata (cont.) HTNguyen13 Ch5. Formal Language HTNguyen14 Ch5. Formal Language (cont.) HTNguyen15 Demo 3 BHTHang

Course Introduction


0.10

Demo No. 1: Fault detection

ABET assessment tool for Internship

1 In order to determine a students qualification, an assessment should bemade by the company offering the internship.

2 There are about 30 rubrics for evaluating.

3 Five assessment scales for each rubric: 0 - no comment, 1 - very poor, 2- poor, 3: satisfactory, 4: good.

Problems before analyzing assessment results

How to ensure that the obtained assessment results are reliable? Some causes: noises, typos, etc. In the worst case, which measurement(s) could indicate these faults?

How to detect them?

dm2 ch0 intro hlmt1 handout

Documents