Note for Operating Systems - OS By Bohar Singh

Touch here to read

Page-1

Introduction - ( 2 - 6 )
Process managment - ( 7 - 7 )
Process state diagram - ( 8 - 9 )
Scheduler - ( 10 - 11 )
Scheduling Algorithm - ( 12 - 23 )
Dead lock - ( 24 - 25 )
Dead numerical - ( 26 - 26 )
Deadlock detection - ( 27 - 27 )
dead lock prevention - ( 28 - 29 )
Deadlock Avoidance - ( 30 - 30 )
Banker ALGORITHM - ( 31 - 33 )
Dead lock recovery - ( 34 - 35 )
Interprocess communication - ( 36 - 36 )
Thread - ( 37 - 37 )
User vs Kernel level thread - ( 38 - 43 )
Critical Section - ( 44 - 45 )
Decker algorithm - ( 46 - 47 )
Peterson Solution - ( 48 - 49 )
Semaphores - ( 50 - 54 )
Producer and consumer problem - ( 55 - 55 )
Reader and writer problem - ( 56 - 57 )
Memory management - ( 58 - 60 )
loading, Linking and addressing binding - ( 61 - 62 )
Logical and Physical address space - ( 63 - 63 )
Memory Allocation Techniques - ( 64 - 68 )
Paging - ( 69 - 73 )
TLB - ( 74 - 75 )
Inverted Paging - ( 76 - 76 )
Segmentation - ( 77 - 78 )
Virtual Memory - ( 79 - 81 )
Page replacement algorithm - ( 82 - 85 )
Thrasing - ( 86 - 87 )
Cache memory Organisation - ( 88 - 89 )
cache mapping techniques - ( 90 - 91 )
File management - ( 92 - 94 )
Directory Structure - ( 95 - 98 )
Disc IO operation - ( 99 - 99 )
Disc space allocation method - ( 100 - 102 )
Unix inode Implementation - ( 103 - 104 )
Bit map - ( 105 - 105 )
Disc Scheduling - ( 106 - 107 )
Fork System call - ( 108 - 108 )

Topic:

Go To Page:- / 108

Asst. Professor at GHG KHALSA COLLEGE LUDHIANA

0 User(s)

Lecture and UGC NET/JRF Notes On OPERATING SYSTEM CONCEPTS By Asst Prof. Bohar Singh Computer Science and Application