Answer to Question #211762 in Programming & Computer Science for Jaguar

Question

QUESTION 1 

Which one of the following statements is NOT true about demand paging?

1. The program pages do not have to be in contiguous memory locations.

2. The complete program do not have to be in memory for execution.

3. Pages are loaded into memory as needed, and replaced by other pages as needed.

4. Consecutive pages from the same program must be loaded into the same frame.

QUESTION 2

A list contains the following elements: 

22 27 32 45 46 47 65 76 87 88 99 111 211

At the beginning, first = 1, mid = 7 and last = 13. What are the values of first, mid and last

respectively after two iterations of the binary search algorithm if the goal is 111?

1. 7 10 13

2. 11 12 13

3. 10 12 13

4. 10 11 13

Answer 1

Dear Jaguar, your question requires a lot of work, which neither of our experts is ready to perform for free. We advise you to convert it to a fully qualified order and we will try to help you. Please click the link below to proceed: Submit order