CS604 Mid Term Papers Spring 2019 (15~28-June 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)+ Click Here to Search (Looking For something at vustudents.ning.com?) + Click Here To Join (Our facebook study Group)
Share Your Mid Term Papers Spring 2019 (Questions/Pattern) & Past Papers as well here to help each other. Thanks
For Important Helping Material related to this subject (Solved MCQs, Short Notes, Solved past Papers, E-Books, FAQ,Short Questions Answers & more). You must view all the featured Discussion in this subject group.
For how you can view all the Featured discussions click on the Back to Subject Name Discussions link below the title of this Discussion & then under featured Discussion corner click on the view all link.
Or visit this link
total mcqs 18
all from waqar and mooaz files
2 Questions of 3 marks
3 Questions of 5 marks
Q. ak code given tha. code may "convert = Buffer_size" likha tha. pucha gya tha k what is the function of convert in this code. /3
Q. P1 to P4 were given with arrival time and CPU burst time. Find average waiting time using shortest job first algorithm. /5
Q. Give three situations when a file will not open or open() system call fails. /5
Q. ak statement given thi us k 2 reasons btany thy yad ni baki.
18 mcqs from past papers moiz + waqar files.
1) round robin algorithm dya howa tha osko solve krna tha (5 marks)
2) single-thread system or multiple-threaded system ki digram bnani thi (5 marks)
3) When the fork call the system from shared process between parents and child process ? Is type e question tha.. Why write any five things? (5 marks )
4) What is meant multilevel feedback queue scheduling (3 marks)
Multilevel feedback queue scheduling allows a process to move between queues. The idea is to separate processes
with different CPU burst characteristics. If a process uses too much CPU time, it will be moved to a lower-priority
queue. This scheme leaves I/O bound and interactive processes in the higher-priority queues. Similarly a process that
waits too long in a lower-priority queue may be moved o a higher priority queue.
Ak or bhe tha wo yad nh.
today paper BC1704038.. 11:30am 24-6-2019
MCQs all new ony roundabout 7 to 9 from past
QUESTION: why micro kernel is better than Monolithic kernal? reason (5 marks)
QUESTION: schedule algorithm ki characteristc ko identify karna tha (3 MARKS)
QUESTION: (5 marks)
a) Can producer and consumer update buffer concurrently
b) is it feasible for producer and consumer i mean both update buffer concurrently? if yes or no give reason
i forget 2 other