0% found this document useful (0 votes)
262 views

CS6401-Operating System PDF

This document contains unit questions and summaries for the Operating Systems course. It includes: 1. 2 mark and 16 mark questions for each unit covering topics like processes, scheduling, memory management, file systems, and more. 2. Summaries of key operating system components like process states, interprocess communication, memory allocation algorithms, paging, segmentation, file system structure and disk scheduling. 3. Gantt charts and examples to illustrate scheduling algorithms and memory management techniques.

Uploaded by

rnagu1969
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
262 views

CS6401-Operating System PDF

This document contains unit questions and summaries for the Operating Systems course. It includes: 1. 2 mark and 16 mark questions for each unit covering topics like processes, scheduling, memory management, file systems, and more. 2. Summaries of key operating system components like process states, interprocess communication, memory allocation algorithms, paging, segmentation, file system structure and disk scheduling. 3. Gantt charts and examples to illustrate scheduling algorithms and memory management techniques.

Uploaded by

rnagu1969
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 8

Downloaded from www.Rejinpaul.

com

VALLIAMMAI ENGNIEERING COLLEGE


SRM Nagar, Kattankulathur 603203.

DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING

YearandSemester :II/IV

Section :CSE1&2

SubjectCode :CS6401

SubjectName :OperatingSystem

DegreeandBranch :B.ECSE

StaffIncharge :G.Sangeetha&V.Prema

UNITI

2 MARK QUESTIONS:

1. Definesystemprocess
2. Whatisaninterrupt?
3. Whatisasystemcall?
4. Whatisaninterruptvector?
5. Definebootstrapprogram
6. Defineoperatingsystem
7. Whatisaresourceallocator?
8. WhatisMooreslaw?
9. Whatiskernel?
10. Drawthestoragedevicehierarchy
11. Whatisfaulttolerant?
12. Definejobpool
13. whatarethetypesofoperationinoperatingsystem?
14. Whatisaprivilegedinstruction?
15. Whatisatrap?
16. Whatisbitmap?
17. Whatisrealtimeoperatingsystem?
18. Whatisbootdisk?
19. Drawthesystemstructureforunix
20. WhatisthelayeredapproachinOS?

PreparedbyG.Sangeetha&V.Prema Page1

Get Unique study materials from www.rejinpaul.com


Downloaded from www.Rejinpaul.com

16 MARK QUESTIONS:

1. Explainindetailthemoderncomputersystem
2. Explaintheabstractviewofthecomponentsofacomputersystem
3. ExplainVonNeumannarchitecture
4. Explainmultiprocessorsystem
5. Explainoperatingsystemstructureindetail
6. Explaincomputingenvironments
7. Explainopensourceoperatingsystem
8. Explainindetailtheoperatingsystemservices
9. Explainindetailoperatingsystemstructure
10. WriteaboutOSgeneration

UNITII
2 MARK QUESTIONS:

1. Define Process

2. What are the Process State

3. What Is PCB?

4.Define Threads.

5. What are the types of Schedulers?

6. What is Context Switch?

7. What is Co-operative Process?

8. Define IPC.

9. What is Remote procedure Calls?

10. Define threads.

11. What is multicore Programming?

12. Define Multithreading

13. What is critical section problem?

14. What is semaphores?

PreparedbyG.Sangeetha&V.Prema Page2

Get Unique study materials from www.rejinpaul.com


Downloaded from www.Rejinpaul.com

15. What is monitors?

16. What is preemptive Scheduling?

17. What is Non Preemptive Scheduling?

18. What are the scheduling Criteria?

19. What are the scheduling algorithm?

20. Define Dead Locks.

16 MARK QUESTIONS:

1.Explainthevariousprocessstate

2.Explaintheinterprocesscommunication

3.Explainaboutremoteprocedurecalls

4.ExplainaboutMultithreadingmodels

5.ConsiderthefollowingsetofprocesseswiththelengthoftheCPUbursttimegiveninmilliseconds

ProcessBurstTimePriority

P1103

P211

P323

P414

P552

Theprocessesareassumedtohavearrivedintheorderp1,p2,p3,p4,p5allattime0.

a. DrawfourGanttchartsillustratingtheexecutionoftheseprocessesusingFCFS,SJF,anon
preemptivepriority(asmallerprioritynumberimpliesahigherpriority)andRR
(quantum=1)scheduling.

b. Whatistheturnaroundtimeofeachprocessforeachoftheschedulingalgorithms

inparta?

c.Whatisthewaitingtimeofeachprocessforeachoftheschedulingalgorithmsinparta?

d.Whichoftheschedulesinpartaresultsintheminimalaveragewaitingtime?

6.Explainaboutvariousschedulingalgorithms

PreparedbyG.Sangeetha&V.Prema Page3

Get Unique study materials from www.rejinpaul.com


Downloaded from www.Rejinpaul.com

7.Explainindetailaboutthecriticalsectionproblem

8.Explainindetailaboutsemaphoresandmonitors

9.Expainaboutdeadlockpreventionanddeadlockavoidancealgorithms

10.Considerthefollowingsnapshotofasystem

AllocationMaxAvailable

ABCDABCDABCD

P0001200121520

P110001750

P213542356

P306320652

P400140656

Answerthefollowingquestionusingbankersalgorithm

a)WhatisthecontentofthematrixNeed?

b)Isthesysteminasafestate?

c)Ifarequestfromprocessp1arrivesfor(0,4,2,0)cantherequestbegrantedimmediately?

UNITIII

2 MARK QUESTIONS:

1.DefineMemoryManagementUnit

2.WhatisDynamicLoading?

3.WhatisOverlays?

4.DefineSwapping

5.WhatisPaging?

6.Definesegmentation.

PreparedbyG.Sangeetha&V.Prema Page4

Get Unique study materials from www.rejinpaul.com


Downloaded from www.Rejinpaul.com

7.WhatisHitratio?

8.WhatisTLB?

9.WhatisVirtualMemory?

10.Whatisdemandpaging?

11.HowtocalculateEffectiveaccesstimeinDemandPaging?

12.Whatismemorymappingapproach?

13.Whatarethepagereplacementalgorithm?

14.CompareLRUandOptimalReplacementAlgorithm

15.DefineAllocationAlgorithm.

16.ComparetheGlobalandLocalAllocation?

17.WhatisThrashing?

18.Consideralogicaladdressspaceofeightpagesof1024wordseachmappedontoaphysicalmemory
of32frames

a)Howmanybitsareinthelogicaladdress?

b)Howmanybitsareinthephysicaladdress?

19.Differencebetweeninternalandexternalfragmentation.

20.Differencebetweenlogicalandphysicaladdress.

16 MARK QUESTIONS:

1. ExplainindetailContiguousMemoryAllocation.
2. Explainindetailaboutsegmentation.
3. Explainindetailaboutpaging.
4. Explainindetailaboutsegmentationwithpaging.
5. Describethefollowingallocationalgorithms:
a. Firstfit
b. Bestfit
c. Worstfit
6. Givenmemorypartitionsof100KB,500KB,200KB,300KB,and600KB(inorder),howwould
eachoffthefirstfit,bestfit,andworstfitalgorithmsplaceprocessesof212KB,417KB,112KB,
and426KB(inorder)?Whichalgorithmmakesthemostefficientuseofmemory?

PreparedbyG.Sangeetha&V.Prema Page5

Get Unique study materials from www.rejinpaul.com


Downloaded from www.Rejinpaul.com

7. Explaindemandpaging.
8. Explainpagereplacementalgorithms.
9. Considerthefollowingpagereferencestring:

1,2,3,4,,2,1,5,6,2,1,2,3,7,6,3,2,1,2,3,6

Howmanypagefaultswouldoccurforthefollowingreplacementalgorithms,assumingtwo,
threeframes?

Rememberthatallframesareinitiallyempty,soyourfirstuniquepageswillallcostonefault
each.

LRUreplacement
FIFOreplacement
Optimalreplacement
10. ExplainindetailaboutThrashing.

UNITIV
2 MARK QUESTIONS:

1.Whatisseektime?

2.whatisRotationallatency?

3.Whatarethetypesofdiskscheduling?

4.WhatisPhysicalformattingofthedisk?

5.Whatislogicalformattingofthedisk?

6.Whatisbootblock?

7.Whatisbadblocks?

8.Whatarethefileattributes?

9.WhataretheFiletypes?

10.WhatarethemethodsforAccessingthefile?

11.Definesingleleveldirectory.

12.DefineTwoleveldirectory.

13.Whatisdistributedfilesystem?

14.Writethestructureoflayeredfilesystem

PreparedbyG.Sangeetha&V.Prema Page6

Get Unique study materials from www.rejinpaul.com


Downloaded from www.Rejinpaul.com

15.WhatisFCB.

16.Whataretheallocationmethodsfordiskspace?

17.Whatisbitvector?

18.Whatispolling?

19.WritedowntheCharacteristicsofI/Odevices.

20.Whatisstreams?

16 MARK QUESTIONS:

1. Explainindetailaboutdiscschedulingalgorithm.
2. Supposethatadiskdrivehas5000cylinders,numbered0to4999.Thedriveiscurrentlyserving
arequestatcylinder143,andthepreviousrequestwasatcylinder125.Thequeueofpending
requests,inFIFOorder,is
86,1470,913,1774,948,1509,1022,1750,130.

Startingfromthecurrentheadposition,whatisthetotaldistance(incylinders)thatthedisk
armmovestosatisfyallthependingrequestsforeachofthefollowingdiskscheduling
algorithms?

a. FCFS
b. SSTF
c. SCAN
d. LOOK
e. CSCAN
f. CLOOK

3. Explainindetailaboutdiscmanagement.
4. Explainindetailaboutdirectorystructure.
5. Explainindetailaboutfilesharingandprotection.
6. Explainindetailaboutfilesystemstructureandimplementation.
7. Explainindetailaboutallocationmethodsofdisc.
8. Explainindetailaboutfreespacemanagement.
9. ExplainindetailaboutBUSstructure.
10. ExplainindetailaboutKernelI/Osubsystem.

UNITV
2 MARK QUESTIONS:

1. WriteaboutLinuxKernelsystem.

PreparedbyG.Sangeetha&V.Prema Page7

Get Unique study materials from www.rejinpaul.com


Downloaded from www.Rejinpaul.com

2. DrawthecomponentsoftheLinuxsystem.
3. WhatarethethreenetworklayersintheLinuxkernelsystem.
4. ListdownthecomponentsofaLinuxSystem.
5. WhatarethethreecomponentsofmodulesupportunderLinux
6. Whatisbuddyheapalgorithm?
7. Whatisdomainnamesystem?
8. Whatisvirtualization?
9. DrawthearchitectureofXenproject.
10. WhatisVMwareonLinux?
11. WhatisLinuxmultifunctionserver?
12. DefineFork.
13. WhatiskernelSynchronizationinLinux?
14. WhatisLinuxex2fsfilesystem?
15. DrawthedevicedriverblockstructureinLinux
16. Whatisthepurposeofblockbuffercache?
17. WhatarethesecuritygroupsinLinux?
18. Whatisprotectionmask?
19. Whatisfirewallmanagement?
20. Whatisstaticanddynamiclinking?

16 MARK QUESTIONS:

1. ExplainthebasicconceptsoftheLinuxsystem.
2. ExplainsystemadministrationrequirementforLinuxsystemadministrator.
3. ExplainsettingupaLinuxmultifunctionserver.
4. Explainlocalnetworkservices.
5. ExplainDomainnamesystems.
6. ExplainthebasicconceptsofVirtualization.
7. ExplainindetailaboutsettingupXen.
8. ExplainindetailaboutVMWareonLinuxHostandAddingGuestOS.
9. ExplainindetailaboutKernelmodulesinLinuxsystems.
10. ExplainindetailaboutnetworkstructureandsecurityinLinux.

PreparedbyG.Sangeetha&V.Prema Page8

Get Unique study materials from www.rejinpaul.com

You might also like