Objectives of Programme's Learning Outcomes

• Understand the fundamentals of computer science
• Show an understanding and deep knowledge of the concepts of computer science and mathematical formalisms used in the field of computer science
• Solve exercises and computer problems by applying basic knowledge in the various disciplines of computer science
• Manage IT projects
• Manage a project in compliance with specifications, constraints and deadlines
• Creatively implement knowledge and expertise gained in the field of computer science.
• Apply appropriate technological and scientific ICT approaches
• Demonstrate independence and their ability to work in teams.
• Understand the fundamentals related to scientific methods
• Develop skills of abstraction and modelling through a conceptual and scientific approach
• Conduct rigorous reasoning based on scientific arguments
• Understand the fundamentals of communication
• Communicate information (both orally and in writing) relating to the field of computer science in an intelligible, clear and structured way
• Communicate a consistent and rigorous scientific argument, either orally or in writing
• Have a good command of language and communication techniques.

Learning Outcomes of UE

By the end of this course, students will have mastered the fundamental principles governing the development of modern operating systems. They will be able to explain the interactions between different components of operating systems and solve complex problems related to resource management and synchronization.

Students will have applied their knowledge by developing scripts and system programs in C to automate process and file management in a UNIX environment.

UE Content: description and pedagogical relevance

Introduction: Functions and characteristics of an operating system, resource allocation and management, brief historical overview.

CPU Virtualization: Process abstraction, interface, process states, data structures, limited direct execution, system calls, context switches, preemption, scheduling algorithms.

Memory Virtualization: Address space abstraction, static and dynamic relocation, segmentation, paging, translation lookaside buffer (TLB), page table storage, swap management.

Concurrency: Thread abstraction, synchronization primitives (locks, condition variables, semaphores), OS and hardware support for their implementation, classic concurrency problems (Producer/Consumer, Thread Throttling, Dining Philosophers), common concurrency bugs, detailed discussion of deadlocks.

Persistence: Input/output devices, disks (operation, scheduling, RAID), file systems (POSIX interface, implementation, journaling).

All concepts are illustrated in the xv6 operating system.

UNIX: Manipulation of processes, file systems, and the kernel through C programs (POSIX interface) and shell scripts.

Prior Experience

Mastery of a programming language, computer architecture, working of a processor, interrupt mechanism, memory addressing, caching.