Dansk - English
Kort version - Fuld version
Mathematics 2 - Discrete Mathematics (Spring 2010 ) (Forår 2010) |
|||
| Kursuskode : | IDISM2-U1 | ||
| ECTS Point : | 7,5 | Status : | Obligatorisk |
| Placering : | 2. semester | Timer pr. uge : | 4 |
| Længde : | 1 semester | Undervisningssprog : | Dansk hvis der ikke er engelsksprogede studerende tilstede |
| Hovedindhold : | 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. |
||
| Undervisningsform : | 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. |
||
| Krævede forudsætninger : | Documented knowledge corresponding to Mathematics 1 and Programming 1. | ||
| Ansvarlig underviser : | John Aasted Sørensen
, jaas@dtu.dk |
||