Skip to content
VUBuddy

CS604P Final Term Quiz 3 July 2023 by Miss Mehwish

Operating Systems (Practical) PDF 540 KBUpdated 23 Oct 2026
Quiz CS604P Final Term Quiz 3 July 2023 by Miss Mehwish PDF 540 KB
vubuddy.com
Type
Quiz
Course
CS604P Operating Systems (Practical)
Size
PDF 540 KB
Updated
23 Oct 2026
Free download 0 of 3 used today
Download free · 540 KB

You get 3 free files a day on the website. Add the Chrome extension for 30 a day.

Unlimited downloads in the Android app Get it free on Google Play

Preview text

Text from pages 1, 2, 3 of 4. Download the file for all 4 pages.

We also provide Past papers for Mids. and Finals

Cross Check your answers before submitting directly from the file. We are not responsible for 100% correction as human error exists

MCQ 1: Logical data refers to the instruction or data stored in the _______. Options: a) Hash table space b) Physical memory location c) Secondary memory location d) Process address space

Correct option: c) Secondary memory location

MCQ 2: In Banker's algorithm, we can say that a system is in a ______ if all of the processes in the system can be executed to termination in some order. a) Reverse state b) Safe state c) Stop state d) Halt state

Correct option: b) Safe state

MCQ 3: The logical address generated by the CPU is divided into two parts: a page number (p) and a page offset (d) and is calculated by the following formula: p / d. a) p / d b) p + d c) p % d d) p * d

Correct option: a) p / d

MCQ 4: Suppose there are 32 number of frames so the number of bits needed for f is: Options: a) 2 b) 3 c) 4 d) 6

Correct option: None of the given options. (The correct answer would depend on the actual number of frames needed, not provided in the options)

MCQ 5: In the Banker algorithm, we need the following data structures: a) Available, Min, Allocation, and Find b) Available, Max, Allocation, and Need c) Available, Min, Allocation, and First d) Available, Max, Allocation, and Next

Correct option: b) Available, Max, Allocation, and Need

MCQ 6: Suppose there are 16 number of pages so the number of bits needed for p is: Options: a) 1 b) 2 c) 3 d) 4

Correct option: d) 4

MCQ 7: In the Banker algorithm, the Max data structure is used. If ________, then process Pi can request a maximum of k instances of resource type Rj. a) Max[j, i] = k b) Max[i, k] = j c) Max[i, j] = k d) Max[k, j] = i

Correct option: a) Max[j, i] = k

MCQ 8: In the Banker algorithm, the Need data structure is used. If ________, then process Pi may need k more instances of resource type Rj to complete the task.

All CS604P files →
CS604P Operating Systems (Practical) All CS604P handouts, past papers, quizzes and MCQs in one place. Open course page

Get more out of VUBuddy, for free

Android app Free on Google Play
  • Unlimited downloads
  • The explanation behind every MCQ answer
  • Study offline on slow data
Get the Android app
Chrome extension Free on the Chrome Web Store
  • 30 downloads a day instead of 3
  • Sign in and buy Pro Semester here
Add to Chrome

One Pro Semester membership works in both the extension and the app.