Fall 1999 final exam

Fall 1999 final exam - Fall 1999 Final Exam Name: 1. What...

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

View Full Document Right Arrow Icon

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

View Full DocumentRight Arrow Icon

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

View Full DocumentRight Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Fall 1999 Final Exam Name: 1. What are the differences between a thread and a process. (3 pts) 2. What is the difference between deadlock and starvation. (3 pts) 3. Describe the advantages of demand paging compared to process swap and segment swap. (3 pts) 4. What is the page-table register for and when it is updated? (3 pts) 5. What is the advantage of using multi-level page tables? (3 pts) 6. Why does the page-size have to be a power of two? (3 pts) 7. List the different page-bits in the page-table entry. (3 pts) 8. List the different types of page-faults. (3 pts) 9. List the steps to process a page-fault. (3 pts) 10. Explain how copy-on-write works when fork() is called. (3 pts) 11. Explain the advantages and disadvantages of first-fit and best-fit in memory allocation. (3 pts) 12. Why does the malloc library is necessary? (3 pts) 13. What is memory fragmentation? (3 pts) 14. What are the problems with explicit memory management and describe them. (3 pts) 15. What is the function of the "count" field in the i-node? (3 pts) 15....
View Full Document

Page1 / 8

Fall 1999 final exam - Fall 1999 Final Exam Name: 1. What...

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

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