DOC PREVIEW
Winthrop CSCI 411 - Final Exam Review

This preview shows page 1 out of 2 pages.

Save
View full document
View full document
Premium Document
Do you want full access? Go Premium and unlock all 2 pages.
Access to all documents
Download any document
Ad free experience
Premium Document
Do you want full access? Go Premium and unlock all 2 pages.
Access to all documents
Download any document
Ad free experience

Unformatted text preview:

CSCI 411 Final Exam Review Spring 2009 Much of the following is review, and the final exam will be about 1/4 to 1/3 review and 2/3 to 3/4 covering the material since Test 2. This is a hopefully exhaustive llist of topics and of course the exam cannot cover it all, but you should be prepared for any of it. 1. DEFine: Process, Interrupt, Context, Context Switch, IPC, IPC mechanism, Critical Section, Race Condition, Mutex, Semaphore, Pipe, Thread, Deadlock, Safe State, Memory Management, Paging, Segmentation, Virtual Memory 2. Explain the distinctions between the concepts of process and program. 3. a. Explain the main reason(s) for the OS supporting these concepts: a. processes; b. interrupts. 4. Explain the main costs of each: a. Processes; b. Interrupts 5. Explain these two methods of creating a process: a. the Unix/Linux fork() b. the Windows CreateProcess function 6. a. Diagram the seven-state process model. b. Explain when the specified state transitions occur (such as Running --> Ready, and so on). 7. List the sequence of steps in the processing of an interrupt. 8. a. Explain or define: (processor) scheduling algorithm. b. Describe two scheduling algorithms that are appropriate for current computer systems. 9. List the conditions required of a critical section. 10. Describe the semaphore (software) IPC mechanism, including description of (a) the two components, (b) the two fundamental operations and (c) the two states. 19. Explain each of the cases for the effects on a semaphore s when process executes each of the two basic operations on s (two cases for Wait and two cases for Signal). 12. Explain the interpretation of the initialization of and the values of the semaphore's counter. 13. List the steps (pseudo instructions) in the program logic of a process for implementing ME of a critical section using a semaphore s. 14. State the requirements for mechanisms that are to be used to control critical sections. 15. a. Explain the relationship between a thread and a process, that is, the similarities and differences of the process and its threads.. b. Explain the importance of the having threads - the advantage(s). 16. a. List the four conditions that must hold for a deadlock to occur, the first three which are necessary conditions (each must exist for deadlock to occur, but deadlock does not have to occur), and the fourth a sufficient condition (guarantees deadlock). b. Explain each of these approaches to dealing with deadlocks and how each can be implemented: 1. prevention 2. avoidance 3. detection 17. Explain what signals are and list the various Linux system calls that are used by processes to communicate using signals. List some of the particular signals. 18. Write two programs that use two signals to control something. I'll try to keep it simple. 19. a. Explain why memory management is a requirement in an operating system. b. List and describe (briefly) five requirements of a memory management subsystem. 20. Describe the fixed partitioning method(s) of memory management, and their advantage(s) and disadvantage(s). 1. Equal size partitions. 2. Unequal size partitions. 21. a. Describe the variable partitioning method, and state the advantages and disadvantages. b. Describe these two partition selection methods: First Fit; Best Fit.22. Explain the Buddy system for partitioning memory. 23. Describe the paging method of managing memory. 24. Describe the segmentation method of handling memory. 25. a. Explain the Linux three-level page table memory management method. b. Explain the Linux page allocation method. 26. Describe reasons for having a virtual memory system. 27. Explain how virtual memory works using paging. 28. Define Locality of Reference. Define these two types: Spatial locality; Temporal Locailty. 29. Describe the working set concept of managing a process's pages in memory. 30. Discuss these issues with virtual memory systems: a. page size 31. Describe these LRU page replacement policies, and how each must be implemented regarding the additional data that must be maintained and used. a. Counter method b. nxn matrix method c. Not Recently Used method d. Aging


View Full Document

Winthrop CSCI 411 - Final Exam Review

Documents in this Course
Load more
Download Final Exam Review
Our administrator received your request to download this document. We will send you the file to your email shortly.
Loading Unlocking...
Login

Join to view Final Exam Review and access 3M+ class-specific study document.

or
We will never post anything without your permission.
Don't have an account?
Sign Up

Join to view Final Exam Review 2 2 and access 3M+ class-specific study document.

or

By creating an account you agree to our Privacy Policy and Terms Of Use

Already a member?