Algorithmics

7.5 credits

Syllabus, Bachelor's level, 1MA098

A revised version of the syllabus is available.
Code
1MA098
Education cycle
First cycle
Main field(s) of study and in-depth level
Mathematics G1N
Grading system
Fail (U), Pass (G), Pass with distinction (VG)
Finalised by
The Faculty Board of Social Sciences, 27 March 2014
Responsible department
Department of Mathematics

Entry requirements

General entry requirements and Mathematics 3b/3c or Mathematics C

Learning outcomes

In order to pass the course the student should

  • be able to give an account of fundamental algorithmic paradigms and how they manipulate data.
  • know how to build a system for the algorithmic universe from a small set of algorithmic building blocks.
  • be able to solve some simple algorithmic problems in number theory and in combinatorics.
  • have knowledge of problems that cannot be solved with algorithms.

Content

  • A model for procedural programming
  • A model for functional programming
  • Recursive number theory
  • Tables, lists, trees and algorithms to manipulate them
  • Cardinality
  • The halting problem

Instruction

Lectures and lessons, the latter with emphasis on problem solving

Assessment

Written examination at the end of the course and assignments given during the course.

.

FOLLOW UPPSALA UNIVERSITY ON

facebook
instagram
twitter
youtube
linkedin