Fixed Partitioning - Operating Systems Fundamentals - Exam Paper, Exams for Computer Science. Aliah University

Computer Science

Description: These are the Exam Paper of Operating Systems Fundamentals which includes Scheduling Policies, I/O Devices, Management Intended, Memory Management, Operating System, New Process, Common Events, File Organisation, File Management etc. Key important points are: Fixed Partitioning, Modern Operating, Operating System, Main Modules, Etch-Execute, Interrupt Occurs, Transition Diagram, Process Transition, Normal Completion, Arrival Times
Showing pages  1  -  2  of  4
Page 1 of 4
CORK INSTITUTE OF TECHNOLOGY
INSTITIÚID TEICNEOLAÍOCHTA CHORCAÍ
Semester 2 Examinations 2009/10
Module Title: Operating Systems Fundamentals
Module Code: SOFT 6003
School: Science
Programme Title: B.Sc. (Honours) in Software Development and Computer Networking
Higher Certificate in Science in Information Technology Support
Programme Code: KITMN_8_Y1
KITSU_7_Y1
KDNET_8_Y1
KITSM_6_Y1
External Examiner(s): Mr. Ken Carroll
Internal Examiner(s): Mr Ger MacSweeney
Ms Helen Fagan
Instructions: Answer four questions. Show all work.
Duration: 2 hours
Sitting: Summer 2010
Requirements for this examination:
Note to Candidates: Please check the Programme Title and the Module Title to ensure that you have received the
correct examination paper.
If in doubt please contact an Invigilator.
Page 2 of 4
Q1
i) What are the main goals of a modern Operating System? List four of the main modules found
in an Operating System.
[5 marks]
ii) What is an interrupt and why is this mechanism used by the CPU?
[5 marks]
iii) With the aid of a diagram, describe the ‘fetch-execute’ cycle indicating when
interrupts are handled.
[3 marks]
iv) Explain in detail the steps that are followed when an interrupt occurs.
[12 marks]
Q2
i) Draw a 5 state Process Transition Diagram naming all states and illustrating the transitions
between these states.
[10 mark]
ii) Apart from normal completion, suggest three reasons why a process might terminate.
[3 mark]
iii) Consider the following set of processes with arrival times and service times given in
milliseconds.
Process Name Arrival
Time
Service
Time
A 0 2
B 2 6
C 4 3
D 5 1
Draw a timeline to show the execution of each of these processes for the following scheduling
algorithms:
Round Robin - time slice (quantum) = 1.
OR
Shortest Remaining Time
Calculate the turnaround and the normalised turnaround time for each process.
[12 Marks]
The preview of this document ends here! Please or to read the full document or to download it.
Document information
Embed this document:
Docsity is not optimized for the browser you're using. In order to have a better experience please switch to Google Chrome, Firefox, Internet Explorer 9+ or Safari! Download Google Chrome