0% found this document useful (0 votes)
24 views

Sample Final

This document contains sample final exam questions for a systems programming course. It lists 7 multiple choice or short answer questions covering topics like thread programming issues, deadlock conditions, virtual memory algorithms, resource allocation states, and how zombie processes are created. It also notes that additional sample questions will be posted by the instructor Ken. The questions are meant to help students prepare for the format and topics that may appear on the final exam.

Uploaded by

shristi_k
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
24 views

Sample Final

This document contains sample final exam questions for a systems programming course. It lists 7 multiple choice or short answer questions covering topics like thread programming issues, deadlock conditions, virtual memory algorithms, resource allocation states, and how zombie processes are created. It also notes that additional sample questions will be posted by the instructor Ken. The questions are meant to help students prepare for the format and topics that may appear on the final exam.

Uploaded by

shristi_k
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

NAME:_______________________________

CSPP-51081 SYSTEMS PROGRAMMING SAMPLE FINAL QUESTIONS

Summer, 2004

1) What problems does the use of errno present in thread programming? How is this handled by
Posix threads?

3) What are the four conditions for deadlock we discussed in class?

4) Identify two reasons multi-media systems can be treated differently with regard to scheduling
than general real-time systems.

5) What is the ideal virtual memory page replacement algorithm?

6) Review safe and unsafe resource allocation states and the bankers algorithm. Is the following
a safe or unsafe resource allocation state?
In use Maximum required Available
Process 1 102 112 010
Process 2 111 122

7) How is a zombie process created? Be exact.

Ken will also be posting some sample questions as well

sample-final.doc

You might also like