Skip to content

CS330: Introduction to Operating Systems

الدروس المجانية Sample Lesson

1.1 introduction

1.2 OS definition

3.5 process creation

1.1 introduction

1.2 OS definition

1.3 Computer system startup

1.6 Computer systems architectures

1.7 OS structure and operations

1.8 Management activities

1.9 I O subsystem + protection and Secuirty

1.10 Computing environments

2.1 OS services + System calls

2.2 Unix Vs. MS-DOS

2.3 System programs + OS design

2.4 OS structures

2.5 OS examples + System debugging

Extra slides for MALE SECTION

Ch1.1 Extra slides – MALE section

Ch1.2 Extra slides – MALE section

Ch2 Extra slides – MALE section

3.1 Process concept and states

3.3 process scheduling

3.4 context switching and multitasking

3.5 process creation

3.6 Process termination

3.7 IPC shared memory

3.8 IPC message passing

4.1 thread introduction

4.2 parallelism Vs concurrency

4.3 User Vs. kernel threads

4.4 Thread mapping

4.5 Thread libraries

🆕 Chapter 3 and 4 Excercises 🆕

Ch3 and 4 exercises Part1

Ch3 and 4 exercises Part2

Ch3 and 4 exercises Part3

5.1 introduction

5.2 schedulers Vs dispatches + preemptive Vs. nonpreemptive scheduling

5.3 scheduling criteria

5.5 SJF Vs. SRTF

5.6 round robin

5.7 priority scheduling

5.8 Multilevel queue and multilevel feedback queue

5.9 thread scheduling

5.10 dispatch latency

5.11 real time scheduling

6.1 cooperating processes

6.2 race conditions

6.3 the critical section

6.4 software solution (Petersons)

6.5 hardware solution (test and set, swap)

6.6 OS solution (semaphores)

6.7 bounded buffer problem

6.8 readers writers problem

6.9 Dining philosophers problem + issues with semaphores

6.10 OS solution (monitors)

6.11 Dining philosophers solution

8.1 logical Vs. physical address space binding

8.2 MMU and swapping

8.3 contiguous allocation

8.4 placement policies

8.5 fragmentation and segmentation

8.7 TLB’s and EAT

Chapter 8 Exercises

Ch8 exercises P1

Ch8 exercises P2

Ch8 exercises P3

Ch8 exercises P4

Ch8 exercises P5

Ch8 exercises P6

Ch8 exercises P7

9.1 introduction to demand paging and virtual memory

9.2 Page faults and the validation bits

9.3 demand paging performance

9.4 page replacement

9.5 page replacement algorithms FIFO

9.6 page replacements algorithms LRU vs. OPTIMAL

11.1 introduction

11.2 sequential and direct access

11.3 single and double level directories

11.4 tree structured dirc

11.5 acyclic and general

11.6 Protection and access lists

12.1 File System implementation

12.2 contiguous allocation

12.3 linked list and indexed allocation

12.4 free list management methods

Assignments & Extra Exercise

Ch3 and C4 assignment part1

Ch3 and C4 assignment part2

Ch6 excersices part1

Ch6 Excersices part2

Ch6 Excersices Part3

Ch6 Excersices Part4

Ch8: Memory management solution video

File System Implementation Exercise Part1

File System Implementation Exercise Part2

File System Implementation Exercise Part3

File System Implementation Exercise Part4

Midterm and final reviews

13.1 Major- part1

13.2 Major- part2

13.3 Major- part3

13.4 Final- part1

13.5 Final- part2

13.6 Final- part3

Final Sample Paper

Previous Lesson

1.1 introduction

⏱ 08:17

CS330: Introduction to Operating Systems 499.00

اشترك الآن