Scribd Logo
Upload

Welcome to Scribd!

  • 1 views

    B11 B12 B13 E11 E12 E13 Operating System TEE

    Uploaded by

    shashwatchandra70

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd

    B11 B12 B13 E11 E12 E13 Operating System TEE

    Uploaded by

    shashwatchandra70
    1 views3 pages

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    1 views3 pages

    B11 B12 B13 E11 E12 E13 Operating System TEE

    Uploaded by

    shashwatchandra70

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    You are on page 1of 3

    Reg. No.

    :
    Name :

    TERM END EXAMINATIONS (TEE) – March 2022


    Programme : B.Tech. Cyber Security (BCY) Semester : Winter Inter Phase- I 2021-22
    Course Name : Operating System Course Code : CSE3003
    B11+B12+B13+E11+E12+E13/
    Faculty Name : Dr. Abha Trivedi Slot / Class No :
    0079
    Time : 1½ hours Max. Marks : 50

    Answer ALL the Questions

    Q. No. Question Description Marks

    PART - A ( 30 Marks)
    1 (a) Give reasons why cache memory is useful. What problems do it solve? If a catch can be 10
    made as large as the device for which it is catching why not make it that large and eliminate
    the device?
    OR

    (b) Do the following algorithms of “Readers/Writers Critical section problem” satisfy Mutual 10
    Exclusion, Progress and Bounded Wait? Justify, if yes or if no; (if no how the algorithm
    can be improved to achieve them).
    Readers Algorithm Writers Algorithm

    wait(wrt); wait(wrt);

    -----read------ -----read------

    signal(wrt); signal(wrt);

    2 (a) At certain time t, the state of the system is as given below with their maximum need and 10
    Allocation of resources:

    Process Max Allocation


    A B C A B C
    P0 5 2 4 2 1 1
    P1 2 7 0 0 3 0
    P2 0 3 6 0 1 4

    In the system, total available resources of type A, B and C are 5, 7 and 7. Using Banker’s
    algorithm, answer the following:

    Page 1 of 3
    a) Determine whether the system is in safe state or not? If it is, find the safe sequence.
    b) Let’s say, now process P0 requested for resources A, B, C as 1, 1, 2. The request
    should be granted or not? Justify

    OR

    (b) For the following set of process find average turnaround time, waiting time and response 10
    time using Gantt chart:
    a) Preemptive SJF Scheduling (SRTF)
    Process No. Arrival Time Burst Time
    P1 5 10
    P2 3 5
    P3 0 18
    P4 6 4

    b) Preemptive Priority Scheduling (Lower the number- higher the priority)


    Priority Process No. Arrival Time Burst Time
    3 P1 5 10
    1 P2 3 5
    4 P3 0 5
    2 P4 4 6

    3 (a) The queue of requests for the disk access with 200 tracks by the processes is: 10
    80, 180, 22, 163, 112, 50, 11, 135
    Current head position is 70. What is the total head movement needed to satisfy the requests
    for the following Scheduling algorithms SSTF and C-SCAN (for C-SCAN, R/W head
    initiate its movement towards the increasing track number)?

    OR
    (b) Differentiate between 10
    i) Interrupt driven I/O and DMA
    ii) Reposition, Delete and Truncate file operations

    PART - B (20 Marks)


    10

    4 Apply your understanding to show the CPU switching sequence between two processes
    (P1 and P2) with the help of a neat and clear diagram. Also, illustrate the use of PCB during
    the switching process.

    10

    Page 2 of 3
    5 You are using Dynamic Contiguous Memory Allocation (DCMA) with a memory user
    space of 2000K. These are the processes P1=402K, P2=327K, P3=112K, P4=526K and
    P5=278 K arrived. Allocation should be done in the given order of arrival. Answer the
    following questions:

    a) Show the allocation and leftover memory space


    b) P6=245K arrived, can it be allocated? If yes where and how much will be the
    leftover memory space now.
    c) Let’s say, P3 and P5 left (emptied the location). P7=75K arrived, where it can be
    accommodated among all the free spaces if using First Fit, Best Fit and Worst Fit?
    (show separate diagram for each).
    d) After allocation done in (c), with whichever scheme, if P8=280K arrived will it lead
    to internal fragmentation or external fragmentation

    

    Page 3 of 3

    You might also like