Downloads
 Overview |
 Search Downloads |
 Up |
| Category: CS604 - Operating Systems |
|
|
Please register or login to download files from this category.Files:
 CS604_Quiz_Fall2011(1st) |
|
CS604 Quiz Fall2011(1st) Operating System |
|
 2011-11-10 11:25:17  244.29 KB  1 |
 cs604 |
|
| cs604 | |
| 2011-07-08 18:20:30 19.5 KB 1 |
| Spring 2011 CS604 1 Solution |
|
Read the following program carefully and write the output of the program. Explain each line of code according to given numbering. #include #include #include #include |
|
| 2011-04-18 09:41:03 25.5 KB 14 |
 Fall 2010_CS604_5_SOL |
|
Question # 1
[10] marks
Consider the following example of the FIFO page replacement algorithm. Calculate number of page faults and also show the working of FIFO algorithm having number of frames = 4 on the following reference string:
{Ali, Bilal, Ahmed, Salman, Shujaat, Ahmed, Salman, Bilal, Sarwar, Ali, Shujaat, Ahmed, Ali, Salman, Bilal, Sarwar}
Question # 2
| |
| 2011-04-02 12:45:54 18.54 KB 4 |
| Fall 2010_CS604_4_SOL |
|
Question # 1
The logical address space of the process is 32 pages and the size of each page is 4 Kb. There are 256 frames in the main memory. The size of a frame is equivalent to the size of a page. With the given information, answer to the following questions:
• Calculate the size of Logical Address?
• Find the size of the Logical .... |
|
| 2011-04-02 12:45:01 24.76 KB 1 |
| Fall 2010_CS604_3_SOL |
|
Question # 1
Using Banker’s Algorithm consider a system with six processes Pak, Iran, Qatar, Oman, UAE and Dubai and four resource types: A, B, C. and D Resource type A has 14 instances, resource type B has 10 instances, resource type C has 12 instances and D has 16 instances. Suppose that at a time T0 the following snapshot of the system has been taken:
i. Construct Need Matrix. [5 .... |
|
| 2011-04-02 12:43:58 34.85 KB 1 |
| Fall 2010_CS604_2_SOL |
|
Question # 1:
Part a: [10]
Using Non-preemptive SJF algorithm answer the following questions using the table below:
|
|
| 2011-04-02 12:42:57 25.21 KB 3 |
| Fall 2010_CS604_1_SOL |
|
Question # 1:
Understand the below program carefully and explain each line accordingly.
#include
void main ( )
1………………… {
2……………………….int pid, status;
3……………………….pid = fork ( );
4……………………….if (pid = = .... |
|
| 2011-04-02 12:41:54 24.52 KB 1 |
| Mid Past Papers QA CS604 Operating Systems |
|
Questions and answer from past papers of CS604 Operating Systems. Prepare Virtual University (VU) mid exam and get success. |
|
| 2010-11-29 22:20:59 305.36 KB 43 |
 Solution Fall 2010 CS604 2 |
|
Using Non-preemptive SJF algorithm answer the following questions using the table below: |
|
| 2010-11-26 17:53:18 123.31 KB 31 |
| Solution_Fall 2010_CS604_1 |
|
Understand the below program carefully and explain each line accordingly. #include void main ( ) 1………………… { 2……………………….int pid, status; 3……………………….pid = fork ( ); 4……………………….if (pid = = -1) 5……………………… { 6……………………………printf(“fork failed\n”); 7……………………………exit(1) ; | |
| 2010-11-01 16:03:30 50.5 KB 11 |
| CS604-Operating System |
|
VU Course Contents CS604-Operating System |
|
| 2010-07-25 22:10:55 34.25 MB 93 |