MMF03

S.A. ENGINEERING COLLEGE

Time: 180 Mins SEMESTER - V MAXIMUM MARKS: 100

COURSE OBJECTIVES:
 To understand the basic concepts, functions, processes and threads of operating systems.
 To analyse scheduling algorithms and understand the concept of deadlocks.
 To analyse various memory management schemes.
 To understand I/O management and file systems.
 To be familiar with the basics of Linux system and Mobile OS like iOS and Android.
COURSE OUTCOMES:
At the end of the course, the student should be able to:
CS1501A.1: Understand the basic concepts, functions, processes and threads of operating systems
CS1501A.2: Analyze various scheduling algorithms, Understand deadlock, prevention and avoidance algorithms
CS1501A.3: Compare and contrast various memory management schemes.
CS1501A.4: Understand the functionality of file systems.
CS1501A.5: Perform administrative tasks on Linux Servers and compare iOS and Android Operating
Systems.
CO.N
BT Marks
O.
Answer ALL the Questions
PART – A (10 x 2 = 20 Marks)
1. Define a hypervisor and list its types. CO1 BTL1 2
2. Identify two distinctions between Batch systems and Time sharing systems. CO1 BTL2 2
3. What is a semaphore? CO2 BTL1 2
4. Name some classic problem of synchronization. CO2 BTL1 2
5. Differentiate internal fragmentation from external fragmentation. CO3 BTL2 2
6. What is thrashing? How to resolve this problem? CO3 BTL2 2
7. Define C-SCAN scheduling. CO4 BTL1 2
8. What are the different methods for allocation in a File System? CO4 BTL1 2
9. Define LINUX Virtualization. CO5 BTL1 2
10. Differentiate iOS from Android OS. CO5 BTL2 2
PART – B (5 x 13 = 65 Marks)
11. (a) Explain different operating system structures with neat sketch CO1 BTL2 13
(Or)
(b) What is a process? Discuss about components of a process and various states
CO1 BTL2 13
of a process with the help of a process state transition diagram.
12. (a) (i) What is meant by the critical section problem? Propose a solution based on
6
the bakery algorithm. CO2 BTL3
7
(ii) Describe the different ways of implementing semaphores.
(Or)
 MMF03

(b) What are interacting processes? Explain any two methods of implementing
CO2 BTL3 13
interacting processes.
13.(a) Explain in detail about the segmentation and implementation of segment
tables. CO3 BTL3 13

(Or)
(b) (i)Under what circumstances does page fault occur? Describe the actions
taken by the operating system when a page fault occurs. 6
CO3 BTL3
(ii)Describe the concept of buddy system allocation with a neat sketch. 7
14.(a) Consider a disk queue with requests for I/O to block on cylinders 98, 183, 37,
122, 14, 124, 65, 67. If the disk head is at 53, then find out the total head
CO4 BTL4 13
movement with respect to FCFS, SSTF, SCAN, CSCAN and LOOK
scheduling.
(Or)
(b) On a disk with 1000 cylinders, numbers 0 to 999, compute the number of
tracks the disk arm must move to satisfy the entire request in the disk queue.
Assume the last received was at track 345 and the head is moving towards
track 0. The queue in FIFO order contains requests for the following tracks:
CO4 BTL4 13
123, 874, 692, 475, 105 and 376. Find the seek length for the following
scheduling algorithms.
(1) FCFS (2) SSTF (3) SCAN (4) C-SCAN (5) C-LOOK

15. (a) Explain the architecture of iOS. Discuss about the media and service layers. CO5 BTL2 13
(Or)
(b) Explain various CPU scheduling algorithms used in Linux systems in detail. CO5 BTL2 13
PART – C (1 x 15 = 15 Marks)
16. (a) Consider the page reference string 7, 0, 1, 2, 0, 3, 0, 4, 2, 3, 0, 3, 2, 1, 2, 0, 1,
7, 0, 1. How many page faults would occur for the following replacement
algorithm, assuming one, two, three, four page frames? Remember that all
CO3 BTL4 15
frames are initially empty, so your first unique pages will all cost one fault
each.(i) FIFO (ii) LRU (iii) OPTIMAL

(Or)
(b) (i)Given memory partitions of 100K, 500K, 200K, 300K and 600K (in order).
How would each of the First-fit, Best-fit and Worst-fit algorithms place 15
processes of 412K, 317K, 112K and 326K (in order)? Which algorithm makes
the most efficient use of memory? And also explain the Paging and CO3 BTL4
Translation Look-aside Buffer memory management technique with diagram
in detail.

BTL1- Remember, BTL 2 - Understand, BTL 3 – Apply, BTL 4- Analyze, BTL 5 – Evaluate, BTL 6 - Create