Scribd Logo
Upload

Welcome to Scribd!

  • Full Marks - 30 Time - 3 Hours The Figure in The Margin Indicates The Full Marks For The Questions

    Uploaded by

    Popat Lal
    7 views2 pages
    This document outlines 10 programming questions on operating system concepts for an Information Technology laboratory exam. The questions cover simulating CPU scheduling algorithms like SJF, FCFS, priority and round robin. Memory management algorithms like FIFO and LRU page replacement and Banker's deadlock avoidance are also included. Additionally, the questions require using UNIX system calls to perform file operations like merging, concatenating, reversing, copying and input/output redirection files.

    Original Description:

    Original Title

    OS lab2021

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This document outlines 10 programming questions on operating system concepts for an Information Technology laboratory exam. The questions cover simulating CPU scheduling algorithms like SJF, FCFS, priority and round robin. Memory management algorithms like FIFO and LRU page replacement and Banker's deadlock avoidance are also included. Additionally, the questions require using UNIX system calls to perform file operations like merging, concatenating, reversing, copying and input/output redirection files.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    7 views2 pages

    Full Marks - 30 Time - 3 Hours The Figure in The Margin Indicates The Full Marks For The Questions

    Uploaded by

    Popat Lal
    This document outlines 10 programming questions on operating system concepts for an Information Technology laboratory exam. The questions cover simulating CPU scheduling algorithms like SJF, FCFS, priority and round robin. Memory management algorithms like FIFO and LRU page replacement and Banker's deadlock avoidance are also included. Additionally, the questions require using UNIX system calls to perform file operations like merging, concatenating, reversing, copying and input/output redirection files.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 2

    B.

    Tech/IT-512

    2021

    (March)

    Information Technology

    OPERATING SYSTEM LABORATORY

    ( 5th Semester )

    (New Syllabus)

    Full Marks - 30

    Time – 3 hours

    The figure in the margin indicates the full marks for the questions

    1. (a) Write a program in C to simulate SJF (non-preemptive) process scheduling algorithm.


    20

    (b) Write a program in C using UNIX system call to merge two files to create a new file and
    display the contents of the all three files. 10

    2. (a) Write a program in C to simulate FIFO page replacement algorithm. 20

    (b) Write a program using UNIX system call to create a file and display the contents of the file.
    10

    3. (a) Write a program in C to simulate FCFS CPU scheduling algorithm. 20

    (b) Write a program using UNIX system call to reverse a file and display the contents of the file.
    10

    ..........................................................................................................................................................

    4. (a) Write a program in C to simulate optimal page replacement algorithm. 20

    (b) Write a program using UNIX system call to concatenate two files and display the contents of
    the concatenated file on the standard output. 10
    5. (a) Write a program in C to implement Banker’s deadlock avoidance algorithm. 20

    (b) Write a program using UNIX system call to create a file and display the contents of the file.
    10

    ----------------------------------------------------------------------------------------------------------------------------------

    6. (a) Write a program in C to simulate priority scheduling (non-preemptive) algorithm. 20

    (b) Write a program using UNIX system call to copy a file and display the contents of the both
    files. 10

    -------------------------------------------------------------------------------------------------------------------------------------

    7. (a) Write a program in C to simulate Least Recently Used (LRU) page replacement algorithm.
    20

    (b) Write a program using UNIX system call to reverse a file and display the contents of the file.
    10

    -------------------------------------------------------------------------------------------------------------------------------------
    8. (a) Write a program in C to simulate Round Robin (RR) scheduling algorithm. 20

    (b) Write a program using UNIX system call to take the input from the standard input and
    display it in the standard output. 10

    ------------------------------------------------------------------------------------------------------------------------------------

    9. (a) Write a program in C to simulate priority scheduling (non-preemptive) algorithm. 20

    (b) Write a program using UNIX system call to merge two files and display the contents of the
    merged file.
    10

    --------------------------------------------------------------------------------------------------------------------------------------

    10. (a) Write a program in C to implement Banker’s deadlock avoidance algorithm. 20

    (b) Write a program using UNIX system call to take the input from the standard input and
    store it in a file and display the contents of the file. 10

    You might also like