- 64
- 497 419
Simplified Computer Science Concepts-Prof. Rutuja
India
Приєднався 28 бер 2020
Types of CPU Scheduling in OS | Preemptive | Non-Preemptive |
Types of CPU Scheduling in OS | Preemptive | Non-Preemptive |
Переглядів: 31
Відео
RAID level 0
Переглядів 233 місяці тому
Redundant Array of Independent Disk | Levels | RAID 0 - Striping
Nagpanchami 2024 #Amits Bloomfield #Nagpanchami khel
Переглядів 2683 місяці тому
Nagpanchami 2024 #Amits Bloomfield #Nagpanchami khel
C-SCAN Disk scheduling algorithm | Circular SCAN | Operating Systems | Animated
Переглядів 4128 місяців тому
C-SCAN Disk scheduling algorithm | Circular SCAN | Operating Systems | Animated
SCAN Disk Scheduling Algorithm | SCAN | Animated
Переглядів 3088 місяців тому
SCAN Disk Scheduling Algorithm | SCAN | Animated
Shortest Seek Time First Disk Scheduling Algorithm | SSTF | Animated
Переглядів 4418 місяців тому
Shortest Seek Time First Disk Scheduling Algorithm | SSTF | Animated
FCFS Disk Scheduling Algorithm | Animation | First Come First Serve
Переглядів 1158 місяців тому
FCFS Disk Scheduling Algorithm | Animation | First Come First Serve
Paging concept in Operating System | Non contiguous memory allocation technique
Переглядів 1329 місяців тому
Paging concept in Operating System | Non contiguous memory allocation technique
Immediate Database Modification in DBMS | Log Based Recovery |
Переглядів 7239 місяців тому
Immediate Database Modification in DBMS | Log Based Recovery |
Deferred Database Modification in DBMS | Log Based Recovery
Переглядів 1,2 тис.9 місяців тому
Deferred Database Modification in DBMS | Log Based Recovery
OS Structures | Simple Structure of OS | Operating Systems
Переглядів 1,1 тис.9 місяців тому
OS Structures | Simple Structure of OS | Operating Systems
Structure of Process in OS | Representation of Process in Memory | Operating System
Переглядів 409 місяців тому
Structure of Process in OS | Representation of Process in Memory | Operating System
Optimal Page Replacement Algorithm | Operating Systems
Переглядів 859 місяців тому
Optimal Page Replacement Algorithm | Operating Systems
Synchronization mechanisms | Operating Systems | Busy Waiting | Without Busy Waiting
Переглядів 6589 місяців тому
Synchronization mechanisms | Operating Systems | Busy Waiting | Without Busy Waiting
CPU bound processes and I/O bound processes
Переглядів 67111 місяців тому
CPU bound processes and I/O bound processes
Functions of OS | Process | Memory | Device | File Management | Job Accounting | Error Detection
Переглядів 17211 місяців тому
Functions of OS | Process | Memory | Device | File Management | Job Accounting | Error Detection
OS Definition | Structure of OS | Components of OS | Goals of OS
Переглядів 13911 місяців тому
OS Definition | Structure of OS | Components of OS | Goals of OS
Booth's Algorithm: Binary Multiplication - Part 1 | Computer Organization | Binary Multiplication
Переглядів 326Рік тому
Booth's Algorithm: Binary Multiplication - Part 1 | Computer Organization | Binary Multiplication
Booth's Algorithm: Binary Multiplication - Part 2 | Computer Organization | Binary Multiplication
Переглядів 174Рік тому
Booth's Algorithm: Binary Multiplication - Part 2 | Computer Organization | Binary Multiplication
Why should a mango be dipped in water before eating it? आंबा खाण्या आधी पाण्यात का भिजवावा
Переглядів 131Рік тому
Why should a mango be dipped in water before eating it? आंबा खाण्या आधी पाण्यात का भिजवावा
Central Server Algorithm to implement Distributed Shared Memory
Переглядів 4,4 тис.Рік тому
Central Server Algorithm to implement Distributed Shared Memory
Rename operator | Relational Algebra | DBMS | Unary operator
Переглядів 9772 роки тому
Rename operator | Relational Algebra | DBMS | Unary operator
Selection operation | Relational Operation | DBMS | Unary operator
Переглядів 1682 роки тому
Selection operation | Relational Operation | DBMS | Unary operator
Projection Operation | Relational Algebra | DBMS | Unary Operation
Переглядів 1942 роки тому
Projection Operation | Relational Algebra | DBMS | Unary Operation
Non-genuine Windows product. Buy a original windows and Activate it.
Not Activated doesn't mean Non Genuine,It's like a free version
Thank you so much mam, your diagrammatic explanations gives us Intitutive understanding of the algorithm 😍, lot of love from Tamilnadu ❤
bhagwan aapka bhala karega..subah k 4 baje parh rha hu..10 baje exam hai..u hv no idea the life saving stuff u're providing in such a simplistic manner...gareeb ki dua lagegi aapko...wish u and ur family the best of fortunes!
@@viceviner1194 😂😂 such a nice msg.. Best wishes to you
Hello mam kese ho aap. Thanks for this video Tomorrow is my exam 😅
Just reading the entire thing thats it nothing more than that like why the lamport introduced why the j and c are concurrent event 🤧🤧🤧 useless teaching
Ma'am when are you uploading the 2-phase and 3-phase commit video??
@@AnshulJethva-h3z will upload asap
When a process receives an election message, it compares the identifier in the message with its own. If the arrived identifier is greater, then it forwards the message to its neighbour. If the arrived identifier is smaller and the receiver is not a participant, then it substitutes its own identifier in the message and forwards it; but it does not forward the message if it is already a participant. On forwarding an election message in any case, the process marks itself as a participant.
thanks ma'am
Can you please upload video of char functions in sql
Thank You Ma'am🙏💖💙
mam please complete distributed system playlist
mam please complete distributed system playlist
mam please complete distributed system playlist
mam please complete distributed system playlist
mam please complete distributed system playlist
@@MysteriousRV please list the name of topics
select POWER(6,-3)....>>output is '0'.....not what you have shown on the screen mam...plz check Itried it & got 0
what is critical section? think I missed that part
How can I trust you're an accual professor?
If you have faith then believe it else👎
Hello Dr. Rujutaja, I have watched most of your DS videos. I now understood the concepts. Can you consider doing videos on Analysis and Design of Algorithms?
@@lahatmariel2241 please list the name of the topics on which you require video
thanks
fantastic
super simple, well done
if you dont know how to tech student than dont waste time of student.
Thanks for your suggestion..
How N-1 is guaranteed? even P2 can make a request, so performance becomes 3N. Isn't it?
The necessity condition to get into critical section is the process that wants to enter into critical section should receive response from remaining two processes.
Why 3?? Because we have request, reply and release message. And N-1 because the number of processes are 3 so thr processes other than the one requesting for critical section processes will request, reply and release.. So here it 3-1 =2
I hope i have answered your question
Yes mam, thanks for the explanation, your videos and doubts resolution are of great use and help to us. Kindly continue provide the support. I am mtech student in cse in bits and you videos are very helpful. It is requested to kindly make videos on questions that are solved using these algorithms. It will be useful for our mid sem and end sem
U r explaining the same
Lamport and ricart algorithm looks like same
the conclusion "THE BIGGEST GUY WINS" Hence, the "BULLY algorithm" wow
Thank you didi
great explanation , thankyou
nice explanation
❤
❤
pro tip: play at 2x
Simple explain ❤
Thank you so much Rutuja ma'am.
very helpful
If we don't have a causal path, then we don't know which event happen before. How is this useful?
Crisp and clear explanation Mam. Thank You
great
❤
One of the best explainer i had ever seen ❤, thanks mam for this valueable content
Awesome
Just before a day of exam❤
Ys
Good explanation, i get questions in the exam , i can easily write content of 2-3 pages
I can now write 3 pages for this😂
It was very helpful ma'am, Thank you so much❤
Euuu nusta raddaaa 🔥🔥😂😂
Sapla ki vishay 🗿🗿
Good explanation ❤
🙌