Scribd
Upload
4 views10 pages

Discrete Structures for Computing Course

The document outlines a course on Discrete Structures for Computing, detailing the lecturers, course content, resources, and evaluation methods. It emphasizes the importance of attendance, teamwork, and coding skills, with assessments including a midterm exam, an assignment, and a final exam. The course spans 15 weeks and covers 11 chapters, utilizing various programming languages and textbooks as resources.

Uploaded by

sinh.maibkcs
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
4 views10 pages

Discrete Structures for Computing Course

The document outlines a course on Discrete Structures for Computing, detailing the lecturers, course content, resources, and evaluation methods. It emphasizes the importance of attendance, teamwork, and coding skills, with assessments including a midterm exam, an assignment, and a final exam. The course spans 15 weeks and covers 11 chapters, utilizing various programming languages and textbooks as resources.

Uploaded by

sinh.maibkcs
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

DISCRETE STRUCTURES FOR

COMPUTING
Tuan Anh Tran
CSE - HCMUT
1. Lecturers: Semester 251

Nguyen An Khuong, Ph.D Tran Tuan Anh, Ph.D


Nguyen Van Minh Man, Ph.D
nakhuong@[Link] trtanh@[Link]
[Link]@[Link]

Mai Xuan Toan, [Link] Tran Hong Tai, [Link]


mxtoan@[Link] thtai@[Link]
2.
Introduction
Why Discrete
Mathematics?

[Link]
3. Contents
15 WEEKS & 11 CHAPTERS

[Link]
3. Contents
Teaching plan
[Link]
1. Slides are updated and sent to students. We can print out and
use in the class.
2. References
[1] Discrete mathematics and applications – Kenneth H.
Rosen.
[2] Discrete Mathematics and Applications, Kevin Ferland,
Chapman and Hall/CRC.
4. Resources [3] Graph Theory and Its Applications, Jonathan L. Gross,
Jay Yellen & Mark Anderso, Chapman and Hall/CRC.
[4] The Mathematics of Chip-Firing, Caroline J. Klivans,
Chapman and Hall/CRC.
[5] Our master: GOOGLE
3. Programming languages: Python, Matlab, C++
Attend every class and ask yourselves
why you are here? What is your goal?

Keep in your mind that we will not teach a topic twice.


You must review everything you have studied in class.
Read the textbooks carefully and solve the exercises
therein as much as possible ...

5. Requirements
Teamwork and coding skill

Respect each other


1. Midterm Exam (40%)
- Multiple choice exam, 60 minutes, closed book
- Content: from Logic to Relation
2. Assignment (20%)
- Not decided yet based on your studies: a real
6. Evaluation problem and need the combination of math and code
- Duration: 4-5 weeks.
3. Final exam (40%)
- Multiple choice exam, 80-90 minutes, closed book
- Content: from Counting to the End
Evaluation

Given during study

= 0.4 *(Midterm + volunteer) + 0.2* (Code/report/present) + 0.4*Final exam

Midterm (40%) Assignment (20%) Final (40%)


Q&A

You might also like