Home Courses Interview Preparation Course Avoidance: Banker's Algorithm

Avoidance: Banker's Algorithm

Instructor: admin Duration: 39 mins

This content is restricted. Please Login

Prev

Next

Deadlock handling Methods

Multi-Threading: an introduction

An Applied Over view

1.1

OS: what does it do?

23 min

1.2

John von Neumann Architecture + History of Operating Systems

48 min

1.3

Modes of CPU execution + FORK ()

31 min

Process Management

2.1

What is a Process?

28 min

2.2

Process States & Queues & Schedulers

47 min

2.3

IPC+Synchronisation: an introduction

20 min

2.4

Producer-Consumer Problem: Challenges

35 min

2.5

Synchronisation Mechanisms -I

41 min

2.6

Detailed explanation about Disabling interrupt

2 min

2.7

Peterson Solution & TSL based synchonization

37 min

2.8

Sleep & Wakeup based synchornization

17 min

2.9

40 min

2.10

Producer-Consumer with Semaphores

21 min

Deadlocks & Threads

3.1

Deadlocks: an introduction

28 min

3.2

Deadlock handling Methods

33 min

3.3

Avoidance: Banker's Algorithm

39 min

3.4

Multi-Threading: an introduction

26 min

3.5

Kernel and User level Threads

13 min

Memory Management

4.1

Memory: an Hardware Overview - I

58 min

4.2

Memory: an Hardware Overview - II

23 min

4.3

Program linking and loading

29 min

4.4

Memory Management: the big picture + Overlays

27 min

4.5

Partitioning -Fixed

35 min

4.6

Partitioning-Variable

26 min

4.7

Non-Contiguous Memory Management & Paging

58 min

4.8

39 min