Navigation

    Cyberian
    • Register
    • Login
    • Search
    • Categories
    • Recent
    • Tags
    • Popular
    • Pro Blog
    • Users
    • Groups
    • Unsolved
    • Solved
    Quiz 100% Result
    • CS604 Assignment 3 Solution and Discussion

      zaasmi

      Re: CS604 Assignment 3 Solution and Discussion

      Operating Systems(CS604)
      Assignment # 03
      Spring 2020
      Total marks = 15

      Deadline Date
      27th July 2020

      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 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
      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.

      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

      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!

      CS604 - Operating Systems
    • CS604 Assignment 2 Solution and Discussion Spring 2020

      zaasmi

      Re: CS604 Assignment 2 Solution and Discussion

      Operating Systems (CS604)
      Assignment # 02
      Spring 2020
      Total marks = 15

      Deadline Date
      14th June 2020

      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 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 5

      The 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!

      CS604 - Operating Systems
    • CS604 GDB 1 solution and discussion Fall-2019

      zareen

      Re: CS604 GDB 1 solution and discussion

      CS604 - Operating Systems
    • CS604 Assignment 3 Solution and Discussion

      zareen

      Operating Systems (CS604)
      Assignment # 03
      FALL 2019
      Total marks = 20

      Deadline Date
      22nd Jan 2020

      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 understanding of:
      Semaphore and Resource Allocation Graph

      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 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!

      CS604 - Operating Systems
    • CS604 Assignment 2 Solution and Discussion

      zareen

      Operating Systems (CS604)
      Assignment # 02
      FALL 2019
      Total marks = 20

      Deadline Date
      02.12.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 System

      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 4+3+3=10 marks
      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.

      Process CPU Burst Time (seconds) P0 2 P1 6 P2 1 P3 4 P4 3 P5 8

      Question No 02 4+3+3=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=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.

      Process CPU Burst Time (Milliseconds) Arrival Time(Milliseconds) P0 15 0 P1 8 4 P2 25 18 P3 18 5

      Wish you very Best of Luck!

      CS604 - Operating Systems
    • CS604 Assignment 1 Solution and Discussion

      zareen

      Operating Systems (CS604)
      Assignment # 01
      Fall 2019
      Total marks = 20

      Deadline Date
      16-11-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 Process and its states

      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 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?

      711993dd-d5ba-4dd9-b8e8-13ae4e0898e1-image.png

      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:
      e6f1dbaf-ee88-4f30-8ad2-a08f1ca000e1-image.png
      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.

      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.

      Wish you very Best of Luck!

      CS604 - Operating Systems
    • CS604 Quiz#2 Solution and discussion

      zaasmi

      CS604 Quiz#2.
      Please post your current Quiz to help the students.

      CS604 - Operating Systems
    • CS604 GDB 1 solution and discussion

      zaasmi

      Graded Discussion Board

      Semester: Spring 2019
      Operating System – CS604

      Instructions:

      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 !

      CS604 - Operating Systems
    • CS604 Assignment # 03
 Solution and Discussion

      zaasmi

      66aa4c6d-8d94-4d53-89e7-ab7904f822a1-image.png

      Operating Systems (CS604)
      Assignment # 03
Spring 2019

      Total 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 System

      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 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.
      81858d3b-c30e-4b21-93b8-bb96c3476b68-image.png

      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 Marks

      Question 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.

      5f0c00bb-3c13-45e5-8c8b-aa638a964522-image.png

      CS604 - Operating Systems
    • Operating Systems (CS604) Assignment # 02
 Spring 2019 Solution and Discussion

      zaasmi

      3ee3e99a-4656-4cc7-9374-92e3f17cd522-image.png

      Operating Systems (CS604)
      Assignment # 02
Spring 2019

      Total 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 System

      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 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.

      be925094-181f-4e06-8dca-f6059257d61c-image.png

      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.

      f390b50c-f3c3-4441-a4dc-3c15e71b2c18-image.png

      Wish you very Best of Luck!

      CS604 - Operating Systems
    • CS604 Quiz#1 Solution and discussion

      M

      ___________ scheduler takes the process from the ready queue and assign the CPU with the help of Dispatcher.
      Long term
      Short term
      Medium
      Swapper

      While 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
      fork

      In 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 ID

      The 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 given

      When 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
      Bounded

      How many modes are supported in operating system? CS604

      1
      2
      3
      4

      In 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
      bg

      A 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()

      CS604 - Operating Systems
    • Operating Systems (CS604) Assignment # 01
 Spring 2019

      cyberian

      Spring 2019_CS604_1.docx

      Operating Systems (CS604)
      Assignment # 01
Spring 2019

      Total 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 System

      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 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 Linux

      2
      Used for mounting temporary file systems

      3
      To store system configuration files

      4
      For the storage of large applications packages

      5
      To store shared libraries and kernel modules

      Wish you very Best of Luck!

      CS604 - Operating Systems

    UNSOLVED CS604 Assignment # 03
 Solution and Discussion

    CS604 - Operating Systems
    assignment cs604
    1
    1
    441
    Loading More Posts
    • Oldest to Newest
    • Newest to Oldest
    • Most Votes
    Reply
    • Reply as topic
    Log in to reply
    This topic has been deleted. Only users with topic management privileges can see it.
    • zaasmi
      zaasmi Cyberian's Gold last edited by

      66aa4c6d-8d94-4d53-89e7-ab7904f822a1-image.png

      Operating Systems (CS604)
      Assignment # 03
Spring 2019

      Total 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 System

      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 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.
      81858d3b-c30e-4b21-93b8-bb96c3476b68-image.png

      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 Marks

      Question 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.

      5f0c00bb-3c13-45e5-8c8b-aa638a964522-image.png

      1 Reply Last reply Reply Quote 0
      • First post
        Last post

      50% Off on Your FEE Join US!

      Quiz 100% Result If you want to know how you can join us and get 50% Discout on your FEE ask Cyberian in Chat Room! Quiz 100% Result Quiz 100% Result
      solution1241 discussion1194 fall 2019813 assignment 1425 assignment 2295 spring 2020265 gdb 1246 assignment 382 crw10174 spring 201955
      | |
      Copyright © 2021 Cyberian Inc. Pakistan | Contributors
      Live Chat