JAYALAKSHMI INSTITUTE OF TECHNOLOGY, THOPPUR 636352
OFFICE OF THE CONTROLLER OF EXAMINATIONS
INTENSIVE COACHING TEST –V
Year/Sem :II/IV Max.Marks: 100
Branch :CSE Duration : 3.00 hrs
Name of the Subject:CS 3451 Introduction to Operating System Date
:
CO1: To understand the different ways for extraction of multimedia data
CO2: To learn and analyze the information retrieval techniques
K1- Knowledge K2- Comprehension K3- Application, K4- Analysis K5- Synthesis K6- Evaluation
PART-A (10*2=20)
1. Define operating system?(CO2, K2)
2. List out the services of OS? CO1,K4)
3. State the critical section problem?(CO2,K3)
4. Name the four condition for deadlock?(CO1,K3)
5. What is swapping?(C02,K2)
6. Define thrashing (VFS)?(CO1,K1)
7. What is a sequential access file?(CO3,K3)
8. Define an immutable shared file?(CO1,K1)
9. What is a virtual machine?
10.Write a note on Android?
(Any five Question) (5*13=65)
11.a) Explain the function performed by an operating system? .(CO2,K3)
(OR)
b) What is system call? Elaborate on the types of system calls?
12.i) With a neat sketch Explain the different states of a process?(CO2,K3)
ii) How process synchronization in achieved using semaphores? Give on example?
(OR)
b)Write Banker’s algorithms for deadlock avoidance Explain with an example?
13.a)What is paging? Elaborate paging with an example and a diagram(CO2,K3)
(OR)
b) Explain first-fit, first-out page replacement algorithms and optimal page replacement algorithms with
an example and diagrams?
14 a)what is directory? Outline a tree structured directory structure and on acyclic graph directory
structure with appropriate example?(CO2,K3)(OR)
b)Explain contiguous allocation and linked allocation of disk space with an example
15. a)Present an outline of the types of virtual machines. Explain in detail?
(OR)
b)outline operating system aspects of virtualization in the context of operating system function
scheduling. I/O and memory management?
PART-C
16. a) Consider the following five processes that arrives at time 0, with the length of the process of the
burs time given milliseconds
process Cpu burst time
P1 10
P2 29
P3 3
P4 7
P5 12
Consider the FCFS, Non preemptive SJF,Round robin(quantum=10 milliseconds) scheduling
algorithms illustrate the scheduling using Gantt chart. Which algorithms will given the minimum average
waiting time? (OR)
b) Consider a disk queue with requests for i/o to blocks on cylinders in the following order
99,183,37,123,14,124,65,67 the disk hand pointer is initially at cylinder 53, outline first –come first
served, disk scheduling algorithms, SCAN disk scheduling algorithms and shortest seek time disk
scheduling with neat diagram
SUBJECT STAFF HOD PRINCIPAL