نظم التشغيل (501453-3) | Operating Systems | كلية حاسبات الطائف

Course Content

Chapter 1 Introduction

What is an Operating System?

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

00:00
2. Computer System Organization (b) Computer-System Operation

00:00
2. Computer System Organization (d) Storage Structure

00:00
2. Computer System Organization (c) Interrupts

00:00
2. Computer System Organization (e) Caching

00:00
2. Computer System Organization (f) IO Structure

00:00
3. Operating-System Structure

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

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

00:00
4. Operating-System Operations (c) Timer

00:00
5. Process Management

00:00
6. Memory Management

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

00:00
7. Storage Management (b) Mass-Storage Management

00:00
7. Storage Management (c) Caching

00:00
7. Storage Management (d) IO Subsystem [ملغي من كلية حسابات الطائف]

00:00
8. Security and Protection [ملغي من كلية حسابات الطائف]

00:00
9. (a) Emulation [ملغي من كلية حسابات الطائف]

00:00
9. (b) Virtualization [ملغي من كلية حسابات الطائف]

00:00
10. Distributed Systems [ملغي من كلية حسابات الطائف]

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

00:00

Chapter 2 Operating-System Structures

1. Operating-System Services

00:00
2. User and Operating-System Interface

00:00
3 System Calls (a) System Calls

00:00
3 System Calls (b) System Call Parameter Passing

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

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

00:00
5. System Programs

00:00
6. Operating-System Structure [ملغي من كلية حسابات الطائف]

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

00:00

Chapter 3 Processes

1. Process Concept (a) Process Concept and Memory

00:00
1. Process Concept (b) Process State

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

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

00:00
2. Process Scheduling (a) Scheduling Queues

00:00
2. Process Scheduling (b) Schedulers

00:00
3. Operations on Processes (a) Process Creation

00:00
3. Operations on Processes (b) Process Termination

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

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

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

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

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

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

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

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

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

00:00

Chapter 4 Threads

Chapter 5 Process Synchronization

Chapter 6 CPU Scheduling

Chapter 7 Deadlocks

7.1 System Model

00:00
7.2 Deadlock Characterization (a) Necessary Conditions

00:00
7.2 Deadlock Characterization (b Resource-Allocation Graph)

00:00
7.3 Methods for Handling Deadlocks

00:00
7.4 Deadlock Prevention

00:00
7.5 Deadlock Avoidance (a) Safe State

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

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

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

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

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

00:00
7.7 Recovery from Deadlock

00:00

Chapter 8 Main Memory

8.1 Background (a) Basic Hardware

00:00
8.1 Background (b) Address Binding

00:00
8.1 Background (c) Logical Vs Physical Address Space

00:00
8.1 Background (d) Dynamic Loading

00:00
8.1 Background (e) Dynamic Linking and Shared Libraries

00:00
8.3 Contiguous Memory Allocation (a) Memory Protection

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

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

00:00
8.3 Contiguous Memory Allocation (c) Fragmentation

00:00
8.4 Paging (d) Page Table

00:00
8.4 Paging (b) Implementation of Page Table

00:00
8.4 Paging (c) Memory Protection

00:00
8.4 Paging (d) Page Sharing

00:00
8.6 Paging Example 1

00:00
8.6 Paging Example 2

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

Chapter 9 Virtual Memory

شرح و حلول الواجبات

تجميعات كويزات

Midterm 1

Midterm 2

Midterm Fall 2017

Midterm first term 2023

Final Term Exam, Fall 2021, 42-43

Question 1 – (a) [MCQ ]

00:00
Question 2 (c-d) 1. FCFS

00:00
Question 2 (c-d) 2. Non-preemptive SJF

00:00
Question 2 (c-d) 3. Preemptive priority

00:00
Question 3 (a) What is critical section problem List the three necessary conditions for critical problem solution.]

00:00
Question 3 (b) [Let S and Q be two semaphores initialized to 1. What is wrong with following scenario? Explain your answer.]

00:00
Question 4 (a) [What is the difference between internal and external fragmentations?]

00:00
Question 4 (b) [On a system using First fit algorithm for memory allocation, assume the memory was allocated as specified in the figure below. The figure shows 5 processes occupying blocks of sizes 10k, 20k, 10k, 30k, 10k, respectively)]

00:00

Final Term Exam, Spring 2022, 42-43 تقنية المعلومات

Final Exam Fall 2024, 1446

Student Ratings & Reviews

No Review Yet

Course Content

Chapter 1 Introduction

2. Computer System Organization (c) Interrupts

4. Operating-System Operations (c) Timer

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 Calls

3 System Calls (b) System Call 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 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

8.1 Background (d) Dynamic Loading

8.1 Background (e) Dynamic Linking and Shared Libraries

8.3 Contiguous Memory Allocation (a) Memory Protection