We have been working very hard since 2009 to facilitate in your learning Read More. We can't keep up without your support. Donate Now.

www.vustudents.ning.com

 www.bit.ly/vucodes + Link For Assignments, GDBs & Online Quizzes Solution www.bit.ly/papersvu + Link For Past Papers, Solved MCQs, Short Notes & More

# CS604 Final Term Papers Spring 2019 (24 August ~ 04 September 2019) & All Solved Past Papers, Solved MCQs & Helping Material

CS604 Final Term Papers Spring 2019 (24 August ~ 04 September 2019) & All Solved Past Papers, Solved MCQs & Helping Material

+ http://bit.ly/vucodes (Link for Assignments, GDBs & Online Quizzes Solution)

+ http://bit.ly/papersvu (Link for Past Papers, Solved MCQs, Short Notes & More)

Views: 845

### Replies to This Discussion

Share You’re Final Term Papers Spring 2019 (Questions/Pattern) & Past Papers as well here to help each other. Thanks

+ Final Term Papers Shared By Bilal Maqsood

+ All VU Subject Mid & Final Term Papers Data Shared by Moaazpk

+ Orignal Solved Final Term Papers By Waqar.siddhu

+ Solved Final Tem Papers Share By Malikooo

www.bit.ly/papersvu (Link for Past Papers, Solved MCQs, Short Notes & More)

cs 604
objective almost 70% from Waqar file
subjective 5 Marks
1: working of copy-on-write
2: describe 5 methode to improve access time and bandwidth
3: Code given and tell the name of semaphore and definition that is not cause busy waiting
4: Calculate no of bits for p,f,d,physical and logical address
5: table given and set the schedule order for FCFS & Round robin scheduling
Sorry 4 Short questions of mark 3

cs 604
objective almost 70% from Waqar file
subjective 5 Marks
1: working of copy-on-write
2: describe 5 methode to improve access time and bandwidth
3: Code given and tell the name of semaphore and definition that is not cause busy waiting
4: Calculate no of bits for p,f,d,physical and logical address
5: table given and set the schedule order for FCFS & Round robin scheduling

CS604 today's paper Spring 2019

CS604 today's paper Spring 2019

cs604

mcq 50% past

5marks

question no 1

program tha ek us main problem batani thi.

q no 2 forms allocation k step batany thy.

q no3 operating system ki responsibilities batani thi

q no 4 allocation graph tha us main batana tha k deadlock hai k nai

q no 5 address calculation kerni thi values di hoe thi offset maloom kerna tha pag ka

3 marks

qno1 segment size dia tha or logical adress or ek segment main kitny page yeh maloom kerna tha

q no 2 semaphor ka tha

q no 3

source code

q no 4 starvation

q no 5 soft code ka th

Cs604

10 mcqs from past papers and remaining from last lectures

Q 1 was related to operating system which software is used to control manage the computer functions management name its two types..

Q. define the figure that was from

Book page 129.

Q write 3 semaphore issues..

Q Find logical address of given value..

Q.Find effective time of given value

Q.Is I/O swaps is faster than file system ?explain

Q..Find save sequence of given value. It was from book page 135 example

Cs604 final term paper 2019

20 mcqs were in past waqar sidhu files

Subjectives are

Q1. Describe the operation that a file owner can use for "file protection" .also mention some operations that we can perform on a file.

[Q2. Is disk I/O to swap space generally faster than file system? Justify the statement with reason in either case .

Q3. Write down at least two types of file structure.

Q4. "Virtual Memory is an extremely large main memory"

Do you agree with the given statement or not? Give reason to support your answer.

Q5. Classify the semaphores into at least two categories based on waiting behavior.

Q6.And when a specific semaphore is more useful as compared to other?

Q7: Suppose ,logical adress space =32bits and page size =8k then calculate the following

*Maximum page in a process address space

Q8.: In deadlock prevention strategy do you think it is necessary to check that either safe state exits or not? Give reason to support your answer.

20mcqz from past

..

1…suppose that pipe read end descriptors is pfd[0] and write end descriptor is pfd[1] now the process creates a new process using fork now write the read end descriptors and write end descriptors

2… identify the problems

a…. po               p1

signal(S)    wait (S)

wait (S)  signal(S)

b.. po               p1

wait (S)   wait(Q)

wait (Q)           wait (S)

signal(S)       signal(Q)

signal(Q)    signal(S)

c.. po               p1

wait(S)       wait(S)

wait(S)     signal(S)

3…..Name the two registers which are used for segmentation

4…enlist the three different stages when the addreeses can be bound ti instruction and data

5..While managing computers system hardware efficient sometimes it seems reasonable to service all requirements that are closed to cureent position write this technique name

6..code likhna tha   test and set ka

7.classify semaphores in two categories

8.in OS mention five methods to improve access time and bandwidth

9..in LINUX write working of copy on write techchique to virtual memory

10.valueas given then 10kb 4kb 2okb 18kb 7kb 9kb 12kb 15kb

Best or wrost fit ka btana tha 12kb 10kb 9kb ka.

+ !♛JH-MuGhaL ♛!+  thanks for sharing

## Latest Activity

+M.Tariq Malik liked Fatima's discussion mgt503
2 hours ago
+M.Tariq Malik liked Fatima's discussion MGT503 short notes
2 hours ago
MUHAMMAD IHSAN ULLAH and maria shams are now friends
2 hours ago
Fatima posted discussions
2 hours ago
3 hours ago
+M.Tariq Malik posted discussions
3 hours ago
3 hours ago
нαρρү cнαη∂α] •._.•´¯)'s discussion was featured

3 hours ago

1

2