| Course Type | Elective Course |
|---|
| Course Level | Bachelor's Degree |
|---|
| Year of Study | - |
|---|
| Semester | - |
|---|
| ECTS | 5 |
|---|
| Name of Lecturer(s) |
- |
| Learning Outcomes |
At the end of this course, the students;
- Know the basic units of the operating system and how it works.
- Analyze the structure of different operating systems and the fundamental differences between them.
- Know the problems affecting the performance of operating systems and proposes solutions.
- Learn the CPU scheduling and memory management.
|
| Mode of Delivery | Face to face |
|---|
| Prerequisites | No |
|---|
| Recommended Optional Programme Components | EEM 335 Computer Organization |
|---|
| Course Description | Basic modes of an operating system, its mechanisms and structure. Processes and resources. Models. Threads. Inter-process communication. Mutual exclusion and synchronization. Concurrency models. Semaphores and monitors. Classical IPC problems. Deadlocks, its detection and recovery, the Banker's algorithm. CPU scheduling. Preemptive and non-preemptive strategies. Memory management. Static and dynamic allocation. Swapping. Virtual memory, page table and paging algorithms. Device management. Buffering. File management, remote files. Protection and security. |
|---|
| Course Contents |
| WEEK |
TOPICS |
|
1st Week |
Operating systems: historical view. Basic functions and modes of OS. |
|
2nd Week |
Operating system's mechanisms and structure. |
|
3rd Week |
Processes and resources. Models. Threads. |
|
4th Week |
Inter-process communication. Synchronization. Concurrency models. |
|
5th Week |
Mutual exclusion. Semaphors and monitors. Classical IPC problems. |
|
6th Week |
Deadlocks. Detection and recovery. The Banker's algorithm. |
|
7th Week |
CPU scheduling. Preemptive and non-preemptive strategies. |
|
8th Week |
Midterm Exam |
|
9th Week |
Scheduling algorithms and their analysis. |
|
10th Week |
Memory management. Static and dynamic allocation. Swapping. Virtual memory, page table. Paging algorithms. |
|
11th Week |
Virtual memory management algorithms. |
|
12th Week |
Device management. Buffering. Access on rotating devices. |
|
13th Week |
File management. Directories. Remote files, mechanisms. |
|
14th Week |
Protection and security. Some mechanisms and protocols. |
|
| Recommended or Required Reading | Andrew S. Tanenbaum. Modern Operating Systems, 2/E, Prentice-Hall, 2001, (2) William Stallings. Operating Systems.Internals and Design Principles, 4/E, Prentice Hall, 2001. |
|---|
| Planned Learning Activities and Teaching Methods |
- Lecture
- Presentation
- Experiment
|
|---|
| Assessment Methods and Criteria |
|
Quantity |
Percentage (%) |
| Mid-term |
1 |
25 |
| Quiz |
2 |
15 |
| Practice |
1 |
15 |
| Project |
1 |
10 |
| Total(%) |
|
65 |
| Contribution of In-term Studies to Overall Grade(%) |
|
65 |
| Contribution of Final Examination to Overall Grade(%) |
|
35 |
| Total(%) |
|
100 |
|
| ECTS Allocated Based on Student Workload |
| Activities |
Quantity |
Duration (Hour) |
Total Workload (Hour) |
| Midterm exam |
1 |
2 |
2 |
| Preparation for Quiz |
2 |
4 |
8 |
| Individual or group work |
14 |
3 |
42 |
| Preparation for Final exam |
1 |
12 |
12 |
| Course hours |
14 |
4 |
56 |
| Preparation for Midterm exam |
1 |
12 |
12 |
| Laboratory (including preparation) |
0 |
0 |
0 |
| Final exam |
1 |
2 |
2 |
| Homework |
2 |
8 |
16 |
| Total Work Load | 150 |
| Total Work Load / 30 (h) | 5 |
| ECTS Credit of the Course | 5 |
|
| Language of Instruction | Turkish |
|---|
| Work Placement(s) | No |
|---|
