CS604 Final Term Solved MCQs with References by Arslan
- Type
- Final term past paper
- Course
- CS604 Operating Systems
- Size
- PDF 414 KB
- Updated
- 23 Oct 2026
You get 3 free files a day on the website. Add the Chrome extensionSign in with the extension for 30 a day.
Preview text
Text from pages 1, 2, 3 of 10. Download the file for all 10 pages.
Updated.
Final-Term Papers Solved MCQS with Reference
- ________ enable processes to communicate with each other
o FIFO PG # 218
o Ordinary File
- ________ scheme works well if members of the team are to work on these shared files sequentially.
o Duplicating Files PG # 288
o Common Login o Link
- UNIX recognizes ______ modes of access o One o Two
o Three PG # 230
o Four UNIX recognizes three modes of access: read, write, and execute (r, w, x).
- The______ algorithm selects the request with the minimum seek time from the current head position o Scan
o SSTF PG # 244
o Look o C-Look
Q5. Which part of the computer system helps in managing the file and memory management system?
o Operating System
o Device Drivers o Application Software o Hardware
- ________ is used to store data on secondary storage device. o Block Special File
o Ordinary File PG # 218
- _______ is a way to establish a connection between the file to be shared and the directory entries of the users who want to have access to this file.
o Link PG # 229
o Access Permission
Q8. Which one of the following indicates end of the file in a read ( ) system call?
o -1 o 0 o 1 o 2
- In one of the deadlock prevention methods, impose a total ordering of all resource types, and require that each process requests resources in an increasing order of enumeration. This violates the _______________condition of deadlock. o Mutual exclusion o Hold and Wait
o No Preemption Right
- The bottom layer in the layered approach of Operating System is ____________. o User interface
o Hardware PG # 18
o Kernel o API
- The non-critical section code in any critical section problem is termed as ____________.
o Entry Section o Leave/Exit Section
o Remainder Section
- The process that satisfies all three requirements of critical section problem is called __________. o Algorithm 1 o Algorithm 2
o Algorithm 3
o Algorithm N
- The main disadvantage of semaphore is ______________. o Context switching
o Busy waiting PG # 111
o Synchronization o Deadlock
Related CS604 files
All CS604 files →- CS604 Final Term Solved Subjective with References by Umair Saulat (Word) Final term DOC 306 KB
- CS604 Final Term Solved Subjective with References by Moaaz (Word) Final term DOCX 966 KB
- CS604 Final Term Solved Subjective 2015 by Aabi Ali Final term PDF 689 KB
- CS604 Final Term Subjective with References by Faisal Final term PDF 788 KB
- CS604 Highlighted Handouts by KST Learning Highlighted PDF 4.9 MB
- CS604 FAQs and Glossary by Eagle Eye Quiz PDF 538 KB
Get more out of VUBuddy, for free
- Unlimited downloads
- The explanation behind every MCQ answer
- Study offline on slow data
- 30 downloads a day instead of 3
- Sign in and buy Pro Semester here
One Pro Semester membership works in both the extension and the app.