BMA1010 - Mathematics for Computer Science


Examination arrangement

Examination arrangement: Home exam
Grade: Passed/Failed

Evaluation Weighting Duration Grade deviation Examination aids
Home exam 100/100 4 hours

Course content

Number theory
- The division algorithm
- Number systems
- Linear congruence generators
- Repeated squaring
- Diffie-Hellman
- Divisors and factorisation
- Euklid's extended algorithm

- Connectives: not or, and, exclusive or, implication and equivalence
- Truth tables
- Boolean algebra
- Disjunktive canonical form
- Predicates and quantifiers

Set theory
- Boolean algebra (with sets)
- Venn diagrams
- Cartesian producs
- Relations and functions

- Elementary matrix algebra
- Systems of linear equations and Gauss elimination
- The least squares method

- Basic definitions
- Dijkstra's algorithm
- Prim's algorithm

Enumerative combinatorics
- Four fundamental principles for counting
- Four standard formulas for counting
- Password safety

Learning outcome

The course will give students knowledge of how mathematics is used in solving problems in computer science. It will also provide a foundation for further specialisation in mathematics and computer science. The course emphasise applications.

Knowledge about:
- Elementary concepts in discrete mathematics
- Mathematics as a method in other subjects
- Connections between mathematics and computer science

Skills in:
- use of mathematical symbols and formulas
- use of mathematical methods
- mathematical reasoning

General competencies
- being able to identify connections between mathematics and computer science
- communication with and about mathematics
- a foundation in mathematics for life long learning

Learning methods and activities

Lectures, tutorials.

Compulsory assignments

  • Obligatorisk arbeidskrav- 4 godkjente innleveringer

Further on evaluation

Re sit exam in August

Specific conditions

Compulsory activities from previous semester may be approved by the department.

Admission to a programme of study is required:
Digital Infrastructure and Cyber Security (BDIGSEC)
Programming (BPROG)

Course materials

Discrete and Combinatorial Mathematics, an Applied Introduction. Grimaldi (adapted edition)

Credit reductions

Course code Reduction From To
DCST1004 7.5 01.09.2019
More on the course



Version: 1
Credits:  7.5 SP
Study level: Foundation courses, level I


Term no.: 1
Teaching semester:  AUTUMN 2020

Language of instruction: -

Location: Gjøvik

Subject area(s)
  • Mathematics
Contact information
Course coordinator:

Department with academic responsibility
Department of Mathematical Sciences


Examination arrangement: Home exam

Term Status code Evaluation Weighting Examination aids Date Time Digital exam Room *
Autumn ORD Home exam (1) 100/100





Room Building Number of candidates
Summer UTS Home exam 100/100 INSPERA
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.
  • 1) Merk at eksamensform er endret som et smittevernstiltak i den pågående koronasituasjonen. Please note that the exam form has changed as a preventive measure in the ongoing corona situation.

For more information regarding registration for examination and examination procedures, see "Innsida - Exams"

More on examinations at NTNU