Course Content
Chapter 1 Introduction
0/29
What is an Operating System?
00:00
What Operating Systems Do
08:54
Computer-System Organization: Computer Startup
03:31
Computer-System Organization: Computer-System Operation
07:34
Computer-System Organization: Interrupts
11:08
Computer-System Organization: I/O Structure
09:30
Direct Memory Access (DMA)
00:00
Computer-System Organization: Storage Structure
12:24
Computer-System Organization: Caching
05:28
Computer-System Architecture
07:36
Computer-System Architecture: Clustered Systems
07:47
Operating-System Structure: Multiprogramming & Time Sharing
13:21
Operating-System Operations: Hardware vs Software Interrupts
06:13
Operating-System Operations: Dual-Mode Operation
07:38
Operating-System Operations: Timer
05:07
Process Management
12:12
Process Management Activities
00:00
Memory Management
05:09
Storage Management: File-System Management
09:07
Storage Management: Mass-Storage Management
11:16
Storage Management: Caching
05:28
Migration of data “A” from Disk to Register
00:00
I/O Subsystem
04:23
Security and Protection
04:41
Kernel Data Structures
11:38
Computing Environments and Open-Source Operating Systems
26:09
Chapter 1 - Quiz 1: OS Foundations and Computer Organization
Chapter 1 - Quiz 2: Architecture and OS Operations
Chapter 1 - Quiz 3: Resource Management and Computing Environments
Chapter 2 Operating-System Structures
0/15
Computing Environments
26:10
Computing Environments: Distributed Systems
04:51
Computing Environments: Emulation (شرح إضافي اختياري)
07:01
Computing Environments: Virtualization (شرح إضافي اختياري)
11:44
Operating-System Services
08:45
User Interfaces (CLI, GUI, Touch Screen)
06:56
System Calls: Interface and Implementation
15:55
System Calls: Parameter Passing
08:57
Types of System Calls
13:14
System Calls: Examples
05:50
Debugging and Performance Tuning
00:00
System Boot
00:00
Chapter 2 - Quiz 1: Operating-System Services and User Interfaces
Chapter 2 - Quiz 2: System Calls and Parameter Passing
Chapter 2 - Quiz 3: OS Implementation, Debugging, and Booting
Chapter 3 Processes
0/16
Process Concept: Process in Memory
11:05
Process Concept: Process State
05:37
Process Concept: Process Control Block (PCB)
06:45
Process Concept: CPU Switch from Process to Process
07:12
Operations on Processes: Process Creation
12:33
Operations on Processes: Process Termination
06:27
Operations on Processes: Examples
19:32
Inter-process Communication: Independent vs Cooperating Processes
05:42
Inter-process Communication: Shared Memory
10:55
Message Passing: Direct and Indirect Communication
06:46
Message Passing: Blocking and Non-Blocking Communication
05:37
Message Passing: Buffering
06:31
تحميل ملخص الشابتر pdf
00:00
Chapter 3 - Quiz 1: Process Concepts and the Process Control Block
Chapter 3 - Quiz 2: Process Creation and Termination
Chapter 3 - Quiz 3: Interprocess Communication
Chapter 4 Threads
0/8
Threads Overview
15:46
Multicore Programming
16:40
Multithreading Models
10:02
Thread Libraries
07:31
تحميل ملخص الشابتر pdf
00:00
Chapter 4 - Quiz 1: Comprehensive Threads Review A
Chapter 4 - Quiz 2: Comprehensive Threads Review B
Chapter 4 - Quiz 3: Comprehensive Threads Review C
Chapter 5 CPU Scheduling
0/19
Basic Concepts of CPU Scheduling
17:01
Scheduling Queues
11:13
Schedulers
13:41
Scheduling Criteria
07:19
First-Come, First-Served (FCFS) Scheduling
15:22
FCFS Scheduling: Example 03
11:45
FCFS Scheduling: Example 04
07:48
Shortest-Job-First (SJF) Scheduling
17:54
SJF Scheduling: Introduction and Examples 01-04
22:08
SJF Scheduling: Examples 05-06
13:42
Shortest-Remaining-Time-First (SRTF) Scheduling: Explanation and Examples 01-04
18:34
SRTF Scheduling: Example 05
12:46
SRTF Scheduling: Example 06
10:47
Priority Scheduling
14:51
Priority Scheduling: Explanation and Examples 01-03
22:22
Round Robin (RR) Scheduling
16:44
Multilevel Queue Scheduling
10:14
Multilevel Feedback Queue Scheduling
00:00
تحميل ملخص الشابتر pdf
00:00
Chapter 6 Process Synchronization
0/9
Background: Race Condition (Producer-Consumer Problem)
18:58
The Critical-Section Problem
18:25
Peterson’s Solution
13:41
Synchronization Hardware
11:15
Mutex Locks
07:19
Semaphores
07:35
Readers-Writers Problem
30:24
Deadlock and Starvation
05:57
تحميل ملخص الشابتر pdf
00:00
Chapter 7 Deadlocks
0/12
System Model
08:37
Deadlock Characterization: Necessary Conditions
11:19
Deadlock Characterization: Resource-Allocation Graph
12:43
Methods for Handling Deadlocks
05:46
Deadlock Prevention
14:56
Deadlock Avoidance: Safe State
03:23
Deadlock Avoidance: Resource-Allocation Graph Algorithm
07:13
Banker’s Algorithm (Part 1)
24:51
Banker’s Algorithm (Part 2)
19:51
Deadlock Detection: Single Instance of Each Resource Type
09:28
Deadlock Detection: Several Instances of a Resource Type
15:29
Recovery from Deadlock
06:59
Chapter 8 Main Memory
0/16
Background: Basic Hardware
10:02
Background: Address Binding
04:29
Background: Logical vs Physical Address Space
10:10
Background: Dynamic Loading
07:52
Background: Dynamic Linking and Shared Libraries
10:21
Contiguous Allocation: Memory Protection
07:00
Contiguous Allocation: Memory Allocation
06:04
Examples on First-Fit and Best-Fit Algorithms
07:44
Contiguous Allocation: Fragmentation
05:52
Paging: Page Table
20:39
Paging: Implementation of Page Table
16:05
Paging: Memory Protection
07:58
Paging: Page Sharing
11:33
Paging Example 1
02:11
Paging Example 2
02:46
تحميل ملخص الشابتر pdf
Chapter 9 Virtual Memory
0/7
Virtual Memory Background
18:00
Demand Paging
12:35
Copy-on-Write
08:00
Page Replacement
16:55
Page Replacement: FIFO Algorithm
14:45
Page Replacement: Optimal Algorithm
11:17
Page Replacement: LRU Algorithm
Chapter 10 Mass-Storage Management
Chapter 11 File Management
0/6
File Concept مفهوم الملف
00:00
Access Methods طرق الوصول
00:00
Directory and Disk Structure بنية المجلد والقرص
00:00
File-System Mounting تركيب نظام الملفات
00:00
File Sharing مشاركة الملفات
00:00
Protection الحماية
00:00
Chapter 12 I/O Management
Chapter 13 Security & Privacy
شرح و حلول الواجبات
تجميعات كويزات
0/5
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
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
Question 3 – (a) []
04:33
Question 3 – (B)
01:27
Question 3 – (C)
02:04
Question 3 – (D)
06:43
Question 3 – (E)
04:46
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
12:37
Question 3-(a)
01:21
Question 3-(b)
03:36
Question 4-(a)
19:06
Question 4-(b)
04:28
CPCS 361 Operating Systems | نظم التشغيل | جامعة الملك عبدالعزيز
Previous
Next
0% Complete