READ ME --> This is a "vanilla plain" jqModal window. Behavior and appeareance extend far beyond this. The demonstrations on this page will show off a few possibilites. I recommend walking through each one to get an understanding of jqModal before using it.

You can view the sourcecode of examples by clicking the Javascript, CSS, and HTML tabs. Be sure to checkout the documentation too!

NOTE; You can close windows by clicking the tinted background known as the "overlay". Clicking the overlay will have no effect if the "modal" parameter is passed, or if the overlay is disabled.

Infomation of Course

Program Bachelor [학사과정] Course Type Major Required [ 전공필수 ]
Course Code 36.204 Course No CS204
Section B English English
L:L:C(AU) 3:0:3.0(0) Exam time
Wed: 13:00~15:45
Course Title Discrete Mathematics [ 이산구조 ]
Class time
Mon: 14:30~15:45 / (N1)Kim Beang-Ho & Kim Sam-Youl ITC Building [ (N1)김병호·김삼열 IT융합빌딩 ] (201)
Wed: 14:30~15:45 / (N1)Kim Beang-Ho & Kim Sam-Youl ITC Building [ (N1)김병호·김삼열 IT융합빌딩 ] (201)
Notice -수강인원제한 60명

Information of Professor

Name 박진아(Jinah, Park)
Department 전산학부(School of Computing)
Phone 042-350-3555

Plan of Lecture

Syllabus File
Syllabus URL
Summary of Lecture This course is to help students become familiar with essential mathematical concepts that are frequently employed in computer science. Topics covered in the course range from basic languages of discrete mathematics, such as sets and relations, to more advanced topics, such as graph theory, Boolean algebra, and automata.
Material for Teaching * Main: Discrete Mathematics with Applications by Susanna S. Epp (4th Edition)

* References:
Discrete Mathematics and its Applications by Kenneth H. Rosen (McGraw-Hill, 2013) Global Edition
Discrete Mathematics (7th Edition) by Richard Johnsonbaugh (Pearson International Edition 2009)
Evaluation Criteria Class Participation/Quiz and Attendance 10%
Homework Assignments 20%
Midterm Exam 30%
Final Exam 40%
Lecture Schedule <This is a tentative schedule>
Week Topic
1 Logic
2 Proofs
3 Functions
4 Relations
5 Algorithms
6 Counting methods
7 Midterm
8 Review
9 Recurrence Relations
10 Graph Theory
11 Graphi Threry
12 Trees
13 Trees
14 Automata
15 Languages
16 Final Exam
Memo Prerequisites: Basic programming experiences (CS101)