3. Operating-System Structure

Course Content

Chapter 1 Introduction

0/24

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

Migration of data “A” from Disk to Register

00:00

Chapter 2 Operating-System Structures

0/11

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

0/17

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

0/5

1. Overview

15:46

2. Multicore Programming

16:40

3. Multithreading Models

10:02

4. Thread Libraries

07:31

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

00:00

Chapter 5 Process Synchronization

0/8

1. Background – Race Condition (Producer Consumer Problem)

18:58

2. The Critical-Section Problem

18:25

3. Peterson’s Solution

13:41

4. Synchronization Hardware

7. Deadlock and Starvation

05:57

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

00:00

Chapter 6 CPU Scheduling

0/9

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

0/12

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

0/16

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

Chapter 9 Virtual Memory

0/7

9.4 Page Replacement (a) First-In-First-Out (FIFO) Algorithm

14:45

9.4 Page Replacement (b) Optimal Page Replacement Algorithm

11:17

9.4 Page Replacement (c) Least Recently Used (LRU) Algorithm

Chapter 10 File-System Interface

0/6

1. File Concept مفهوم الملف

00:00

2. Access Methods طرق الوصول

00:00

3. Directory and Disk Structure بنية المجلد والقرص

00:00

4. File-System Mounting تركيب نظام الملفات

00:00

5. File Sharing مشاركة الملفات

00:00

6. Protection الحماية

00:00

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

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

0/5

quiz 1 on chapter [1 – 2 – 3]

10:05

quiz 2 on chapter [1 – 2 – 3]

16:14

quiz 1 on Chapter 4

15:46

Midterm 1

0/2

Question 3 (a) FCFS

03:47

Question 3 (b) Round Robin (RR)

10:13

Midterm 2

0/2

Midterm 2 Question 3-(a) Shortest-Job First (SJF)

12:23

Midterm 2 Question 3-(b) Round Robin (RR)

08:14

Midterm Fall 2017

0/2

Question 1 [MCQ questions ]

04:15

Question 2 [True/False]

05:37

Midterm first term 2023

0/5

Final Term Exam, Fall 2021, 42-43

0/8

Question 1 – (a) [MCQ ]

05:25

Question 2 (c-d) 1. FCFS

05:42

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

06:08

Question 2 (c-d) 3. Preemptive priority

08:02

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

01:21

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

03:36

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

01:17

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)]

07:44

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

0/3

Question 4 (a) [Q4-1: Given five memory partitions of 150 Kb, 450 Kb, 220 Kb, 300 Kb, and 550 Kb (in order), how would the first-fit, best-fit, and worst-fit algorithms place processes of 250 Kb, 450 Kb, and 100 Kb and 500Kb (in order).]

07:34

Question 4 (b) [Q4-2: Show if the graph stated below has a deadlock or not? Why? ]

06:50

Question 4 (c) [Q4-3: Suppose that both of processes P1 and P2 concurrently read the value stored in a memory location X, then add 10 to it and assign it back to X (shared resource). State the type of this process communication problem]

05:30

Final Exam Fall 2024, 1446

0/8

Question 1 (MCQ)

06:42

Question 2 (a) – (i) FCFS Scheduling

08:31

Question 2 (a) – (ii) SJF Scheduling

16:19

Question 2 (a) – (iii) Priority Scheduling

Operating Systems Midterms Chapters 1, 2, 3 Dr. Sarah Al-Raddadi

0/3

Operating Systems Midterm - Quiz 1 | Chapters 1, 2, 3

Operating Systems Midterm - Quiz 2 | Chapters 1, 2, 3

Operating Systems Midterm - Quiz 3 | Chapters 1, 2, 3

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

0% Complete