MENY
This is the study programme for 2019/2020. It is subject to change.


To understand the foundations of computer science and discrete mathematics. Key recurring concepts which are essential to computing, specifically: conceptual and formal models, efficiency, and levels of abstraction. Fundamental as well as advanced theory is presented.

Learning outcome

Knowledge: To understand the foundations of computer science and discrete mathematics. Key recurring concepts which are essential to computing, specifically: conceptual and formal models, efficiency, and levels of abstraction. Fundamental as well as advanced theory is presented.

Contents

Iteration, induction, and recursion; running time of programs; combinatorics and probability; data models (tree, list, set, relational, graph); patterns, automata, and regular expressions; recursive description of patterns; propositional logic; using logic to design computer components; predicate logic.

Required prerequisite knowledge

None.

Recommended previous knowledge

A basic course in data structures and algorithms, and a course in object oriented programming

Exam

Weight Duration Marks Aid
Oral exam1/1 Pass - Fail

Course teacher(s)

Course coordinator
Krisztian Balog
Course teacher
Tomasz Wiktorski , Erlend Tøssebro , Hein Meling , Reggie Davidrajuh , Rong Chunming
Head of Department
Tom Ryen

Method of work

Guided self-tuition. Lectures can be organized in some instances.

Open to

Computer Engineering - PhD

Course assessment

Form and/or discussion.

Literature

Alfred V. Aho and Jeffrey D. Ullman "Foundations of Computer Science: C Edition", W. H. Freeman 1995.


This is the study programme for 2019/2020. It is subject to change.

Sist oppdatert: 27.06.2019