Exam Details
| Subject | operating systems | |
| Paper | ||
| Exam / Course | b.e.(computer science and engineering) | |
| Department | ||
| Organization | SETHU INSTITUTE OF TECHNOLOGY | |
| Position | ||
| Exam Date | May, 2017 | |
| City, State | tamil nadu, pulloor |
Question Paper
Reg. No.
B.E. B.Tech. DEGREE EXAMINATION, MAY 2017
Third Semester
Computer Science and Engineering
01UCS305 OPERATING SYSTEMS
(Regulation 2013)
Duration: Three hours Maximum: 100 Marks
Answer ALL Questions.
PART A (10 x 2 20 Marks)
1. What do you mean by Time-Sharing systems?
2. What is system call? Give examples.
3. What is busy waiting? Is it preferable over blocking wait? Give reason.
4. Give two hardware instructions and their definitions which can be used for implementing mutual exclusion.
5. What is Belady's anomaly?
6. Write the impacts in choosing page size.
7. In indexed allocation scheme, how can the index blocks be implemented? Mention the advantages of indexed allocation scheme.
8. What is disk stripping?
9. Define rotational latency and disk bandwidth?
10. Write down the contents present in the registration table of Linux kernel.
PART B x 16 80 Marks)
11. Explain in detail about inter process communication and threading issues.
Or
Question Paper Code: 31235
2
31235
Discuss about the services provided by the operating system. What are the different types of Multithreading models? Explain. 12. Explain how an operating system controls the processes and manage the resources for processes. With a help of diagram discuss the structure of a monitor. Or Explain the FCFS, preemption and non-preemption versions of shortest job first and round robin (time slice scheduling algorithm with gant chart for the four process given and compare their average turn around time and waiting time.
Process
Arrival Time
Burst Time
P1
0
8
P2
1
4
P3
2
9
P4
3
5
13. Give the basic concepts about paging and give a note on techniques for structuring the page table. Or Discuss the hardware support for segmentation and explain the mapping of logical address to physical address.
14. Enumerate why file protection is necessary? Write notes about the protection strategies provided for files. Or Discuss about different types of disk scheduling algorithm.
15. Outline the concept kernel I/O subsystem. Or
With a neat diagram explain the system components of Windows 2000.
B.E. B.Tech. DEGREE EXAMINATION, MAY 2017
Third Semester
Computer Science and Engineering
01UCS305 OPERATING SYSTEMS
(Regulation 2013)
Duration: Three hours Maximum: 100 Marks
Answer ALL Questions.
PART A (10 x 2 20 Marks)
1. What do you mean by Time-Sharing systems?
2. What is system call? Give examples.
3. What is busy waiting? Is it preferable over blocking wait? Give reason.
4. Give two hardware instructions and their definitions which can be used for implementing mutual exclusion.
5. What is Belady's anomaly?
6. Write the impacts in choosing page size.
7. In indexed allocation scheme, how can the index blocks be implemented? Mention the advantages of indexed allocation scheme.
8. What is disk stripping?
9. Define rotational latency and disk bandwidth?
10. Write down the contents present in the registration table of Linux kernel.
PART B x 16 80 Marks)
11. Explain in detail about inter process communication and threading issues.
Or
Question Paper Code: 31235
2
31235
Discuss about the services provided by the operating system. What are the different types of Multithreading models? Explain. 12. Explain how an operating system controls the processes and manage the resources for processes. With a help of diagram discuss the structure of a monitor. Or Explain the FCFS, preemption and non-preemption versions of shortest job first and round robin (time slice scheduling algorithm with gant chart for the four process given and compare their average turn around time and waiting time.
Process
Arrival Time
Burst Time
P1
0
8
P2
1
4
P3
2
9
P4
3
5
13. Give the basic concepts about paging and give a note on techniques for structuring the page table. Or Discuss the hardware support for segmentation and explain the mapping of logical address to physical address.
14. Enumerate why file protection is necessary? Write notes about the protection strategies provided for files. Or Discuss about different types of disk scheduling algorithm.
15. Outline the concept kernel I/O subsystem. Or
With a neat diagram explain the system components of Windows 2000.
Other Question Papers
Subjects
- applied statistics and queuing networks
- artificial intelligence
- building enterprise applications
- c# and .net framework
- cloud computing
- computer communication and networks
- computer networks
- computer organization and architecture
- data structures
- data warehousing and data mining
- database management systems
- database system concepts
- design and analysis of algorithms
- discrete mathematics
- distributed systems
- environmental science and engineering
- fundamentals of information security
- fundamentals of mobile computing
- human computer interaction
- information storage management
- interactive computer graphics
- internet of things
- java programming
- microprocessors and microcontrollers
- multimedia
- object oriented analysis and design
- object oriented programming
- object oriented programming with c++
- operating systems
- principles of compiler design
- probability statistics and queuing systems
- project management and finance
- python programming
- qualitative and quantitative aptitude
- reasoning and quantitative aptitude
- software engineering
- software testing
- theory of computation
- transforms and partial differential equations
- value education and human rights
- web programming