Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

i need the answer just please Question 26 A preemptive version of shortest job first is Not yet answered Marked out of 1.00 O a.

i need the answer just please

image text in transcribedimage text in transcribedimage text in transcribedimage text in transcribedimage text in transcribed

Question 26 A preemptive version of shortest job first is Not yet answered Marked out of 1.00 O a. round-robin scheduling O b. shortest remaining time first Flag question O c. first-come first served d. three-level scheduling O e. none of these. Question 27 In CPU-bound processes Not yet answered Marked out of 1.00 O a. A good process mix is achieved Flag question O b. Synchronization cannot be performed correctly O c. The wait times may be too big O d. More time spent in computation than I/O O e. More time spent in I/O than computation Question 28 Which one of the following statements is correct about command line interpreters? Not yet answered Marked out of 1.00 O a. Some commands are implemented within the command line interpretter and others are implemented as external files. Flag question Ob. All commands must be implemented within the command line iterpreter itself. O c. Some commands are implemented within the command line interpreter but cannot be called from the command line. O d. All commands can be called from the command line but none of them is implemented within the command line interpreter. Question 29 Not yet answered What data structure contains information about a process' state, its program counter, stack pointer, and other information? Marked out of 1.00 O a. the scheduler Flag question O b. the interrupt vector O c. process control block O d. the thread e. none of these Question 30 Not yet How many instructions can a processor execute at a time? answered Marked out of 1.00 O a. Depends on the operating system Flag question O b. Two O c. One O d. Equal to the number of processes in the ready queue O e. Equal to the number of concurrent processes in memory

Step by Step Solution

There are 3 Steps involved in it

Step: 1

blur-text-image

Get Instant Access to Expert-Tailored Solutions

See step-by-step solutions with expert insights and AI powered tools for academic success

Step: 2

blur-text-image

Step: 3

blur-text-image

Ace Your Homework with AI

Get the answers you need in no time with our AI-driven, step-by-step assistance

Get Started

Recommended Textbook for

Database Design Application And Administration

Authors: Michael Mannino, Michael V. Mannino

2nd Edition

0072880678, 9780072880670

Students also viewed these Databases questions