STUDENT IDENTIFICATION NO
MULTIMEDIA COLLEGE
JALAN GURNEY KIRI
54100 KUALA LUMPUR
FIRST, SECOND, THIRD SEMESTER FINAL EXAMINATION, 2014/2015 SESSION
ITC2053/TIS2233 – OPERATING SYSTEM
DSEWE-F-2-/14, DSEW-E-F-1/14, DSEW-E-F-3/14
11 FEBRUARY 2015
9.00 AM – 11.00 AM
(2 HOURS)
INSTRUCTION TO STUDENT
1.
This Examination paper has SEVENTEEN (17) printed pages.
2.
This question paper consists of THREE (3) sections.
3.
Section
A
: Answer ALL questions.
Section
B
: Answer ALL questions.
Section
C
: Answer FIVE (5) questions ONLY.
Please write all your answers in the Answer Booklet provided.
ITC2053/TIS2233
OPERATING SYSTEM
SECTION A
: OBJECTIVE QUESTION (30 MARKS)
INSTRUCTION
: ANSWER ALL QUESTIONS
1.
11 FEBRUARY 2014
Which of the following memory management schemes does NOT allow
multiprogramming?
2.
3.
A.
Single-user contiguous scheme
B.
Fixed partition
C.
Dynamic partition
D.
Relocatable dynamic partitions
Which of the following memory management schemes optimizes fragmentation?
A.
Single-user contiguous scheme
B.
Fixed partition
C.
Dynamic partition
D.
Relocatable dynamic partitions
Given the following static allocation scheme:
Partition
Contents
Size
1
2
3
Operating System
free
free
32K
32K
64K
Where will a job requiring 96K bytes of memory be stored?
A.
Partition 1
B.
Partition 2
C.
Partition 3
D.
None of the above
Continued…
RA
Page 2 of 13
ITC2053/TIS2233
4.
OPERATING SYSTEM
11 FEBRUARY 2014
Consider the case where the Free Memory Storage List is kept in ascending order by
partition size. The attempt to place a job in the smallest free partition in which it will
fit is called______________.
5.
A.
First Fit
B.
Best Fit
C.
Worst Fit
D.
No Fit
The total effect of all CPU cycles, from both I/O-bound and CPU-bound jobs,
approximates which of the following distribution curves?
6.
A.
Gaussian distribution
B.
Poisson distribution
C.
Lorentzian Distribution
D.
Random Distribution
Which of the following algorithms employ the concept of a time quantum that is
given to each job to ensure that the CPU is equally shared among all active processes?
7.
A.
SRT
B.
SJN
C.
Round robin
D.
Priority scheduling
Which of the following conditions results from the liberal allocation of resources?
A.
Starvation
B.
Deadlock
C.
Increased efficiency
D.
Request for more memory
Continued…
RA
Page 3 of 13
ITC2053/TIS2233
8.
OPERATING SYSTEM
11 FEBRUARY 2014
In directed graphs, a solid arrow from a resource to process represents which of the
following?
9.
A.
Process is holding the resource
B.
Process is waiting for the resource
C.
Deadlock
D.
Starvation
Which of the following strategies for handling deadlocks is illustrated using the
Banker’s algorithm?
10.
11.
A.
Prevention
B.
Avoidance
C.
Detection
D.
Recovery
A supercomputer can perform ______________ floating-point operations per second.
A.
240 million
B.
2.4 billion
C.
2.4 trillion
D.
24 trillion
___________ is how memory is deallocated in a fixed partition scheme.
A.
Memory Manager releases the block and combines it with another free block.
B.
Memory Manager immediately gives memory to another program.
C.
Memory Manager adds block to free list and removes it from busy list.
D.
Memory Manager resets the status of the memory block where the job was
stored to “free.”
12.
A system with _______________ divides programs into parts and keep them in
secondary storage, bringing each part into memory only as it is needed.
A.
virtual memory
B.
shared memory
C.
segmented processing
D.
passive multiprogramming
Continued…
RA
Page 4 of 13
ITC2053/TIS2233
13.
14.
15.
OPERATING SYSTEM
11 FEBRUARY 2014
The primary advantage of storing programs in noncontiguous locations is that ____.
A.
multiple programs can run at the same time
B.
every program will be able to run
C.
secondary storage is accessed more quickly
D.
main memory is used more efficiently
The I/O ______________ allocates the devices, control units, and channels.
A.
scheduler
B.
traffic controller
C.
device handler
D.
director
The source code of a Java program is first compiled into an intermediate language
called Java _________, which are platform-independent.
16.
17.
A.
beans
B.
nibs
C.
bits
D.
bytecodes
For ________ systems, deadlocks quickly become critical situations.
A.
batch
B.
interactive
C.
real-time
D.
general purpose
When the operating system detects a non-recoverable error, the following step is
performed first by the interrupt handler : __________________.
A.
the state of the interrupted process is saved
B.
the type of interrupt is described and stored
C.
the interrupt is processed
D.
the processor resumes operation
Continued…
RA
Page 5 of 13
ITC2053/TIS2233
18.
OPERATING SYSTEM
11 FEBRUARY 2014
Failure to lock database records before updating them may result in a _______
between processes.
19.
20.
21.
A.
struggle
B.
race
C.
timeout
D.
livelock
The fixed partition scheme works well ___________________.
A.
when jobs have the same size
B.
when jobs have different sizes
C.
when job sizes are not known in advance
D.
when all jobs are under 100K
_________ means that several logical records are grouped within one physical record.
A.
Grouping
B.
Fixing
C.
Combining
D.
Blocking
_____systems are computer placed inside other products to add features and
capabilities.
22.
A.
Hybrid
B.
Embedded
C.
Real-Time
D.
Interactive
________includes every peripheral unit in the system such as printers, disk drives,
CD/DVD drives, flash memory, keyboards, and so on.
A.
The CPU
B.
Processors
C.
I/O Devices
D.
Memory
Continued…
RA
Page 6 of 13
ITC2053/TIS2233
23.
OPERATING SYSTEM
11 FEBRUARY 2014
Which of the following memory management techniques that leads to internal
fragmentation?
I.
Single-user Contiguous
II. Fixed Partition
III. Dynamic Partition
IV. Relocatable Dynamic Partition
24.
A.
I, II
B.
II, III
C.
III, IV
D.
I, IV
The most common mechanism for implementing multiprogramming was the
introduction of the _______ concept, which is when the CPU is notified of priority
events needing operating systems services.
25.
26.
A.
Interrupt
B.
Messaging
C.
Paging
D.
Sharing
_____ devices are assigned to only one job at a time.
A.
Dedicated
B.
Virtual
C.
Shared
D.
Static
The purpose of a file extension is to __________________________.
A.
identify the directory in which the file is stored
B.
identify the type of file
C.
identify the file size
D.
identify the file owner
Continued…
RA
Page 7 of 13
ITC2053/TIS2233
27.
28.
OPERATING SYSTEM
11 FEBRUARY 2014
A page size that is too small will generate __________________________.
A.
very long PMTs
B.
excessive internal fragmentation
C.
more difficult to calculate actual position
D.
excessive external fragmentation
The Processor Scheduler assigns the CPU to execute the processes of those jobs
placed on the ___________ state by the Job Scheduler.
29.
A.
WAITING
B.
PROCESS
C.
NEXT
D.
READY
With demand paging, jobs are divided into equally sized _______ that initially reside
in secondary storage.
30.
A.
pages
B.
frames
C.
blocks
D.
sets
The fixed partition scheme works well when ______________________.
A.
jobs have the same size
B.
jobs have different sizes
C.
job sizes are not known in advance
D.
all jobs are under 100K
Continued…
RA
Page 8 of 13
ITC2053/TIS2233
OPERATING SYSTEM
SECTION B
: TRUE (T) OR FALSE (F) (20 MARKS)
INSTRUCTION
: ANSWER ALL QUESTIONS
1.
11 FEBRUARY 2014
After a job has been placed on the READY queue by the Job Scheduler, the Process
Scheduler takes over.
2.
CPU-bound jobs (such as printing a series of documents) have many brief CPU
cycles and long I/O cycles.
3.
As a job moves through the system it is always in one of five states (or at least three);
these are called the job status or the process status.
4.
Each job is uniquely identified by the user’s identification and a pointer connecting it
to its descriptor.
5.
The shortest remaining time (SRT) algorithm is often used in interactive systems.
6.
If locks are not used to preserve data integrity, the updated records in a database
might include only some of the data—and their contents would depend on the order
in which each process finishes its execution.
7.
A race introduces the element of chance, an element that is desirable in database
management.
8.
A deadlock is preceded by six simultaneous conditions that the operating system
could have recognized.
9.
When modeling deadlock, if there’s a cycle in the graph, then there is a deadlock
involving the processes and the resources in the cycle.
10.
Mutual exclusion should be eliminated from a computer system to avoid deadlock.
Continued…
RA
Page 9 of 13
ITC2053/TIS2233
OPERATING SYSTEM
11 FEBRUARY 2014
11.
The Memory Manager is in charge of main memory, also known as ROM.
12.
The high-level portion of the Process Manager is called the Process Scheduler.
13.
The Device Manager monitors every device, channel, and control unit.
14.
The supercomputer was developed primarily for government applications needing
massive and fast number-crunching ability to carry out military operations and
weather forecasting.
15.
If the control unit has two buffers, the second buffer can be loaded while the first
buffer is transmitting its contents to or from the CPU.
16.
Most systems have transformed the printer into a sharable device that uses high-speed
storage to transfer data between it and the CPU.
17.
The operating system must be sure never to satisfy a request that moves it from a safe
state to an unsafe one.
18.
Although the Banker’s Algorithm has been used to avoid deadlocks in systems with a
few resources, it isn’t always practical for most systems.
19.
Starvation is the result of the liberal allocation of resources.
20.
Once starvation has been detected, an algorithm can be implemented in which the
system blocks new jobs until the starving jobs have been satisfied.
Continued…
RA
Page 10 of 13
ITC2053/TIS2233
OPERATING SYSTEM
SECTION C :
INSTRUCTION
11 FEBRUARY 2014
SHORT QUESTION (50 MARKS)
:
ANSWER FIVE (5) QUESTIONS ONLY.
Question 1
Provide the definition of the term below:
a)
Best-fit memory allocation
b)
First-fit memory allocation
c)
Compaction
d)
Deallocation
e)
Dynamic partitions
(10 Marks)
Question 2
a)
What is a computer system?
(2 Marks)
b)
What is an operating system?
(2 Marks)
c)
List TWO (2) example of operating system.
(2 Marks)
d)
List TWO (2) types of the operating system
(2 Marks)
e)
Provide TWO (2) managers/components in operating system.
(2 Marks)
Question 3
a)
Explain the first-in first-out (FIFO) and least-recently-used (LRU) page replacement
policies.
(4 Marks)
b)
Provide ONE(1) advantage and ONE(1) disadvantage of Paged Memory Allocation
(4 Marks)
c)
What is cache memory?
(2Marks)
Continued…
RA
Page 11 of 13
ITC2053/TIS2233
OPERATING SYSTEM
11 FEBRUARY 2014
Question 4
Given that main memory is composed of three page frames for public use and that a program
requests pages in the following order:
a, d, b, a, f, b, e, c, g, f, b, g
a)
Using the First-In First-Out (FIFO) page removal algorithm, perform a page trace
analysis indicating page faults with asterisks (*). Then compute the failure and
success ratios.
Page request
a
d
b
a
f
b
e
c
g
f
b
g
Page fault
Page frame 1
Page frame 2
Page frame 3
(5 Marks)
b)
Using the Least Recently Used (LRU) page removal algorithm, perform a page trace
analysis indicating page faults with asterisks (*). Then compute the failure and
success ratios.
Page request
a
d
b
a
f
b
e
c
g
f
b
g
Page fault
Page frame 1
Page frame 2
Page frame 3
(5 Marks)
Question 5
a)
What is deadlock?
(2 Marks)
b)
State and explain FOUR (4) situations that caused a deadlock.
(8 Marks)
Continued…
RA
Page 12 of 13
ITC2053/TIS2233
OPERATING SYSTEM
11 FEBRUARY 2014
Question 6
Based on the following information:
Memory
Memory
Job
Status
Internal
External
Block
Block Size
No
Busy/Free
Fragmentation
Fragmentation
Block 1
500 K
Block 2
300 K
Block 3
900 K
Incoming Job list:
Job 1 (850 K)
Job 2 (150 K)
Job 3 (600 K)
a)
Use the follows algorithm to indicate which memory blocks are allocated to each of
the 3 (THREE) arriving jobs. Calculate the internal and external fragmentation.
i)
Best-fit algorithm
ii)
First-fit algorithm
iii)
Worst-fit algorithm
(9 Marks)
b)
From the three algorithm which is the most suitable algorithm.
(1 Marks)
End of Page.
RA
Page 13 of 13