Operating System Zhejiang University (Li Shanping)

Operating system is one of the most active subjects in the field of computer science and technology, so the operating system course is naturally a core professional basic course in this major. The content of the operating system course integrates basic theoretical teaching, practical teaching, and tracking of the latest technology. The importance of operating system courses requires that the teaching content must be both basic and forward-looking, as well as interesting and fashionable to stimulate students' interest in learning.

• Chapter 1：Course Introduction 1 (39 minutes and 39 seconds)

• Chapter 2：Course Introduction 2 (22 minutes and 19 seconds)

• Chapter 3：Operating system structure one (41 minutes and 51 seconds)

• Chapter 4：Operating system structure 2 (20 minutes and 47 seconds)

• Chapter 5：Process concept one (24 minutes and 7 seconds)

• Chapter 6：Process concept two (34 minutes and 4 seconds)

• Chapter 7：Example: PCB for Linux (44 minutes and 44 seconds)

• Chapter 8：process operations (42 minutes and 25 seconds)

• Chapter 9：Thread one (22 minutes and 50 seconds)

• Chapter 10：Thread 2 (36 minutes and 33 seconds)

• Chapter 11：CPU scheduling one (30 minutes and 5 seconds)

• Chapter 12：CPU Scheduling 2 (36 minutes and 57 seconds)

• Chapter 13：CPU scheduling three (31 minutes and 2 seconds)

• Chapter 14：CPU scheduling four (26 minutes and 29 seconds)

• Chapter 15：Example-Linux process scheduling algorithm one (38 minutes and 33 seconds)

• Chapter 16：Example-Linux process scheduling algorithm 2 (41 minutes and 24 seconds)

• Chapter 17：Critical section problem one (27 minutes and 26 seconds)

• Chapter 18：Critical section problem 2 (23 minutes and 5 seconds)

• Chapter 19：Algorithm 1 (dual process) (14 minutes and 28 seconds)

• Chapter 20：Algorithm 2 (dual process) (7 minutes and 33 seconds)

• Chapter 21：Peterson algorithm (dual process) (7 minutes and 56 seconds)

• Chapter 22：Lamport Bakery Algorithm (N Process) (44 minutes and 11 seconds)

• Chapter 23：Hardware instruction solution (23 minutes and 22 seconds)

• Chapter 24：signal (36 minutes and 54 seconds)

• Chapter 25：Classic synchronization problem one (43 minutes and 34 seconds)

• Chapter 26：Classic synchronization problem 2 (19 minutes and 58 seconds)

• Chapter 27：Deadlock concept (16 minutes and 14 seconds)

• Chapter 28：Necessary conditions for deadlock (26 minutes and 48 seconds)

• Chapter 29：Deadlock prevention (22 minutes and 10 seconds)

• Chapter 30：Deadlock avoidance (32 minutes and 25 seconds)

• Chapter 31：Deadlock detection and recovery (29 minutes and 53 seconds)

• Chapter 32：Basic concepts of memory management (22 minutes and 40 seconds)

• Chapter 33：Page storage management one (35 minutes and 48 seconds)

• Chapter 34：Page storage management 2 (12 minutes and 22 seconds)

• Chapter 35：Segmented storage management and examples (21 minutes and 10 seconds)

• Chapter 36：Virtual storage ideas (32 minutes and 14 seconds)

• Chapter 37：Paging on demand (26 minutes and 12 seconds)

• Chapter 38：Example: Linux page fault interrupt processing 1 (22 minutes and 21 seconds)

• Chapter 39：Example: Linux page fault interrupt processing 2 (34 minutes and 12 seconds)

• Chapter 40：Page replacement one (27 minutes and 17 seconds)

• Chapter 41：Page replacement two (30 minutes and 32 seconds)

• Chapter 42：Page replacement two (29 minutes and 29 seconds)

• Chapter 43：Page frame allocation and system jitter (25 minutes and 42 seconds)

• Chapter 44：Example: Linux storage management one (44 minutes and 48 seconds)

• Chapter 45：Example: Linux Storage Management II (42 minutes and 2 seconds)

• Chapter 46：Basic concepts of file system (33 minutes and 40 seconds)

• Chapter 47：File sharing and protection (16 minutes and 4 seconds)

• Chapter 48：File system implementation (25 minutes and 53 seconds)

• Chapter 49：External memory allocation method one (19 minutes and 4 seconds)

• Chapter 50：External memory allocation method 2 (33 minutes and 56 seconds)

• Chapter 51：Example: Linux ext2 file system one (30 minutes and 44 seconds)

• Chapter 52：Example: Linux ext2 file system two (34 minutes and 14 seconds)

• Chapter 53：Large capacity storage structure (19 minutes and 0 seconds)

• Chapter 54：disk scheduling (28 minutes and 4 seconds)

• Chapter 55：Disk management (9 minutes and 28 seconds)

• Chapter 56：swap space management (4 minutes and 19 seconds)

• Chapter 57：RAID structure (9 minutes and 18 seconds)

• Chapter 58：Case Analysis (9 minutes and 2 seconds)

• Chapter 59：IO device access method (23 minutes and 47 seconds)

• Chapter 60：IO device type (11 minutes and 10 seconds)

• Chapter 61：The IO subsystem of the operating system kernel (18 minutes and 50 seconds)