EM313: Discrete Mathematics
| Course Number : EM313 | ||||||
|---|---|---|---|---|---|---|
| Course Title : Discrete Mathematics | ||||||
| Credits : 3 | ||||||
| Prerequisites : none | ||||||
| No | Course Content | Time Allocated (hours) | ||||
| L | T | P | A | |||
| 01 | Fundamentals Basic set theory, Functions and relations, Mathematical induction |
4 |
|
|||
| 02 | Combinatorics Counting, Multiplication rule, Ordered samples and permutations, Unordered samples, Permutations involving indistinguishable objects, Principle of inclusion and exclusion |
6 | 1 |
|
||
| 03 | Graph Theory Directed graphs, Euler cycles, Euler paths, Trees, Spanning trees, Binary trees, Tree searching, Planar graphs |
8 | 2 | |||
| 04 | Algorithms Algorithms for minimum spanning trees, Shortest path problems, Running times of algorithms |
9 | 4 | |||
| 05 | Prepositional Calculus Boolean algebra, Basic theorems, Karnaugh maps |
4 | 1 | |||
| 06 | Mathematical Models for Computing Machines Boolean functions with memory, Finite state machines pattern recognition, turing machine |
5 | 1 | |||
| Total | 36 | 9 | ||||
| Assessment | Percentage Marks | |||||
| Continuous Assessment | 30 | |||||
| Assignment | 30 | |||||
| Course work | ||||||
| Written Examinations | 70 | |||||
| Mid-Semester | ||||||
| End of Semester | 70 | |||||