Critical Section Problem in Operating System in Hindi | Operating System Tutorial s

preview_player
Показать описание
Download LMT APP Now One Stop Solution for Engineering and Placement

Get Video Lectures , Module wise Importance with Solution , Viva Questions , PYQ and How to Pass Strategy. [ Download our App Now ]
Offline mode:-You can access everything offline ( Without Internet ) ✅

__________________________________________________________________________________________
Join LMT Social Media to Stay Updated with academics and get Importance and resources of other subjects of Engineering

___________________________________________________________________________________________

Tags :
Critical Section Problem in Operating System in Hindi | Operating System Tutorial s,
Producer Consumer Problem in Hindi | Operating System Tutorials,
Round Robin Algorithm in Hindi with Solved Example | Operating System Lectures in Hindi,
Priority Process Scheduling in Hindi | Preemptive Algorithm | Operating System Lectures,
SJF (Non preemptive ) with solved example in Hindi | Operating system Lectures in Hindi,
SJF Preemptive with solved example in Hindi | Operating System Lectures in Hindi,
FCFS ( First come first serve ) in hindi | Operating System Series,
Process State Transition Diagram in Hindi | Operating System Series,
PCB ( Process Control Block ) in Hindi | Operating System series,
User Space and Kernel Space Explained in Hindi | Operating System Tutorial ,
Monolithic and Micro Kernel Architecture Explain in Hindi | Operating System Tutorials ,
Operating System Lectures ,
Operating System Tutorials ,
Operating System Lectures in Hindi ,

Hashtags :
#LMT #lastmomenttuitions #Engineering #Placements
Рекомендации по теме
Комментарии
Автор

samjhanay ka andaz kitna piyara and cute h apka kitna polite bolti hm

muhammadkamalmuhammadkamal
Автор

The way you were explaining in entire video was too awesome. Thanks and Yes Subscribed.

ashishsaxena
Автор

You are better than others Youtubers .

sujeetkumarnandan
Автор

One of the best teaching style "koi kalesh nhi hoga"

HhhHhh-fl
Автор

Best explanation mam and thanks a lot for this video 👏🏻

shraddhashrivastav
Автор

please solve this question...
Consider the methods used by processes P1 and P2 for accessing their critical sections. The initial values of shared Boolean variables S1 and S2 are randomly assigned,



P1 P2

while (S1 = = S2); while (S1 != S2);

critical section critical section

S1 = S2; S2 = not(S1)



Which one of the following statements describes the properties achieved ?
a.
Mutual exclusion but not progress
b.
Progress but not mutual exclusion
c.
Neither mutual exclusion nor progress
d.
Both mutual exclusion and progress

danishali
Автор

aap teacher nai blke, didi lgti hen, ,, thank you didi . i like your way of talking.

muhammadmansoor
Автор

Mam full mark ke liye solution bhi to explain karne padenge na

Explanation ekdum badiya

bhagwatdhavale
Автор

Thanks mam, It's really deficult to understand this topic. You made it easy

amandarash
Автор

Achcha laga. Although Hindi thora muskil hamara.

codewizard
Автор

Sister, nice video but u speak fast or explain fast . please explain slow then ur video are wonderful

roshansingh
Автор

See i really appreciate your efforts of making videos but the way of explaination is terribly poor, atleast make good notes so atleast by reading you written notes we can understand this concept .!!!best of luck for other videos!!

AdityaSharan
Автор

Mam kuch sequence bhi hota hai likhne ka kahi pe bhi kuch bhi likh rkha hai

bolamo
Автор

What is mean by entry, exit&reminder section

rohiniphutane
Автор

Where is the race around condition video?

rohitmohit
visit shbcf.ru