Two kinds of semaphores: counting and binary o True False In the main memory the

Question

Two kinds of semaphores: counting and binary o True False In the main memory the operating system is loaded after the user space memony O True O False In the main memory the operating system is loaded after the user space memory O True O False Memory mapped file allows several processes to map the same file allowing the pages in memory to be shared O True False To prove that a potential solution is correct, we have to prove that mutual exclusion, progress, and bounde walting are all not satisfied. False One benefit of Slab allocation is to prevent fragmentation on the cache memory O True False This page-replacement algorithm has the lowest page-fault rate of al algonthms. FIFO Optimal MRU LFU Thrashing a process is busy swapping pages in and out True False when muitiple readers try to read at the same time, and only allow one single writer to access the shared data at a time is called the readers/writers problem True False Initially valid-invalid bit is set to V on all entries True False In race condition situation The final value depends on the order in which the instructions are executed True O False

Explanation / Answer

1) True, We have counting and binary semaphore.
2) False, First OS is loaded
3)False, First OS is loaded then user process are loaded
4) True, several process share the same file
5) True, ALL THREE SHOULD BE SATUSFIED
6)True, it prevent fragmentation
7) Optimal has the lowest page fault rate
8) True, thrashing is a process of busy swapping in and out
9) False, Iniitlaly its all set to Invalid
10) True, race condition depends on the order in which instruction are executed



Thanks, PLEASE UPVOTE if helpful

Related Questions

Navigate

• Browse (All)
• Browse T
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.