SIT222 2010-2 Exam

Refers to the fact that a process

Info iconThis preview shows page 1. Sign up to view the full content.

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

Unformatted text preview: Operating Systems [ 16 + 8 + 16 = 40 marks ] a. Briefly describe four types of operating systems b. Briefly describe an operating system in terms of (i) making computer systems easier to use, and (ii) managing the resources of the computer. c. Identify and describe four possible structures of an operating system kernel. Question 3. Processes [ 6 + 16 + 18 = 40 marks ] a. Discuss the difference/s between processes and threads. b. Identify and describe four of the resources that constitute a process. c. Draw three figures to illustrate the operation of the First Come First Served, Shortest Job First, and Round Robin (timeslice = 2) for the following processes: Process Arrival Duration P1 0 4 P2 2 1 P3 4 5 For Round Robin, if a process arrives on a context switch, assume that new process arrives after the current process has been placed back in the ready queue (where relevant). Question 4. Memory [ 9 + 7 + 24 = 40 marks ] a. Identify and briefly describe three strategies for allocating variable length free memory regions. b. Describe, compare, and contrast paging and segmentation. c. For the following sequence of page references: 1, 2, 3, 4, 3, 4, 2, 1, 4, 5, 3, 6, 5, 7, 5, 3, 4, 1, 6, 7 Demonstrate the operation of the optimal, FIFO, and LRU algorithms. Assume a memory size of 3 page frames. DEAKIN UNIVERSITY Page: 3/3 Unit: SIT222 Operating Systems Date: Trimester 2, 2010 Question 5. Deadlock [ 8 + 6 + 26 = 40 marks ] a. Identify and briefly describe the four conditions required for deadlock. b. Briefly describe the deadlock detection and recovery, deadlock avoidance, and deadlock prevention approaches to managing deadlock. c. Consider the following information about resource usage: Allocation Max Available A B C A B C A B C P0 2 4 2 3 5 6 1 1 3 P1 2 1 1 3 2 2 P2 3 0 2 7 5 3 P3 2 1 1 3 5 1 P4 0 0 2 4 3 2 Using the Banker’s Algorithm i. Demonstrate that the system is in a safe state, showing working. ii. Demonstrate the outcome, showing working, of servicing a request from P0 for three more ‘C’ resources. Question 6. Files and Disks [ 8 + 6 + 8 + 6 + 12 = 40 marks ] a. List and briefly describe four system calls that can be provided for working with files. b. List six attributes or metadata that can be maintained for files. c. Describe, compare, and contrast the linked list and FAT approaches to implementing a file system. d. Describe the concept and operation of a journaling file system. e. Identify and describe three disk scheduling algorithms. [ Section B Total: 120 marks ] [ Grand Total: 180 marks ]...
View Full Document

This document was uploaded on 09/26/2013.

Ask a homework question - tutors are online