Matematics 2 for computer science
Study plans 2016-2017
- 10 ECTS
On the basis of
REA1141 Mathematics 1
Expected learning outcomes
The students will learn mathematical tools and methods for engineering problem solving, and have a foundation for further study in mathematics and computer science. The course emphasises applications.
- Understand the relevance of mathematics in engineering problem solving
- Able to identify applications of mathematics in engineering subjects
- Know the possibilities and limitations of mathematical software
The students will have in-depth knowledge in the areas of logic and discrete mathematics, with:
- able to understand and use mathematical language
- able to use mathematical methods and software to solve problems
- basic mathematical reasoning
- systems of equations
- vector spaces
- linear transformations
- eigensystems and diagonalization
- sequences and convergence
- Taylor series
- difference equations
- propositional logiv
- Boolean algebra
- Predicate logic
Sets and relations:
- Venn diagrams
- set operations
Graphs and trees:
- Hamilton og Euler cycles
- Prim og Dijkstra’s algorithms
- graphs and matrices
Automata and formal languages:
- deterministic and non-deterministic automata
- regular expressions
Form(s) of Assessment
Written exam, 4 hours
Alphabetical Scale, A(best) – F (fail)
Grading by internal examiner. External examiner every 4 year, next time is 2020.
A re-sit examination is organized in August for the written exam.
Code C: Specified printed and hand-written support material is allowed. A specific basic calculator is allowed.
Read more about permitted examination aids.
At least four problem sheets, including at least one using mathematical software, must be completed to take the exam.
- Otto Bretscher, Linear Algebra with applications 4th ed., Pearson/Prentice Hall Richard
- Johnsonbaugh, Discrete Mathematics, 7th ed., Pearson/Prentice Hall
Examination support: Approved collection of formulae.
Credit reduction due to overlapping course REA2051: 100%