Discrete Mathematics
Postgraduate course
- ECTS credits
- 10
- Teaching semesters
- Autumn
- Course code
- MAT221
- Number of semesters
- 1
- Teaching language
- Norwegian
- Resources
- Schedule
- Reading list
Course description
Objectives and Content
The subject gives an introduction to combinatorial structures on finite sets. One part consists of counting theory, binomial coefficients, recursion formulas and generating functions. The other part consists of graph theory, paths and circuits, trees, planarity, and colouring.
Learning Outcomes
To provide the students with basic knowledge of graph theory and counting theory. The subject is useful for further studies in mathematics and informatics.
Level of Study
Bachelor
Semester of Instruction
Autumn
Recommended Previous Knowledge
Credit Reduction due to Course Overlap
MAT611: 10 ECTS
Compulsory Assignments and Attendance
Exercises
Forms of Assessment
Written examination: 4 hours
Examination support materials: Non- programmable calculator, according to model listed in faculty regulations
Grading Scale
The grading scale used is A to F. Grade A is the highest passing grade in the grading scale, grade F is a fail.