Exam Details
Subject | operating systems | |
Paper | ||
Exam / Course | mca | |
Department | ||
Organization | acharya nagarjuna university-distance education | |
Position | ||
Exam Date | May, 2017 | |
City, State | new delhi, new delhi |
Question Paper
M.C.A. DEGREE EXAMINATION, MAY 2017
First Year
Operating Systems
Time 3 Hours Maximum Marks 70
Section A
Answer any three questions × 15 45]
Q1) What are the system components of operating system and explain each of them in detail.
Q2) Consider the following set of processes with length of CPU burst time and arrival time
given in milliseconds
Process Burst Time Arrival Time
P1 5 1.5
P2 1 0
P3 2 2
P4 4 3
Illustrate the execution of these processes using FCFS, SJF CPU scheduling algorithms.
Also calculate wait time, turn around time for each process. Also calculate Average
waiting time, average turn around time for above situation.
Q3) Explain about the techniques for structuring the page table.
Q4) What is meant by RAID levels? Which level is used for what purpose?
Q5) Discuss various security issues in modern operating system.
Section B
Answer any five questions × 4 20]
Q6) Describe batch processing and multi processor operating systems.
Q7) Write about process state model with state diagram.
Q8) Briefly explain about long and short term scheduling.
Q9) Explain the schemes for defining the logical structure of a directory.
Q10) Explain necessary condition for deadlock to occur?
Q11) State critical section problem. Describe the basic requirements of critical section problem
solution.
Q12) Write short demand paging.
Q13) Explain the classic problems of synchronization.
Section C
Answer all questions × 1
Q14) Define thread.
Q15) Define semaphore.
Q16) What is virtual memory?
Q17) Define page fault.
Q18) Define worm and virus.
First Year
Operating Systems
Time 3 Hours Maximum Marks 70
Section A
Answer any three questions × 15 45]
Q1) What are the system components of operating system and explain each of them in detail.
Q2) Consider the following set of processes with length of CPU burst time and arrival time
given in milliseconds
Process Burst Time Arrival Time
P1 5 1.5
P2 1 0
P3 2 2
P4 4 3
Illustrate the execution of these processes using FCFS, SJF CPU scheduling algorithms.
Also calculate wait time, turn around time for each process. Also calculate Average
waiting time, average turn around time for above situation.
Q3) Explain about the techniques for structuring the page table.
Q4) What is meant by RAID levels? Which level is used for what purpose?
Q5) Discuss various security issues in modern operating system.
Section B
Answer any five questions × 4 20]
Q6) Describe batch processing and multi processor operating systems.
Q7) Write about process state model with state diagram.
Q8) Briefly explain about long and short term scheduling.
Q9) Explain the schemes for defining the logical structure of a directory.
Q10) Explain necessary condition for deadlock to occur?
Q11) State critical section problem. Describe the basic requirements of critical section problem
solution.
Q12) Write short demand paging.
Q13) Explain the classic problems of synchronization.
Section C
Answer all questions × 1
Q14) Define thread.
Q15) Define semaphore.
Q16) What is virtual memory?
Q17) Define page fault.
Q18) Define worm and virus.
Subjects
- accounts & finance
- computer algorithms
- computer graphics
- computer networking
- computer organization
- data base management systems
- data structures
- discrete mathematics
- distributed operating systems
- e-commerce
- information technology
- operating systems
- probability and statistics
- programming with c++
- programming with java
- software engineering