305331 Discrete Mathematics for Computer Engineering Home  Semester 1, Academic Year 2007 Suradet Jitprapaikulsarn, PhD

Overview | Objectives | Instructional Approach | References | Course outline | Evaluation

Resources » Home   Go back to my home page. » Announcement   Announcement for this class. » Academic Policy   The academic policy enforced in this class.  Students are required to understand and followed this policy. » Score   The score for each student. » Work submission   Where to submit your assignments. » Lecture Notes Notes for this class. 7 habits of highly effective students Be punctual - To be a good professional, we need to be punctual from the starting. Ask questions - The more you ask, the more you understand, the less confused. Review materials every day - The sooner you review the materials, the better you understand the materials. Be moderate in resting and eating - Few people receive good score by cramming everything in a few nights.  Not eating can lead to several health problem, so as not enough rest. Be organized - The better you organize your materials, the easier to remember or review. Prioritize - Not everything receive the same level of attention.  Hence, prioritize your work to maximize the benefits. Think positively - Positive attitude can help students through difficult time.

Overview Discrete Mathematics is the branch of mathematics dealing with mathematical structures that are essentially discrete.  In other word it is not continuous.  We will explore the fundamental principles of theory of computing, how theory connects with applications, and the mathematical tools necessary for the analysis of problems.  The focus is on the application of these principles and tools to solve computing problems. Objectives This is one of the foundation courses for any computer-related majors.  After completing this course, students should have a basic practical understanding of the following: The theoretical mathematical framework underlying key concepts in computer science and computer engineering. The mathematical reasoning, deductive logic and proofs. The mathematical tools for analyzing computer science problems. The application of the discrete mathematic concepts to solve computing problems. Instructional Approach Students are required to read through the textbooks before attending each class.  Throughout the course, theoretical exercises and programming exercises will be systematically analyzed and discussed.  Additional assignments will be given to expand the knowledge beyond the textbooks. References Since many reference books are used in the class, it will be more economical to acquire only one title per student and share different titles among group members. (DS) Daniel Solow, ดร.ฉัฐไชย์ ลีนาวงศ์, ตรรกะ ... แห่งการพิสูจน์ (How to read and do proof), สำนักพิมพ์ท้อป, 2548, ISBN 974-209-035-1 (DMMS) Malik, D.S. and Sen, M.K., Discrete Mathematical Structures: Theory and Applications, Course Technology, 2004, ISBN 0-619-21285-3 (JM) John Martin, Introduction to Languages and the Theory of Computation, 3rd Edition, McGraw-Hill, 2004, ISBN 978-007-124018-5 Course outline The following schedule is tentative only; it may change depending on the circumstances.  Note that  Week Topics Book Section 1 How to do read and do proof I DS: Ch 1 - 7 2 How to do read and do proof II DS: Ch 8 - 13 3 Sets, Logic, and Algorithms DMMS: Ch 1 - 2 4 Relations and Posets DMMS: Ch 3 5 Matrices and Closures of relations DMMS: Ch 4 6 Functions DMMS: Ch 5 7 Congruences DMMS: Ch 6 8 Midterm - 9 Counting Principles DMMS: Ch 7 10 Recurrence Relations DMMS: Ch 8 11 Algorithms and Time Complexity DMMS: Ch 9 12 Graph Theory DMMS: Ch 10 13 Trees and Networks DMMS: Ch 11 14 Boolean Algebra and Combinatorial Circuits DMMS: Ch 12 15 Finite Automata and Languages I DMMS: Ch 13 JM: Ch 3 - 5 16 Finite Automata and Languages II JM: Ch 6 - 10 17 Final Exam - Note that the above schedule is tentative by nature; it may change at the instructor's discretion. Evaluation The course evaluation will be divided equally between examinations and assignments.  The distribution of each half is shown below.   Items Weight Individual Assignments 20% Group Assignments 20% Articles 10% Quizzes 10% Midterm Exam 20% Final Exam 20% Please make sure that you have carefully read and understand the academic policy. Note that the above description is only tentative; it may change at the instructor's discretion.

Copyright © 2007 Suradet Jitprapaikulsarn. Last Updated June 3, 2007