7. Storage Management (a) File-System management | si-manual

Skip to content

الرئيسية
كل الكورسات
كورسات الجامعات السعودية
طرق الدفع
تسجيل دخول
انشاء حساب جديد

si-manual

si-manual

الرئيسية
كل الكورسات
كورسات الجامعات السعودية
طرق الدفع
تسجيل دخول
انشاء حساب جديد

Course Content

Chapter 1 Introduction

0/22

What is an Operating System?

2. Computer System Organization (a) Computer Startup

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

2. Computer System Organization (d) Storage Structure

2. Computer System Organization (c) Interrupts

2. Computer System Organization (e) Caching

2. Computer System Organization (f) IO Structure

3. Operating-System Structure

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

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

4. Operating-System Operations (c) Timer

5. Process Management

6. Memory Management

7. Storage Management (a) File-System management

7. Storage Management (b) Mass-Storage Management

7. Storage Management (c) Caching

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

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

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

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

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

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

Chapter 2 Operating-System Structures

0/9

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

0/17

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

0/5

2. Multicore Programming

3. Multithreading Models

4. Thread Libraries

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

Chapter 5 Process Synchronization

0/8

1. Background – Race Condition (Producer Consumer Problem)

2. The Critical-Section Problem

3. Peterson’s Solution

4. Synchronization Hardware

7. Deadlock and Starvation

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

Chapter 6 CPU Scheduling

0/8

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

0/12

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

0/16

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

8.3 Contiguous Memory Allocation (b) Memory Allocation

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

8.3 Contiguous Memory Allocation (c) Fragmentation

8.4 Paging (d) Page Table

8.4 Paging (b) Implementation of Page Table

8.4 Paging (c) Memory Protection

8.4 Paging (d) Page Sharing

8.6 Paging Example 1

8.6 Paging Example 2

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

Chapter 9 Virtual Memory

0/7

9.2 Demand Paging

9.3 Copy-on-Write

9.4 Page Replacement

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

9.4 Page Replacement (b) Optimal Page Replacement Algorithm

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

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

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

0/5

quiz 1 on Chapter 1

quiz 1 on Chapter 3

quiz 1 on chapter [1 – 2 – 3]

quiz 2 on chapter [1 – 2 – 3]

quiz 1 on Chapter 4

Midterm 1

0/2

Question 3 (a) FCFS

Question 3 (b) Round Robin (RR)

Midterm 2

0/2

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

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

Midterm Fall 2017

0/2

Question 1 [MCQ questions ]

Question 2 [True/False]

Midterm first term 2023

0/5

Question 3 – (a) []

Question 3 – (B)

Question 3 – (C)

Question 3 – (D)

Question 3 – (E)

Final Term Exam, Fall 2021, 42-43

0/8

Question 1 – (a) [MCQ ]

Question 2 (c-d) 1. FCFS

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

Question 2 (c-d) 3. Preemptive priority

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

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

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

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

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

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

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]

Final Exam Fall 2024, 1446

0/8

Question 1 (MCQ)

Question 2 (a) – (i) FCFS Scheduling

Question 2 (a) – (ii) SJF Scheduling

Question 2 (a) – (iii) Priority Scheduling

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

0% Complete

Copyright © 2025 si-manual