INTERNATIONAL ISLAMIC UNIVERSITY MALAYSIA

END-OF-SEMESTER EXAMINATION SEMESTER I, 2007/2008 SESSION

KULLIYYAH OF INFORMATION AND COMMUNICATION TECHNOLOGY
Programme Time Duration Course Code Course Title : : : : : BIT/BCS 9.00 p.m. 11.45 p.m. 2 Hr(s) 45 Min(s) CSC 3401 OPERATING SYSTEM Section(s) : All Level of Study Date : Undergraduate : 13th Nov 2007

This Question Paper Consists of 10 printed pages including cover page with 3 PARTS of questions and the total marks is 100 No calculators are allowed

INSTRUCTION(S) TO CANDIDATES
DO NOT OPEN UNTIL YOU ARE ASKED TO DO SO
PART A: MULTIPLE CHOICE QUESTIONS (20 QUESTIONS) PART B: TRUE/FALSE QUESTIONS (20 QUESTIONS) PART C: SHORT ESSAYS QUESTIONS (4 QUESTIONS) Answer ALL questions in the Answer Booklet.

Any form of cheating or attempt to cheat is a serious offence which may lead to dismissal.

APPROVED BY

Section 1: Multiple Choice Questions

(20 marks)

Instruction: This section contain 20 multiple choice questions. Select the BEST answer for each questions and answer in the provided answer sheet. 1. A _____________ resource is one that can be created and destroyed. A. consumable B. reusable C. definable D. noticeable 2. A semaphore consists of the following elements EXCEPT:A. Current value of the semaphore B. Process ID of the last process to operate. C. Number of signal that informs a process. D. Number of process waiting for the semaphores value to be zero. 3. One of the disadvantages of User-Level Threads (ULTs) compared to Kernel-Level Threads (KLTs) is: A. B. C. D. 4. Characteristic: Main memory is divided into a number of equal- size frames. Strength : No external fragmentation Weaknesses : A small amount of internal fragmentation. The statements above refer to a memory management technique known as ____________. A. Fixed Partitioning B. Dynamic Partitioning C. Simple Paging D. Virtual Memory Paging 5. Which of the following is NOT a placement algorithm in the memory management? A. Best-Fit B. First-Fit C. Last-Fit D. Next-Fit Scheduling is application specific When a ULT executes a system call, all threads in the process are blocked Thread switching does not require kernel mode privileges All of the above

6. A ____________ or absolute address is an actual location in main memory. A. Logical Address B. Relative Address C. Basic Address D. Physical Address 7. The chunks of a process, known as _________________________. A. Page B. Frame C. Segment D. Address 8. Each entry in the page table includes the following EXCEPT:i) Page Number ii) Process Identifier iii) Control Bits iv) Chain Pointer A. i and ii B. ii and iii C. iii only D. All of the above 9. Which of the following DOES NOT describes the Fixed Allocation Policy? A. Number of frames allocated to a process is fixed. B. Not possible for global replacement globe. C. Page to be replaced is chosen from among the frames allocated to the process. D. The number of frames allocated to a process may be change from time to time. 10. The type of scheduling that involves the decision to add a process to those that are at least partially in main memory and therefore available for execution is referred to as: A. B. C. D. Long-term scheduling Medium-term scheduling I/O scheduling None of the above

11. The following are the types of scheduling EXCEPT:A. Long term scheduling B. Short-term scheduling C. I/O scheduling D. Last-term scheduling

12

A scheduling algorithm in which processes that are activated in a fixed cyclic order

The statement refers to:A. FIFO B. Round Robin C. Shortest Process Next (SPN) D. Highest Response Ratio Next (HRRN) 13.

The diagram above refers to:A. RAID 0 B. RAID 1 C. RAID 2 D. RAID 3 14. The following list is use to manage the benefit cache EXCEPT:A. Pay List B. Free List C. Device List D. Driver I/O queue 15. The I/O manager consists of modules as follows:i) Cache manager ii) File system drivers iii) Network drivers iv) Hardware device drivers A. i and ii B. iii and i C. i, ii and iii D. All of the above. 16. The following are the information elements of a File Directory EXCEPT:A. File Name B. File Type C. File Holder 5

D. File Organization 17. The following diagram refers to a __________ which is one of types of file organizations.

A. Pile file B. Sequential file C. Indexed sequential file D. Indexed file 18. A non-erasable disk that stores digitized audio information. The standard system uses 12-cm disks and can record more than 60 minutes of uninterrupted playing time. The statements above explain about:A. CD-R B. CD-ROM C. CD D. DVD-RW 19. On the movable- head system, the time it takes to position the head at the track is known as __________________. A. seek time B. transfer time C. delay time D. access time 20. An improvement over the single buffering. A process now transfer data to (or from) one buffer while the operating systems empties (of fills) the other. The statements refer to:A. Single buffering B. Circular buffering C. Triple buffering

D. Double buffering

Section 2: Choose whether TRUE or FALSE, and answer in the provided answer sheet. (20 marks) 1 A set of processes is deadlocked when each process in the set is blocked awaiting an event that can only triggered by another blocked process in the set. A reusable resources is one that not safety used by only one process at a time. To overcome some of the difficulties with dynamic partitioning, an approach known as fixed partitioning was develops. A logical address is a references to a memory location without it concerns the current assignment of data to memory A file is a collection of fields, which is in turn a collection of related records. The Least Recently Used (LRU) policy replaces the page in memory that has not been referenced for the shortest time. The task of subdividing memory between the O/S and processes is performed automatically by the O/S and is called relocation. Two objectives in designing the I/O facility are efficiency and generality. Windows support a number of file systems, including the file allocation table (FAT) that runs on a Windows 95, MS-DOS and OS/2.

2 3 4 5 6 7 8 9

10 In file management, a partial index contains one entry for every record in the main files. 11 Instruction processing consists of two steps; the processor write instruction to the memory and execute only some of them 12 A program which runs on the system mode being called as the user mode 13 Process swapping can lead to process suspension

14 MS-DOS support multiple user processes as well as multithreading 15 In message passing, the blocking send, blocking receive approach needs the both sender and receiver to be blocked to allow the creation of process spawning 16 One of the most common approaches for recovery from deadlocked processes is to abort all deadlocked processes. 17 Fixed partitioning has the risk of experiencing external fragmentation 18 A page fault occurs when the desired page table entry is not found in the Translation Look aside Buffer (TLB) 19 Three techniques for performing I/O are programmed I/O, interruptdriven I/O and indirect memory access (IDMA) 20 RAID is a set logical drive that being seen as a physical drive

Section 3: Short Answer Questions Instruction: Answer ALL questions in the provided answer booklet. QUESTION 1 a) What is the file management system? b) Define the following terms: i) ii) iii) iv) Data rate FSCAN Disk cache Lazy write

c) In a certain system, the executions of two processes are synchronized using two semaphores, S1 and S2, as shown below. Both semaphores are initialized to zero. The two processes also share the variables x, y, s. The variables x and y are both initialized to 1, whereas variable s is initialized to 0. Process A do{ semWait(S1) x=x+y semSignal (S2) semWait (S1) print s,y }while(s<4) Process B do{ semSignal (S1) semWait(S2) y=x-y s=s+1 semSignal (S1) }while(s<4)

What would be the output of the print statement of process A ? X Y S

QUESTIONS 2 a. Differentiate between the following terms:-

i) Logical I/O and Device I/O ii) Block oriented devices and Stream oriented devices. iii) Asynchronous I/O and Synchronous I/O iv) Hardware RAID and Software RAID b. For each of the following applications, what are the suitable file organizations can be used? i. ii. iii. iv. batch application directories airline reservation data storied prior to processing

c. Give THREE key differences that can exist across (and even in) classes of I/O devices:

QUESTION 3 a. What is Virtual Memory? b. Consider the following page reference string 3 5 4 1 4 5 3 2 5 1 2 5 How many page faults would occur when we use the following replacement algorithms assuming there are 3 frames and they are initially empty (show how you derived your answer)? 1. FIFO 2. LRU 3. Optimal

10