Recent questions without a selected answer / GATE Overflow for GATE CSE

0 votes

0 answers

12841

Galvin Edition 9 Exercise 6 Question 11 (Page No. 307)
Discuss how the following pairs of scheduling criteria conflict in certain settings. a. $CPU$ utilization and response time b. Average turnaround time and maximum waiting time c. $I/O$ device utilization and $CPU$ utilization

Discuss how the following pairs of scheduling criteria conflict in certain settings.a. $CPU$ utilization and response timeb. Average turnaround time and maximum waiting t...

akash.dinkar12

251 views

akash.dinkar12 asked Mar 20, 2019

0 votes

0 answers

12842

Galvin Edition 9 Exercise 6 Question 10 (Page No. 307)
Why is it important for the scheduler to distinguish $I/O-bound$ programs from $CPU-bound$ programs?

Why is it important for the scheduler to distinguish $I/O-bound$ programs from $CPU-bound$ programs?

akash.dinkar12

296 views

akash.dinkar12 asked Mar 20, 2019

0 votes

0 answers

12843

Galvin Edition 9 Exercise 6 Question 9 (Page No. 307)
The traditional $UNIX$ scheduler enforces an inverse relationship between priority numbers and priorities: the higher the number, the lower the priority. The scheduler recalculates process priorities once per second using the following ... does the traditional UNIX scheduler raise or lower the relative priority of a $CPU-bound$ process?

The traditional $UNIX$ scheduler enforces an inverse relationship between priority numbers and priorities: the higher the number, the lower the priority. The scheduler re...

akash.dinkar12

472 views

akash.dinkar12 asked Mar 20, 2019

0 votes

0 answers

12844

Galvin Edition 9 Exercise 6 Question 8 (Page No. 307)
Assume that an operating system maps user-level threads to the kernel using the many-to-many model and that the mapping is done through the use of $LWP$(Light Weight Processes). Furthermore, the system allows program developers to create real-time threads. Is it necessary to bind a real-time thread to an LWP?

Assume that an operating system maps user-level threads to the kernel using the many-to-many model and that the mapping is done through the use of $LWP$(Light Weight Proc...

akash.dinkar12

137 views

akash.dinkar12 asked Mar 20, 2019

0 votes

0 answers

12845

Galvin Edition 9 Exercise 6 Question 7 (Page No. 307)
Distinguish between $PCS$(Process Contention Scope) and $SCS$(Source Contention Scope) scheduling.

Distinguish between $PCS$(Process Contention Scope) and $SCS$(Source Contention Scope) scheduling.

akash.dinkar12

160 views

akash.dinkar12 asked Mar 20, 2019

0 votes

0 answers

12846

Galvin Edition 9 Exercise 6 Question 6 (Page No. 306-307)
Suppose that a scheduling algorithm (at the level of short-term $CPU$ scheduling) favors those processes that have used the least processor time in the recent past. Why will this algorithm favor $I/O-bound$ programs and yet not permanently starve $CPU-bound$ programs ?

Suppose that a scheduling algorithm (at the level of short-term $CPU$ scheduling) favors those processes that have used the least processor time in the recent past. Why w...

akash.dinkar12

305 views

akash.dinkar12 asked Mar 20, 2019

1 votes

0 answers

12847

Galvin Edition 9 Exercise 6 Question 5 (Page No. 306)
Many CPU-scheduling algorithms are parametrized. For example, the $RR$ algorithm requires a parameter to indicate the time slice. Multilevel feedback queues require parameters to define the number of queues, the scheduling algorithm for each queue, the ... . $Multilevel feedback queues$ and $FCFS$ c. $Priority$ and $FCFS$ d. $RR$ and $SJF$

Many CPU-scheduling algorithms are parametrized. For example, the $RR$ algorithm requires a parameter to indicate the time slice. Multilevel feedback queues require param...

akash.dinkar12

453 views

akash.dinkar12 asked Mar 20, 2019

0 votes

0 answers

12848

Galvin Edition 9 Exercise 6 Question 4 (Page No. 306)
What advantage is there in having different time-quantum sizes at different levels of a multilevel queueing system ?

What advantage is there in having different time-quantum sizes at different levels of a multilevel queueing system ?

akash.dinkar12

276 views

akash.dinkar12 asked Mar 20, 2019

0 votes

0 answers

12849

Galvin Edition 9 Exercise 6 Question 3 (Page No. 306)
Suppose that the following processes arrive for execution at the times indicated. Each process will run for the amount of time listed. In answering the questions, use non preemptive scheduling, and base all decisions on the ... during this idle time, so their waiting time may increase. This algorithm could be called future-knowledge scheduling.

Suppose that the following processes arrive for execution at the times indicated. Each process will run for the amount of time listed. In answering the questions, use non...

akash.dinkar12

423 views

akash.dinkar12 asked Mar 20, 2019

0 votes

1 answer

12850

Galvin Edition 9 Exercise 6 Question 2 (Page No. 306)
Explain the difference between preemptive and nonpreemptive scheduling.

Explain the difference between preemptive and nonpreemptive scheduling.

akash.dinkar12

296 views

akash.dinkar12 asked Mar 20, 2019

0 votes

1 answer

12851

Galvin Edition 9 Exercise 6 Question 1 (Page No. 305)
A CPU-scheduling algorithm determines an order for the execution of its scheduled processes. Given $n$ processes to be scheduled on one processor, how many different schedules are possible? Give a formula in terms of $n$.

A CPU-scheduling algorithm determines an order for the execution of its scheduled processes. Given $n$ processes to be scheduled on one processor, how many different sche...

akash.dinkar12

462 views

akash.dinkar12 asked Mar 20, 2019

0 votes

0 answers

12852

Galvin Edition 9 Exercise 5 Question 35 (Page No. 248)
Design an algorithm for a monitor that implements an alarm clock that enables a calling program to delay itself for a specified number of time units (ticks). You may assume the existence of a real hardware clock that invokes a function $tick()$ in your monitor at regular intervals.

Design an algorithm for a monitor that implements an alarm clock that enables a calling program to delay itself for a specified number of time units (ticks). You may assu...

akash.dinkar12

535 views

akash.dinkar12 asked Mar 20, 2019

0 votes

0 answers

12853

Galvin Edition 9 Exercise 5 Question 34 (Page No. 248)
Suppose we replace the $wait($) and $signal()$ operations of monitors with a single construct a $wait(B)$, where B is a general Boolean expression that causes the process executing it to wait until B becomes true. ... implemented efficiently. c. What restrictions need to be put on the await statement so that it can be implemented efficiently ?

Suppose we replace the $wait($) and $signal()$ operations of monitors with a single construct a $wait(B)$, where B is a general Boolean expression that causes the process...

akash.dinkar12

313 views

akash.dinkar12 asked Mar 20, 2019

0 votes

0 answers

12854

Galvin Edition 9 Exercise 5 Question 33 (Page No. 248)
When a signal is performed on a condition inside a monitor, the signaling process can either continue its execution or transfer control to the process that is signaled. How would the solution to the preceding exercise differ with these two different ways in which signaling can be performed?

When a signal is performed on a condition inside a monitor, the signaling process can either continue its execution or transfer control to the process that is signaled. H...

akash.dinkar12

468 views

akash.dinkar12 asked Mar 20, 2019

0 votes

0 answers

12855

Galvin Edition 9 Exercise 5 Question 32 (Page No. 248)
A file is to be shared among different processes, each of which has a unique number. The file can be accessed simultaneously by several processes, subject to the following constraint: the sum of all unique numbers associated with ... processes currently accessing the file must be less than $n$.Write a monitor to coordinate access to the file.

A file is to be shared among different processes, each of which has a unique number. The file can be accessed simultaneously by several processes, subject to the followin...

akash.dinkar12

991 views

akash.dinkar12 asked Mar 20, 2019

0 votes

0 answers

12856

Galvin Edition 9 Exercise 5 Question 31 (Page No. 248)
Consider a system consisting of processes $P_1, P_2, ..., P_n$, each of which has a unique priority number. Write a monitor that allocates three identical printers to these processes, using the priority numbers for deciding the order of allocation.

Consider a system consisting of processes $P_1, P_2, ..., P_n$, each of which has a unique priority number. Write a monitor that allocates three identical printers to the...

akash.dinkar12

413 views

akash.dinkar12 asked Mar 20, 2019

0 votes

0 answers

12857

Galvin Edition 9 Exercise 5 Question 29 (Page No. 248)
How does the $signal()$ operation associated with monitors differ from the corresponding operation defined for semaphores?

How does the $signal()$ operation associated with monitors differ from the corresponding operation defined for semaphores?

akash.dinkar12

186 views

akash.dinkar12 asked Mar 20, 2019

0 votes

0 answers

12858

Galvin Edition 9 Exercise 5 Question 28 (Page No. 247)
Discuss the tradeoff between fairness and throughput of operations in the readers–writers problem. Propose a method for solving the readers–writers problem without causing starvation.

Discuss the tradeoff between fairness and throughput of operations in the readers–writers problem. Propose a method for solving the readers–writers problem without ca...

akash.dinkar12

319 views

akash.dinkar12 asked Mar 20, 2019

0 votes

0 answers

12859

Galvin Edition 9 Exercise 5 Question 26 (Page No. 247)
Design an algorithm for a bounded-buffer monitor in which the buffers (portions) are embedded within the monitor itself.

Design an algorithm for a bounded-buffer monitor in which the buffers (portions) are embedded within the monitor itself.

akash.dinkar12

241 views

akash.dinkar12 asked Mar 20, 2019

0 votes

1 answer

12860

Peter Linz Edition 4 Exercise 2.1 Question 20 (Page No. 48)
Let $L$ be the language accepted by the automaton in the following figure. Find a DFA that accepts $L^2$.

Let $L$ be the language accepted by the automaton in the following figure. Find a DFA that accepts $L^2$.

Naveen Kumar 3

483 views

Naveen Kumar 3 asked Mar 20, 2019

0 votes

1 answer

12861

Kenneth Rosen Edition 7 Exercise 1.7 Question 7 (Page No. 91)
Use a direct proof to show that every odd integer is the difference of two squares.

Use a direct proof to show that every odd integer is the difference of two squares.

Pooja Khatri

885 views

Pooja Khatri asked Mar 20, 2019

0 votes

0 answers

12862

Kenneth Rosen Edition 7 Exercise 1.7 Question 6 (Page No. 91)
Use a direct proof to show that the product of two odd numbers is odd.

Use a direct proof to show that the product of two odd numbers is odd.

Pooja Khatri

210 views

Pooja Khatri asked Mar 20, 2019

1 votes

1 answer

12863

Kenneth Rosen Edition 7 Exercise 1.7 Question 5 (Page No. 91)
Prove that if $m+n$ and $n+p$ are even integers, where $m, n$,and $p$ are integers, then $m+p$ is even. What kind of proof did you use?

Prove that if $m+n$ and $n+p$ are even integers, where $m, n$,and $p$ are integers, then $m+p$ is even. What kind of proof did you use?

Pooja Khatri

231 views

Pooja Khatri asked Mar 20, 2019

0 votes

0 answers

12864

Kenneth Rosen Edition 7 Exercise 1.7 Question 4 (Page No. 91)
Show that the additive inverse, or negative, of an even number is an even number using a direct proof.

Show that the additive inverse, or negative, of an even number is an even number using a direct proof.

Pooja Khatri

288 views

Pooja Khatri asked Mar 20, 2019

1 votes

1 answer

12865

Peter Linz Edition 4 Exercise 2.1 Question 19 (Page No. 48)
Show that $δ^*(q,wv)=δ^*(δ^*(q,w),v)$ for all $w,v ∈ Σ^*$ . (symbols have standard meaning)

Show that $δ^*(q,wv)=δ^*(δ^*(q,w),v)$for all $w,v ∈ Σ^*$ .(symbols have standard meaning)

Naveen Kumar 3

389 views

Naveen Kumar 3 asked Mar 20, 2019

0 votes

1 answer

12866

Kenneth Rosen Edition 7 Exercise 1.7 Question 3 (Page No. 91)
Show that the square of an even number is an even number using a direct proof

Show that the square of an even number is an even number using a direct proof

Pooja Khatri

264 views

Pooja Khatri asked Mar 20, 2019

0 votes

0 answers

12867

Kenneth Rosen Edition 7 Exercise 1.7 Question 2 (Page No. 91)
Use a direct proof to show that the sum of two even integers is even.

Use a direct proof to show that the sum of two even integers is even.

Pooja Khatri

191 views

Pooja Khatri asked Mar 20, 2019

1 votes

1 answer

12868

Kenneth Rosen Edition 7 Exercise 1.7 Question 1 (Page No. 91)
Use a direct proof to show that the sum of two odd integers is even.

Use a direct proof to show that the sum of two odd integers is even.

Pooja Khatri

361 views

Pooja Khatri asked Mar 20, 2019

1 votes

1 answer

12869

Peter Linz Edition 4 Exercise 2.1 Question 18 (Page No. 48)
Show that if $L$ is regular, so is $L$ $∪$ {$a$}, for all $a∈Σ$.

Show that if $L$ is regular, so is $L$ $∪$ {$a$}, for all $a∈Σ$.

Naveen Kumar 3

416 views

Naveen Kumar 3 asked Mar 20, 2019

0 votes

1 answer

12870

Kenneth Rosen Edition 7 Exercise 1.6 Question 35 (Page No. 80)
Determine whether this argument, taken from Kalish and Montague [KaMo64], is valid. If Superman were able and willing to prevent evil,he would do so. If Superman were unable to prevent evil, he would be impotent; if ... does not prevent evil. If Superman exists, he is neither impotent nor malevolent. Therefore, Superman does not exist.

Determine whether this argument, taken from Kalish and Montague [KaMo64], is valid.If Superman were able and willing to prevent evil,he would do so. If Superman were unab...

Pooja Khatri

1.1k views

Pooja Khatri asked Mar 20, 2019

tags	tag:apple
author	user:martin
title	title:apple
content	content:apple
exclude	-tag:apple
force match	+apple
views	views:100
score	score:10
answers	answers:2
is accepted	isaccepted:true
is closed	isclosed:true