In which scheduling policies, context switching never takes place

Answer: Option A

1. Which among following scheduling algorithms give minimum average waiting time

Answer: Option B

2. Which one is true

Answer: Option C

3. Dijkstra's algorithm deals with

Answer: Option C

4. The part of machine level instruction, which tells the central processor what has to be done, is

Answer: Option A

5. A public key encryption system

Answer: Option B

In which scheduling policies, context switching never takes place

1. Which among following scheduling algorithms give minimum average waiting time

2. Which one is true

3. Dijkstra's algorithm deals with

4. The part of machine level instruction, which tells the central processor what has to be done, is

5. A public key encryption system

In which scheduling policies, context switching never takes place

1. Which among following scheduling algorithms give minimum average waiting time

2. Which one is true

3. Dijkstra's algorithm deals with

4. The part of machine level instruction, which tells the central processor what has to be done, is

5. A public key encryption system

Current Affairs

Govt Jobs