-
Урок 1.
00:20:52
What is a File System
-
Урок 2.
00:05:07
Attributes of a file
-
Урок 3.
00:08:19
Logical Block Number, Physical Block number, Important points about Hard disk
-
Урок 4.
00:15:10
create () system call
-
Урок 5.
00:12:23
Finding Logical Block Number and Physical Block Number using Logical Byte Number
-
Урок 6.
00:29:12
open () system call
-
Урок 7.
00:15:31
read () and write () system call
-
Урок 8.
00:07:16
Operations of a File
-
Урок 9.
00:13:53
Contiguous Allocation with advantages
-
Урок 10.
00:01:15
Important point to note
-
Урок 11.
00:02:14
Disadvantages of Contiguous Allocation - Size Declaration Problem
-
Урок 12.
00:02:55
Disadvantages of Contiguous Allocation - External Fragmentation Problem
-
Урок 13.
00:02:43
Disadvantages of Contiguous Allocation - Internal Fragmentation Problem
-
Урок 14.
00:05:28
Linked List Allocation
-
Урок 15.
00:03:36
Advantages of Non Contiguous Allocation
-
Урок 16.
00:05:30
Disadvantages of Linked List Allocation Method
-
Урок 17.
00:04:09
Size of pointer in a block
-
Урок 18.
00:13:17
Understanding FAT Allocation Method
-
Урок 19.
00:01:15
Advantage of FAT Allocation Method over Linked List Allocation
-
Урок 20.
00:03:07
Calculating the size of FAT
-
Урок 21.
00:06:43
Problem on FAT Allocation Method
-
Урок 22.
00:07:57
Understanding Indexes of a file
-
Урок 23.
00:15:34
Indexed Allocation - Complete Picture
-
Урок 24.
00:07:00
Placing Index across multiple disk blocks using Linked List
-
Урок 25.
00:08:19
Placing Index across multiple disk blocks using Multi level Index
-
Урок 26.
00:13:01
Placing Index across multiple disk blocks using Hybrid method
-
Урок 27.
00:03:22
Very Important Point to Note
-
Урок 28.
00:11:13
Problem 1 on Inode
-
Урок 29.
00:05:20
Problem 2 on Inode
-
Урок 30.
00:10:24
Free Space Management using 2 data structures
-
Урок 31.
00:08:22
Why we need Disk Scheduling Algorithms
-
Урок 32.
00:26:30
Hard Disk Structure , Seek Time, Rotational Latency, Data Transfer Time
-
Урок 33.
00:13:33
How order of processing disk requests can change the total seek time
-
Урок 34.
00:13:24
Difference between track and cylinder
-
Урок 35.
00:09:39
FCFS Disk Scheduling Basics
-
Урок 36.
00:08:59
FCFS explained with example
-
Урок 37.
00:09:59
SSTF explained with example
-
Урок 38.
00:02:34
Why SSTF suffers from Starvation problem
-
Урок 39.
00:09:48
Why FCFS and SSTF are not the best disk scheduling algorithms
-
Урок 40.
00:10:44
SCAN Disk Scheduling Algorithm
-
Урок 41.
00:10:21
C-SCAN Disk Scheduling Algorithm
-
Урок 42.
00:03:17
Why the name "Circular SCAN" ?
-
Урок 43.
00:06:33
LOOK Disk Scheduling Algorithm
-
Урок 44.
00:05:37
C-LOOK Disk Scheduling Algorithm
-
Урок 45.
00:04:39
Problem on C-LOOK Algorithm
-
Урок 46.
00:03:01
Problem on LOOK Algorithm
-
Урок 47.
00:02:06
Problem on C-SCAN Algorithm
-
Урок 48.
00:02:38
Problem on SCAN Algorithm
-
Урок 49.
00:11:17
Difference between Kernel and Operating System
-
Урок 50.
00:20:40
System Calls, User Mode vs Kernel Mode
-
Урок 51.
00:14:05
Context Switching vs Mode Switching
-
Урок 52.
00:02:23
Problem
-
Урок 53.
00:15:56
Fork () system call explained
-
Урок 54.
00:05:45
Problems on Fork ()
-
Урок 55.
00:05:42
Problem on Fork ()
-
Урок 56.
00:07:40
Disadvantages of using fork () for performing repetitive tasks
-
Урок 57.
00:15:48
Difference between stack memory and heap memory
-
Урок 58.
00:17:53
Difference between stack memory and heap memory continued
-
Урок 59.
00:14:20
Understanding Threads and Single Threaded Process
-
Урок 60.
00:20:52
Multithreading explained 1
-
Урок 61.
00:12:32
Multithreading explained 2
-
Урок 62.
00:25:03
User Level Threads vs Kernel Level Threads
-
Урок 63.
00:04:31
Summary of Threads