Ise Os Ty 2021 Co

(Autonomous College Affiliated to University of Mumbai)
Semester: August – December 2021

In-Semester Examination
Class: TY B. Tech
Branch: EXTC Semester: V
Full name of the course:Operating system Course Code: 2UTE513
Duration: 1hr.15 min (attempting questions) Max. Marks: 30
+15 min (uploading)
Q. Questions Marks CO
No Mapped
Q1 Multiple choice questions:--
1.1) A system contains three programs and each requires three tape
units for its operation. The minimum number of tape units which
the system must have such that deadlocks never arise is
_________.
a) 6 b) 7 c) 8 d) 9
1.2) Which of the following statements are true?

I Shortest remaining time first scheduling may cause
starvation
II. Preemptive scheduling may cause starvation
III. Round robin is better than FCFS in terms of response
time
a) I only
b) I and III only
c) II and III only.
CO1,CO2
d) I, II and III 10 marks
1.3) Two processes, P1 and P2, need to access a critical section of (1 MARK
code. Consider the following synchronization construct used by EACH)
the processes:
/* P1 */ /* P2 */
while (true) { while (true) {
wants1 = true; wants2 = true;
while (wants2 == true); while (wants1==true);
/* Critical /* Critical
Section */ Section */
wants1=false; wants2 = false;
} }
/* Remainder section */ /* Remainder section */
Here, wants1 and wants2 are shared variables, which are

initialized to false. Which one of the following statements is
TRUE about the above construct?
a) It does not ensure mutual exclusion.
b) It does not ensure bounded waiting.
c) It requires that processes enter the critical section in strict
alternation.
d) It does not prevent deadlocks, but ensures mutual exclusion.
1.4) A thread is usually defined as a “light weight process” because

an operating system (OS) maintains smaller data structures for a
thread than for a process. In relation to this, which of the
following is TRUE?
a) On per-thread basis, the OS maintains only CPU register

state.
b) The OS does not maintain a separate stack for each thread
c) On per-thread basis, the OS does not maintain virtual

memory state.
d) On per-thread basis, the OS maintains only scheduling and
accounting information.
1.5) Which of the following is FALSE?

a) Context switch time is longer for kernel level threads than for user
level threads
b) User level threads do not need any hardware support
c) Related kernel level threads can be scheduled on different processors
in a multiprocessor system.
d) Blocking one kernel level thread blocks all other related threads.
1.6) Which one of the following is the address generated by CPU?

a) Physical address
b) Absolute address
c) Logical address
d) Index address
1.7) A solution to the problem of external fragmentation is:

a) Larger memory space
b) Compaction
c) Smaller memory space
d) Extraction.
1.8) The model in which one kernel thread is mapped to many user-
level threads is called :
a) Many to One model
b) One to Many model
c) Many to Many model
d) One to One model.
2. 1.9) The degree of multi-programming is :
a) the number of processes executed per unit time
b) the number of processes in the ready queue
c) the number of processes in the I/O queue
d) the number of processes in memory.
1.10) A semaphore is a shared integer variable

a) that cannot drop below zero
b) that cannot be more than zero
c) that cannot drop below one
d) that cannot be more than one
Q2 Consider the following snapshot:-
Process Allocation Max Available

A B C D A B C A B C D
D
P0 0 0 1 2 0 0 1 2 1 5 2 0
P1 1 0 0 0 1 7 5 0
P2 1 3 5 4 2 3 5 6 10 marks CO3
P3 0 6 3 2 0 6 5 2
P4 0 0 1 4 0 6 5 6
Answer the following questions using bankers algorithm :-

a) What is the content of the matrix Need.
b) Is the system in a safe state ?
c) If a request from process P1 arrives for(0,4,2,0), can the request
be granted immediately?
Q3 Answer any two:

a) Explain types of multithreading models in brief. CO1,CO2
b) Explain Peterson’s Solution for process synchronization. 10 marks
c) What is a counting and binary Semaphore? 5 marks
d) Compare and contrast between Monolithic and Microkernel. each

Ise Os Ty 2021 Co

Uploaded by

Copyright:

Available Formats

Ise Os Ty 2021 Co

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Ise Os Ty 2021 Co

Uploaded by

Copyright:

Available Formats

(Autonomous College Affiliated to University of Mumbai)

Semester: August – December 2021

1.2) Which of the following statements are true?

Here, wants1 and wants2 are shared variables, which are

1.4) A thread is usually defined as a “light weight process” because

a) On per-thread basis, the OS maintains only CPU register

c) On per-thread basis, the OS does not maintain virtual

1.5) Which of the following is FALSE?

1.6) Which one of the following is the address generated by CPU?

1.7) A solution to the problem of external fragmentation is:

1.10) A semaphore is a shared integer variable

Q2 Consider the following snapshot:-

Process Allocation Max Available

Answer the following questions using bankers algorithm :-

Q3 Answer any two:

You might also like