Skip to content
SmartFigureEdu

CS 3451 Introduction to Operating Systems question paper, April/May 2023

Download PDFRepeated questions and unit-wise bank

Question Paper Code : 30122

B.E./B.Tech. DEGREE EXAMINATIONS, APRIL/MAY 2023.

Fourth Semester

Computer Science and Engineering

CS 3451 — INTRODUCTION TO OPERATING SYSTEMS

(Common to : Information Technology)

(Regulations 2021)

Time : Three hoursMaximum : 100 marks

Answer ALL questions.

PART A — (10 × 2 = 20 marks)

  1. 1.

    Define operating system.

  2. 2.

    List the services of OS.

  3. 3.

    State the critical section problem.

  4. 4.

    Name the four conditions for deadlock.

  5. 5.

    What is swapping?

  6. 6.

    Define thrashing.

  7. 7.

    What is a sequential-access file?

  8. 8.

    Define an immutable shared file.

  9. 9.

    What is a virtual machine?

  10. 10.

    Write a note on Android.

PART B — (5 × 13 = 65 marks)

  1. 11.
    (a)

    Explain the functions performed by an operating system.

  2. Or
  3. (b)

    What is a system call? Elaborate on the types of system calls.

  4. 12.
    (a)
    • (i)With a neat sketch, explain the different states of a process.(5)
    • (ii)How process synchronization is achieved using semaphores? Give an example.(8)
  5. Or
  6. (b)

    Write Bankers algorithm for deadlock avoidance. Explain with an example.

  7. 13.
    (a)

    What is paging? Elaborate paging with an example and a diagram.

  8. Or
  9. (b)

    Explain first-in, first-out page replacement algorithm and optimal page replacement algorithm with an example and diagrams.

  10. 14.
    (a)

    What is a directory? Outline a tree-structured directory structure and an acyclic-graph directory structure with appropriate examples.

  11. Or
  12. (b)

    Explain contiguous allocation and linked allocation of disk space with an examples.

  13. 15.
    (a)

    Present an outline of the types of virtual machines. Explain in detail.

  14. Or
  15. (b)

    Outline the operating system aspects of virtualization in the context of operating system functions scheduling, I/O and memory management.

PART C — (1 × 15 = 15 marks)

  1. 16.
    (a)

    Consider the following five processes that arrive at time 0, with the length of the CPU burst time given in milliseconds. [Table: Process - CPU BURST TIME: P1 10, P2 29, P3 3, P4 7, P5 12] Consider the First Cum First Serve (FCFS), non-preemptive Shortest Job First (SJF), Round Robin (RR) (quantum = 10 milliseconds) scheduling algorithms. Illustrate the scheduling using Gantt chart. Which algorithm will give the minimum average waiting time?

  2. Or
  3. (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 pointer is initially at cylinder 53. Outline first-come, first served disk scheduling algorithm, SCAN disk scheduling algorithm and shortest-seek- time-first disk scheduling algorithm with a diagram.

Other CS3451 papers