1. Which of the following scheduling policies will provide the least turnaround time for a CPU bound process? (Both I/O-bound and CPU bound requests are present in the system.) a. RR, b. LCN, c. multilevel adaptive scheduling

2. Find the simplest sum-of-products form for the function f using the dont-care condition d, where f = x1(x2x3 + x2x3 + x2x3x4) + x2x4(x3 + x1) and d = x1x2(x3x4 + x3x4) + x1x3x4

SUBJECT: operating systems and computer architecture