Scribd
Upload
79 views3 pages

Operating System Exam Guide 2023

This document contains instructions for a final exam for a Fundamentals of Operating Systems course. It includes 4 questions. Question 1 asks about scheduling principles and program threats. Question 2 is about deadlock conditions and using the Banker's algorithm. Question 3 involves drawing Gantt charts for different scheduling algorithms and calculating metrics. Question 4 defines processes and their attributes, and process states in the process lifecycle. The exam tests various core operating system concepts.

Uploaded by

i23025110
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
79 views3 pages

Operating System Exam Guide 2023

This document contains instructions for a final exam for a Fundamentals of Operating Systems course. It includes 4 questions. Question 1 asks about scheduling principles and program threats. Question 2 is about deadlock conditions and using the Banker's algorithm. Question 3 involves drawing Gantt charts for different scheduling algorithms and calculating metrics. Question 4 defines processes and their attributes, and process states in the process lifecycle. The exam tests various core operating system concepts.

Uploaded by

i23025110
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

ITE2204 (F) / Page 1 of 4

INTI INTERNATIONAL UNIVERSITY


BACHELOR OF COMPUTER SCIENCE (HONS) - BCSILS
ITE2204: FUNDAMENTAL OF OPERATING SYSTEM
FINAL EXAMINATION: FINAL AUGUST 2023 SESSION

Instructions: Answer ALL questions . All questions carry equal marks

Question 1

(a) What is scheduling. What are the SIX (6) types of principles which must be considered
during the selection of a scheduling algorithm?
(15 marks)
(b) Briefly explain the following program threats:
i. Trojan Horse

ii. Trap Door

iii. Logic Bomb

iv. SQL Injections

iv. Stack and Buffer Overflow


(10 marks)
Question 2

(a) What are the FOUR (4) conditions required for a deadlock to occur?
(12 marks)

(b) Consider the following data structures in the Banker’s algorithm, with resources A, B, C,
and D, and process P0 to P4.
Allocation Max Available Resource - 1 5 2 0
ABCD ABCD
ITE2204 (F) / Page 2 of 4

P0 0 01 2 00 1 2
P1 1 0 0 0 1 7 5 0
P2 1 3 5 4 2 3 5 6
P3 0 6 3 2 0 6 5 2
P4 0 0 1 4 0 6 5 6

i) Calculate the Need Matrix.


(5 marks)
ii) Is the system in a safe state? Give the safe sequence.
(8 marks)

Question 3

(a) Consider the following set of processes in Table 1-1, with the length of the CPU
burst times given in millisecond:
Process Burst Time Priority
P1 10 3
P2 1 1
P3 2 3
P4 1 4
P5 5 2
Table 1-1

(i) Draw FOUR (4) Gantt charts that illustrate the execution of these processes using the
following scheduling algorithms: FCFS, SJF, non-preemptive priority (a smaller
priority number implies a higher priority), and RR (quantum = 1).
(17 marks)
ITE2204 (F) / Page 3 of 4

(ii) Calculate the Average Turn Around Time (ATAT), Average Waiting Time (AWT).
(8 marks)

Question 4

(a) What is a process? List and explain any FIVE (5) main attributes of a process.

(15 marks)

(b) Name and describe the different states (process life cycle) that a process can exist in at any
given time.
(10 marks)

- THE END -
ITE2204(F)AUG2023/JEYARANI PERIASAMY/9/09/2023

You might also like