Scribd
Upload
6 views

os model

This document is a question paper for the B.E./B.Tech. degree examination in April 2024 for the fourth semester, covering the subject of Operating Systems. It includes three parts: Part A with short answer questions, Part B with detailed questions on various operating system concepts, and Part C with scheduling algorithms and disk scheduling. The paper is intended for students in Computer Science, Information Technology, and Artificial Intelligence & Data Science programs.

Uploaded by

Madhu
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
6 views

os model

This document is a question paper for the B.E./B.Tech. degree examination in April 2024 for the fourth semester, covering the subject of Operating Systems. It includes three parts: Part A with short answer questions, Part B with detailed questions on various operating system concepts, and Part C with scheduling algorithms and disk scheduling. The paper is intended for students in Computer Science, Information Technology, and Artificial Intelligence & Data Science programs.

Uploaded by

Madhu
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 3

Question Paper Set: A

VARUVAN VADIVELAN INSTITUTE OF TECHNOLOGY


DHARMAPURI - 636 703

B.E./B.Tech. DEGREE MODE EXAMINATION, APRIL – 2024

Fourth Semester

Common to CSE / IT/ AI & DS

Sub. Code: CS3451/AL3452 / Title: Introduction to operating systems / Operating Systems

(Regulations 2021)

DATE : .0.2024 Maximum: 100 marks

PART – A (10 x 2 = 20 marks)

1. Define operating systems .


2. List the services operating systems.
3. State the critical section problem.
4. Name the four condition for dead lock.
5. What is swapping ?
6. What do you meant by threading?
7. What is a sequential access file ?.
8. Define an immutable shared file.
9. What is a virtual machine?.
10. Write a note on android.

PART – B (5 x 13 = 65 marks)

11. a. Explain the functions performance by an evolution of operating system


(Or)
b. What is a system call? Elaborate on the types of system calls.

12. (a) (i) With a neat sketch, explain the different states of a process. (5)

(ii) How process synchronization is achieved using semaphores? An example. (8)


(Or)

(b) Write Bankers algorithm for deadlock avoidance. Example with an example. (13)

13. (a) What is paging with an example and a diagram (13)


(Or)
(b) Explain first –in, first-out page replacement algorithm and optimal page
replacement algorithm with an example and diagrams. (13)

14. (a) What is a directory? Outline a tree – structured directory structure and an acyclic
– graph directory structure with appropriate examples. (13)
(Or)
(b) Explain contiguous allocation and linked allocation of disk space with an example.
(13)
15. (a) Present an outline of the types of virtual machines Explain in detail. (13)
(Or)

(b)Outline the operating system aspects of virtualization in the context of operating


system function scheduling . I/O and memory management. (13)

PART – C (1 x 15 = 15 marks)

16. (a) Explain the FCFS, preemptive and non-preemptive versions of Shortest-Job First
and Round Robin (time slice = 10) scheduling algorithms with Gantt charts for the four
Processes given. Compare their average waiting time. (15)

Process Burst Time


P1 10
P2 29
P3 3
P4 7
P5 12
(Or)

(b) Consider a disk queue with requests for I/O to blocks on cylinders in the following
order:98, 183, 37, 122, 14, 124, 65, 67

The disk head pointe4r in initially at cylinder 53. Outline first – come first served disk
scheduling algorithm, SCAN disk scheduling and shortest- seek – time -first disk scheduling
algorithm with a diagram (15)

You might also like