Exam Details
| Subject | advanced operating systems | |
| Paper | ||
| Exam / Course | computer science and engineering | |
| Department | ||
| Organization | Vardhaman College Of Engineering | |
| Position | ||
| Exam Date | June, 2017 | |
| City, State | telangana, hyderabad |
Question Paper
Hall Ticket No:
Question Paper Code B2202
(AUTONOMOUS) M. Tech I Semester Supplementary Examinations, June 2017
(Regulations: VCE-R14) ADVANCED OPERATING SYSTEMS
(Computer Science and Engineering) Date: 07 June, 2017 AN
Time: 3 hours
Max Marks: 60
Answer any FIVE Questions
Each Question carries equal marks
1.
What is TCB? Explain the different information associated with a specific process.
7M
What are the advantages and disadvantages of implementing threads in user space and kernel space? A computer system has enough room to hold four programs in its main memory. These programs are idle waiting for I/O half the time. What fraction of the CPU time is wasted?
5M
2.
What are monitors? Explain how to handle producer-consumer problem using monitors.
5M
Five batch jobs A through arrive at a computer center at almost the same time. They have estimated running times of 10, and 8 minutes. Their (externally determined) priorities are and respectively, with 5 being the highest priority. For each of the following scheduling algorithms, determine the mean process turnaround time. Ignore process switching overhead:
v. Round robin
vi. Priority scheduling
vii. First-come, first-served (run in order 10, viii. Shortest job first
For assume that the system is multiprogrammed, and that each job gets its fair share of the CPU. For through assume that only one job at a time runs, until it finishes. All jobs are completely CPU bound.
7M
3.
Discuss deadlock prevention mechanisms.
6M
Explain banker Algorithm to avoid deadlock with multiple instance of resources.
6M
4.
Discuss mechanisms to manage free memory space.
6M
Consider a swapping system in which memory consists of the following hole sizes in memory order: 10 KB, 4 KB, 20 KB, 18 KB, 7 KB, 9 KB, 12 KB, and 15 KB. Which hole is taken for successive segment requests of:
iv. 12 KB
v. 10 KB
vi. 9 KB
for first fit? Now repeat the question for best fit, worst fit, and next fit.
6M
5.
Discuss various directory organizations, their properties and the operations that can be performed on them.
7M
Write a note on Unix file system.
5M
6.
What is transparency? List the different kinds of transparency and explain in detail.
6M
List any two possible failures that occur in RPC system and their possible solutions.
6M
7.
Explain Lamport's algorithm to synchronize the clocks along with illustration.
6M
Discuss Ricart and Agrawala's algorithm to handle mutual exclusion in distributed systems.
6M
8.
List the various strategies used to handle deadlocks in distributed systems.
4M
Draw and discuss any two distributed deadlock prevention algorithms.
8M
Question Paper Code B2202
(AUTONOMOUS) M. Tech I Semester Supplementary Examinations, June 2017
(Regulations: VCE-R14) ADVANCED OPERATING SYSTEMS
(Computer Science and Engineering) Date: 07 June, 2017 AN
Time: 3 hours
Max Marks: 60
Answer any FIVE Questions
Each Question carries equal marks
1.
What is TCB? Explain the different information associated with a specific process.
7M
What are the advantages and disadvantages of implementing threads in user space and kernel space? A computer system has enough room to hold four programs in its main memory. These programs are idle waiting for I/O half the time. What fraction of the CPU time is wasted?
5M
2.
What are monitors? Explain how to handle producer-consumer problem using monitors.
5M
Five batch jobs A through arrive at a computer center at almost the same time. They have estimated running times of 10, and 8 minutes. Their (externally determined) priorities are and respectively, with 5 being the highest priority. For each of the following scheduling algorithms, determine the mean process turnaround time. Ignore process switching overhead:
v. Round robin
vi. Priority scheduling
vii. First-come, first-served (run in order 10, viii. Shortest job first
For assume that the system is multiprogrammed, and that each job gets its fair share of the CPU. For through assume that only one job at a time runs, until it finishes. All jobs are completely CPU bound.
7M
3.
Discuss deadlock prevention mechanisms.
6M
Explain banker Algorithm to avoid deadlock with multiple instance of resources.
6M
4.
Discuss mechanisms to manage free memory space.
6M
Consider a swapping system in which memory consists of the following hole sizes in memory order: 10 KB, 4 KB, 20 KB, 18 KB, 7 KB, 9 KB, 12 KB, and 15 KB. Which hole is taken for successive segment requests of:
iv. 12 KB
v. 10 KB
vi. 9 KB
for first fit? Now repeat the question for best fit, worst fit, and next fit.
6M
5.
Discuss various directory organizations, their properties and the operations that can be performed on them.
7M
Write a note on Unix file system.
5M
6.
What is transparency? List the different kinds of transparency and explain in detail.
6M
List any two possible failures that occur in RPC system and their possible solutions.
6M
7.
Explain Lamport's algorithm to synchronize the clocks along with illustration.
6M
Discuss Ricart and Agrawala's algorithm to handle mutual exclusion in distributed systems.
6M
8.
List the various strategies used to handle deadlocks in distributed systems.
4M
Draw and discuss any two distributed deadlock prevention algorithms.
8M
Other Question Papers
Subjects
- advanced algorithms
- advanced algorithms laboratory
- advanced data communications
- advanced data structures
- advanced data structures laboratory audit course – i
- advanced mechanics of solids
- advanced mechanisms
- advanced operating systems
- advanced operating systems laboratory
- artificial intelligence and neural networks
- business analytics
- cloud computing
- cloud computing laboratory
- cmos vlsi design
- computer graphics
- computer organization and architecture
- computer vision and pattern recognition
- constitution of india
- cpld and fpga architectures and applications
- cryptography and computer security
- data warehousing and data mining
- datawarehousing and data mining
- design patterns
- digital image processing
- digital systems design
- disaster management
- distributed computing
- distributed databases
- distributed operating systems
- dsp processors and architectures
- embedded linux
- embedded real time operating systems
- embedded systems
- energy conversion systems
- english for research papers writing
- entrepreneurship development
- finite element methods
- fracture, fatigue and creep deformation
- human computer interaction
- image processing
- industrial safety
- information retrieval systems
- information security
- machine learning
- major project phase-i
- major project phase-ii
- microcontrollers for embedded system design
- mini project with seminar audit course – ii
- mobile computing
- mobile satellite communications
- national service scheme
- number theory and cryptography
- object oriented analysis and design
- operations research
- pedagogy studies
- personality development through life enlightenment skills
- power electronic control of dc drives
- power electronic converters-i
- power semi conductor devices
- principles of machine modeling analysis
- research methodology and intellectual property rights
- sanskrit for technical knowledge
- semantic web and social networks
- software engineering principles
- solar, energy and applications
- stress management by yoga
- system modeling and simulation
- value education
- waste to energy
- web security
- wireless and mobile computing