CS604 Operating Systems

Comment

Comment by + M.Tariq Malik + on April 13, 2013 at 10:24pm

@ All members Please Check these important links for this subject group

+ Latest Activity in This Group + Newest Discussoins in this group

+ Most Popular Discussions in this Group + Add New Discussion

+ View All Discussions in this Group + View All Featured Discussions in This Group

Comment by zaini on April 9, 2013 at 5:04pm

nice

Comment by + M.Tariq Malik + on December 14, 2012 at 8:09pm

Thanks hina 

Comment by Hinna on December 14, 2012 at 1:44pm

CS604-MIDTERM SOLVED Subjective WITH REFERENCES BY HINA

CS604-MIDTERM SOLVED MCQS WITH REFERENCES BY HINA.

Comment by star angel on November 18, 2012 at 8:18pm

plz share the idea solution of assignment 02

Comment by aneela javed on November 4, 2012 at 10:58am

PLZ Share idea solution of cs604 Assignmnt No 1 

Comment by Ata Ul Nasar on July 9, 2012 at 2:10pm

I need help for the installation of Ubuntu Virtual Machine on Windows 7.
please help me.

Comment by Rehana shafi on June 2, 2012 at 7:07pm

tody iz grace dy..plz snd me cs 604 assigment

Comment by + (((ℛ((ὗмДἷℛ ṩἷD )ℛ))♥ on May 2, 2012 at 4:09pm

cs 604 quiz 1 ......... needed....:) 

Comment by atif khan on May 2, 2011 at 11:09am

CS604 Assignmnet 2 - Last date 02 / May / 2011

Discuss about this assignment here.

Question 2: Marks: 10

Suppose there are number of processes running on a system. New process in this

system arrives at an average of ten processes per minute. Each process requires an

average of 4 seconds of service time. Estimate the fraction of CPU busy time in a

system with a single processor.

Question 2: Marks: 10

The Round Robin algorithm has been applied on the following processes with

quantum size=8 milliseconds. You have to answer the question given below

related with processes. Calculate the average waiting time and average

turnaround time for each process by using round robin algorithm?

Process CPU burst

time

(milliseconds)        Arrival time                 (milliseconds)

P0                                25                                           0

P1                                 10                                         5

P2                                 15                                         7

P3                                 9                                           8

P4                                33                                        10

P5                               16                                           10

 

Question 3: Marks: 10

Suppose you have to apply FCFS and SJF (non-preemptive) scheduling

algorithms on the following given processes. Considering all the processes

arrives in the ready queue within time 0 seconds. Calculate the average waiting

time for each algorithm. You have to identify that which of these two algorithms

is better reference to waiting time?

Process                       CPU burst time(seconds)

P0                                           25

P1                                           10

P2                                           15

P3                                             9

P4                                            33

P5                                              5

• ‹ Previous
• 1
• 2
• Next ›
• Page