Download AKTU B-Tech 5th Sem 2016-2017 Geotechnical Engineering Nce 501 Question Paper

ANURAG GROUP OF INSTITUTIONS

Autonomous

III B.Tech I Semester Regular Examinations Nov/Dec 2023

OPERATING SYSTEMS

--- Content provided by‌ FirstRanker.com ---

(Computer Science and Engineering)

Time: 3 Hours Max. Marks: 70

PART A: Answer all questions. Each question carries 2 marks (10 * 2 = 20 Marks)

1. What are the various services provided by the operating system?
2. Define essential properties of Distributed Operating System.

--- Content provided by⁠ FirstRanker.com ---

3. What is critical section?
4. What is preemptive scheduling?
5. What is thrashing?
6. Define external and internal fragmentation.
7. What is file allocation table?

--- Content provided by‍ FirstRanker.com ---

8. Write short notes on disk management.
9. List out different attributes of file.
10. Write the goals of protection mechanism.

PART B: Answer all questions. Each question carries 10 marks (5 * 10 = 50 Marks)

1. a) What is an Operating System? Explain different types of Operating System. (5M)
   

   --- Content provided by‌ FirstRanker.com ---

   (OR)
   b) Discuss about system calls with examples. (5M)
2. a) Explain about the Peterson's solution for achieving mutual exclusion. (5M)
   (OR)
   b) Discuss about Banker's algorithm for deadlock avoidance. (5M)

--- Content provided by​ FirstRanker.com ---

3. a) What are the different CPU scheduling algorithms? Explain with examples. (5M)
   (OR)
   b) Consider the following set of processes, with the length of the CPU burst time given in milliseconds.
   

   Process	Burst Time	Priority
   P1	10	3
   P2	1	1
   P3	2	4
   P4	1	5
   P5	5	2

   The processes are assumed to have arrived in the order P1, P2, P3, P4, and P5 all at time 0.
   i) Draw Gantt charts illustrating the execution of these processes using FCFS, SJF and priority (A smaller priority number implies a higher priority) scheduling.
   

   --- Content provided by​ FirstRanker.com ---

   ii) What is the turnaround time of each process for each of the scheduling algorithms in part a?
   iii) What is the waiting time of each process for each of the scheduling algorithms in part a?
   iv) Which of the algorithms results in the minimum average waiting time (over all processes)? (5M)
4. a) Explain about paging in detail. (5M)
   (OR)
   

   --- Content provided by​ FirstRanker.com ---

   b) Discuss about various page replacement algorithms. (5M)
5. a) Explain file system implementation in detail. (5M)
   (OR)
   b) Discuss about access matrix and access control list in detail. (5M)

FirstRanker.com

--- Content provided by​ FirstRanker.com ---