SIR ISSAC NEWTON COLLEGE OF ENGINEERING AND TECHNOLOGY

DEPARTMENT OF CSE
REVISION CLASS QUESTION PAPER
CS6401- OPERATING SYSTEMS
NAME:
REG.NO:
UNIT I-OPERATING SYSTEMS OVERVIEW
Q.NO QUESTION
1

Define Operating Systems. Give examples

2
3
4
5
6
7
8
9

Mention the objectives and functions of an operating systems

Mention the advantages in using multiprogramming systems
What you mean by bootstrap program
Define context switch
What is system call? Give the example
What does the CPU do when there are no user programs to run?
What are the main purposes of an OS?
Mention the circumferences that would a user be better off using a timesharing system rather than a PC or a single user workstation ?
Can multiple user level threads achieve better performance on a
multiprocessor system than a single processor system? Justify your answer.
Discuss multiprocessor systems in detail
Explain the purpose and importance of system calls with examples
Explain the purpose of system calls and discuss the calls related to device
management and communications in brief
Explain the concept of virtual machines ,their implementation and benefits in
detail
Discuss the execution of remote procedure call and remote method
innovation with supporting diagrams
Describe an essential properties of different types of operating systems
Total Marks

10
11
12
13
14
15
16

MARKS
MARKS
ALLOTED OBTAINED
2
2
2
2
2
2
2
2
2
2
8
8
8
8
8
15
75

UNIT II-PROCESS MANAGEMENT

Q.NO

QUESTION

MARKS
ALLOTED

Define process, PCB and process states

Define thread. Differentiate user thread and kernel threads. Mention the benefits
of multi-threads
Define deadlocks. List out the situations causing the deadlocks
Define mutual exclusion and semaphore
State difference between preemptive and non preemptive scheduling
Is it possible to having deadlock in only one process? State your answer
Define monitor. What does it consists of?
Define overlay. What is the use of it?
Write the four situations under which CPU scheduling decisions take place .
Show that mutual exclusion may be violated if the signal and wait operations
are not executed automatically
Discuss how scheduling algorithms are selected for a system. What are the
criteria considered ? Explain different evaluation methods
What is meant by critical section problem? Propose a solution based on bakery
algorithm.

3
4
5
6
7
8
9
10
11
12

2
2
2
2
2
2
2
2
12
12

MARKS
OBTAINED

13

Define deadlock. Write about deadlock conditions and bankers algorithm in

detail

16

14

Consider the following system : P0-P4 are 5 processes present and A,B,C,D are
resources .The maximum need of a process and the allocated resources details
are given in the table.

15

Answer the following based on bankers algorithm

1)What is the content of NEED matrix?
2) s the system in a safe state?
3. Which processes may cause deadlock if the file system is not safe.
4) If a request from processes P1 arrives for (0,4,3,1) can the request be granted
immediately? justify.
Total Marks

75

UNIT III-STORAGE MANAGEMENT

Q.NO QUESTION
1

Define segmentation and paging

2
3
4
5
6
7
8

What you mean by demand paging?

What is the use of single continuous memory allocation?
Define thrashing
Define page fault
What you mean by Pure demand paging?
Define dynamic linking and dynamic loading
Consider a logical address space of eight pages of 1024 words ach, mapped
on to a physical memory of 32 frames. Find the number of bits in the logical
address and the physical address.
Define virtual memory.
How can you allocate kernel memory
Explain the concept of segmentation and paging with necessary diagrams
Consider
the
following
page
reference
string:
1,2,3,4,2,1,5,6,1,2,3,7,6,3,2,1,2,3,6 How many page faults would occur for the
LRU, FIFO, LFU and optimal page replacement algorithms assuming two and
five frames?

9
10
11
12

13
14
15

Explain any two structures of the page table with neat diagrams
Discuss about continuous memory allocation
Define page replacement algorithms with suitable examples
Total Marks

MARKS
ALLOTED
2
2
2
2
2
2
2
2
2
3
8
10
12
12
12
75

MARKS
OBTAINED

UNIT IV-I/O SYSTEMS

Q.NO QUESTION

MARKS
ALLOTED
2

Define files and directories

2
3
4
5
6
7
8
9

List any four types of common files and its attributes

Mention idea behind the free space management
What is RAID? Give short notes
Define file mounting and Virtual file system (VFS)
What you mean by swapping?
What is rotational and seek time latency?
Define sharing and mirroring
What are the information contained in a boot control block and partition
control block?
What is meant by polling?
Discuss how file system is implemented in Windows XP
Explain how file system management is done in Linux
Discuss about free space management
Explain the different file access methods in detail
Explain the common schemes for defining the logical structure of a directory
Explain different file allocation methods in detail and mention its advantages
and drawbacks
Total Marks

10
11
12
13
14
15
16

MARKS
OBTAINED

2
2
2
2
2
2
2
2
2
8
8
8
8
8
15
75

UNIT V-CASE STUDY

Q.NO QUESTION
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19

What is the use of LINUX OS? List out the features of LINUX versions
Discuss about UNIX and LINUX OS
What is garbage collection?
Define Virtualization
How can you add the Guest OS to LINUX?
What you mean by Guest OS? Give the examples
How can you setting up the Xen machine?
What you mean by JVM?
Define journalizing
Draw the shared Circular buffer in VM
Explain in detail about java virtual machines garbage collection
How can you map the physical memory? Explain
Discuss the Architecture and components of LINUX Operating systems
Define virtual machine. Explain about virtualization concepts with neat
architecture diagrams.
What is the usage of Guest OS? Briefly discuss about to adding guest
OS to LINUX
Write a brief note on the steps involved in DMA transfer.
Explain the data structures supported by kernel I/O subsystem.
Describe any three disk scheduling algorithms with suitable
illustrations.
Write a brief note on tertiary storage devices.
Total Marks

SUB-INCHARGE

MARKS
ALLOTED
2
2
2
2
2
2
2
2
2
3
5
5
8
8
8
8
8
12
4
75

HOD

MARKS
OBTAINED