OPERATING SYSTEM ASSESSMENT ANSWER

LESSON 1: INTRODUCTION TO OPERATING SYSTEM

ASSESSMENTS:
True or False: Write TRUE if the statement is correct otherwise write FALSE on the
Space provided.

FALSE 1. The operating system is a control program which manages the computer
system hardware and other application software.
FALSE 2. The operating system hides from the human user the technical and complex
truth about computer operation.
TRUE 3. The first computer does not have an operating system.
TRUE 4. Multiprocessor computers are computers with more than one memory unit.
TRUE 5. Multiprogramming simple allows multiple processes to stay in memory while
having alternate turns with the processor.
TRUE 6. ACPU burst denotes the amount of time a job is utilizing the computer
processor.
FALSE 7. In time sharing, the OS rapidly switches the processor to multiple jobs, which
create the illusion that the computer is not handling multiple jobs simultaneously.
TRUE 8. A task or a process is always composed of a CPU burst and I/O burst.
TRUE 9. OS provides an environment where users can run their programs/applications.
FALSE 10. Device managers are in charge with how hardware mechanisms of the
compute operate in the coordination with the OS.

LESSON 2: COMPUTER SYSTEM STRUCTURE

ASSESSMENTS:
Multiple Choice: Select the best answer from the given choices.
A 1. The storage structure which do not survive system crashes are______
a) Volatile storage
 b) Non-volatile storage
c) Stable storage
d) Dynamic storage
B 2. Storage devices like tertiary storage, magnetic disk comes under
a) Volatile storage
b) Non-volatile storage
c) Stable storage
d) Dynamic storage
A 3. What do you do to start the boot process?
a) Push the power button
b) Install the boot loader
c) Find CPU
d) Press F8
A 4. What is the program that makes your software applications and hardware work
together?
a) Operating System
b) Read-only Memory
c) CPU
d) Main Memory
C 5. Once the computer has power, what is the first step in the boot process?
a) Safe mode
b) Cache Loads the boot loader
c) Power on Self-Test
d) Batch input/output system

LESSON 3: PROCESS MANAGEMENT

ASSESSMENTS:
Problem 1: Compute for TTA, WTA, CPU utilization using FCFS, SJP, NPP, SRTF, PP and
RR(q=3)

Jobs Arrival Time Burst Time Priority

A 1 4 6
B 5 12 2
C 5 9 4
D 11 2 3
E 16 10 1
 F 20 11 5
Flow line

A4(6) B12(2) C9(4) D2(3) E10(1) F11(5)

1 5 5 11 16 20

FCFS
A4 B12 C9 D2 E10 F11

0 1 5 17 26 28 38 49
A4 B12 C9 D2 E10 F11
C9 D2 E10 F11
E10 F11

TT = ET – AT WT = TT-BT TTA WTA CPU UTILIZATION =TBT/ET *100

A=5-1=4 4-4=0 =4+12+21+17+22+29 =12+15+12+18 =4+12+9+2+10+11

B=17-5=12 12-12=0 =105/6 =57/6 =48/49 *100
C=26-5=21 21-9=12 =17.50 MS =9.50 MS =97.95%
D=28-11=17 17-2=15
E=38-16=22 22-10=12
F=49-20=29 29-11=18

SJF
A4 C9 D2 E10 F11 B12

0 1 5 14 16 26 37 49
A4 B12 B12 B12 B12 B12
C9 D2 E10 F11

TT = ET – AT WT = TT-BT TTA WTA

A=5-1=4 4-4=0 =4+44+9+5+10+17 =32+3+6

B=49-5=44 44-12=32 =89/6 =41/6
C=14-5=9 9-9=0 =14.83 MS =6.83 MS
D=16-11=5 5-2=3
E=26-16=10 10-10=0
F=37-20=17 17-11=6
NPP
A4 B12 E10 D2 C9 F11

0 1 5 17 27 29 38 49

A4(6) B12(2) C9(4) C9(4) C9(4) F11(5)

C9(4) D2(3) D2(3) F11(5)
E10(1) F11(5)

TT = ET – AT WT = TT-BT TTA WTA

A=5-1=4 4-4=0 =4+12+33+18+11+29 =24+16+1+18

B=17-5=12 12-12=0 =/6 =59/6
C=38-5=33 33-9=24 =17.83 MS =9.83 MS
D=29-11=18 18-2=16
E=27-16=11 11-10=1
F=49-20=29 29-11=18

SRTF
A4 C6 D2 C3 E4 E6 F11 B12

0 1 5 11 13 16 20 26 37 49

A4 B12 B12 B12 B12 B12 B12 B12

C9 D2 C3 E10 F11 F11
C3 E6

TT = ET – AT WT = TT-BT TTA WTA

A=5-1=4 4-4=0 =4+44+11+2+10+17 =32+2+6

B=49-5=44 44-12=32 =88/6 =40/6
C=16-5=11 11-9=2 =14.66 MS =6.66 MS
D=13-11=2 2-2=0
E=26-16=10 10-10=0
F=37-20=17 17-11=6

PP
A4 B6 B5 E4 E6 B1 D2 C9 F11
0 1 5 11 16 20 26 27 29 38 49

A4(6) B12(2) C9(4) C9(4) C9(4) C9(4) C9(4) C9(4) F11(5)

C9(4) D2(3) D2(3) D2(3) D2(3) D2(3) F11(5)
B6(2) E10(1) B1(2) B1(2) F11(5)
B1(2) F11(5) F11(5)
E6(1)

TT = ET – AT WT = TT-BT TTA WTA

A=5-1=4 4-4=0 =4+22+33+18+10+29 =10+24+16+18

B=27-5=22 22-12=10 =116/6 =68/6
C=38-5=33 33-9=24 =19.33 MS =11.33 MS
D=29-11=18 18-2=16
E=26-16=10 10-10=0
F=49-20=29 29-11=18

RR (q=3)
A3 A1 B3 C3 B3 D2 C3 B1 E3

0 1 4 5 8 11 14 16 19 20 23

A4 A1 B12 C9 B9 D2 C6 B6 E10 C3
C9 B9 D2 C6 B6 E10 C3 F11
C6 B6 E10 C3 F11 B5
B5 E7
 C3 F3 B3 E3 F3 B2 E3 F3 E1 F2

26 29 32 35 38 40 43 46 47 49

F11 B5 E7 F8 B2 E4 F5 E1 F2
B5 E7 F8 B2 E4 F5 E1 F2
E7 F8 B2 E4 F5

TT = ET – AT WT = TT-BT TTA WTA

A=5-1=4 4-4=0 =4+35+21+5+31+29 =23+12+3+21+18

B=40-5=35 35-12=23 =125/6 =77/6
C=26-5=21 21-9=12 =20.83 MS =12.83 MS
D=16-11=5 5-2=3
E=47-16=31 31-10=21
F=49-20=29 29-11=18

TTA WTA CPU uTILIZATION

FCFS 17.50 MS 9.50 MS

SJF 14.83 MS 6.83 MS

NPP 17.83 MS 9.83 MS

SRTF 14.66 MS 6.66 MS

97.95%
PP 19.33 MS 11.33 MS

RR 20.83 MS 12.83 MS

Problem 2: Compute for TTA and WTA using FCFS and RR(q=5).
Jobs Arrival Time Burst Time
P1 3 8
P2 7 2
P3 9 11
P4 14 4
P5 17 12
P6 19 8
 P7 27 9
Flow line

P1 P2 P3 P4 P5 P6 P7

3 7 9 14 17 19 27

FCFS
P1 P2 P3 P4 P5 P6 P7

0 3 11 13 24 28 40 48 57
P1 P2 P3 P4 P5 P6 P7
P3 P5 P6 P7
P6 P7

TT = ET – AT WT = TT-BT TTA WTA

P1=11-3=8 8-8=0 =8+6+15+14+23+29+30 =4+4+10+11+21+21

P2=13-7=6 6-2=4 =105/7 =71/7
P3=24-9=15 15-11=4 =17.85 MS =10.14 MS
P4=28-14=14 14-4=10
P5=40-17=23 23-12=11
P6=48-19=29 29-8=21

P7=57-27=30 30-9-=21

RR (q=5)
P1(5) P2(1) P1(3) P3(2) P2(1) P4(2) P3(2) P5(5) P4(2)

0 3 8 9 12 14 15 17 19 24 26

P1(8) P2(2) P1(3) P3(11) P2(1) P4(4) P3(9) P5(12) P4(2) P6(8)
P1(3) P3(11) P2(1) P4(4) P3(9) P5(12) P4(2) P6(8) P3(7)
P2(1) P3(9) P4(2) P6(8) P3(7) P5(7)
P3(7) P5(7)
 P6(1) P3(5) P5(5) P7(5) P6(5) P3(2) P5(2) P7(4) P6(2)

27 32 37 42 47 49 51 55 57

P3(7) P5(7) P7(9) P6(7) P3(2) P5(2) P7(4) P6(2)

P5(7) P7(9) P6(7) P3(2) P5(2) P7(4) P6(2)
P7(9) P6(7) P3(2) P5(2) P7(4) P6(2)
P6(7) P3(2) P5(2) P7(4) P6(2)

TT = ET – AT WT = TT-BT TTA WTA

P1=12-3=9 9-8=1 =9+8+40+12+34+38+28 =1+6+29+8+22+30+19

P2=15-7=8 8-2=6 =169/7 =115/7
P3=49-9=40 40-11=29 =24.14 MS =16.42 MS
P4=26-14=12 12-4=8
P5=51-17=34 34-12=22
P6=57-19=38 38-8=30

P7=55-27=28 28-9-=19

TTA WTA

FCFS 17.85 MS 10.14 MS

RR 24.14 MS 16.42 MS

LESSON 4: STORAGE MANAGEMENT

ASSESSMENTS:
Multiple Choice

C 1. Suppose a disk has 201 cylinders, numbered from 0 to 200. At some time the disk
arm is at cylinder 100, and there is a queue of disk access requests for cylinders 30, 85,
90,100,105,110,135 and145. If Shortest-Seek Time First (SSTF) is being used for
scheduling the disk access, the request for cylinder 90 is serviced after servicing
____________number of requests.
a)1 b)2 c)3 d)4
D 2. Consider an operating system capable of loading and executing a single sequential
user process at a time. The disk head scheduling algorithm used is First Come First
Served (FCFS). If FCFS is replaced by Shortest Seek Time First (SSTF), claimed by the
vendor to give 50% better bench mark results, what is the expected improvement in the
I/O performance of user programs?
a) 50% b) 40% c) 25% d) 0%
C 3. Suppose the following disk request sequence (track numbers) for a disk with 100
tracks is given: 45,20,90,10,50,60,80,25,70. Assume that the initial position of the R/W
head is on track 50. The additional distance that will be traversed by the R/W head
when the Shortest Seek Time First (SSTF) algorithm is used compared to the SCAN
(Elevator) algorithm (assuming that SCAN algorithm moves towards 100 when it starts
execution) is _________tracks
a) 8 b) 9 c) 10 d) 11

LESSON 5: MEMORY MANAGEMENT

ASSESSMENTS:
TRUE or FALSE: Write TRUE if the statement is correct otherwise write FALSE on the
space provided.
FALSE 1. The simplest form of memory management puts a demarcation line between
the user space and the kernel space.
FALSE 2. Buddy suffers from the MVP and MFP problem on internal and external
fragmentations.
FALSE 3. Overlays allow the sharing of limited memory space.
TRUE 4. The goal of compaction is to merge all available memory space.
FALSE 5. Internal fragmentation is an unused memory space with in a partition.
TRUE 6. MVP allows partitions to be dynamically created and dissolved.
FALSE 7. Memory diagrams are constructed at every time interval.
TRUE 8. Buddy system splits and merges the memory using the power of two.
TRUE 9. Swapping is an exchange between an unneeded job in the main memory and
a needed job in the secondary storage.
TRUE 10. A palindrome.exe program can make use of compile time binding.

LESSON 6: VIRTUAL MEMORY MANAGEMENT

ASSESSMENTS:
Matching type
COLUMN A COLUMN B
C 1. FIFO A. Location will most likely be accessed
again
B. Address used in the main memory
F 2. Spatial Locality
C. Exhibits Belady’s Anomaly
D. Phenomenon of moving pages
E 3. Temporal Locality
excessively to and from the main
memory

K 4. Virtual Memory E. Replace pages based on the concept

of temporal locality
F. Location near a region that was
G 5. Logical Address accessed are candidates doe access in
the near future

B 6. Physical Address G. Address used in the CPU

H. Program divided into small equal
parts
I 7. Segmentation
I. Program divided into small uneven
parts
H 8. Paging J. Use secondary memory as extension
of main memory

A 9. Thrashing K. Request page not in main memory.

L. Replace pages that are not going to
be referenced soon.
L 10. OPT Algorithm

LESSON 7: DEADLOCKS
ASSESSMENTS:
True or False: Write TRUE if the statement is correct otherwise write FALSE on the
space provided.
FALSE 1. Deadlocks are beneficial to the computer system, but are commonly
misunderstood like interrupts.
TRUE 2. A safe sequence guarantees the process is not in deadlock.
FALSE 3. Processes is in a Hold and wait condition whenever there is exclusive owner
ship of a particular resource.
TRUE 4. There can be more than one safe sequence in a given set of processes and
resources.
FALSE 5. Deadly embrace can be avoided in the computer system by preventing any of
the conditions for deadlock to be true.
TRUE 6. Pretending that a deadlock problem does not exist is also known ostrich
algorithm.
TRUE 7. All four conditions for deadlocks must be true before a state of deadlock can
exist.
FALSE 8. A request can not be granted if the resources are sufficient or when the
request would place the system in a state of deadlock.
TRUE 9. A safe state is a situation where in all processes can finish execution.
TRUE10. When the system accepts a request for a particular resource/s, it runs the
Banker’s Algorithm to check it, it is safe to grant the request.

LESSON 8: FILE MANAGEMENT

ASSESSMENTS:
TRUE or FALSE: Write TRUE if the statement is correct otherwise write FALSE on the
space provided for.
FALSE 1. A physical write occurs between the hard disk and the main memory.
FALSE 2. The File organization technique is characterized y long file searches due to
the sequential nature of storing and searching.
TRUE 3. Customer name is regarding as a record.
FALSE 4. The creation of subdirectories gives rise to the three-directory structure.
TRUE 5. It is advisable to use a big blocking factor in a direct/random file organization.
TRUE 6. File names must be unique to avoid being over written an existing file.
TRUE 7. Directories must be shared in the same manner as files are to be shared in the
same manner as files are to be shared to many users.
FALSE 8. Blocking factor specifies the number of records to compromise a block.
TRUE 9. Microsoft word uses a graphical user interface(GUI).
TRUE 10. The simplest form of directory system is called a single-level directory system
otherwise known as Root Directory.