Exam Details
Subject | operating system | |
Paper | ||
Exam / Course | m.c.a.commerce | |
Department | ||
Organization | savitribai phule pune university | |
Position | ||
Exam Date | April, 2018 | |
City, State | maharashtra, pune |
Question Paper
Total No. of Questions—5] [Total No. of Printed Pages—3
Seat
No. [5361]-15
M.C.A. (Commerce) (I-Semester) EXAMINATION, 2018
105 OPERATING SYSTEMS
(2008 PATTERN)
Time Three Hours Maximum Marks 80
N.B. All questions are compulsory.
(ii Neat diagrams must be drawn wherever necessary.
1. Attempt any four of the following
What is process Explain process control block in detail.
Explain multiprocessor system.
Explain I/o structure.
What is system call State the system calls provided by the
operating system for the device management.
What are the performance criteria for CPU scheduling algorithms
2. Attempt any four of the following
What is a semaphore What are different types of the
semaphore Explain their usage.
What is Dead lock prevention Explain dead lock prevention
strategies.
What are the different allocation methods used in a file
system Explain any one.
[5361]-15 2
Write a note on Interrupts
Explain Internal and External Fragmentations.
3. Attempt any four of the following
Consider the following snap shot of the system
Job Arrival Time Burst Time
1 1 5
2 0 7
3 3 3
4 2 10
Calculate the average turn around time and total wait time
using non-premptive SJF scheduling algorithm.
Write a note on Direct Access method.
When do page faults occur Describe action taken by the
operating system when a fault occurs.
Explain various types of system programs.
Explain free space management method.
4. Attempt any four of the following
Consider the following reference string
5.
How many page faults will occur for the following algorithms
with 3 page frames
FIFO
LRU.
[5361]-15 3 P.T.O.
Consider the following snapshot of a system. System has 5
processes P0, P1, P2, P3, P4 and resources
Allocation Max Available
A B C D A B C D A B C D
P0 0 0 1 2 0 0 1 2 1 5 2 0
P1 1 0 0 0 1 7 5 0
P2 1 3 5 4 2 3 5 6
P3 0 6 3 2 0 6 5 2
P4 0 0 1 4 0 6 5 6
What are the contents of matrix need
(ii Is the system in safe state.
Explain swapping.
What do you mean by thrashing.
Explain access methods of file system.
5. Attempt any four of the following
What is DMA How does DMA increase system concurrency.
Explain C-SCAN disk scheduling algorithm.
Robin Algorithm is non-pre-emptive'' Comment and justify.
Explain activities performed by operating system in connection
with process management.
Define the following terms
CPU burst cycle
Dead lock
Bit map
Polling.
Seat
No. [5361]-15
M.C.A. (Commerce) (I-Semester) EXAMINATION, 2018
105 OPERATING SYSTEMS
(2008 PATTERN)
Time Three Hours Maximum Marks 80
N.B. All questions are compulsory.
(ii Neat diagrams must be drawn wherever necessary.
1. Attempt any four of the following
What is process Explain process control block in detail.
Explain multiprocessor system.
Explain I/o structure.
What is system call State the system calls provided by the
operating system for the device management.
What are the performance criteria for CPU scheduling algorithms
2. Attempt any four of the following
What is a semaphore What are different types of the
semaphore Explain their usage.
What is Dead lock prevention Explain dead lock prevention
strategies.
What are the different allocation methods used in a file
system Explain any one.
[5361]-15 2
Write a note on Interrupts
Explain Internal and External Fragmentations.
3. Attempt any four of the following
Consider the following snap shot of the system
Job Arrival Time Burst Time
1 1 5
2 0 7
3 3 3
4 2 10
Calculate the average turn around time and total wait time
using non-premptive SJF scheduling algorithm.
Write a note on Direct Access method.
When do page faults occur Describe action taken by the
operating system when a fault occurs.
Explain various types of system programs.
Explain free space management method.
4. Attempt any four of the following
Consider the following reference string
5.
How many page faults will occur for the following algorithms
with 3 page frames
FIFO
LRU.
[5361]-15 3 P.T.O.
Consider the following snapshot of a system. System has 5
processes P0, P1, P2, P3, P4 and resources
Allocation Max Available
A B C D A B C D A B C D
P0 0 0 1 2 0 0 1 2 1 5 2 0
P1 1 0 0 0 1 7 5 0
P2 1 3 5 4 2 3 5 6
P3 0 6 3 2 0 6 5 2
P4 0 0 1 4 0 6 5 6
What are the contents of matrix need
(ii Is the system in safe state.
Explain swapping.
What do you mean by thrashing.
Explain access methods of file system.
5. Attempt any four of the following
What is DMA How does DMA increase system concurrency.
Explain C-SCAN disk scheduling algorithm.
Robin Algorithm is non-pre-emptive'' Comment and justify.
Explain activities performed by operating system in connection
with process management.
Define the following terms
CPU burst cycle
Dead lock
Bit map
Polling.
Other Question Papers
Subjects
- advance java
- advanced database management system
- advanced networking
- advanced operating system
- advanced web programming
- business and professional skills
- business communication
- business strategies
- content management system
- core java
- cyber law and ethics
- data structure using-c
- data warehousing and data mining
- database management system
- distributed database system
- e-commerce practices andtechnologies
- element of statistics
- elements of mathematics
- financial and investment analysis
- fundamental of informationtechnology
- human resource management
- information system audit
- it project management
- knowledge management for business
- m-commerce
- management information system
- mobile communication
- networking operations
- numerical and statistical methods
- oop’s using c++
- operating system
- operating systems
- principles of management
- programming fundamentals : ‘c’ programming
- programming in ‘c’
- relational database management systems
- software engineering
- system analysis and design
- system organisation and management
- system simulation and modeling
- visual programming
- web technologies