-
Re: CS604 Assignment 3 Solution and Discussion
Operating Systems(CS604)
Assignment # 03
Spring 2020
Total marks = 15Deadline Date
27th July 2020Please carefully read the following instructions before attempting assignment.
RULES FOR MARKING
It should be clear that your assignment would not get any credit if:
The assignment is submitted after the due date.
The submitted assignment does not open or file is corrupt.
Strict action will be taken if submitted solution is copied from any other student or from the internet.You should consult the recommended books to clarify your concepts as handouts are not sufficient.
You are supposed to submit your assignment in .doc or docx format.
Any other formats like scan images, PDF, zip, rar, ppt and bmp etc will not be accepted.Objective:
• The objective of this assignment is to learn deadlock avoidance algorithm.
• The objective of this assignment is to learn page addressing.NOTE
No assignment will be accepted after the due date via email in any case (whether it is the case of load shedding or internet malfunctioning etc.). Hence refrain from uploading assignment in the last hour of deadline. It is recommended to upload solution file at least two days before its closing date.
If you find any mistake or confusion in assignment (Question statement), please consult with your instructor before the deadline. After the deadline no queries will be entertained in this regard.
For any query, feel free to email at:
[email protected]Question No 01 15 marks
Allocation Max Available A B C D A B C D A B C D P0 0 0 1 2 0 0 1 2 1 5 2 0 P1 1 0 0 0 1 7 5 0 P2 1 3 5 4 2 3 5 6 P3 0 6 3 2 0 6 5 2 P4 0 0 1 4 0 6 5 6
Consider the below given table showing the system state at a certain time. There are five processes P0 to P4 and four types of resources A, B, C and D. The resource allocation, max and available matrices for each process are also given in the table as shown below.Considering the Banker’s algorithm for deadlock avoidance, answer the following questions.
(a) Compute and show the Need matrix for processes in the system.
(b) Is the system in safe state? If YES, then show the safe sequence. If NOT in safe state, then explain the reason.Wish you very best of luck!
-
Re: CS604 Assignment 2 Solution and Discussion
Operating Systems (CS604)
Assignment # 02
Spring 2020
Total marks = 15Deadline Date
14th June 2020Please carefully read the following instructions before attempting assignment.
RULES FOR MARKING
It should be clear that your assignment would not get any credit if:
The assignment is submitted after the due date.
The submitted assignment does not open or file is corrupt.
Strict action will be taken if submitted solution is copied from any other student or from the internet.You should consult the recommended books to clarify your concepts as handouts are not sufficient.
You are supposed to submit your assignment in .doc or docx format.
Any other formats like scan images, PDF, zip, rar, ppt and bmp etc will not be accepted.Objective:
• The objective of this assignment is to learn scheduling algorithm.
• To learn and understand different Operating System structure.NOTE
No assignment will be accepted after the due date via email in any case (whether it is the case of load shedding or internet malfunctioning etc.). Hence refrain from uploading assignment in the last hour of deadline. It is recommended to upload solution file at least two days before its closing date.
If you find any mistake or confusion in assignment (Question statement), please consult with your instructor before the deadline. After the deadline no queries will be entertained in this regard.
For any query, feel free to email at:
[email protected]Question No 01 15 marks
Consider the following set of processes, with the CPU burst time given in milliseconds:Process Burst Time
P1 10
P2 1
P3 2
P4 1
P5 5The processes are arrived in the order P1, P2, P3, P4, P5, all at time 0.
A. Draw Gantt chart showing the execution of these processes using FCFS and SJF scheduling.
B. Calculate the turnaround time of each process for FCFS scheduling algorithm as per part Calculation of part A?
C. Calculate the waiting time of each process for SJF scheduling algorithm as per calculation of Part A?Wish you very Best of Luck!
-
Operating Systems (CS604)
Assignment # 03
FALL 2019
Total marks = 20Deadline Date
22nd Jan 2020Please carefully read the following instructions before attempting assignment.
RULES FOR MARKING
It should be clear that your assignment would not get any credit if:
The assignment is submitted after the due date.
The submitted assignment file does not open or it is corrupt.
The submitted assignment solution is copied from any other student or from the internet.You should consult the recommended books to clarify your concepts as handouts are not sufficient.
You are supposed to submit your assignment in .doc or docx format.
Any other formats like scan images, PDF, zip, rar, ppt and bmp etc. will not be accepted.Objective:
• The objective of this assignment is to provide understanding of:
Semaphore and Resource Allocation GraphNOTE
No assignment will be accepted after the due date via email in any case (whether it is the case of load shedding or internet malfunctioning etc.). Hence refrain from uploading assignment in the last hour of deadline. It is recommended to upload solution file at least two days before its closing date.
If you find any mistake or confusion in assignment (Question statement), please consult with your instructor before the deadline. After the deadline no queries will be entertained in this regard.
For any query, feel free to email at:
[email protected]Question No 01 8 Marks
Consider a banking transaction system where two processes Cash Withdrawal and Cash Deposit for a bank account could take place at the same time. The Cash Withdrawal process helps in withdrawing some cash amount using the ATM and the Cash Deposit process is used to deposit some amount into the account through a cheque. Which synchronization technique should be adopted in order to make sure that these processes can take place mutually exclusive? Write pseudo-code or algorithm for these two processes.
Note: No need to write code in any programing language.
Question No 02 12 Marks
Suppose a computer lab comprises of two printers, three scanners, and four ROM writers. There are three programs currently running on some computer. Assume program P1 is currently allocated a printer and two ROM writers and it is waiting for a scanner. Program P2 is allocated a scanner and it is waiting for a printer. Program P3 is allocated two ROM writers, a scanner, and a printer. Draw the corresponding resource allocation graph for these three programs. Also specify if the system is in a deadlocked state or not?
Wish you very Best of Luck!
-
Operating Systems (CS604)
Assignment # 02
FALL 2019
Total marks = 20Deadline Date
02.12.2019Please carefully read the following instructions before attempting assignment.
RULES FOR MARKING
It should be clear that your assignment would not get any credit if:
The assignment is submitted after the due date.
The submitted assignment file does not open or it is corrupt.
The submitted assignment solution is copied from any other student or from the internet.You should consult the recommended books to clarify your concepts as handouts are not sufficient.
You are supposed to submit your assignment in .doc or docx format.
Any other formats like scan images, PDF, zip, rar, ppt and bmp etc will not be accepted.Objective:
• The objective of this assignment is to provide hands on experience of:
Different Process Scheduling Algorithms in Operating SystemNOTE
No assignment will be accepted after the due date via email in any case (whether it is the case of load shedding or internet malfunctioning etc.). Hence refrain from uploading assignment in the last hour of deadline. It is recommended to upload solution file at least two days before its closing date.
If you find any mistake or confusion in assignment (Question statement), please consult with your instructor before the deadline. After the deadline no queries will be entertained in this regard.
For any query, feel free to email at:
[email protected]Question No 01 4+3+3=10 marks
Process CPU Burst Time (seconds) P0 2 P1 6 P2 1 P3 4 P4 3 P5 8
Assume you have to apply Shortest Job First (SJF) scheduling algorithms on the set of different processes given in the table below. The CPU burst time is also given for each process. Consider that all the processes arrive in the ready queue within time 0 seconds except P2 that arrive in ready queue within time 8 seconds. You are required to show the Gantt Chart to illustrate the execution sequence of these processes and calculate the Total Waiting Time and Average Waiting Time for the given processes by using SJF algorithm.Question No 02 4+3+3=10 marks
Process CPU Burst Time (Milliseconds) Arrival Time(Milliseconds) P0 15 0 P1 8 4 P2 25 18 P3 18 5
Consider a scenario where you have to apply Round Robin scheduling algorithm on the below given set of processes with each having a quantum size=8 milliseconds. The CPU burst time and arrival time for each process is also provided in the given table. You are required to show the Gantt Chart to illustrate the execution sequence of these processes. Moreover, calculate the Average Turnaround Time and Average Waiting Time for given processes by using round robin algorithm.Wish you very Best of Luck!
-
Operating Systems (CS604)
Assignment # 01
Fall 2019
Total marks = 20Deadline Date
16-11-2019Please carefully read the following instructions before attempting assignment.
RULES FOR MARKING
It should be clear that your assignment would not get any credit if:
The assignment is submitted after the due date.
The submitted assignment does not open or file is corrupt.
Strict action will be taken if submitted solution is copied from any other student or from the internet.You should consult the recommended books to clarify your concepts as handouts are not sufficient.
You are supposed to submit your assignment in .doc or docx format.
Any other formats like scan images, PDF, zip, rar, ppt and bmp etc will not be accepted.Objective:
• The objective of this assignment is to provide hands on experience of:
• To learn and understand the basic concept of an Operating System
• To learn Process and its statesNOTE
No assignment will be accepted after the due date via email in any case (whether it is the case of load shedding or internet malfunctioning etc.). Hence refrain from uploading assignment in the last hour of deadline. It is recommended to upload solution file at least two days before its closing date.
If you find any mistake or confusion in assignment (Question statement), please consult with your instructor before the deadline. After the deadline no queries will be entertained in this regard.
For any query, feel free to email at:
[email protected]Question No 01 2*5=10 marks
As a process executes, it changes states. The state of a process is defined in part by the current activity of that process. Given below are current and next states of process. According to your understanding write process conditions based on the states in which process is currently in. what can be the condition that changes one state into another?
Question No 02 2*5=10 marks
The following table contains the list of operations. Write down the Linux commands along with their screenshots for performing these operations:
You are required to run the respective commands on Ubuntu and provide relevant screen shots of the list of operations as stated in above table.
List of Operations
List the contents of files to the terminal window.
Change the owner and group owner of a file.
Compares two text files and show the differences between them
Print a string of text to the terminal window.
Change the password for a user.Wish you very Best of Luck!
-
CS604 Quiz#2.
Please post your current Quiz to help the students. -
Graded Discussion Board
Semester: Spring 2019
Operating System – CS604Instructions:
Please read the following instructions carefully before submitting the GDB:
A concise, coherent and to the point comment is preferred over lengthy comment having irrelevant details. Your comment must not be more than 4-5 lines.
Comments, posted on regular Lesson’s MDB or sent through email will NOT be considered in any case. Any request about such an acceptance will not be catered.
You should post your answer on the Graded Discussion Board (GDB), not on the Moderated Discussion Board (MDB).
For any query about the GDB, contact at [email protected]
Topic: “Characteristics Based Comparison Of Operating Systems”Scenario
Suppose an enterprise intends to decentralize its infrastructure. In this process of decentralization, the enterprise has to use mobile-based services at the employee/user end. The budget allocated for this transformation is very limited, so the enterprise has to select an operating system that is flexible enough to accommodate its services and cheaper as well. Select an operating system for mobile devices that is suitable for the organization’s needs and give justification for your selection.
Best of Luck !
-
Operating Systems (CS604)
Assignment # 03 Spring 2019Total marks = 20
Deadline Date 23rd July, 2019
Please carefully read the following instructions before attempting assignment.
RULES FOR MARKING
It should be clear that your assignment would not get any credit if:
The assignment is submitted after the due date.
The submitted assignment does not open or file is corrupt.
Strict action will be taken if submitted solution is copied from any other student or from the internet.You should consult the recommended books to clarify your concepts as handouts are not sufficient.
You are supposed to submit your assignment in .doc or docx format.
Any other formats like scan images, PDF, zip, rar, ppt and bmp etc will not be accepted.Objective:
• The objective of this assignment is to provide hands on experience of:
• To learn and understand deadlock algorithms in Operating SystemNOTE
No assignment will be accepted after the due date via email in any case (whether it is the case of load shedding or internet malfunctioning etc.). Hence refrain from uploading assignment in the last hour of deadline. It is recommended to upload solution file at least two days before its closing date.
If you find any mistake or confusion in assignment (Question statement), please consult with your instructor before the deadline. After the deadline no queries will be entertained in this regard.
For any query, feel free to email at:
[email protected]Question No 1 15 Marks
Consider the below given snapshot of the system. P1 to P5 represent the 5 processes currently running on the system. M, N, O and P represent the resources whereas M, N, O and P have 13, 11, 9 and 16 instances respectively.
Considering the given snapshot, answer the following questions using the banker’s algorithm:
(a) What will be the content of the matrix Available? 5 Marks
(b) What will be the content of the matrix Need? 5 Marks
Is the system in a safe state Yes/No? If yes, then identify the safe sequence. 5 MarksQuestion No 2 5 Marks
Consider the following resource allocation graph. Is there any deadlock in this graph or not? If yes, then mention the dead lock sequence. -
Operating Systems (CS604)
Assignment # 02 Spring 2019Total marks = 20
Deadline Date 3rd June 2019
Please carefully read the following instructions before attempting assignment.
RULES FOR MARKING
It should be clear that your assignment would not get any credit if:
The assignment is submitted after the due date.
The submitted assignment file does not open or it is corrupt.
The submitted assignment solution is copied from any other student or from the internet.You should consult the recommended books to clarify your concepts as handouts are not sufficient.
You are supposed to submit your assignment in .doc or docx format.
Any other formats like scan images, PDF, zip, rar, ppt and bmp etc will not be accepted.Objective:
• The objective of this assignment is to provide hands on experience of:
Different Process Scheduling Algorithms in Operating SystemNOTE
No assignment will be accepted after the due date via email in any case (whether it is the case of load shedding or internet malfunctioning etc.). Hence refrain from uploading assignment in the last hour of deadline. It is recommended to upload solution file at least two days before its closing date.
If you find any mistake or confusion in assignment (Question statement), please consult with your instructor before the deadline. After the deadline no queries will be entertained in this regard.
For any query, feel free to email at:
[email protected]Question No 01 10 marks
Assume you have to apply First Come First Serve (FCFS) scheduling algorithms on the set of different processes given in the table below. The CPU burst time is also given for each process. Consider that all the processes arrive in the ready queue within time 0 seconds. You are required to show the Gantt chart to illustrate the execution sequence of these processes and calculate the total waiting time and average waiting time for the given processes by using FCFS algorithm.Question No 02 10 marks
Consider a scenario where you have to apply Round Robin scheduling algorithm on the below given set of processes with each having a quantum size=10 milliseconds. The CPU burst time and arrival time for each process is also provided in the given table. You are required to show the Gantt chart to illustrate the execution sequence of these processes. Moreover, calculate the average turnaround time and average waiting time for given processes by using round robin algorithm.Wish you very Best of Luck!
-
___________ scheduler takes the process from the ready queue and assign the CPU with the help of Dispatcher.
Long term
Short term
Medium
SwapperWhile using the read/write system call which data type is use to return the size of file to buffer from file descriptor fd? CS604
Pipefd
SIZE_MAX
FIFO
Ssize_t_____ system call is used to write to a file or FIFO or any other IPC channel. CS604
read
write
open
forkIn multi-threaded process thread () take two argument, they are used to take______________ and ___________. CS604
Program counter value, address space limit
New thread ID, process name
Register count, program counter
New thread function name, new thread IDThe basic purpose of ________________is to help the users to utilize the hardware resources for completing different tasks in a simplified manner. CS604
Operating system (Page 6)
Application software
All Software
All of the givenWhen sender never block because it has an infinite length storage area, then it means it is holding a queue of _____________ capacity. CS604
Zero
Unbounded
Defined
BoundedHow many modes are supported in operating system? CS604
1
2
3
4In process management, some of the jobs can be suspended for some time in order to give other jobs a chance to be in execution. Which command can be used to place back a suspended program? CS604
fg
top
ps
bgA Process ‘A’ that has finished working but its parent process has also finished its execution. In this state the process ‘A’ will be called as _____ process. CS604
Child
Thread
Zombie (Page No. 39)
Fork
In Unix/Linux ------------- are used for client server communication to pass data between a server process and client processes. CS604
FIFO (page 60)
LIFO
Read()
Write() -
Operating Systems (CS604)
Assignment # 01 Spring 2019Total marks = 20
Deadline Date 14th May 2019
Please carefully read the following instructions before attempting assignment.
RULES FOR MARKING
It should be clear that your assignment would not get any credit if:
The assignment is submitted after the due date.
The submitted assignment does not open or file is corrupt.
Strict action will be taken if submitted solution is copied from any other student or from the internet.You should consult the recommended books to clarify your concepts as handouts are not sufficient.
You are supposed to submit your assignment in .doc or docx format.
Any other formats like scan images, PDF, zip, rar, ppt and bmp etc will not be accepted.Objective:
• The objective of this assignment is to provide hands on experience of:
• To learn and understand the basic concept of an Operating System
• To learn Directory Structure of Operating SystemNOTE
No assignment will be accepted after the due date via email in any case (whether it is the case of load shedding or internet malfunctioning etc.). Hence refrain from uploading assignment in the last hour of deadline. It is recommended to upload solution file at least two days before its closing date.
If you find any mistake or confusion in assignment (Question statement), please consult with your instructor before the deadline. After the deadline no queries will be entertained in this regard.
For any query, feel free to email at:
[email protected]Question No 01 10 marks
The following figure shows the directory structure in a UNIX/Linux system. Suppose, user Hassan has a subdirectory named courses under his home directory. This directory contains subdirectories for the courses that he has taken i.e. (CS401 and CS604).
If hassan is currently in the courses directory than write the UNIX/Linux commands to perform following operations.
How he can navigate back to his home directory? How he can navigate to his personal directory? How he can navigate to the directory for cs604 course? Right after the login, how he can display names of files and directories in his home directory? How he can create a new directory named programs under cs604 directory?Question No 02 10 marks
The following table contains the list of operations based on important directories in the Linux operating system; you are required to mention the directory names used in Linux operating system against each desired output operation.
Sr #
List of Operations
Directory
1
To contain the devices available to Linux2
Used for mounting temporary file systems3
To store system configuration files4
For the storage of large applications packages5
To store shared libraries and kernel modulesWish you very Best of Luck!
SOLVED CS604 Quiz#2 Solution and discussion
-
CS604 Quiz#2.
Please post your current Quiz to help the students. -
While executing the statement c++/c-- in Producer-Consumer problem, at back end certain number of
instructions are executed, if interleaving of statements happen, it create race condition. Tell number of
instructions that require “no interleaving” while executing c++/c–?3
1
2
0 -
Software solution to critical section problem can run only in environment ______________.
Multiprocessor
Multithreading
Uniprocessor
Separate address spacingThe software-based solution is 2 processes also they are not guaranteed to work on modern computers architecture. The critical section problem could be solved simply in a uniprocessor environment if we prevent interrupts from occurring from uniprocessor environment.
-
We can use semaphores to deal with the number of __________process critical section problem.
►n-process critical section problem
-
Using hardware solution to synchronization for complex problems, introduce a new synchronization tool know as _______________.
- TestAndSet
- Semaphore (Page 111)
- Swap
- Trap
-
The main memory is usually divided into partitions, one for __________ and other for __________.
- Operating System, User processes
- Operating system, CPU
- Processes, Virtual Memory
- Base Register, Limit Register
-
The integer value of ________semaphores can range over an unrestricted integer domain.
►Counting (Page 117)
►Binary
►Mutex
►Bounded buffer -
The integer value of _________ semaphores can not be greater than 1.
►Counting
►Binary (Page 117)
►Mutex
►Bounded buffer -
Secondary storage memory devices have ____ memory.
►Volatile
►Permanent and non volatile Click here for detail
►Temporary
►None of the -
Object files and libraries are combined by a ------------- program to produce the executable binary
► Compiler
► Linker
► Text editor
► Loader Click here for detail -
In Swapping technique of Memory Management, the total amount transfer time is directly proportional to the ___________.
- amount of memory swapped
- amount of space on backing store
- space on main memory
- all the given options are correct
-
In order to remove the problem like busy waiting, some high level synchronization constructs are defined. What
are they?►Critical regions and Monitors (Page 124)
-
In deadlock detection and recovery algorithm, a deadlock exists in the system if and only if the wait for graph
contains a _____________► Cycle (Page 147)
► Graph
► Edge
► Node -
External Fragmentation takes place in ______________
Select correct option:
- Multi programming with Variable Tasks (MVT)
- Multi programming with Fixed Tasks (MFT)
- Multi-tasking
- Paging
-
Each page is a power of -------- bytes long in paging scheme.
► 2
► 3
► 4 (Page 167)
► 5 -
----------holds the smallest legal physical memory address for a process CS604
Or
Which register holds the smallest legal physical memory address for a process?► Base register (Page 13)
► Limit register
►Status register
►None of the given options