Course - Discrete Mathematics - TMA4140
TMA4140 - Discrete Mathematics
About
Examination arrangement
Course content
The course gives an introduction to mathematical logic and set theory, and elementary number theory with modular arithmetic. Other central topics are: Sequences, recurrence relations, mathematical induction and combinatorial counting methods with applications. Moreover, the course gives an introduction to the theory of relations, graphs and trees, as well as formal languages, grammars and finite automata.
Learning outcome
1. Knowledge. The student has a basic knowledge of mathematical logic, set theory and combinatorial counting methods. The student is familiar with elementary number theory, including the chinese remainder theorem and Fermat's little theorem. The student has knowledge of recursion an induction, as well as relations, graphs and trees. The student also has basic knowledge of formal languages, grammars and finite automata.
2. Skills. The student is able to make practical use of elementary logic and set theory, can apply Euclid's algorithm, and is proficient in modular arithmetic. The student can solve systems of linear congruences using the chinese remainder theorem, can write simple proofs using induction, and is able to recognize, understand and apply concepts such as relations, graphs and trees in applications, for example in information technology. Moreover, the student is able to apply combinatorial counting methods to solve practical problems, and can make practical use of finite automata.
Learning methods and activities
Lectures, compulsory exercises, mid-semester examination. Portfolio assessment is the basis for the grade awarded in the course. This portfolio comprises a written final examination (80%) and the semester assignment (20%). The results for the constituent parts are to be given in %-points, while the grade for the whole portfolio (the course grade) is given by the letter grading system. The mid-semester examination only counts if it has a positive effect on the total assessment. Retake of examination may be given as an oral examination.
Compulsory assignments
- Exercises
Further on evaluation
In the case that the student receives an F/Fail as a final grade after both ordinary and re-sit exam, then the student must retake the course in its entirety. Submitted work that counts towards the final grade will also have to be retaken. For more information about grading and evaluation. see «Teaching methods and activities».
Specific conditions
Exam registration requires that class registration is approved in the same semester. Compulsory activities from previous semester may be approved by the department.
Recommended previous knowledge
None.
Course materials
Will be announced at the start of the semester.
Credit reductions
| Course code | Reduction | From | To |
|---|---|---|---|
| SIF5015 | 7.5 | ||
| MA0302 | 3.7 | 01.09.2007 | |
| MA0301 | 3.7 | 01.09.2007 |
Version: 1
Credits:
7.5 SP
Study level: Foundation courses, level I
Term no.: 1
Teaching semester: AUTUMN 2020
No.of lecture hours: 4
Lab hours: 4
No.of specialization hours: 4
Language of instruction: -
Location: Trondheim
- Technological subjects
Department with academic responsibility
Department of Mathematical Sciences
Phone:
Examination
Examination arrangement: Portfolio assessment
- Term Status code Evaluation form Weighting Examination aids Date Time Digital exam Room *
- Autumn ORD Semester test 20/100 C
-
Room Building Number of candidates - Autumn ORD Written examination 80/100 C
-
Room Building Number of candidates
- * The location (room) for a written examination is published 3 days before examination date. If more than one room is listed, you will find your room at Studentweb.
For more information regarding registration for examination and examination procedures, see "Innsida - Exams"