Scribd
Upload
33 views3 pages

OS Qus 2022 B 1

The document outlines the examination structure for the Operating Systems course at Dhanalakshmi Srinivasan College of Arts & Science for women, including multiple-choice questions, short answer questions, and essay-type questions. It covers various topics such as operating system services, process scheduling, page replacement algorithms, and file operations. The exam is designed to assess students' understanding of key concepts in operating systems over a duration of three hours.

Uploaded by

Alamelu
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
33 views3 pages

OS Qus 2022 B 1

The document outlines the examination structure for the Operating Systems course at Dhanalakshmi Srinivasan College of Arts & Science for women, including multiple-choice questions, short answer questions, and essay-type questions. It covers various topics such as operating system services, process scheduling, page replacement algorithms, and file operations. The exam is designed to assess students' understanding of key concepts in operating systems over a duration of three hours.

Uploaded by

Alamelu
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 3

Dhanalakshmi Srinivasan College of Arts & Science for women

(Autonomous),
Perambalur – 621212
(Affiliated to Bharathidasan University)
(Nationally Re-Accredited with ‘A’ Grade by NAAC)

DEPARTMENT OF COMPUTER APPLICAIONS

Pattern - B
OPERATING SYSTEMS

Semester: V Time: 3hrs


Subject code: 18UCS5C11 Max. Marks: 75
Part-A

(10*1=10Marks)
Choose the correct Answer:
1. All modern computer systems that are available provides support for___________.
a) symmetric multiprogramming b) single processor
c) master slave relationship d) symmetric multiprocessing
2. A hard disk with 20 surfaces will have ___________ heads.
a) 10 b) 5 c) 1 d) 20
3. If _______ rule sequences the jobs Orders are processed in the sequence they arrive
a) first come, first served b) critical ratios
c) earliest due date d) lack time remaining
4. Which requested resources are granted with deadlock detection?
a) Resources b) Processes c) Users d) Programs
5. Where the Paging is implemented_________
a) Software b) Operating System c) Hardware d) B and C
6. A process is copied into the main memory from the secondary memory
a) Swapping b) Paging c) Segmentation d) Demand paging
7. A floppy disk is designed to rotate ___________ as compared to a hard disk drive.
a) faster b) slower c) at the same speed d) none of the mentioned
8. A disk that has a boot partition is called as_____________
a) Bad disk b) Boot disk c) Format disk d) Hard disk
9. The UNIX operating system uses?
a) handshaking b) affinity scheduling
c) infinity scheduling d) Fair primitive scheduling
10. The minimum number of links for any directory file?
a)5 b) 6 c) 7 d)2

Part –B

ANSWER ALL THE QUESTIONS (5*7=35)

11. a) Explain operating system services.


b) System Programs
12. a) Discuss about the Process Scheduling.
b) Inter Process .
13. a) Describe about FIFO Page Replacement.
b) What is Performance of demand paging? Explain
14. a) Write a note on File Operations.
b)Illustrate the Indexed Allocation.
15. a) Briefly explain about Program and Process.
b) Discriminate System calls and Library functions.

Part – C

ANSWER ANY THREE QUESTIONS (3*10=30)

19. Define essential properties of the following types of Operating system:


i) Batch operating system
ii) Interactive operating system
iii) Time sharing operating system
iv) Real time operating system
v) Distributed operating system.
20. Describe the Message –Passing Systems.
21. Discuss the following page replacement algorithm with an example.
1. Basic Page Replacement
2. FIFO Page Replacement
3. Optimal Page Replacement
4. LRU Page Replacement
22. Discuss about the Allocation method.
23. Briefly explain about User Identification.

You might also like