Course - Mathematics for computer science - REA1101
Mathematics for computer science
About
About the course
Course content
- theory
- Matrices
- Propositional and predicate logic
- Proofs
- Sets, functions and relations
- Enumerative combinatorics
- Graphs and trees
- Automata and languages
Learning outcome
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 emphasizes applications.
Knowledge:
- 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 knowledge in the areas of logic and discrete mathematics, With
Skills:
- able to understand and use mathematical language.
- able to use mathematical methods and software to solve problems.
- basic mathematical reasoning.
Learning methods and activities
Lectures, assignments
Compulsory assignments
- Obligatoriske innleveringer
Further on evaluation
Written exam - 4 hours (100%)
Specific conditions
Admission to a programme of study is required:
Bachelor in Software Engineering (BPU)
Bachelor of Game Programming (BSP)
Computer Science (ÅRINF)
IT Operations and Information Security (BITSEC)
Information Security (BIS)
Network and System Administration (BDR)
Programming (BPROG)
Required previous knowledge
2MX or REA 3022 Matematikk R1 or equivalent course.
Course materials
Richard Johnsonbaugh: Discrete Mathematics, 7th ed., Pearson/Prentice HallAdditional material published on classfronter.
Contact information
Course coordinator
Lecturers
Department with academic responsibility
Examination
Examination
Ordinary examination - Autumn 2018
Skriftlig eksamen
The specified room can be changed and the final location will be ready no later than 3 days before the exam. You can find your room location on Studentweb.