Operating Systems | نظم التشغيل | Operating System Concepts

Course Content

Chapter 1 Introduction

What is an Operating System?

00:00
2. Computer System Organization (a) Computer Startup

03:31
2. Computer System Organization (b) Computer-System Operation

07:34
2. Computer System Organization (d) Storage Structure

12:24
2. Computer System Organization (c) Interrupts

11:08
2. Computer System Organization (e) Caching

05:28
2. Computer System Organization (f) IO Structure

09:30
3. Operating-System Structure

13:21
4. Operating-System Operations (a) Hardware interrupt Vs Software interrupt

06:13
4. Operating-System Operations (b) Dual-Mode Operation

07:38
4. Operating-System Operations (c) Timer

05:07
5. Process Management

12:12
6. Memory Management

05:09
7. Storage Management (a) File-System management

09:07
7. Storage Management (b) Mass-Storage Management

11:16
7. Storage Management (c) Caching

05:28
7. Storage Management (d) I/O Subsystem

04:23
Process Management Activities

00:00
8. Security and Protection

04:41
9. (a) Emulation

07:01
9. (b) Virtualization

11:44
10. Distributed Systems

04:51
تحميل ملخص الشابتر pdf

00:00

Chapter 2 Operating-System Structures

1. Operating-System Services

08:45
2. User and Operating-System Interface

06:56
3 System Calls (a) System Call

15:55
3 System Calls (b) System Calls Parameter Passing

08:57
4. Types of System Calls (a) Types of System Calls

13:14
4. Types of System Calls (b) Example Standard C Library

05:50
5. System Programs

06:40
6. Operating-System Debugging

00:00
7. System Boot

00:00
8. Operating-System Structure

10:05
تحميل ملخص الشابتر pdf

00:00

Chapter 3 Processes

1. Process Concept (a) Process Concept and Memory

11:05
1. Process Concept (b) Process State

05:37
1. Process Concept (c) Process Control Block (PCB)

06:45
1. Process Concept (d) CPU Switch from Process to Process

07:12
2. Process Scheduling (a) Scheduling Queues

11:13
2. Process Scheduling (b) Schedulers

13:41
3. Operations on Processes (a) Process Creation

12:33
3. Operations on Processes (b) Process Termination

06:27
4. Inter-process Communication (a) Independent process vs Cooperating Processes

05:42
4. Inter-process Communication (b) Shared Memory

10:55
4. Inter-process Communication (c) Message Passing 1. Direct and Indirect Communication

06:46
4. Inter-process Communication (c) Message Passing 2. Blocking and Non-Blocking Communication

05:37
4. Inter-process Communication (c) Message Passing 3. Buffering

06:31
5. Communication in Client–Server Systems (a) Sockets

12:43
5. Communication in Client–Server Systems (b) Remote Procedure Calls (RPC)

08:30
5. Communication in Client–Server Systems (c) Pipes

10:32
تحميل ملخص الشابتر pdf

00:00

Chapter 4 Threads

Chapter 5 Process Synchronization

Chapter 6 CPU Scheduling

6.1 Basic Concept

17:01
6.2 Scheduling Criteria

07:19
6.3 Scheduling Algorithms (a) First- Come, First-Served (FCFS)

15:22
6.3 Scheduling Algorithms (b) Shortest-Job-First (SJF)

17:54
6.3 Scheduling Algorithms (c) Priority Scheduling

14:51
6.3 Scheduling Algorithms (d) Round Robin (RR)

16:44
6.3 Scheduling Algorithms (e) Multilevel Queue

10:14
6.3 Scheduling Algorithms (f) Multilevel Feedback Level Queue

00:00
تحميل ملخص الشابتر pdf

00:00

Chapter 7 Deadlocks

7.1 System Model

08:37
7.2 Deadlock Characterization (a) Necessary Conditions

11:19
7.2 Deadlock Characterization (b Resource-Allocation Graph)

12:43
7.3 Methods for Handling Deadlocks

05:46
7.4 Deadlock Prevention

14:56
7.5 Deadlock Avoidance (a) Safe State

03:23
7.5 Deadlock Avoidance (b) Resource-Allocation Graph Algorithm

07:13
(7.5) 1 Deadlock Avoidance (c) Banker’s Algorithm part

24:51
(7.5) 2 Deadlock Avoidance (c) Banker’s Algorithm part

19:51
7.6 Deadlock Detection (a) Single Instance of Each Resource Type

09:28
7.6 Deadlock Detection (b) Several Instances of a Resource Type

15:29
7.7 Recovery from Deadlock

06:59

Chapter 8 Main Memory

8.1 Background (a) Basic Hardware

10:02
8.1 Background (b) Address Binding

04:29
8.1 Background (c) Logical Vs Physical Address Space

10:10
8.1 Background (d) Dynamic Loading

07:52
8.1 Background (e) Dynamic Linking and Shared Libraries

10:21
8.3 Contiguous Memory Allocation (a) Memory Protection

07:00
8.3 Contiguous Memory Allocation (b) Memory Allocation

06:04
8.3 Examples on (First Fit – Best Fit) Algorithms (b) Memory Allocation

07:44
8.3 Contiguous Memory Allocation (c) Fragmentation

05:52
8.4 Paging (d) Page Table

20:39
8.4 Paging (b) Implementation of Page Table

16:05
8.4 Paging (c) Memory Protection

07:58
8.4 Paging (d) Page Sharing

11:33
8.6 Paging Example 1

02:11
8.6 Paging Example 2

02:46
ملخص الشابتر pdf

Course Content

Chapter 1 Introduction

2. Computer System Organization (c) Interrupts

4. Operating-System Operations (c) Timer

Process Management Activities

8. Security and Protection

9. (a) Emulation

9. (b) Virtualization

تحميل ملخص الشابتر pdf

Chapter 2 Operating-System Structures

1. Operating-System Services

2. User and Operating-System Interface

3 System Calls (a) System Call

3 System Calls (b) System Calls Parameter Passing

4. Types of System Calls (a) Types of System Calls

4. Types of System Calls (b) Example Standard C Library

5. System Programs

6. Operating-System Debugging

7. System Boot

8. Operating-System Structure

تحميل ملخص الشابتر pdf

Chapter 3 Processes

1. Process Concept (a) Process Concept and Memory

1. Process Concept (b) Process State

1. Process Concept (c) Process Control Block (PCB)

1. Process Concept (d) CPU Switch from Process to Process

2. Process Scheduling (a) Scheduling Queues

2. Process Scheduling (b) Schedulers

3. Operations on Processes (a) Process Creation

3. Operations on Processes (b) Process Termination

4. Inter-process Communication (a) Independent process vs Cooperating Processes

4. Inter-process Communication (b) Shared Memory

4. Inter-process Communication (c) Message Passing 1. Direct and Indirect Communication

4. Inter-process Communication (c) Message Passing 2. Blocking and Non-Blocking Communication

4. Inter-process Communication (c) Message Passing 3. Buffering

5. Communication in Client–Server Systems (a) Sockets

5. Communication in Client–Server Systems (b) Remote Procedure Calls (RPC)

5. Communication in Client–Server Systems (c) Pipes

تحميل ملخص الشابتر pdf

Chapter 4 Threads

1. Overview

2. Multicore Programming

3. Multithreading Models

4. Thread Libraries

تحميل ملخص الشابتر pdf

Chapter 5 Process Synchronization

1. Background – Race Condition (Producer Consumer Problem)

2. The Critical-Section Problem

3. Peterson’s Solution

4. Synchronization Hardware

5. Mutex Locks

6. Semaphores

7. Deadlock and Starvation

تحميل ملخص الشابتر pdf

Chapter 6 CPU Scheduling

6.1 Basic Concept

6.2 Scheduling Criteria

6.3 Scheduling Algorithms (a) First- Come, First-Served (FCFS)

6.3 Scheduling Algorithms (b) Shortest-Job-First (SJF)

6.3 Scheduling Algorithms (c) Priority Scheduling

6.3 Scheduling Algorithms (d) Round Robin (RR)

6.3 Scheduling Algorithms (e) Multilevel Queue

تحميل ملخص الشابتر pdf

Chapter 7 Deadlocks

7.1 System Model

7.2 Deadlock Characterization (a) Necessary Conditions

7.2 Deadlock Characterization (b Resource-Allocation Graph)

7.3 Methods for Handling Deadlocks

7.4 Deadlock Prevention

7.5 Deadlock Avoidance (a) Safe State

7.5 Deadlock Avoidance (b) Resource-Allocation Graph Algorithm

(7.5) 1 Deadlock Avoidance (c) Banker’s Algorithm part

(7.5) 2 Deadlock Avoidance (c) Banker’s Algorithm part

7.6 Deadlock Detection (a) Single Instance of Each Resource Type

7.6 Deadlock Detection (b) Several Instances of a Resource Type

7.7 Recovery from Deadlock

Chapter 8 Main Memory

8.1 Background (a) Basic Hardware

8.1 Background (b) Address Binding

8.1 Background (c) Logical Vs Physical Address Space