| TATA35 | Discrete Mathematics, 7 ECTS credits. /Diskret matematik/ |
||
Prel. scheduled
hours: 68 |
|||
|
Area of Education: Science Subject area: Mathematics |
|||
| Advancement level
(A-D): B
|
|||
| Aim: To give basic knowledge about discrete and combinatorial mathematics to prepare for applications in computer sciences and further courses in mathematics. |
|||
| Prerequisites: (valid for students admitted to programmes within which the course is offered) Lycée mathematics (natural sciences or technical programme). Note: Admission requirements for non-programme students usually also include admission requirements for the programme and threshhold requirements for progression within the programme, or corresponding. |
|||
| Organisation: Teaching is done through lectures and problem classes. |
|||
| Course contents: Combinatorics with permutations and combinations. Settheory and counting. Numbertheory with some application e.g. Public Key Encryption. Mathematical induction and recursion. Euclidean algorithm and Diophantine equations. Relations and functions, especially partial orders and equivalence relations. Boolean algebras. Graph theory and graph coloring. Trees and traversals of trees. |
|||
| Course literature: Grimaldi,Ralph: Discrete and Combinatorial mathematics. |
|||
| Examination: | |||
| Written examination |
4,5 p |
||
Course language is Swedish. Department offering the course: MAI. Director of Studies: Arne Enqvist Examiner: Olle Axling (Ht1), Armen Asratian (Vt1) Link to the course homepage at the department Course Syllabus in Swedish |
|||
|
|
 |
|||||
| ||||||