#2.1 Process Concept #2.2 Process State #2.3 Process Control Block (PCB) #2.4 Schedulers #2.5 Context Switch #2.6 Process Creation #2.7 Process Termination #2.8 Interprocess Communication – Shared Memory #2.9 Interprocess Communication – Message Passing #2.10 Synchronization

#3.1 Threads #3.2 Concurrency vs. Parallelism #3.3 Thread Libraries #3.4 Threading Issues

#4.1 Basic Concepts #4.2 FCFS Scheduling #4.3 Non-Preemptive SJF Scheduling #4.4 Preemptive SJF Scheduling #4.5 Preemptive SJF Scheduling-2 #4.6 non-Preemptive Priority Scheduling #4.7 Round Robin Scheduling (RR)-1 #4.8 Round Robin Scheduling (RR)-2 #4.9 Determining Length of Next CPU Burst #4.10 Examples of Exponential Averaging #4.11 Multilevel Queue Scheduling #4.12 Thread Scheduling #4.13 Solaris #4.14 Windows Scheduling #4.15 Linux Scheduling #4.16 Algorithm Evaluation

#5.1 Process synchronization #5.2 The Critical-Section Problem #5.3 Peterson’s Solution #5.4 Locks #5.5 Semaphore #5.6 Bounded-Buffer Problem #5.7 Readers-Writers Problem #5.8 Dining-Philosophers Problem #5.9 Synchronization Examples

#6.1 banker’s algorithm-1 #6.2 banker’s algorithm-2 #6.3 Deadlock-1 #6.4 Deadlock-2 #6.5 Deadlock-3 #6.6 Deadlock-4 #6.7 detection algorithm

#7.1 Logical Versus Physical Address Space #7.2 Memory Allocation #7.3 Fragmentation #7.4 Paging-1 #7.5 Paging-2 #7.6 Hierarchical Page Tables #7.7 Hashed Page Tables Inverted Page Tables #7.8 Segmentation

#8.1 Virtual memory #8.2 Virtual memory-2 #8.3 Virtual memory-2 #8.4 virtual meomery-3

#9.1 mid1-مسائل ch5 #9.2 mid1-Multilevel Queue #9.3 Banker's Algorithm #9.4 deadlock #9.5 deadlock -1 #9.6 Banker's Algorithm-1 #9.7 memory partitions -1 #9.8 deadlock -3 #9.9 مهم جدا- Page replacement #9.10 mid1-Process Scheduling #9.11 Banker's Algorithm-2 #9.12 Phusical Address #9.13 Phusical Address-1 #9.14 Process Scheduling-mid1 #9.15 internal fragmentation #9.16 physical Adrees #9.17 logical address #9.18 mid1-scheduled CPU #9.19 scheduled CPU-mid1-مهم #9.20 mid1-Process State #9.21 أختياري-1 mid #9.22 mid1 -أختياري-2 #9.23 mid2 -أختياري- 3 #9.24 أختياري-4 #9.25 Scenario مهم جداً -mid1 #9.26 mid1-Amdahls law #9.27 mid1-five-state process model #9.28 Logical and physical address #9.29 نموذج فاينل-1 #9.30 نموذج فاينل-2 #9.31 نموذج فاينل-3 #9.32 أختياري-1 mid #9.33 نموذج- mid1 #9.34 نموذج - mid1 #9.35 mid1 #9.36 أختياري-mid2 #9.37 ch6-ex #9.38 أختياري -ch6 #9.39 نموذج- mid1 #9.40 Seektime تمرين مهم شبتر10 #9.41 mid1-Quiz1 #9.42 mid1-True and false #9.43 mid1-اختياري #9.44 ميد1 #9.45 mid1-مقارنه #9.46 memory partitions #9.47 Processmemory-mid1 #9.48 مهم SJF-Non-Preemptive -mid1 #9.49 Round Rouben with arrival time-mid1مهم

#10.1 Disk Scheduling #10.2 RAID

#11.1 Operating-System Structures