Is it possible to have a deadlock condition with a single process? Explain and justify your answer with reference to deadlock prevention method”. Solution: No, it is not possible to have a deadlock condition in a single process.The deadlock involves a circular “hold-and-wait” condition between two or more processes, so “one” process cannot hold a […]
Question 1: (5 Marks) Consider the following snapshot of a system: Allocation Max Available A B C D A B C D A B C D P0 1 1 1 2 3 4 2 2 1 2 3 4 P1 1 0 2 2 1 3 4 14 P2 […]
Do overlays increase a burden on a programmer as compare to virtual memory? Give reason to support your answer Solution: Yes overlays increase a burden on a programmer as compare to virtual memory. Programmers have to specify the details of overlays but the operating system handles virtual memory automatically.
Question No.1: [Marks 5] Consider a scenario of post mailbox, there are two processes named sender S and receiver R. Both processes can communicate with each other by name along with message. You need to Identify what type of IPC is this? Write the send and receive primitives for stated processes. Identify at least three properties of communication channel or link in this scheme. Solution Indirect communications : […]
Question 1: [Marks : 02] A single processor can run only one program at a time. Operating System installed on the machine interacts as intermediary between the hardware of the system and users. How does an operating system make multiprogramming possible by using single processor? In a multi programmed system, the operating system simply switches to, […]
Question No.1[Marks:5] Here you are given a single instance RAG, drive WFG (wait-for graph) from this graph and judge whether this system is with deadlock or not? If yes then represent it by drawing corresponding WFG? Question No.2[Marks:10] Consider the following snapshot of the system Use banker’s algorithm and write down all the intermediate steps […]
Dear Students! Please note that a QUIZ No.01 of CS604 fall 2013 will be launched on Monday, 25th November 2013. It will remain open for two days from 25th November to 26th November 2013. It will include MCQ’s from Lecture No.01 to Lecture No.10. It will consists of about 10 Multiple Choice Questions (MCQs).and will last for 48 hours only, so try to attempt QUIZ at your earliest.
Question 1: [Marks : 05] Consider a computer system with two processes, P0 and P1. The CPU is switched from P0 to P1 when P0 finishes its CPU burst and needs to wait for an event or the CPU is switched from P1 to P0 when P1 finishes its CPU burst and needs to wait […]
Virtual Memory is an extremely large main memory than physical memory. Do you agree with the given statement or not? Give reason to support your answer. Solution: Yes , I agree Virtual Memory is an extremely large main memory than physical memory” .Physical memory is the memory on the RAM Chips in your computer. This memory can be […]
A system has four processes and five allocated resources. The current allocation and maximum needs Give the smallest value of “x” for which this is a safe state? Suppose a system that is neither deadlocked nor safe. It means some processes (p1, p2, and p3) are in working condition but may lead to deadlock for any […]