A single CPU is scheduled to run three processes with differing deadlines. Which scheduling strategy ensures that the CPU maximizes the number of processes completed by their deadlines?

💡 Explanation

Earliest Deadline First (EDF) minimizes lateness and maximizes the number of tasks completed by their deadline, because it prioritizes processes closest to their deadlines. Therefore, EDF is the best option, rather than FCFS, SJF, or LJF, which do not consider deadlines directly.

• If a digital circuit design system falsely validates an AND gate as equivalent to an OR gate, which logical property has been violated?
• A cryptographic system relies on prime numbers exceeding 2^512. If a computationally weak random number generator occasionally produces composite numbers, which consequence follows?
• A network of interconnected computers is designed such that every computer is connected to at least 'd' others. Which outcome regarding communication resilience occurs as 'd' increases?
• A university club with 12 members needs to form a committee of 4. Which mechanism calculates the total number of possible unique committees?
• A Monte Carlo simulation estimates financial risk; if it has a small probability of a very large loss, which effect dominates the decision-making, considering the algorithm's expected value?
• If a rule-based expert system attempts to prove a statement but its inference engine finds no applicable rule, which outcome will inevitably follow?