Professional Documents
Culture Documents
OS Interview Questions
OS Interview Questions
Uploaded by
James BondCopyright
Available Formats
Share this document
Did you find this document useful?
Is this content inappropriate?
Report this DocumentCopyright:
Available Formats
OS Interview Questions
OS Interview Questions
Uploaded by
James BondCopyright:
Available Formats
Always Asked Operating
System Interview Questions
with Answers
CONNECT
https://rsinghal26.github.io/?contact
Data tructure Algorithm Intervie Preparation Topic-ie Practice C++ Java Pthon
Commonl Aked Operating tem
Intervie Quetion
Difficult Level : Medium ● Lat Updated : 24 Nov, 2021
1. What are a proce and proce tale?
A proce i an intance of a program in execution. For example, a We
roer i a proce, a hell (or command prompt) i a proce. The
operating tem i reponile for managing all the procee that are
running on a computer and allocate each proce a cer tain amount of
time to ue the proceor. In addition, the operating tem alo
allocate variou other reource that procee ill need, uch a
computer memor or dik. To keep track of the tate of all the
procee, the operating tem maintain a tale knon a the
proce tale. Inide thi tale, ever proce i lited along ith the
reource the proce i uing and the current tate of the proce.
2. What are the di몭erent tate of the proce?
Procee can e in one of three tate: running, read, or aiting. The
running tate mean that the proce ha all the reource it need for
execution and it ha een given permiion the operating tem to
ue the proceor. Onl one proce can e in the running tate at an
given time. The remaining procee are either in a aiting tate (i.e.,
aiting for ome external event to occur uch a uer input or dik
acce) or a read tate (i.e., aiting for permiion to ue the
proceor). In a real operating tem, the aiting and read tate are
implemented a queue that hold the procee in thee tate.
3. What i a Thread?
tart Your Coding Journe No! Login Regiter
A thread i a ingle equence tream ithin a proce. ecaue thread
have ome of the proper tie of procee, the are ometime called
lighteight procee. Thread are a popular a to improve the
application through parallelim. For example, in a roer, multiple
ta can e di몭erent thread. M ord ue multiple thread, one
thread to format the text, another thread to proce input, etc.
4. What are the di몭erence eteen proce and thread?
A thread ha it on program counter (PC), a regiter et, and a tack
pace. Thread are not independent of one another, like procee. A a
reult, thread hare ith other thread their code ection, data ection,
and O reource like open 몭le and ignal.
5.What are the ene몭t of multithreaded programming?
It make the tem more reponive and enale reource haring. It
lead to the ue of multiproce architecture. It i more economical and
preferred.
6. What i Thrahing?
Thrahing i a ituation hen the per formance of a computer degrade
or collape. Thrahing occur hen a tem pend more time
proceing page fault than executing tranaction. While proceing
page fault i necear in order to appreciate the ene몭t of vir tual
memor , thrahing ha a negative e몭ect on the tem. A the page
fault rate increae, more tranaction need proceing from the
paging device. The queue at the paging device increae, reulting in
increaed er vice time for a page fault.
7. What i elad ’ Anomal?
élád ’ anomal i an anomal ith ome page replacement policie
ere increaing the numer of page frame reult in an increae in the
numer of page fault. It occur hen Firt in Firt Out page
replacement i ued.
8. What happen if a non-recurive mutex i locked more than once.
Deadlock. If a thread that had alread locked a mutex, trie to lock the
mutex again, it ill enter into the aiting lit of that mutex, hich
reult in a deadlock. It i ecaue no other thread can unlock the
mutex. An operating tem implementer can exercie care in
identif ing the oner of the mutex and return it if it i alread locked
the ame thread to prevent deadlock.
9. xplain the main purpoe of an operating tem?
An operating tem act a an intermediar eteen the uer of a
computer and computer hardare. The purpoe of an operating tem
i to provide an environment in hich a uer can execute program
convenientl and e몭cientl.
An operating tem i oftare that manage computer hardare. The
hardare mut provide appropriate mechanim to enure the correct
operation of the computer tem and to prevent uer program from
inter fering ith the proper operation of the tem.
10. What i demand paging?
The proce of loading the page into memor on demand (henever
page fault occur) i knon a demand paging.
11. What are the advantage of a multiproceor tem?
There are ome main advantage of a multiproceor tem:
nhanced per formance.
Multiple application.
Multi-taking inide an application.
High throughput and reponivene.
Hardare haring among CPU.
12. What i kernel?
A kernel i the central component of an operating tem that manage
the operation of computer and hardare. It aicall manage
operation of memor and CPU time. It i a core component of an
operating tem. Kernel act a a ridge eteen application and
data proceing per formed at the hardare level uing inter-proce
communication and tem call.
13. What are real-time tem?
A real-time tem mean that the tem i ujected to real-time, i.e.,
the repone hould e guaranteed ithin a peci몭ed timing contraint
or the tem hould meet the peci몭ed deadline.
14.What are the di몭erent cheduling algorithm?
Firt-Come, Firt-er ved (FCF) cheduling.
hor tet-Jo-Next ( JN) cheduling.
Priorit cheduling.
hor tet Remaining Time.
Round Roin(RR) cheduling.
Multiple-Level Queue cheduling.
15. What i a deadlock?
Deadlock i a ituation hen to or more procee ait for each other
to 몭nih and none of them ever 몭nih. Conider an example hen to
train are coming toard each other on the ame track and there i onl
one track, none of the train can move once the are in front of each
other. A imilar ituation occur in operating tem hen there are
to or more procee that hold ome reource and ait for reource
held other().
16. What i vir tual memor ?
Vir tual memor create an illuion that each uer ha one or more
contiguou addre pace, each eginning at addre zero. The ize
of uch vir tual addre pace are generall ver high. The idea of
vir tual memor i to ue dik pace to extend the R AM. Running
procee don’t need to care hether the memor i from R AM or dik.
The illuion of uch a large amount of memor i created udividing
the vir tual memor into maller piece, hich can e loaded into
phical memor henever the are needed a proce.
17. Decrie the ojective of multi-programming.
Multi-programming increae CPU utilization organizing jo (code
and data) o that the CPU ala ha one to execute. The main ojective
of multi-programming i to keep multiple jo in the main memor . If
one jo get occupied ith IO, CPU can e aigned to other jo.
18. What i the time-haring tem?
Time-haring i a logical extenion of multiprogramming. The CPU
per form man tak itche that are o frequent that the uer can
interact ith each program hile it i running. A time-hared operating
tem allo multiple uer to hare computer imultaneoul.
19. What i a thread?
A thread i a path of execution ithin a proce. A proce can contain
multiple thread.
20. Give ome ene몭t of multithreaded programming?
A thread i alo knon a lighteight proce. The idea i to achieve
parallelim dividing a proce into multiple thread. Thread ithin
the ame proce run in hared memor pace,
21. rie몭 explain FCF?
FCF tand for Firt Come Firt er ve. In the FCF cheduling
algorithm, the jo that arrived 몭rt in the read queue i allocated to the
CPU and then the jo that came econd and o on. FCF i a non-
preemptive cheduling algorithm a a proce that hold the CPU until it
either terminate or per form I/O. Thu, if a longer jo ha een
aigned to the CPU then man hor ter jo after it ill have to ait.
22. What i the RR cheduling algorithm?
A round-roin cheduling algorithm i ued to chedule the proce
fairl for each jo a time lot or quantum and interrupting the jo if it i
not completed then the jo come after the other jo hich i arrived
in the quantum time that make thee cheduling fairl.
Round-roin i cclic in nature, o tar vation doen’t occur
Round-roin i a variant of 몭rt come, 몭rt er ved cheduling
No priorit, pecial impor tance i given to an proce or tak
RR cheduling i alo knon a Time licing cheduling
23. What are the necear condition hich can lead to a deadlock in
a tem?
Mutual xcluion: There i a reource that cannot e hared.
Hold and Wait: A proce i holding at leat one reource and aiting for
another reource, hich i ith ome other proce.
No Preemption: The operating tem i not alloed to take a reource
ack from a proce until the proce give it ack.
Circular Wait: A et of procee are aiting for each other in circular
form.
24. numerate the di몭erent R AID level?
A redundant arra of independent dik i a et of everal phical dik
drive that the operating tem ee a a ingle logical unit. It plaed a
igni몭cant role in narroing the gap eteen increaingl fat
proceor and lo dik drive. R AID ha di몭erent level:
Level-0
Level-1
Level-2
Level-3
Level-4
Level-5
Level-6
25. What i anker ’ algorithm?
The anker ’ algorithm i a reource allocation and deadlock avoidance
algorithm that tet for afet imulating the allocation for
predetermined maximum poile amount of all reource, then
make an “-tate” check to tet for poile activitie, efore deciding
hether allocation hould e alloed to continue.
26. What factor determine hether a detection algorithm mut e
utilized in a deadlock avoidance tem?
One i that it depend on ho often a deadlock i likel to occur under
the implementation of thi algorithm. The other ha to do ith ho
man procee ill e a몭ected deadlock hen thi algorithm i
applied.
27. tate the main di몭erence eteen logical and phical addre
pace?
Parameter LOGICAL ADDR PHYICAL ADDR
aic generated CPU. location in a memor unit.
Addre Logical Addre pace i a et Phical Addre i a et of
pace of all logical addree all phical addree
generated the CPU in mapped to the correponding
reference to a program. logical addree.
Viiilit Uer can vie the logical Uer can never vie the
addre of a program. phical addre of the
program.
Generation generated the CPU. Computed MMU.
Acce The uer can ue the logical The uer can indirectl
addre to acce the phical acce phical addre ut
addre. not directl.
28. Ho doe dnamic loading aid in etter memor pace utilization?
With dnamic loading, a routine i not loaded until it i called. Thi
method i epeciall ueful hen large amount of code are needed in
order to handle infrequentl occurring cae uch a error routine.
29. What are overla?
The concept of overla i that henever a proce i running it ill not
ue the complete program at the ame time, it ill ue onl ome par t of
it. Then overla concept a that hatever par t ou required, ou load
it and once the par t i done, then ou jut unload it, hich mean jut
pull it ack and get the ne par t ou required and run it. Formall, “ The
proce of tranferring a lock of program code or other data into
internal memor , replacing hat i alread tored”.
30. What i fragmentation?
Procee are tored and remove from memor , hich make free
memor pace, hich i too little to even conider utilizing di몭erent
procee. uppoe, that proce i not read to dipene to memor
lock ince it little ize and memor hinder conitentl ta unued
i called fragmentation. Thi kind of iue occur during a dnamic
memor allotment frameork hen free lock are mall, o it can’t
atif an requet.
31. What i the aic function of paging?
Paging i a method or technique hich i ued for non-contiguou
memor allocation. It i a 몭xed-ize par titioning theme (cheme). In
paging, oth main memor and econdar memor are divided into
equal 몭xed-ize par tition. The par tition of the econdar memor
area unit and the main memor area unit are knon a page and
frame repectivel.
Paging i a memor management method accutomed fetch procee
from the econdar memor into the main memor in the form of page.
in paging, each proce i plit into par t herever the ize of ever par t
i the ame a the page ize. The ize of the lat half could alo e ut
the page ize. The page of the proce area unit hold on ithin the
frame of main memor reling upon their acceiilit
32. Ho doe apping reult in etter memor management?
apping i a imple memor /proce management technique ued
the operating tem(o) to increae the utilization of the proceor
moving ome locked procee from the main memor to the
econdar memor thu forming a queue of the temporaril upended
procee and the execution continue ith the nel arrived proce.
During regular inter val that are et the operating tem, procee
can e copied from the main memor to a acking tore, and then
copied ack later. apping allo more procee to e run that can 몭t
into memor at one time
33. Write a name of claic nchronization prolem?
ounded-u몭er
Reader-riter
Dining philoopher
leeping arer
34. What i the Direct Acce Method?
The direct Acce method i aed on a dik model of a 몭le, uch that it
i vieed a a numered equence of lock or record. It allo
aritrar lock to e read or ritten. Direct acce i advantageou
hen acceing large amount of information. Direct memor acce
(DMA) i a method that allo an input/output (I/O) device to end or
receive data directl to or from the main memor , paing the CPU to
peed up memor operation. The proce i managed a chip knon
a a DMA controller (DMAC).
35. When doe thrahing occur?
Thrahing occur hen procee on the tem frequentl acce
page not availale memor .
36. What i the et page ize hen deigning an operating tem?
The et paging ize varie from tem to tem, o there i no ingle
et hen it come to page ize. There are di몭erent factor to conider
in order to come up ith a uitale page ize, uch a page tale, paging
time, and it e몭ect on the overall e몭cienc of the operating tem.
37. What i multitaking?
Multitaking i a logical extenion of a multiprogramming tem that
uppor t multiple program to run concurrentl. In multitaking, more
than one tak i executed at the ame time. In thi technique, the
multiple tak, alo knon a procee, hare common proceing
reource uch a a CPU.
38. What i caching?
The cache i a maller and fater memor that tore copie of the data
from frequentl ued main memor location. There are variou
di몭erent independent cache in a CPU, hich tore intruction and
data. Cache memor i ued to reduce the average time to acce data
from the Main memor .
39. What i pooling?
pooling refer to imultaneou peripheral operation online, pooling
refer to putting jo in a u몭er, a pecial area in memor , or on a dik
here a device can acce them hen it i read. pooling i ueful
ecaue device acce data at di몭erent rate.
40. What i the functionalit of an A emler?
The A emler i ued to tranlate the program ritten in A eml
language into machine code. The ource program i an input of an
aemler that contain aeml language intruction. The output
generated the aemler i the oject code or machine code
undertandale the computer.
41. What are interrupt?
The interrupt are a ignal emitted hardare or oftare hen a
proce or an event need immediate attention. It aler t the proceor
to a high-priorit proce requiring interruption of the current orking
proce. In I/O device one of the u control line i dedicated for thi
purpoe and i called the Interrupt er vice Routine (IR).
42. What i GUI?
GUI i hor t for Graphical Uer Inter face. It provide uer ith an
inter face herein action can e per formed interacting ith icon
and graphical mol.
43. What i preemptive multitaking?
Preemptive multitaking i a tpe of multitaking that allo computer
program to hare operating tem (O) and underling hardare
reource. It divide the overall operating and computing time eteen
procee, and the itching of reource eteen di몭erent procee
occur through prede몭ned criteria.
44. What i a pipe and hen i it ued?
A Pipe i a technique ued for inter-proce communication. A pipe i a
mechanim hich the output of one proce i directed into the input
of another proce. Thu it provide a one-a 몭o of data eteen
to related procee.
45. What are the advantage of emaphore?
The are machine-independent.
a to implement.
Correctne i ea to determine.
Can have man di몭erent critical ection ith di몭erent emaphore.
emaphore acquire man reource imultaneoul.
No ate of reource due to u aiting.
46. What i a oottrap program in the O?
oottrapping i the proce of loading a et of intruction hen a
computer i 몭rt turned on or ooted. During the tar tup proce,
diagnotic tet are per formed, uch a the poer-on elf-tet (POT),
that et or check con몭guration for device and implement routine
teting for the connection of peripheral, hardare, and external
memor device. The ootloader or oottrap program i then loaded to
initialize the O.
47. What i IPC?
Inter-proce communication (IPC) i a mechanim that allo
procee to communicate ith each other and nchronize their
action. The communication eteen thee procee can e een a a
method of co-operation eteen them.
48. What are the di몭erent IPC mechanim?
Thee are the method in IPC:
Pipe (ame Proce) –
Thi allo a 몭o of data in one direction onl. Analogou to implex
tem (Keoard). Data from the output i uuall u몭ered until the
input proce receive it hich mut have a common origin.
Named Pipe (Di몭erent Procee) –
Thi i a pipe ith a peci몭c name it can e ued in procee that don’t
have a hared common proce origin. .g. i FIFO here the detail
ritten to a pipe are 몭rt named.
Meage Queuing –
Thi allo meage to e paed eteen procee uing either a
ingle queue or everal meage queue. Thi i managed the
tem kernel thee meage are coordinated uing an API.
emaphore –
Thi i ued in olving prolem aociated ith nchronization and to
avoid race condition. Thee are integer value that are greater than or
equal to 0.
hared memor –
Thi allo the interchange of data through a de몭ned area of memor .
emaphore value have to e otained efore data can get acce to
hared memor .
ocket –
Thi method i motl ued to communicate over a netork eteen a
client and a er ver. It allo for a tandard connection hich i
computer and O independent
49. What i the di몭erence eteen preemptive and non-preemptive
cheduling?
In preemptive cheduling, the CPU i allocated to the procee for a
limited time herea, in Non-preemptive cheduling, the CPU i
allocated to the proce till it terminate or itche to aiting for
tate.
The executing proce in preemptive cheduling i interrupted in the
middle of execution hen higher priorit one come herea, the
executing proce in non-preemptive cheduling i not interrupted in
the middle of execution and ait till it execution.
In Preemptive cheduling, there i the overhead of itching the
proce from the read tate to running tate, vie-vere, and
maintaining the read queue. Wherea the cae of non-preemptive
cheduling ha no overhead of itching the proce from running
tate to read tate.
In preemptive cheduling, if a high-priorit proce frequentl
arrive in the read queue then the proce ith lo priorit ha to
ait for a long, and it ma have to tar ve. On the other hand, in the
non-preemptive cheduling, if CPU i allocated to the proce having
a larger urt time then the procee ith mall urt time ma
have to tar ve.
Preemptive cheduling attain 몭exiilit alloing the critical
procee to acce the CPU a the arrive into the read queue, no
matter hat proce i executing currentl. Non-preemptive
cheduling i called rigid a even if a critical proce enter the read
queue the proce running CPU i not ditured.
Preemptive cheduling ha to maintain the integrit of hared data
that ’ h it i cot aociative it hich i not the cae ith Non-
preemptive cheduling.
50. What i the zomie proce?
A proce that ha 몭nihed the execution ut till ha an entr in the
proce tale to repor t to it parent proce i knon a a zomie
proce. A child proce ala 몭rt ecome a zomie efore eing
removed from the proce tale. The parent proce read the exit
tatu of the child proce hich reap o몭 the child proce entr from
the proce tale.
51. What are orphan procee?
A proce hoe parent proce no more exit i.e. either 몭nihed or
terminated ithout aiting for it child proce to terminate i called an
orphan proce.
52. What are tar vation and aging in O?
tar vation: tar vation i a reource management prolem here a
proce doe not get the reource it need for a long time ecaue the
reource are eing allocated to other procee.
Aging : Aging i a technique to avoid tar vation in a cheduling tem. It
ork adding an aging factor to the priorit of each requet. The
aging factor mut increae the priorit of the requet a time pae
and mut enure that a requet ill eventuall e the highet priorit
requet
53. Write aout monolithic kernel?
Apar t from microkernel, Monolithic Kernel i another clai몭cation of
Kernel. Like microkernel, thi one alo manage tem reource
eteen application and hardare, ut uer er vice and kernel
er vice are implemented under the ame addre pace. It increae
the ize of the kernel, thu increae the ize of an operating tem a
ell. Thi kernel provide CPU cheduling, memor management, 몭le
management, and other operating tem function through tem
call. A oth er vice are implemented under the ame addre pace,
thi make operating tem execution fater.
54. What i Context itching?
itching of CPU to another proce mean aving the tate of the old
proce and loading the aved tate for the ne proce. In Context
itching the proce i tored in the Proce Control lock to er ve
the ne proce, o that the old proce can e reumed from the ame
par t it a left.
55. What i the di몭erence eteen the Operating tem and kernel?
Operating tem Kernel
Operating tem i tem The kernel i tem oftare that
oftare. i par t of the Microkerneloperating
tem.
Operating tem provide The kernel provide inter face /
inter face / uer and hardare. application and hardare.
It alo provide protection and It main purpoe i memor
ecurit. management, dik management,
proce management and tak
management.
All tem need a real-time All operating tem need kernel
operating real-time,Microkernel to run.
tem to run.
Tpe of operating tem include Tpe of kernel include Monolithic
ingle and multiuer O, and Micro kernel.
multiproceor O, realtime O,
Ditriuted O.
It i the 몭rt program to load hen It i the 몭rt program to load hen
the computer oot up. the operating tem load
56. What i the di몭erence eteen proce and thread?
.NOProce Thread
1. Proce mean an program Thread mean a egment of a
i in execution. proce.
2. The proce i le e몭cient Thread i more e몭cient in term of
in term of communication. communication.
3. The proce i iolated. Thread hare memor .
4. The proce i called Thread i called lighteight proce.
heav eight the proce.
5. Proce itching ue, Thread itching doe not require to
another proce inter face in call an operating tem and caue
operating tem. an interrupt to the kernel.
6. If one proce i locked The econd, thread in the ame tak
then it ill not a몭ect the could not run, hile one er ver
execution of other proce thread i locked.
7. The proce ha it on Thread ha Parent’ PC, it on
Proce Control lock, tack Thread Control lock and tack and
and Addre pace. common Addre pace.
57. What i PC?
the proce control lock (PC) i a lock that i ued to track the
proce’ execution tatu. A proce control lock (PC) contain
information aout the proce, i.e. regiter, quantum, priorit, etc. The
proce tale i an arra of PC, that mean logicall contain a PC
for all of the current procee in the tem.
58. When i a tem in a afe tate?
The et of dipatchale procee i in a afe tate if there exit at
leat one temporal order in hich all procee can e run to
completion ithout reulting in a deadlock.
59. What i Ccle tealing?
ccle tealing i a method of acceing computer memor (R AM) or u
ithout inter fering ith the CPU. It i imilar to direct memor acce
(DMA) for alloing I/O controller to read or rite R AM ithout CPU
inter vention.
60. What i a Trap and Trapdoor?
A trap i a oftare interrupt, uuall the reult of an error condition,
and i alo a non-makale interrupt and ha the highet priorit
Trapdoor i a ecret undocumented entr point into a program ued to
grant acce ithout normal method of acce authentication.
61.Write a di몭erence eteen proce and program?
r.No. Program Proce
1. Program contain a et of Proce i an intance of an
intruction deigned to executing program.
complete a peci몭c tak.
2. Program i a paive entit a it Proce i anThe proce active
reide in the econdar entit a it i created during
memor . execution and loaded into the
main memor .
3. The program exit in a ingle Proce exit for a limited pan
place and continue to exit of time a it get terminated
until it i deleted. af ter the completion of a tak.
4. A program i a tatic entit. The proce i a dnamic entit.
r.No. Program Proce
5. Program doe not have an Proce ha a high reource
reource requirement, it onl requirement, it need reource
require memor pace for like CPU, memor addre, I/O
toring the intruction. during it lifetime.
6. The program doe not have an The proce ha it on control
control lock. lock called Proce Control
lock.
62.What i a dipatcher?
The dipatcher i the module that give proce control over the CPU
after it ha een elected the hor t-term cheduler. Thi function
involve the folloing:
itching context
itching to uer mode
Jumping to the proper location in the uer program to retar t that
program
63. De몭ne the term dipatch latenc?
A Dipatch latenc can e decried a the amount of time it take for a
tem to repond to a requet for a proce to egin operation. With a
cheduler ritten peci몭call to honor application prioritie, real-time
application can e developed ith a ounded dipatch latenc.
64.What are the goal of CPU cheduling?
Max CPU utilization [Keep CPU a u a poile]Fair allocation of
CPU.
Max throughput [Numer of procee that complete their execution
per time unit]
Min turnaround time [Time taken a proce to 몭nih execution]
Min aiting time [Time a proce ait in read queue]
Min repone time [Time hen a proce produce 몭rt repone]
65.What i a critical- ection?
When more than one procee acce the ame code egment that
egment i knon a the critical ection. The critical ection contain
hared variale or reource hich are needed to e nchronized to
maintain conitenc of data variale. In imple term, a critical
ection i a group of intruction/tatement or region of code that
need to e executed atomicall uch a acceing a reource (몭le, input
or output por t, gloal data, etc.).
66. Write the name of nchronization technique?
Mutexe
Condition variale
emaphore
File lock
67. Write a di몭erence eteen a uer-level thread and a kernel-level
thread?
Uer-level thread Kernel level thread
Uer thread are implemented kernel thread are implemented
uer. O.
O doen’t recognize uer-level Kernel thread are recognized O.
thread.
Implementation of Uer thread i Implementation of the per form
ea. kernel thread i complicated.
Context itch time i le. Context itch time i more.
Context itch require no Hardare uppor t i needed.
hardare uppor t.
If one uer-level thread per form If one kernel thread per form a the
a locking operation then entire locking operation then another
proce ill e locked. thread can continue execution.
Uer-level thread are deigned Kernel level thread are deigned a
a dependent thread. independent thread.
68.Write don the advantage of multithreading?
ome of the mot impor tant ene몭t of MT are:
Improved throughput. Man concurrent compute operation and I/O
requet ithin a ingle proce.
imultaneou and full mmetric ue of multiple proceor for
computation and I/O.
uperior application reponivene. If a requet can e launched on
it on thread, application do not freeze or ho the “hourgla”.
An entire application ill not lock or other ie ait, pending the
completion of another requet.
Improved er ver reponivene. L arge or complex requet or lo
client don’t lock other requet for er vice. The overall throughput
of the er ver i much greater.
Minimized tem reource uage. Thread impoe minimal impact
on tem reource. Thread require le overhead to create,
maintain, and manage than a traditional proce.
Program tructure impli몭cation. Thread can e ued to implif the
tructure of complex application, uch a er ver-cla and
multimedia application. imple routine can e ritten for each
activit, making complex program eaier to deign and code, and
more adaptive to a ide variation in uer demand.
etter communication. Thread nchronization function can e
ued to provide enhanced proce-to-proce communication. In
addition, haring large amount of data through eparate thread of
execution ithin the ame addre pace provide extremel high-
andidth, lo-latenc communication eteen eparate tak
ithin an application
69.Di몭erence eteen Multithreading and Multitaking?
.No. Multi-threading Multi-taking
1. Multiple thread are executing at everal program are executed
the ame time at the ame or concurrentl.
di몭erent par t of the program.
2. CPU itche eteen multiple CPU itche eteen multiple
thread. tak and procee.
3. It i lighteight par t proce. It i a heav eight proce.
4. It i a feature of the proce. It i a feature of O.
5. Multi-threading i haring of Multitaking i haring of
computing reource among computing reource(CPU,
thread of a ingle proce. memor , device, etc.) among
procee.
70.What are the draack of emaphore?
Priorit Inverion i a ig limitation of emaphore.
Their ue i not enforced ut i convention onl.
The programmer ha to keep track of all call to ait and to ignal
the emaphore.
With improper ue, a proce ma lock inde몭nitel. uch a ituation
i called Deadlock.
71. What i peteron’ approach?
72. De몭ne the term ounded aiting?
A tem i aid to follo ounded aiting condition if a proce ant
to enter into a critical ection ill enter in ome 몭nite time.
73. What are the olution to the critical ection prolem?
There are three olution to the critical ection prolem:
oftare olution
Hardare olution
emaphore
74.What i a anker ’ algorithm?
The anker ’ algorithm i a reource allocation and deadlock avoidance
algorithm that tet for afet imulating the allocation for
predetermined maximum poile amount of all reource, then
make an “-tate” check to tet for poile activitie, efore deciding
hether allocation hould e alloed to continue.
75. What i concurrenc?
A tate in hich a proce exit imultaneoul ith another proce
than thoe it i aid to e concurrent.
76.Write a draack of concurrenc?
It i required to protect multiple application from one another.
It i required to coordinate multiple application through additional
mechanim.
Additional per formance overhead and complexitie in operating
tem are required for itching among application.
ometime running too man application concurrentl lead to
everel degraded per formance.
77.What are the iue related to concurrenc?
Non-atomic –
Operation that are non-atomic ut interruptile multiple
procee can caue prolem.
Race condition –
A race condition occur of the outcome depend on hich of everal
procee get to a point 몭rt.
locking –
Procee can lock aiting for reource. A proce could e
locked for a long period of time aiting for input from a terminal. If
the proce i required to periodicall update ome data, thi ould
e ver undeirale.
tar vation –
It occur hen a proce doe not otain er vice to progre.
Deadlock –
It occur hen to procee are locked and hence neither can
proceed to execute
78.Wh do e ue precedence graph?
A precedence graph i a directed acclic graph that i ued to ho the
execution level of everal procee in the operating tem. It ha the
folloing proper tie alo:
Node of graph correpond to individual tatement of program
code.
An edge eteen to node repreent the execution order.
A directed edge from node A to node ho that tatement A
execute 몭rt and then tatement execute
79. xplain the reource allocation graph?
The reource allocation graph i explained to u hat i the tate of the
tem in term of procee and reource. One of the advantage of
having a diagram i, ometime it i poile to ee a deadlock directl
uing R AG.
80. Ho to recover from a deadlock?
We can recover from a deadlock folloing method:
Proce termination
Aor t all the deadlock procee
Aor t one proce at a time until the deadlock i eliminated
Reource preemption
Rollack
electing a victim
81. What i the goal and functionalit of memor management?
The goal and functionalit of memor management are a follo;
Relocation
Protection
haring
Logical organization
Phical organization
82. Write a di몭erence eteen phical addre and logical addre?
.NO. Parameter Logical addre Phical Addre
1. aic It i the vir tual addre The phical addre i a
generated CPU. location in a memor unit.
2. Addre et of all logical et of all phical
addree generated addree mapped to the
CPU in reference to a correponding logical
program i referred a addree i referred a
Logical Addre pace. Phical Addre.
3. Viiilit The uer can vie the The uer can never vie
logical addre of a phical addre of
program. program
4. Acce The uer ue the logical The uer can not directl
addre to acce the acce phical addre
phical addre.
5. Generation The Logical Addre i Phical Addre i
generated the CPU Computed MMU
83. xplain addre inding?
The A ociation of program intruction and data to the actual phical
memor location i called the Addre inding.
84. Write di몭erent tpe of addre inding?
Addre inding divided into three tpe a follo.
Compile-time Addre inding
Load time Addre inding
xecution time Addre inding
85. Write an advantage of dnamic allocation algorithm?
When e do not kno ho much amount of memor ould e
needed for the program eforehand.
When e ant data tructure ithout an upper limit of memor
pace.
When ou ant to ue our memor pace more e몭cientl.
Dnamicall created lit iner tion and deletion can e done ver
eail jut the manipulation of addree herea in cae of
taticall allocated memor iner tion and deletion lead to more
movement and atage of memor .
When ou ant ou to ue the concept of tructure and linked lit in
programming, dnamic memor allocation i a mut
86. Write a di몭erence eteen internal fragmentation and external
fragmentation?
.NO Internal fragmentation xternal fragmentation
1. In internal fragmentation In external fragmentation, variale-
몭xed-ized memor , lock ized memor lock quare meaure
quare meaure appointed appointed to method.
to proce.
2. Internal fragmentation xternal fragmentation happen hen
happen hen the method the method or proce i removed.
or proce i larger than the
memor .
3. The olution of internal olution of external fragmentation i
fragmentation i et-몭t compaction, paging and
lock. egmentation.
4. Internal fragmentation xternal fragmentation occur hen
occur hen memor i memor i divided into variale ize
divided into 몭xed ized par tition aed on the ize of
par tition. procee.
5. The di몭erence eteen The unued pace formed eteen
memor allocated and non-contiguou memor fragment
required pace or memor are too mall to er ve a ne proce,
i called Internal i called xternal fragmentation.
fragmentation.
87. De몭ne the Compaction?
The proce of collecting fragment of availale memor pace into
contiguou lock moving program and data in a computer ’
memor or dik.
88. Write aout the advantage and diadvantage of a hahed page
tale?
Advantage
The main advantage i nchronization.
In man ituation, hah tale turn out to e more e몭cient than
earch tree or an other tale lookup tructure. For thi reaon, the
are idel ued in man kind of computer oftare, par ticularl for
aociative arra, dataae indexing, cache, and et.
Diadvantage
Hah colliion are practicall unavoidale. hen hahing a random
uet of a large et of poile ke.
Hah tale ecome quite ine몭cient hen there are man colliion.
Hah tale doe not allo null value, like a hah map.
89. Write a di몭erence eteen paging and egmentation?
.NO Paging egmentation
1. In paging, program i In egmentation, program i divided
divided into 몭xed or into variale ize ection.
mounted ize page.
2. For the paging operating For egmentation compiler i
tem i accountale. accountale.
3. Page ize i determined Here, the ection ize i given the
hardare. uer.
4. It i fater in the egmentation i lo.
comparion of
.NO Paging egmentation
egmentation.
5. Paging could reult in egmentation could reult in external
internal fragmentation. fragmentation.
6. In paging, logical addre Here, logical addre i plit into
i plit into that page ection numer and ection o몭et.
numer and page o몭et.
7. Paging comprie a page While egmentation alo comprie
tale hich encloe the the egment tale hich encloe
ae addre of ever egment numer and egment o몭et.
page.
8. A page tale i emploed to ection Tale maintain the ection
keep up the page data. data.
9. In paging, operating In egmentation, the operating tem
tem mut maintain a maintain a lit of hole in the main
free frame lit. memor .
10. Paging i inviile to the egmentation i viile to the uer.
uer.
11. In paging, proceor need In egmentation, proceor ue
page numer, o몭et to egment numer, o몭et to calculate
calculate aolute addre. the full addre.
90. Write a de몭nition of A ociative Memor and Cache memor ?
.No. A ociative Memor Cache Memor
1 A memor unit acce content Fat and mall memor i called
i called aociative memor . cache memor .
2 It reduce the time required to It reduce the average memor
몭nd the item tored in memor . acce time.
3 Here data i acceed it Here, data are acceed it
content. addre.
4 It i ued here earch time i It i ued hen a par ticular
ver hor t. group of data i acceed
repeatedl.
5 It aic characteritic i it logic It aic characteritic i it fat
circuit for matching it content. acce
91. What i “Localit of reference”?
The localit of reference refer to a phenomenon in hich a computer
program tend to acce the ame et of memor location for a
par ticular time period. In other ord, Localit of Reference refer to
the tendenc of the computer program to acce intruction hoe
addree are near one another.
92. Write don the advantage of vir tual memor ?
A higher degree of multiprogramming.
Allocating memor i ea and cheap
liminate external fragmentation
Data (page frame) can e cattered all over PM
Page are mapped appropriatel ana
L arge program can e ritten, a vir tual pace availale i huge
compared to phical memor .
Le I/O required lead to fater and ea apping of procee.
More phical memor i availale, a program are tored on vir tual
memor , o the occup ver le pace on actual phical memor .
More e몭cient apping
93. Ho to calculate per formance in vir tual memor ?
The per formance of vir tual memor of a vir tual memor management
tem depend on the total numer of page fault, hich depend on
“paging policie” and “frame allocation”.
몭ective acce time = (1-p) x Memor acce time + p x page fault time
94. Write don the aic concept of the 몭le tem?
A 몭le i a collection of related information that i recorded on econdar
torage. Or 몭le i a collection of logicall related entitie. From uer ’
perpective, a 몭le i the mallet allotment of logical econdar
torage.
95. Write the name of di몭erent operation on 몭le?
Operation on 몭le:
Create
Open
Read
Write
Rename
Delete
Append
Truncate
Cloe
96. De몭ne the term it-Vector?
A itmap or it Vector i a erie or collection of it here each it
correpond to a dik lock. The it can take to value: 0 and 1: 0
indicate that the lock i allocated and 1 indicate a free lock.
97. What i a File allocation tale?
FAT tand for File Allocation Tale and thi i called o ecaue it
allocate di몭erent 몭le and folder uing tale. Thi a originall
deigned to handle mall 몭le tem and dik. A 몭le allocation tale
(FAT) i a tale that an operating tem maintain on a hard dik that
provide a map of the cluter (the aic unit of logical torage on a
hard dik) that a 몭le ha een tored in.
98. What i rotational latenc?
Rotational Latenc: Rotational L atenc i the time taken the deired
ector of the dik to rotate into a poition o that it can acce the
read/rite head. o the dik cheduling algorithm that give minimum
rotational latenc i etter.
99. What i eek time?
eek Time : eek time i the time taken to locate the dik arm to a
peci몭ed track here the data i to e read or rite. o the dik
cheduling algorithm that give minimum average eek time i etter.
100. What i u몭er?
A u몭er i a memor area that tore data eing tranferred eteen
to device or eteen a device and an application.
Lat Minute Note – Operating tem
We ill oon e covering more Operating tem quetion. Pleae
rite comment if ou 몭nd anthing incorrect, or ou ant to hare
more information aout the topic dicued aove.
You might also like
- The Subtle Art of Not Giving a F*ck: A Counterintuitive Approach to Living a Good LifeFrom EverandThe Subtle Art of Not Giving a F*ck: A Counterintuitive Approach to Living a Good LifeRating: 4 out of 5 stars4/5 (5834)
- The Gifts of Imperfection: Let Go of Who You Think You're Supposed to Be and Embrace Who You AreFrom EverandThe Gifts of Imperfection: Let Go of Who You Think You're Supposed to Be and Embrace Who You AreRating: 4 out of 5 stars4/5 (1093)
- Never Split the Difference: Negotiating As If Your Life Depended On ItFrom EverandNever Split the Difference: Negotiating As If Your Life Depended On ItRating: 4.5 out of 5 stars4.5/5 (852)
- Grit: The Power of Passion and PerseveranceFrom EverandGrit: The Power of Passion and PerseveranceRating: 4 out of 5 stars4/5 (590)
- Hidden Figures: The American Dream and the Untold Story of the Black Women Mathematicians Who Helped Win the Space RaceFrom EverandHidden Figures: The American Dream and the Untold Story of the Black Women Mathematicians Who Helped Win the Space RaceRating: 4 out of 5 stars4/5 (903)
- Shoe Dog: A Memoir by the Creator of NikeFrom EverandShoe Dog: A Memoir by the Creator of NikeRating: 4.5 out of 5 stars4.5/5 (541)
- The Hard Thing About Hard Things: Building a Business When There Are No Easy AnswersFrom EverandThe Hard Thing About Hard Things: Building a Business When There Are No Easy AnswersRating: 4.5 out of 5 stars4.5/5 (350)
- Elon Musk: Tesla, SpaceX, and the Quest for a Fantastic FutureFrom EverandElon Musk: Tesla, SpaceX, and the Quest for a Fantastic FutureRating: 4.5 out of 5 stars4.5/5 (474)
- Her Body and Other Parties: StoriesFrom EverandHer Body and Other Parties: StoriesRating: 4 out of 5 stars4/5 (824)
- The Sympathizer: A Novel (Pulitzer Prize for Fiction)From EverandThe Sympathizer: A Novel (Pulitzer Prize for Fiction)Rating: 4.5 out of 5 stars4.5/5 (122)
- The Emperor of All Maladies: A Biography of CancerFrom EverandThe Emperor of All Maladies: A Biography of CancerRating: 4.5 out of 5 stars4.5/5 (271)
- The Little Book of Hygge: Danish Secrets to Happy LivingFrom EverandThe Little Book of Hygge: Danish Secrets to Happy LivingRating: 3.5 out of 5 stars3.5/5 (405)
- The World Is Flat 3.0: A Brief History of the Twenty-first CenturyFrom EverandThe World Is Flat 3.0: A Brief History of the Twenty-first CenturyRating: 3.5 out of 5 stars3.5/5 (2259)
- The Yellow House: A Memoir (2019 National Book Award Winner)From EverandThe Yellow House: A Memoir (2019 National Book Award Winner)Rating: 4 out of 5 stars4/5 (98)
- Devil in the Grove: Thurgood Marshall, the Groveland Boys, and the Dawn of a New AmericaFrom EverandDevil in the Grove: Thurgood Marshall, the Groveland Boys, and the Dawn of a New AmericaRating: 4.5 out of 5 stars4.5/5 (266)
- A Heartbreaking Work Of Staggering Genius: A Memoir Based on a True StoryFrom EverandA Heartbreaking Work Of Staggering Genius: A Memoir Based on a True StoryRating: 3.5 out of 5 stars3.5/5 (231)
- Team of Rivals: The Political Genius of Abraham LincolnFrom EverandTeam of Rivals: The Political Genius of Abraham LincolnRating: 4.5 out of 5 stars4.5/5 (234)
- On Fire: The (Burning) Case for a Green New DealFrom EverandOn Fire: The (Burning) Case for a Green New DealRating: 4 out of 5 stars4/5 (74)
- The Unwinding: An Inner History of the New AmericaFrom EverandThe Unwinding: An Inner History of the New AmericaRating: 4 out of 5 stars4/5 (45)
