exam 2 - Summer 2011 KEY

exam 2 - Summer 2011 KEY - COP 4600 Exam #2 Summer 2011...

Info iconThis preview shows pages 1–3. Sign up to view the full content.

View Full Document Right Arrow Icon
This test is comprised of three different types of questions: multiple choice, true/false, and short answer. If you need more room for some answers (for problems 21-25) use the backs of pages – label all answers clearly if you do this!!! Multiple choice - circle the number which corresponds to the best answer or best completes each statement. True or False - circle the word TRUE if the statement is true and circle FALSE if the statement is false. Short answer – provide a short but complete answer to the question. Don’t write paragraphs. You simply need to convince me that you know what’s going on with the concept on which the question is based. Problems 1-20 are worth 3 points each. For problems 21-25 points are shown with the problem. 1. Consider a fixed partitioning scheme with equal sized partitions of 2 16 bytes and a total main memory size of 2 24 bytes. A process table is maintained that includes a pointer to a partition for each resident process. How many bits are required for the pointer? (a) 4 (b) 8 (c) 16 (d) none of the above are correct 2. Assume a main memory of 1024 KB is partitioned into 32 fixed-size partitions each 32 KB in size. Suppose that every process that will run on this system is between 1 KB and 20 KB in size. What is the minimum and maximum size of an internal fragmentation that could occur in any partition on this system? (a) minimum = 12 KB, maximum = 1 KB. (b) minimum = 1 KB, maximum = 12 KB. (c) minimum = 12 KB, maximum = 31 KB. (d) minimum = 20 KB, maximum = 31 KB. (e) None of the above are correct. 1 COP 4600 – Exam #2 – Summer 2011 Thursday July 21, 2011 100 points total Name: (Please print clearly) KEY 2 24 /2 16 = 2 8 partitions, so a total of 8 bits will be needed to identify a given partition. The largest process of 20KB would leave an internal fragment of 12KB while the smallest process of 1KB would leave an internal fragment 31KB in size.
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
3. Address binding can be done at: (a) program development time (when you write the source code). (b) compile/assembly time. (c) load time. (d) execution time. (e) only b, c, and d 4. A relocation register allows the system loader to place relocatable programs at any location in the memory it so desires. The MMU (Memory Management Unit) then resets the relocation register value after loading the program. TRUE FALSE 5. The backing store is (a) a high-speed disk used to back-up (copy) the contents of the main memory for safe-keeping. (b) a high-speed disk used to temporarily hold memory images of processes in execution that have been context-switched out to make room for other processes in main memory. (c) the high-speed disk that is used to hold all overlay routines and transient OS code. (d) a chiropractor’s dream.
Background image of page 2
Image of page 3
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 10/03/2011 for the course COP 4600 taught by Professor Montagne during the Summer '08 term at University of Central Florida.

Page1 / 9

exam 2 - Summer 2011 KEY - COP 4600 Exam #2 Summer 2011...

This preview shows document pages 1 - 3. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online