نظم التشغيل | Operating Systems | هندسة حاسب جامعة جدة (CCCS-225)
Categories: كلية حاسبلت جامعة جدة
Course Content
Chapter 1 Introduction
-
00:00
-
00:00
-
00:00
-
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 Calls
08:57 -
3 System Calls (b) System Call Parameter Passing
15:55 -
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 -
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
-
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
-
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
11:15 -
5. Mutex Locks
07:19 -
6. Semaphores
07:35 -
7. Deadlock and Starvation
05:57 -
تحميل ملخص الشابتر pdf
00:00
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 -
تحميل ملخص الشابتر 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
Chapter 9 Virtual Memory
-
9.1 Background
18:00 -
9.2 Demand Paging
12:35 -
9.3 Copy-on-Write
08:00 -
9.4 Page Replacement
16:55 -
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
-
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
شرح و حلول الواجبات
تجميعات كويزات
-
quiz 1 on Chapter 1
09:51 -
quiz 1 on Chapter 3
11:29 -
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 Question 1 (اختياري)
04:15 -
Midterm 1 Question 2 (صح و خطأ)
05:37 -
Midterm 2 Question 1 (اختياري)
05:25
Midterm 1
-
Question 3 (a) FCFS
03:47 -
Question 3 (b) Round Robin (RR)
10:13
Midterm 2
-
Midterm 2 Question 3-(a) Shortest-Job First (SJF)
12:23 -
Midterm 2 Question 3-(b) Round Robin (RR)
08:14
Final Term Exam, Fall 2021, 42-43
-
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)
01:21 -
Question 3 (b)
03:36 -
Question 4 (a)
01:17 -
Question 4 (b)
07:44 -
Question 4 (c)
00:00
Final Term Exam, Spring 2022, 42-43 تقنية المعلومات
-
Question 4 (a)
07:34 -
Question 4 (b)
06:50 -
Question 4 (c)
05:30
Final Exam Fall 2024, 1446
-
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
12:37 -
Question 3-(a)
01:21 -
Question 3-(b)
03:36 -
Question 4-(a)
19:06 -
Question 4-(b)
04:28