Three CPU-bound tasks, with execution times of 15, 12 and 5 time units respectively arrive at times 0, t and 8, respectively. If the operating system implements a shortest remaining time first scheduling algorithm, what should be the value of t to have 4 context switches? Ignore the context switches at time 0 and at the end.

An operating system uses the Banker’s algorithm for deadlock avoidance when managing the allocation of three resource types X, Y, and Z to three processes P0, P1, and P2. The table given below presents the current system state. Here, the Allocation matrix shows the current number of resources of each type allocated to each process and the Max matrix shows the maximum number of resources of each type required by each process during its execution. Allocation Max X Y Z X Y Z P0 0 0 1 8 4 3 P1 3 2 0 6 2 0 P2 2 1 1 3 3 3 There are 3 units of type X, 2 units of type Y and 2 units of type Z still available. The system is currently in a safe state. Consider the following independent requests for additional resources in the current state: REQ1: P0 requests 0 units of X, 0 units of Y and 2 units of Z REQ2: P1 requests 2 units of X, 0 units of Y and 0 units of Z Which one of the following is TRUE?

A

Only REQ1 can be permitted

B

Only REQ2 can be permitted.

C

Both REQ1 and REQ2 can be permitted

D

Neither REQ1 nor REQ2 can be permitted

Consider three CPU intensive processes, which require 10, 20, 30 units and arrive at times 0,2,6 respectively. How many context switches are needed if shortest remaining time first is implemented? Context switch at 0 is included but context switch at end is ignored

A

1

B

2

C

3

D

4

Consider four processes P, Q, R, and S scheduled on a CPU as per round-robin algorithm with a time quantum of 4 units. The processes arrive in the order P, Q, R, S, all at time t = 0. There is exactly one context switch from S to Q, exactly one context switch from R to Q, and exactly two context switches from Q to R. There is no context switch from S to P. Switching to a ready process after the termination of another process is also considered a context switch. Which one of the following is NOT possible as CPU burst time (in time units) of these processes?

A

P = 4, Q = 10, R = 6, S = 2

B

P = 2, Q = 9, R = 5, S = 1

C

P = 4, Q = 12, R = 5, S = 4

D

P = 3, Q = 7, R = 7, S = 3

An operating system uses shortest remaining time (SRT) scheduling algorithm. Consider the arrival times and execution time for the following processes: Proces Arrival Time Execution Time P1 0 20 P2 15 25 P3 30 10 P4 45 15 What is total waiting time for process P2?

A

5

B

15

C

40

D

55

Raw material purchased:
1^st January, 600 units @ Rs. 12 per unit
12^th January, 500 units @ Rs. 14 per unit
21^st January, 300 units @ Rs. 13 per unit
Raw material issued for manufacture:
3^rd January 300 units
5^th January 124 units
15^th January 250 units
16^th January 300 units
Raw material returned to stores from manufacturing department on 14^th January, 50 units. The material is issued on First-in-First out method.
The value of material remaining in store on 21^st January will be:

A

5,775

B

6,100

C

6,350

D

6,600

The rate of electricity in the rural area is given below: i) up to 25 units - Rs 5 per unit ii) up to 75 units - Rs 7 per units iii) up to 100 units - Rs 9 per units iv) After 100 units - Rs 13 per units Additional charge after 100 units = Rs. 50 The consumption of the electricity of the household is 120 units. How much electricity bill he has to pay?

A

Rs. 1560

B

Rs. 1610

C

Rs. 1680

D

Rs. 1540

To configure the VLAN trunking protocol to communicate VLAN information between two switches, what two requirements must be met?
1. Each end of the trunk link must be set to the IEEE 802.1e encapsulation.
2. The VTP management domain name of both switches must be set the same.
3. All ports on both the switches must be set as access ports.
4. One of the two switches must be configured as a VTP server.
5. A rollover cable is required to connect the two switches together.
6. A router must be used to forward VTP traffic between VLANs.

A

1, 2 and 4

B

3, 5 and 6

C

2 and 4

D

1 and 6

Simplify the value of $$\frac{{{\text{0}}{\text{.9}} \times {\text{0}}{\text{.9}} \times {\text{0}}{\text{.9 + 0}}{\text{.2}} \times {\text{0}}{\text{.2}} \times {\text{0}}{\text{.2 + 0}}{\text{.3}} \times {\text{0}}{\text{.3}} \times {\text{0}}{\text{.3}} - {\text{3}} \times 0.9 \times {\text{0}}{\text{.2}} \times {\text{0}}{\text{.3}}}}{{{\text{0}}{\text{.9}} \times {\text{0}}{\text{.9 + 0}}{\text{.2}} \times {\text{0}}{\text{.2 + 0}}{\text{.3}} \times {\text{0}}{\text{.3}} - 0.9 \times {\text{0}}{\text{.2}} - {\text{0}}{\text{.2}} \times {\text{0}}{\text{.3}} - 0.3 \times 0.9}} = ?$$

A

1.4

B

0.054

C

0.8

D

1.0

One of the Scheduling method is also known as Shortest-next-CPU-burst algorithm, because scheduling through this method depends on the length of the next CPU burst of a process rather than its total length. Which of the following scheduling method is being discussed here?

A

SJF Scheduling

B

FCFS Scheduling

C

Round Robin Scheduling

D

Multilevel-queue Scheduling

interface Base{ boolean m1 (); byte m2(short s);}

which two code fragments will compile?

1. interface Base2 implements Base {}2. abstract class Class2 extends Base { public boolean m1(){ return true; }}3. abstract class Class2 implements Base {}4. abstract class Class2 implements Base { public boolean m1(){ return (7 > 4); }}5. abstract class Class2 implements Base { protected boolean m1(){ return (5 > 7) }}

A

1 and 2

B

2 and 3

C

3 and 4

D

1 and 3

E

4 and 5

Process	Arrival Time	Burst Time
P₀	0	15
P₁	t	12
P₂	8	5

Related Questions