2. Computer System Organization (a) Computer Startup | 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

تجميعات ميد

0/3

Midterm 1 Question 1 (اختياري)

Midterm 1 Question 2 (صح و خطأ)

Midterm 2 Question 1 (اختياري)

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)

Final Term Exam, Fall 2021, 42-43

0/8

Question 2 (c-d) 1. FCFS

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

Question 2 (c-d) 3. Preemptive priority

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

0/3

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

Operating Systems نظم التشغيل (CS 222) | | كلية حاسبات جامعة القصبم

0% Complete

Copyright © 2025 si-manual