PONJESLY COLLEGE OF E

DEPARTMENT OF INFORMAT
S.NO REGISTER NO STUDENT NAME
1 961823205001 AAKASH T
2 961823205002 ABINESH M L
3 961823205003 ABISHA S
4 961823205004 ABISH KUMAR R K
5 961823205005 ADLIN BERNISHA S
6 961823205006 AHIL ROY R
7 961823205007 AHMAD HASAN N
8 961823205008 AJAY K S
9 961823205009 AJAY S
10 961823205010 ANIRUDH S
11 961823205011 ANLIN LINISHA K
12 961823205014 ASHIK M
13 961823205015 ATHISHA S
14 961823205016 AYMAN A
15 961823205017 BARAKATH SHAFIN R
16 961823205018 BHARATH SINGH S R
17 961823205019 CHRISTON THOMAS T J
18 961823205020 DANIEL SANJAY T
19 961823205021 DISHON SAM D
20 961823205022 FATHIMA SANA M
21 961823205023 GOKUL T S
22 961823205024 HUTSON THOMAS T J
23 961823205025 JAI FRANKLIN B
24 961823205026 JASHALIN J
25 961823205027 JASLIN SIBI J S
26 961823205028 JEHILIN J K LIMSHEKHA
27 961823205029 JERICO GRIS G B
28 961823205030 JERISH M
29 961823205031 JESU ANIS KUMAR A
30 961823205032 JINSU J
31 961823205033 JINU ASHLY J
32 961823205035 JOYCE JERUSSA A
33 961823205036 KARTHIK A K
34 961823205037 KELVIN JOHN M
35 961823205038 MANIKANDAN I
36 961823205039 MANO RITA S P
37 961823205040 MOHAMED BAASIL S
38 961823205041 MONISH R
39 961823205042 NAVISHMA D R
40 961823205043 PON JESWIN SALOMON S
41 961823205044 PRAVEENKUMAR N
42 961823205045 PRUJITH T K
43 961823205046 RAHIN A M
44 961823205047 RETHEESH R
961823205048 RITHICK ROHAN R C

45

46 961823205049 SABARI NATH B V

47 961823205050 SAJITH M
48 961823205051 SANGEETHA M
49 961823205052 SANJAY JACOB
50 961823205053 SARANYA S
51 961823205054 SARAVANAN M
52 961823205055 SHAM LIYANES J
53 961823205056 SHIJU N
54 961823205057 SHIJU S
55 961823205058 SOWNDARYA C
56 961823205059 SRIVIN S K
57 961823205060 THANU D
58 961823205061 VIBINESH R S
59 961823205062 VIBIN JOSEPH D
60 961823205063 VIGNESHWARAN K
61 961823205301 JELIL ROSHAN.J
 PONJESLY COLLEGE OF ENGINEERING
DEPARTMENT OF INFORMATION TECHNOLOGY

Describe operating system functions.

Describe objectives of operating Systems.
What is system call? Discuss the types ofsystem calls
List and briefly describe types of operatingsystems?
Discuss Evolutions of operating system?
What is difference between a program and a process?Explain the process state diagram
What is a Scheduler? Describe different CPUSchedulers
What is the need for inter process communication?Explain how inter process communication takes place
Discuss the FCFS and Priority CPU schedulingalgorithms with a suitable example
Discuss Multithreading Models with neat diagrams
Discuss the SJF and Round robin CPU schedulingalgorithms with a suitable example
Explain about resource allocation graph in deadlocks
Explain in detail about recovery from deadlock
Explain Components of a Computer.
Explain User Interface and its types?
Explain FCFS with an example.
Explain SJF with an example.
Explain SRTF with an example
Explain Classic problems of Synchronization
Explain deadlock detection algorithm.
Explain in detail about System Program
Explain in detail about semaphores.
Explain in detail about threading issues
Explain in detail about operation on Processes
Explain in detail about monitors
Explain in detail about deadlock avoidance
Explain in detail about contiguous memory allocation
Explain in detail about paging with an example.
Explain in detail about Structure of Pagetable.
Draw the diagram PCB and explain each of its content?
What is Time-Sharing Operating Systems? Give its advantages and disadvantages?
Explain the concept of Swapping
Explain the elements of computer System
Explain in detail about mutex?
Explain the design and implementation of OS
Explain the steps to handle pagefault.
Explain Structuring methods in OS
Explain in detail about process sychronization
Explain in detail about synchronization hardware
Explain CPU-bound and I/o bound process.
What is Time-Sharing Operating Systems? Give its advantages and disadvantages?
What is Real time Operating System ? Give its advantages and disadvantages?
What is Batch Operating System? Give its advantages and disadvantages?
Explain in detail about message passing system
Consider the set of 5 processes whose arrival time and burst time are given below-
Process Id
P1
P2
P3
P4
P5
If the CPU scheduling policy is Round Robin with time quantum = 2 unit, calculate the average waiting time and aver
Explain user level thread and kernel level thread.
Consider the set of 5 processes whose arrival time and burst time are given below-
Process Id
P1
P2
P3
P4
P5
Explain logical versus physical address space.
Create and explain timeline for history of operating system ?
Explain why OS called as resource allocator?
Compare multiprocessor and multiprogramming in detail
Explain in detail about multilevel queue scheduling
What is Distributed Operating Systems? Give its advantages and disadvantages?
Explain Preemptive priority with an example.
Explain in detail about Remote Procedure call
Explain Round robin with an example
Explain in detail about process control block
Explain in detail about Symmetric multiprocessing.
Explain in detail about dinning philosopher Problem
Explain the history of operating Systems
Explain in detail about deadlock detection
Explain in detail about producer-consumer problem
 Arrival Burst
time time
0 5
1 3
2 1
3 2
4 3
g time and average turn around time.

Arrival Burst If the CPU scheduling policy is FCFS, calculate the average waiting time and average turn around
time time
3 4
5 3
0 2
5 1
4 3
me and average turn around time.
S.NO REGISTER NO STUDENT NAME
1 961823205001 AAKASH T
2 961823205002 ABINESH M L

3 961823205003 ABISHA S
4 961823205004 ABISH KUMAR R K
5 961823205005 ADLIN BERNISHA S
6 961823205006 AHIL ROY R
7 961823205007 AHMAD HASAN N

8 961823205008 AJAY K S
9 961823205009 AJAY S
10 961823205010 ANIRUDH S

11 961823205011 ANLIN LINISHA K

12 961823205014 ASHIK M
13 961823205015 ATHISHA S
14 961823205016 AYMAN A
15 961823205017 BARAKATH SHAFIN R
16 961823205018 BHARATH SINGH S R
17 961823205019 CHRISTON THOMAS T J
18 961823205020 DANIEL SANJAY T
19 961823205021 DISHON SAM D
20 961823205022 FATHIMA SANA M
21 961823205023 GOKUL T S

22 961823205024 HUTSON THOMAS T J

23 961823205025 JAI FRANKLIN B
24 961823205026 JASHALIN J
25 961823205027 JASLIN SIBI J S
26 961823205028 JEHILIN J K LIMSHEKHA
27 961823205029 JERICO GRIS G B
28 961823205030 JERISH M
29 961823205031 JESU ANIS KUMAR A
30 961823205032 JINSU J
31 961823205033 JINU ASHLY J
32 961823205035 JOYCE JERUSSA A
33 961823205036 KARTHIK A K
34 961823205037 KELVIN JOHN M

35 961823205038 MANIKANDAN I
36 961823205039 MANO RITA S P
37 961823205040 MOHAMED BAASIL S
38 961823205041 MONISH R
39 961823205042 NAVISHMA D R
40 961823205043 PON JESWIN SALOMON S
41 961823205044 PRAVEENKUMAR N
42 961823205045 PRUJITH T K
43 961823205046 RAHIN A M
44 961823205047 RETHEESH R
45 961823205048 RITHICK ROHAN R C
46 961823205049 SABARI NATH B V

52 961823205055 SHAM LIYANES J

53 961823205056 SHIJU N
54 961823205057 SHIJU S
55 961823205058 SOWNDARYA C

60 961823205063 VIGNESHWARAN K
61 961823205301 JELIL ROSHAN.J
 PONJESLY COLLEGE OF ENGINEERING
DEPARTMENT OF INFORMATION TECHNOLOGY

Explain in detail about Virtual Memory

Explain Page Replacement Algorithm

Consider a reference string: 4, 7, 6, 1, 7, 6, 1, 2, 7, 2. the number of frames in the memory is 3. Find out the number of page fa
Explain in detail about fragmentation
Explain in detail about free space management
Explain indetail about demand paging
Consider the following page reference string: 1, 2, 3, 4, 2, 1, 5,6, 2, 1, 2, 3, 7, 6, 3, 2, 1, 2, 3, 6.Identify the no.of page faults wou

Consider a disk with 200 tracks and the queue has random requests from different processes in the order:55, 58, 39, 18, 90, 16
length using FIFO
Explain memory allocation in detail
Explain in detail about Application I/O interface

Consider the Segment table Which of the following logical address will produce trap addressing error?

0, 430
1, 11
2, 100
3, 425
4, 95

Calculate the physical address if no trap is produced.

Explain Segmetation with paging

Explain in detail about I/O subsystem of kernel
Explain about Disk Storage and Disk Structures in detail.
Explain about Disk Management
Explain the architecture of iOS. Discuss the media and Service layers
Consider a reference string: 4, 7, 6, 1, 7, 6, 1, 2, 7, 2. the number of frames in the memory is 3. Find out the number of page fa
consider the request sequence for disk scheduling as 82, 170, 43, 140, 24, 16 and 190 and current position of head at 50. Find
consider the request sequence for disk scheduling as 82, 170, 43, 140, 24, 16 and 190 and current position of head at 50. Find
Explain I/O Systems in detail.
Explain in detail about iOS file system

consider the request sequence for disk scheduling as 82, 170, 43, 140, 24, 16 and 190 and current position of head at 50. Find
Explain in detail about iOS Kernel Architecture
Explain in detail about Model-View Controller
Consider a disk with 200 tracks and the queue has random requests from different processes in the order:55, 58, 39, 18, 90, 16
length using CLOOK
consider the request sequence for disk scheduling as 82, 170, 43, 140, 24, 16 and 190 and current position of head at 50. Find
Discuss Disk Scheduling algorithms in detail
Consider a disk with 200 tracks and the queue has random requests from different processes in the order:55, 58, 39, 18, 90, 16
length using SCAN
Explain the benefits and features of virtual Machine
consider
Consider the request
a disk sequence
with 200 tracks for
anddisk
thescheduling
queue has as 82, 170,
random 43, 140,
requests 24,different
from 16 and processes
190 and current
in the position
order:55,of58,
head
39,at18,
50.90,
Find
16
length using SSTF
Explain the System model of Virtual machine
Explain about Files and its types in detail
Explain CLOOK disk scheduling algorithm with example

A certain computer system has the segmented paging architecture for virtual memory. The memory is byte addressa
216 bytes each. The virtual address space is divided into 8 non-overlapping equal size segments. The memory mana
entry of which contains the physical address of the page table for the segment. Page tables are stored in the main m
that each page table entry contains (besides other information) 1 valid bit, 3 bits for page protection and 1 dirty bit. H
the aging information for the page? Assume that page size is 512 bytes.
Explain the types of virtual machine and their implementations
Explain LOOK disk scheduling algorithm with example
Explain the building blocks of an Virtual Machine
Explain in detail the operating system aspects of virtualization
With neat diagram explain Android process hierarchy
Explain in detail about thrashing
Explain FIFO page replacement algorithm with example
Explain Optimal page replacement algorithm with example
Explain LRU page replacement algorithm with example
Consider the following page reference string: 1, 2, 3, 4, 2, 1, 5,6, 2, 1, 2, 3, 7, 6, 3, 2, 1, 2, 3, 6.Identify the no.of page faults wou
Explain FCFS disk scheduling with example

Consider
Consider aa disk
reference string:
with 200 4, 7,and
tracks 6, 1,
the7,queue
6, 1, 2,has
7, 2. the number
random of frames
requests in the memory
from different is 3.
processes inFind out the number
the order:55, 58, 39,of page
18, 90, fa
16
length using LOOK

Consider the following page reference string: 1, 2, 3, 4, 2, 1, 5,6, 2, 1, 2, 3, 7, 6, 3, 2, 1, 2, 3, 6.Identify the no.of page faults wou
Expain SCAN scheduling with example

Explain CSCAN scheduling with example

Explain about file system mounting in detail.
ssuming one, two, three, four, frames? Remember all frames are initially empty,so your first unique pages will all cost one fault each using
ssuming one, two, three, four, frames? Remember all frames are initially empty,so your first unique pages will all cost one fault each using

ssuming one, two, three, four, frames? Remember all frames are initially empty,so your first unique pages will all cost one fault each using
will all cost one fault each using FIFO
will all cost one fault each using LRU

will all cost one fault each using Optimal