---------- Forwarded message ----------
From: ●●Binish_Awais●● <greyferry@gmail.com>
Date: Fri, May 13, 2011 at 10:04 PM
Subject: Re: ::: vuaskari.com ::: cs 604 urgent required...
To: Awais Jamal <jamal.awais@gmail.com>
HERE ARE ALL SUBJCTV QUESTIONS FROM LATEST TERM 2011...GOODLUCK
Scan Algorithm is sometimes called the elevator algorithm, why?
What is basic logic in FIFO page replacement algorithm?
What is Mounting? Name two types of mounting. Give your answer with respect to File System?
Write three main characteristics memory management System?
Provide names of common file structures.
What do you think that why Main Memory is kept as a volatile memory and why not a permanent storage device?
Summarize the tradeoffs among simple arrays, trees, and hash tables as implementations of a page table.
Name inter-process communication tools available in UNIX/Linux?
How to implement hold and wait which can ensure that a deadlock will not occur?
q list down 2 major benefits of virtual memory
q what are the possible system for the input redirection in the UNIX/LINX system
q what is the purpose of stud in dynamic linking ,give answer with respect to memory
q what is use of mounting in file system
q the scan algorithm is sometime called eveloater . why ?
q how operating attacks the" no preemption "condition necessary for feedback in order to solve the pro of deadlock
q what is pager ? give answer with respect to virtual memory
q what does the following command do in the LINX/UNIX operating system
$mkdir/courses/cs604/program
q how u can differentiate between external and internal fragmentation
q how page fault freqancy can b used as a method of thrashing
q 3 major frame allocation scheme
q consider the round robin technique .do u think that the deadlock or starvation can happen in the round robin tech scheduling
q explain the work of copy on write with respect to virtual memory
MCQs 16
1. List and define the different metrics by which might evaluate a scheduler (List at least 4). 5 marks
2. Write brief the multilevel feedback queue scheduling. 5 marks
3. Assumption made while formulating a solution to the critical section problem. 2 marks
4. There are many commands. Write the method through which these commands can communicate with each other. 3 marks
5. Write Difference between SJF and Shortest Remaining Time First Scheduling algorithm. 3 marks
6. Write formula for calculating waiting time in preemptive Shortest Job First Algorithm. 2 marks
7. Define race condition and how prevent this condition. 2 marks
--
From: ●●Binish_Awais●● <greyferry@gmail.com>
Date: Fri, May 13, 2011 at 10:04 PM
Subject: Re: ::: vuaskari.com ::: cs 604 urgent required...
To: Awais Jamal <jamal.awais@gmail.com>
HERE ARE ALL SUBJCTV QUESTIONS FROM LATEST TERM 2011...GOODLUCK
Scan Algorithm is sometimes called the elevator algorithm, why?
What is basic logic in FIFO page replacement algorithm?
What is Mounting? Name two types of mounting. Give your answer with respect to File System?
Write three main characteristics memory management System?
Provide names of common file structures.
What do you think that why Main Memory is kept as a volatile memory and why not a permanent storage device?
Summarize the tradeoffs among simple arrays, trees, and hash tables as implementations of a page table.
Name inter-process communication tools available in UNIX/Linux?
How to implement hold and wait which can ensure that a deadlock will not occur?
q list down 2 major benefits of virtual memory
q what are the possible system for the input redirection in the UNIX/LINX system
q what is the purpose of stud in dynamic linking ,give answer with respect to memory
q what is use of mounting in file system
q the scan algorithm is sometime called eveloater . why ?
q how operating attacks the" no preemption "condition necessary for feedback in order to solve the pro of deadlock
q what is pager ? give answer with respect to virtual memory
q what does the following command do in the LINX/UNIX operating system
$mkdir/courses/cs604/program
q how u can differentiate between external and internal fragmentation
q how page fault freqancy can b used as a method of thrashing
q 3 major frame allocation scheme
q consider the round robin technique .do u think that the deadlock or starvation can happen in the round robin tech scheduling
q explain the work of copy on write with respect to virtual memory
salams
download the attachment
download the attachment
CS604 Current 2010 Paper
one more paper
Question # 1 Marks: 2 * 5= 10
Answer the following questions:
a) If there are 50 processes then the total number of page tables will be?
b) How can we calculate the number of bits required to identify the number of pages in the process address space. Give the formula.
c) If there are 64 pages in the process address space then what will be the total number of entries in page table.
d) How can we calculate the MAXIMUM number of pages with the given info: no. of bits of logical address space (p) and size of the page table. Give the formula.
e) How can we calculate the size of the page table?
Question # 2 Marks: 2.5 * 4= 10
The logical address space of the process is 8 pages and the size of each page is 1 Kb. There are 64 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:
1 Calculate the size of Logical Address?
2 Find the size of the Logical Memory?
3 Calculate the size of Physical Address?
4 Determine the size of the Physical Memory?
Answer the following questions:
a) If there are 50 processes then the total number of page tables will be?
b) How can we calculate the number of bits required to identify the number of pages in the process address space. Give the formula.
c) If there are 64 pages in the process address space then what will be the total number of entries in page table.
d) How can we calculate the MAXIMUM number of pages with the given info: no. of bits of logical address space (p) and size of the page table. Give the formula.
e) How can we calculate the size of the page table?
Question # 2 Marks: 2.5 * 4= 10
The logical address space of the process is 8 pages and the size of each page is 1 Kb. There are 64 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:
1 Calculate the size of Logical Address?
2 Find the size of the Logical Memory?
3 Calculate the size of Physical Address?
4 Determine the size of the Physical Memory?
Post: #1 | CS604 Midterm Paper Unsolved paper  |
shared by CS BOY fall_2011 midterm paper of cs604
Total 23 QuestionsMCQs 16
1. List and define the different metrics by which might evaluate a scheduler (List at least 4). 5 marks
2. Write brief the multilevel feedback queue scheduling. 5 marks
3. Assumption made while formulating a solution to the critical section problem. 2 marks
4. There are many commands. Write the method through which these commands can communicate with each other. 3 marks
5. Write Difference between SJF and Shortest Remaining Time First Scheduling algorithm. 3 marks
6. Write formula for calculating waiting time in preemptive Shortest Job First Algorithm. 2 marks
7. Define race condition and how prevent this condition. 2 marks
Dear Friends AOA!
Here is my today's complete paper of CS604 - Operating Systems. Study it and hope that you get some out of it. Wish you all a well doing in exams.
Pray for me as well
Here is my today's complete paper of CS604 - Operating Systems. Study it and hope that you get some out of it
. Wish you all a well doing in exams.Pray for me as well
On Fri, May 13, 2011 at 9:20 PM, Awais Jamal <jamal.awais@gmail.com> wrote:
Please upload cs 604 solved papers.... please!! urgenttttt!!
On 5/13/11, Arslan <mc090400692@vu.edu.pk> wrote:
> *CS507 12 may 2011*
>
> --
> We say, "Be one as Pakistani Nation and grow up for Pakistan's Future". Wish
> you all the best. Join www.vuaskari.com,
> To post to this group, send email to vuaskari_com@googlegroups.com
> Visit these groups:
> This (Main) Group:http://groups.google.com/group/vuaskari_com?hl=en?hl=en
> MIT/MCS Group: http://groups.google.com/group/vu_askarimit?hl=en?hl=en
> HRM Group: http://groups.google.com/group/askari_hrm?hl=en?hl=en
> Banking Group: http://groups.google.com/group/askari_banking?hl=en?hl=en
> Management: https://groups.google.com/group/vuaskari_mgt?hl=en
> Marketing: https://groups.google.com/group/vuaskari_mkt?hl=en
> MIS Group: http://groups.google.com/group/askari_mis?hl=en
>
●●Gяєу_Fєяяy ●●
vuAskarian_∂oll
--
●●Gяєу_Fєяяy ●●
vuAskarian_∂oll
--
We say, "Be one as Pakistani Nation and grow up for Pakistan's Future". Wish you all the best. Join www.vuaskari.com,
To post to this group, send email to vuaskari_com@googlegroups.com
Visit these groups:
This (Main) Group:http://groups.google.com/group/vuaskari_com?hl=en?hl=en
MIT/MCS Group: http://groups.google.com/group/vu_askarimit?hl=en?hl=en
HRM Group: http://groups.google.com/group/askari_hrm?hl=en?hl=en
Banking Group: http://groups.google.com/group/askari_banking?hl=en?hl=en
Management: https://groups.google.com/group/vuaskari_mgt?hl=en
Marketing: https://groups.google.com/group/vuaskari_mkt?hl=en
MIS Group: http://groups.google.com/group/askari_mis?hl=en
No comments:
Post a Comment
PLEASE COMMENT ABOUT YOUR VISIT AND MY SITE
Note: Only a member of this blog may post a comment.