College of Science

Courses

Operating Systems

Course Code C0174 Th 4 Pr 4 CrHrs 6

           Principles of operating systems. Process management, memory management, auxiliary storage management, resource allocation.

           At the end of this course the students should have the ability to:

  1. Describe and illustrate basic issues, goals, and services of operating systems.
  2. Define the concepts of processes, threads, asynchronous signals, and competitive system resource allocation.
  3. Explain what multi-tasking is and outline standard scheduling algorithms for multi-tasking.
  4. Apply the acquired knowledge to manage the memory, processes, processors, devices, and files. Hence, monitoring and controlling all activities done on the computer system.

Provide an overview of the distributed systems.

ئەرکەکانی قوتابی

به‌رپرسیارێتی قوتابی سه‌باره‌ت به‌ کۆرسه‌که‌ :

ئاماده‌بوونی قوتابیان له‌ هەموو وانه‌کاندا
ئاماده‌بوونی قوتابیان له‌ هەموو تاقیکردنه‌وه‌کاندا
ئەنجامدانى ئەرکەکانى دواى دەوام وەک راپۆرت و ووتار نووسین

ڕێگه‌ی وانه‌‌ ووتنه‌وه‌

مامۆستا ڕێگه‌ی وانه‌‌ ووتنه‌وه‌ ئەم ئامرازە بکار دهێنت ‌:‌

داتاشۆ و پاوه‌رپۆینت.
ته‌خته‌ی سپی.
سمارتبۆردیان‌.
مه‌لزه‌مه‌.

Distribution of Marks

Final Mark

Final Exam

Second Term

Mid-Year

First Term

100

Prac.

Theor.

Prac.

Theor.

Prac.

Theor.

Prac.

Theor.

20

30

5

5

10

20

5

5

References

Operating Systems Concepts, 10th Edition, Avi Silberschatz, Peter Baer Galvin, Greg Gagne, John Wiley & Sons, 2018.

Operating Systems Internal and Design Principles, 8th Edition, Wiliam Stallings, 2014.

Modern Operating Systems, 4th edition, Andrew s. Tanenbaum, prentice hall, 2015.             

Introduction, What Operating Systems Do?

Computer-System Organization

Computer-System Architecture

Operating-System Operations

Operating System Services

User and Operating System-Interface

System Calls, System Services, Linkers and Loaders

Process Concept, Process Scheduling

Operations on Processes

Interprocess Communication

Basic Concepts

Scheduling Criteria

FCFS, SJF

Priority, Round-robin

Algorithm Evaluation

Mid-term exams

Deadlock

Deadlock Necessary Conditions

Deadlock Prevention

Deadlock Avoidance, Safe State

Banker’s Algorithm

Safety Algorithm

Memory Management Unit

Swapping

Paging

Segmentation

Examples of Segmentation

Disk Management

Disk Scheduling

FCFS, SSTF

Scan, C-scan, C-look

Selecting a Disk-Scheduling Algorithm

Final Review