Application deadline

Type of course

Admission requirements

ADMISSION REQUIREMENTS: A relevant undergraduate bachelor Engineering programme with minimum 30 credits Mathematics/statistics topics

Application code: 9371

Course content

Content

Combinatorics, properties of integers and number theory, graph theory, applied algebra, relations and functions, equivalence relations, recurrence relations with unarranged problems, finite state machines and minimization of these.

Objectives of the course

Learning outcomes, skills and attitudes

Knowledge about theory, facts, concepts and procedures within discrete structures, which is important in analyzes and constructions of models.

Knowledge in how to solve theoretical and practical tasks by arguments in discrete mathematics. Emphasis on how to communicate results.

Knowledge in how to analyze sources of information and utilize discrete structures in order to solve problems.

Language of instruction and examination

Teaching methods

Working and assessment methods

Lectures and task solution sessions. Video lectures.

Project work in Graph Theory to be approved

Final, summative exam.

Assessment

An assignment in Graph Theory is to be completed and approved before the final exam.

3 hour written exam accounts for 100% of the grade in the course. Grading will be done by A-F grading scale. A re-sit exam will be arranged for this course.

Recommended reading/syllabus

Grimaldi: Discrete and Combinatorial Mathematics. Addison-Wesley

Theory and examples on It's learning

Lecture notes

Additional literature

K.H. Rosen: Discrete and its applications.

E. Kreyszig: Advanced engineering mathematics.