Operating System (March-2023)

Maulana Azad National Urdu University M.C.A I Semester Examination, March 2023 Paper - MMCA113PCT : Operating System

6 M , ì

Ä : p 6 ,

Time : 3 hrs Marks : 70

@ c Z

* ] :

» V ß Z Î Ð V ” x Ó X ì è S g  á Z Š Z ® Å V / n Æ [ Z Ž C Ù X x Î z Ô zx Š z Ô w Zz z : ì Œ 6 , V ” & ] Ñ Z Î p ! 6 , t

Ž Z

Š [ b i Ñ ì ò X ì

C X Ù Z Î

Æ w ò i Ñ [ Z Ž » w Z Î C Ù X  ] Ñ Z Î á zZ [ Z Ž ¿ & * * ™ %æFN ( à { & ] Ñ Z Î è z c ž Ž  ] Ñ Z Î ò i Ñ

¹⁰

~ w Zz z

^.1

(10 x 1 = 10 Marks)

X ì – 

¹

a

V / 6 , ì Œ

X

⁽²⁰⁰⁾

Î z Š ã ½ [ Z Ž » w Z Î C Ù X  ¶ Š [ Z Ž Æ V ß Z Î õ 0 * ð à à D ¨ ( ¤ Ð ~ k ÔZ  ] Ñ Z Î

⁸

~ zx Š z

^.2

(5 x 6 = 30 Marks)

X  – ] Z 

⁶

a Æ w Z Î C Ù

V / 6 ,

ì Œ

⁽⁵⁰⁰⁾

Î õ 0 * ã ½ [ Z Ž » w Z Î C Ù X  ¶ Š [ Z Ž Æ V ß Z Î & ð à à D ¨ ( ¤ Ð ~ k XZ  ] Ñ Z Î

⁵

~ x Î z

^.3

(3 x 10 = 30 Marks)

X  – ] Z 

¹⁰

a Æ w Z Î C Ù

Zz z w

1 :

w Z Î H

ì

?

Context Switch (i)

H ì

?

Time Sharing System (ii)

H ì

?

^{IO Burst (iii)}

H

ì

?

^{Preemption (iv)}

H

ì

?

^{Thrashing (v)}

H

ì

?

^{Mounting (vi)}

H

ì

?

Address Binding (vii)

H ì

?

Response Time (viii)

H ì

?

^{Starvation (ix)}

H

ì

?

Device Controller (x)

z

Š zx

ƒ

@ ì * q XZ - { Æ Å

Š æ

Œ Ð



?

^Data

‚ y à ~ k Z ?  C

^Importance

Å

Process Control Block

X

²

1/3

z Å

Ÿ s

#

X Ù

^semaphores

g Zz

mutual exclusion

~

Interprocess Communication

? ì H

Critical Section

X

³

à ÉÀ

/õG Ÿ

X

^methods

Æ

Deadlock handling

? Ù s # Ÿ z Å

necessary conditions

g Zz

^essential

a Æ

^Deadlock

X

⁴

z Å

Ÿ s

™ #

z?

Directory functions

g Zz

File Space Allocation

? /õG Ÿ ÉÀ

Methods Access

Æ

File handling

X

⁵

z Å

Ÿ s

#

X Ù

architectural models

Æ

^Threads

? Ù ã zZ à t  Û ~

^interrupt

g Zz

System Call

X

⁶

z Å

Ÿ s

#

X Ù

Unix File Security

?  Œ Ã

System Components

Æ

^Linux

g Zz

^Unix

X

⁷

£ ë



?

Block stripping

z? ™ ã zZ Ð Š æ Å V à { Ã

^levels

Z Æ

^RAID

? ì H

^DRAI

X

⁸

~

™ ù D



?

variable partitions

g Zz

Multiprogramming with Fixed

Ã

^Compaction

? ì H

^Compaction

X

⁹

z x Î

Z Ã q - { Æ Å

Š æ z Ð

Ÿ s

™ #



?

Process states

X Ù ã zZ à t  Û ~

^threads

g Zz

^Programs

Ô

^Process

X

¹⁰

w V

Æ

^{Page Table}

g Zz

Segment Table

z? ™ ã zZ à t  Û ~

^paging

g Zz

Segmentation

? ì H

Paging Concept

X

¹¹

B ‚

Œ



?

Š

ƒ ~ ð ì

X

page reference string

s f z g q X

¹²

6 5 8 6 3 4 7 5 0 1 7 1 0 2 7 1 7 0 6 7 5

¥

™ x ,

X

page faults

Æ ™ w E Z »

LRU page replacement algorithm

g Zz

Optimal page replacement

{ ì à

?

Frame initially

g Zz ì

3 Frame size

rount, timeaverage ____

g Zz

average waiting time

Æ ™ w E Z Ã

^data

s f z g q ~ } g ! * Æ

^processes

Z X

¹³

a Æ

X

schedulling algorithums

x Ó X B ï

Round Robin .b SRTF .a

¨ Ã ì K Zz Y g V

?

^algorithm

4 Ð ƒ & X ì

4 second, time quantum

~

round robin Burst time Arrival time Process

12 0 P0

17 1 P1

16 4 P2

7 6 P3

5 7 P4

8 9 P5

2/3

Š c

ƒ * ì Z

X

resource table

~ s f z g Š X

¹⁴

Instances Resource type

5 A

3 B

5 C

3 D

ì

:

^snapshot

q - Z »

^system

~ s f

Max Allocation Process

A B C D A B C D

2 2 1 1 1 1 0 0 P0

1 2 1 2 0 1 1 0 P1

1 1 2 1 1 0 1 1 P2

3 1 2 0 2 1 2 0 P3

2 1 1 0 1 0 1 0 P4

H

ƒ f

?

^contents

Æ

need matrix .I

H ì

?

available vector .ii

H ì

?

safe sequence

Â ì ¤ / ?Z ì ~

^{safe state}

q - Z

^system

H

^.iii /

/ /

3/3