Dansk - English
Short version - Full version
Mathematics 2 - Discrete Mathematics (Spring 2011) |
|||
| Course code : | IDISM2-U1 | ||
| ECTS Credits : | 5 | Status : | Compulsory |
| Placement : | 2. semester | Hours per week : | 4 |
| Length : | 1 semester | Teaching Language : | Danish if no English students are present |
| Principal Content : | Discrete Mathematics Part: Expressions and sets; reduction rules for logic expressions; relations and functions; define and apply equivalence relations; construct and apply functions; natural numbers; apply induction to verify properties of natural numbers; define a prime number and use Euclid´s algorithm for factorizing an integer; define a language from the elements of a set; define a regular language; form strings from a regular language; construct examples on regular languages; define a finite state machine as a 6-tuble; describe simple finite state machines by tables and graphs; pattern recognition by finite state machines; minimizing the number of states in a finite state machine; construct a finite state machine for a given application; apply a simple clustering method for exploration of data; apply the clustering in a simple pattern recognition system. |
||
| Teaching method : | The teaching in Discrete Mathematics is a combination of sessions with lectures and students solving problems, either manually or by using Matlab. Furthermore a selection of problems must be solved and handed in during the course. |
||
| Required prequisites : | Documented knowledge corresponding to Mathematics 1 and Programming 1. | ||
| Responsible teacher : | John Aasted Sørensen
, jaas@dtu.dk |
||