Course Content
Chapter 1 Introduction
0/4
1. What is an Operating System
00:00
2. OS Design Issues
00:00
3. Storage Structure
00:00
4. IO Structure & DMA
00:00
Chapter 2 Operating-System Structures
0/9
1. Operating-System Services
00:00
2. User and Operating-System Interface
00:00
3 System Calls (a) System Calls
00:00
3 System Calls (b) System Call Parameter Passing
00:00
4. Types of System Calls (a) Types of System Calls
00:00
4. Types of System Calls (b) Example Standard C Library
00:00
5. System Programs
00:00
6. Operating-System Structure
00:00
تحميل ملخص الشابتر pdf
00:00
Chapter 3 Processes
0/17
1. Process Concept (a) Process Concept and Memory
00:00
1. Process Concept (b) Process State
00:00
1. Process Concept (c) Process Control Block (PCB)
00:00
1. Process Concept (d) CPU Switch from Process to Process
00:00
2. Process Scheduling (a) Scheduling Queues
00:00
2. Process Scheduling (b) Schedulers
00:00
3. Operations on Processes (a) Process Creation
00:00
3. Operations on Processes (b) Process Termination
00:00
4. Inter-process Communication (a) Independent process vs Cooperating Processes
00:00
4. Inter-process Communication (b) Shared Memory
00:00
4. Inter-process Communication (c) Message Passing 1. Direct and Indirect Communication
00:00
4. Inter-process Communication (c) Message Passing 2. Blocking and Non-Blocking Communication
00:00
4. Inter-process Communication (c) Message Passing 3. Buffering
00:00
5. Communication in Client–Server Systems (a) Sockets
00:00
5. Communication in Client–Server Systems (b) Remote Procedure Calls (RPC)
00:00
5. Communication in Client–Server Systems (c) Pipes
00:00
تحميل ملخص الشابتر pdf
00:00
Chapter 4 Threads
0/5
1. Overview
00:00
2. Multicore Programming
00:00
3. Multithreading Models
00:00
4. Thread Libraries
00:00
تحميل ملخص الشابتر pdf
00:00
Chapter 5 Process Synchronization
0/8
1. Background – Race Condition (Producer Consumer Problem)
00:00
2. The Critical-Section Problem
00:00
3. Peterson’s Solution
00:00
4. Synchronization Hardware
00:00
5. Mutex Locks
00:00
6. Semaphores
00:00
7. Deadlock and Starvation
00:00
تحميل ملخص الشابتر pdf
00:00
Chapter 6 CPU Scheduling
0/8
6.1 Basic Concept
00:00
6.2 Scheduling Criteria
00:00
6.3 Scheduling Algorithms (a) First- Come, First-Served (FCFS)
00:00
6.3 Scheduling Algorithms (b) Shortest-Job-First (SJF)
00:00
6.3 Scheduling Algorithms (c) Priority Scheduling
00:00
6.3 Scheduling Algorithms (d) Round Robin (RR)
00:00
6.3 Scheduling Algorithms (e) Multilevel Queue
00:00
تحميل ملخص الشابتر pdf
00:00
Chapter 7 Deadlocks
0/12
7.1 System Model
00:00
7.2 Deadlock Characterization (a) Necessary Conditions
00:00
7.2 Deadlock Characterization (b Resource-Allocation Graph)
00:00
7.3 Methods for Handling Deadlocks
00:00
7.4 Deadlock Prevention
00:00
7.5 Deadlock Avoidance (a) Safe State
00:00
7.5 Deadlock Avoidance (b) Resource-Allocation Graph Algorithm
00:00
(7.5) 1 Deadlock Avoidance (c) Banker’s Algorithm part
00:00
(7.5) 2 Deadlock Avoidance (c) Banker’s Algorithm part
00:00
7.6 Deadlock Detection (a) Single Instance of Each Resource Type
00:00
7.6 Deadlock Detection (b) Several Instances of a Resource Type
00:00
7.7 Recovery from Deadlock
00:00
Chapter 8 Main Memory
0/16
8.1 Background (a) Basic Hardware
00:00
8.1 Background (b) Address Binding
00:00
8.1 Background (c) Logical Vs Physical Address Space
00:00
8.1 Background (d) Dynamic Loading
00:00
8.1 Background (e) Dynamic Linking and Shared Libraries
00:00
8.3 Contiguous Memory Allocation (a) Memory Protection
00:00
8.3 Contiguous Memory Allocation (b) Memory Allocation
00:00
8.3 Examples on (First Fit – Best Fit) Algorithms (b) Memory Allocation
00:00
8.3 Contiguous Memory Allocation (c) Fragmentation
00:00
8.4 Paging (d) Page Table
00:00
8.4 Paging (b) Implementation of Page Table
00:00
8.4 Paging (c) Memory Protection
00:00
8.4 Paging (d) Page Sharing
00:00
8.6 Paging Example 1
00:00
8.6 Paging Example 2
00:00
ملخص الشابتر pdf
Chapter 9 Virtual Memory
0/7
9.1 Background
00:00
9.2 Demand Paging
00:00
9.3 Copy-on-Write
00:00
9.4 Page Replacement
00:00
9.4 Page Replacement (a) First-In-First-Out (FIFO) Algorithm
00:00
9.4 Page Replacement (b) Optimal Page Replacement Algorithm
00:00
9.4 Page Replacement (c) Least Recently Used (LRU) Algorithm
شرح و حلول الواجبات
تجميعات كويزات
0/5
quiz 1 on Chapter 1
00:00
quiz 1 on Chapter 3
00:00
quiz 1 on chapter [1 – 2 – 3]
00:00
quiz 2 on chapter [1 – 2 – 3]
00:00
quiz 1 on Chapter 4
00:00
تجميعات ميد
0/3
Midterm 1 Question 1 (اختياري)
00:00
Midterm 1 Question 2 (صح و خطأ)
00:00
Midterm 2 Question 1 (اختياري)
00:00
Midterm 1
0/2
Question 3 (a) FCFS
00:00
Question 3 (b) Round Robin (RR)
00:00
Midterm 2
0/2
Midterm 2 Question 3-(a) Shortest-Job First (SJF)
00:00
Midterm 2 Question 3-(b) Round Robin (RR)
00:00
Final Term Exam, Fall 2021, 42-43
0/8
Question 2 (c-d) 1. FCFS
00:00
Question 2 (c-d) 2. Non-preemptive SJF
00:00
Question 2 (c-d) 3. Preemptive priority
00:00
Question 3 (a)
00:00
Question 3 (b)
00:00
Question 4 (a)
00:00
Question 4 (b)
00:00
Question 4 (c)
00:00
Final Term Exam, Spring 2022, 42-43 تقنية المعلومات
0/3
Question 4 (a)
00:00
Question 4 (b)
00:00
Question 4 (c)
00:00
Final Exam Fall 2024, 1446
0/8
Question 1 (MCQ)
00:00
Question 2 (a) – (i) FCFS Scheduling
00:00
Question 2 (a) – (ii) SJF Scheduling
00:00
Question 2 (a) – (iii) Priority Scheduling
00:00
Question 3-(a)
00:00
Question 3-(b)
00:00
Question 4-(a)
00:00
Question 4-(b)
00:00
نظم التشغيل | Operating Systems | هندسة حاسب جامعة جدة (CCCS-225)
Previous
Next
0% Complete