DM510: Operating Systems

Study Board of Science

Teaching language: Danish or English depending on the teacher, but English if international students are enrolled
EKA: N330031112, N330031102
Assessment: Second examiner: None, Second examiner: External
Grading: Pass/Fail, 7-point grading scale
Offered in: Odense
Offered in: Spring
Level: Bachelor

STADS ID (UVA): N330031101
ECTS value: 10

Date of Approval: 18-11-2019

Duration: 1 semester

Version: Archive

Entry requirements


Academic preconditions

Students taking the course are expected to know the content of DM548.

Course introduction

To obtain knowledge of the structure of computer systems, the interplay
of hardware and software, the role of operating systems in this task,
and the resource abstractions provided by an operating system.
will gain knowledge about actual operating systems, scheduling
algorithms, security and protection mechanisms, file systems and process
communication. Students will learn C-programming on operating system

The course provides some basis for the course ‘compiler construction’.
In relation to the competence profile of the degree it is the explicit focus of the course to:
  • Give competence to
    • handle complex and development-oriented situations in academic and work settings
    • identify their own learning needs and to structure own learning in different learning environments
  • Give skills to
    • make and justify decisions within the subject area
    • describe, formulate, and communicate problems and results to either peers and non-specialists or partners and users
  • Provide knowledge about
    • principles for the design of computer hardware and operating systems, including distributed and parallel systems

Expected learning outcome

The learning objective of the course is that the student demonstrates the ability to:
  • Describe
    different architecture styles for realizing operating systems and the
    fundamental abstractions managed by an operating system.
  • Describe
    how several control flows can be realized, discuss problems related to
    concurrency, and describe how synchronization and communication between
    control flows can be achieved.
  • Discuss the methods used for CPU, disc and page-replacement scheduling.
  • Describe how memory can be virtualized and how it can be managed as a resource.
  • Describe
    the notion of file systems, possible implementations, and discuss how
    mass-storage can be attached to a computer system.
  • Describe the interplay between system software/applications, operating system kernel, and computer hardware.
  • Describe
    the two main distributed operating system design principles, and
    describe the notion of networks and the layered approach to realize
    network protocols.
  • Describe the notion of protection in an
    operating system, discuss existing solutions, and describe the security
    problems virus, worm, Trojan horse and buffer overflow attack.
  • Implement system programs using contemporary operating system abstractions.
  • Apply basic operating system abstractions in networked programming.
  • Use the programming language C on operating system level.
When the programming projects have been followed the students will be able to:
  • Add functionality to the kernel of a Linux operating system.
  • Implement the organization layer of a file system.
  • Write a clear and well-structured report


The following main topics are contained in the course:
Operating systems structure, system calls, interrupts, processes concept, multithreading, CPU scheduling, critical section problem, synchronization mechanisms, classical synchronization problems, atomic transactions, deadlock handling, swapping, memory allocation, paging, segmentation, demand paging, page replacement, frame allocation, file concept, directory implementation, mounting, free space management, disk structure, disk scheduling, RAID structure, protection, access matrix concept, security threats, encryption, authentication, distributed operating systems, networks, distributed file systems, virtualization,  programming in C


See itslearning for syllabus lists and additional literature references.

Examination regulations

Prerequisites for participating in the exam a)




A number of programming assignments




Second examiner: None




Full name and SDU username


Normally, the same as teaching language

Examination aids

To be announced during the course

ECTS value


Additional information

The prerequisite examination is a prerequisite for participation in exam element a)

Exam element a)




Type Prerequisite name Prerequisite course
Prerequisite not found


Oral exam




Second examiner: External


7-point grading scale


Student Identification Card


Normally, the same as teaching language


25 minutes

Examination aids

To be announced during the course

ECTS value


Additional information

The examination form for re-examination may be different from the exam form at the regular exam.

Indicative number of lessons

60 hours per semester

Teaching Method

The teaching activities are reflected in an estimated allocation of the workload of an average student as follows:

  • Intro phase (lectures, class lessons) - 36 hours
  • Training phase: 24 hours

Educational activities 

  • Using the acquired knowledge in projects.

Teacher responsible

Name E-mail Department
Daniel Merkle Algorithms


Administrative Unit

Institut for Matematik og Datalogi (datalogi)

Team at Educational Law & Registration


Offered in


Recommended course of study

Profile Education Semester Offer period