The data structure suitable for scheduling processes is

M

Mr. Dubey

🎓 Coach ⭐ 103.11K Points

📊 Computer Architecture

Q. The data structure suitable for scheduling processes is

(A) list
(B) heap
(C) queue
(D) stack

💬 Discuss

✅ Correct Answer: (C) queue

Explanation: the queue data structure is generally used for scheduling as it is two directional.

Explanation by: Mr. Dubey

the queue data structure is generally used for scheduling as it is two directional.

💬 Discussion

📊 Question Analytics

👁️

194

Total Visits

📽️

3 y ago

Published

🎖️

Mr. Dubey

Publisher

📈

88%

Success Rate