CPSC 457 Study Guide - Final Guide: Message Passing, Inode, Open Network Computing Remote Procedure Call

96 views11 pages
9 Jan 2019
Course
Professor

For unlimited access to Study Guides, a Grade+ subscription is required.

CPSC 457
OPERATING SYSTEMS
FINAL EXAM SOLUTION
Department of Computer Science
University of Calgary
Professor: Carey Williamson
December 10, 2008
This is a CLOSED BOOK exam. Textbooks, notes, laptops, calculators, personal digital
assistants, cell phones, and Internet access are NOT allowed.
It is a 120-minute exam, with a total of 100 marks. There are 18 questions, and 11 pages
(including this cover page). Please read each question carefully, and write your answers
legibly in the space provided. You may do the questions in any order you wish, but please
USE YOUR TIME WISELY.
When you are finished, please hand in your exam paper and sign out. Good luck!
Student Name:
Student ID:
Score: / 100 = %
1
Unlock document

This preview shows pages 1-3 of the document.
Unlock all 11 pages and 3 million more documents.

Already have an account? Log in
Multiple Choice
Choose the best answer for each of the following 12 questions, for a total of 12 marks.
1 1. Three file descriptors associated with every Linux process are:
(a) standard input, standard output, and standard pipe
(b) standard input, standard output, and standard error
(c) standard input, standard output, and standard deviation
(d) standard input, standard output, and standard terminal
(e) standard input, standard output, and standard transmission
1 2. User Mode Linux (UML) is an example of a virtual machine environment in which:
(a) Linux runs on top of Windows
(b) Linux runs on top of Linux
(c) Windows runs on top of Linux
(d) Windows runs on top of Windows
(e) none of the above
1 3. During the boot process, a computer obtains its initial bootstrapping information from:
(a) a special “boot block” on disk
(b) the superblock in the root file system
(c) a pre-configured file vmunix within the file system
(d) the /tmp file system
(e) none of the above
1 4. The copy-on-write mechanism provides:
(a) an efficient way to create new processes
(b) a clever way to share virtual memory pages (at least temporarily)
(c) a way to avoid unnecessary page copying
(d) all of the above
(e) none of the above
2
Unlock document

This preview shows pages 1-3 of the document.
Unlock all 11 pages and 3 million more documents.

Already have an account? Log in
1 5. In memory management, global page replacement is usually preferable to local page
replacement because:
(a) most processes are well-behaved
(b) most processes have small working sets
(c) most processes have large working sets
(d) most processes are highly synchronized
(e) the set of pages from which to choose is larger
1 6. Implementing LRU precisely in an OS is expensive, so practical implementations often
use an approximation called:
(a) MRU
(b) MFU
(c) LFU
(d) LFU with aging
(e) none of the above
1 7. For two processes accessing a shared variable, Peterson’s algorithm provides:
(a) mutual exclusion
(b) progress
(c) bounded waiting
(d) all of the above
(e) none of the above
1 8. Counting semaphores:
(a) generalize the notion of a binary semaphore
(b) are used for managing multiple instances of a resource
(c) have increment and decrement operations
(d) can use queueing to manage waiting processes
(e) all of the above
3
Unlock document

This preview shows pages 1-3 of the document.
Unlock all 11 pages and 3 million more documents.

Already have an account? Log in

Get access

Grade+
$10 USD/m
Billed $120 USD annually
Homework Help
Class Notes
Textbook Notes
40 Verified Answers
Study Guides
1 Booster Class