bca 502 operating systems-2

7/26/2019 Bca 502 Operating Systems-2

1/30

BCA502 : CORE 19 : OPERATING SYSTEMS

MULTIPLE CHOICE QUESTIONS

1) The address of the next instruction to be executed by the current process is provided by

the

a) CPU registers

b) program counter

c) process stack

d) pipe

Answer:b) A Process Contro! "!ock#PC") does not contain which of the fo!!owing :

a) Process $tate

b) $tack

c) %eap

d) boot strapAnswer: d

&) The number of processes comp!eted per unit time is known as ''''''''''(

a) utput

b) Throughput

c) *fficiency

d) Capacity

Answer: b

+) The state of a process is defined by :

a) the fina! activity of the process

b) the activity ,ust executed by the process

c) the activity to next be executed by the processd) the current activity of the process

Answer: d-) .hich of the fo!!owing is not the state of a process /

a) 0ew

b) !d

c) .aiting

d) unning

e) eady

Answer: b

2) The Process Contro! "!ock is :a) Process type variab!e

b) 3ata $tructure

c) a secondary storage section

d) a "!ock in memory

Answer: b

4) .hich of the fo!!owing do not be!ong to 5ueues for processes /

a) 6ob 7ueue


2/30

b) PC" 5ueue

c) 3evice 7ueue

d) eady 7ueue

Answer: b

8) .hen a process terminates : #Choose Two)

a) 9t is removed from a!! 5ueues

b) 9t is removed from a!! but the ,ob 5ueue

c) 9ts process contro! b!ock is de;a!!ocated

d) 9ts process contro! b!ock is never de;a!!ocated

Answer: a and c


3/30

1+) A parent process ca!!ing ''''' system ca!! wi!! be suspended unti! chi!dren processes

terminate(

a) wait

b) fork

c) exit

d) exec

Answer: a

1-) Cascading termination refers to termination of a!! chi!d processes before the parent

terminates ''''''(

a) 0orma!!y

b) Abnorma!!y

c) 0orma!!y or abnorma!!y

d) 0one of these

Answer: a

12) .hen the process issues an 9@ re5uest :a) 9t is p!aced in an 9@ 5ueue

b) 9t is p!aced in a waiting 5ueue

c) 9t is p!aced in the ready 5ueue

d) 9t is p!aced in the 6ob 5ueue

Answer: a

14) .hich of the fo!!owing do not be!ong to 5ueues for processes /

a) 6ob 7ueue

b) PC" 5ueue

c) 3evice 7ueued) eady 7ueue

Answer: b

18) essage passing system a!!ows processes to :

a) communicate with one another without resorting to shared data(

b) communicate with one another by resorting to shared data(

c) share data

d) name the recipient or sender of the message

Answer: a

1


4/30

=) The !ink between two processes P and 7 to send and receive messages is ca!!ed :

a) communication !ink

b) message;passing !ink

c) synchroni?ation !ink

d) A!! of these

Answer: a

1) 9n indirect communication between processes P and 7 :

a) there is another process to hand!e and pass on the messages between P and 7

b) there is another machine between the two processes to he!p communication

c) there is a mai!box to he!p communication between P and 7

d) 0one of these

Answer: c

) 9n the non b!ocking send :

a) the sending process keeps sending unti! the message is received

b) the sending process sends the message and resumes operation

c) the sending process keeps sending unti! it receives a message

d) 0one of theseAnswer: b

&) 9n the Bero capacity 5ueue : #choose two)

a) the 5ueue has ?ero capacity

b) the sender b!ocks unti! the receiver receives the message

c) the sender keeps sending and the messages dont wait in the 5ueue

d) the 5ueue can store at!east one message

Answer: a and b

+) The interva! from the time of submission of a process to the time of comp!etion is termed

as

a) waiting timeb) turnaround time

c) response time

d) throughput

Answer:b

-) The processes that are residing in main memory and are ready and waiting to execute are

kept on a !ist ca!!ed

a) ,ob 5ueue

b) ready 5ueue

c) execution 5ueued) process 5ueue

Answer:b

2) .hich schedu!ing a!gorithm a!!ocates the CPU first to the process that re5uests the CPU

first/

a) first;come first;served schedu!ing

b) shortest ,ob schedu!ing


5/30

c) priority schedu!ing

d) none of the mentioned

Answer: a

4) 9n priority schedu!ing a!gorithm

a) CPU is a!!ocated to the process with highest priority

b) CPU is a!!ocated to the process with !owest priority

c) e5ua! priority processes can not be schedu!ed


Answer:a

8) Time 5uantum is defined in

a) shortest ,ob schedu!ing a!gorithm

b) round robin schedu!ing a!gorithm

c) priority schedu!ing a!gorithm

d) mu!ti!eve! 5ueue schedu!ing a!gorithm

Answer:b


6/30

Answer: a

&+) 9n Unix .hich system ca!! creates the new process/

a) fork

b) create

c) new


Answer:a

&-)A process can be terminated due to

a) norma! exit

b) fata! error

c) ki!!ed by another process

d) a!! of the mentioned

Answer:d

&2).hat is interprocess communication/

a) communication within the process

b) communication between two process

c) communication between two threads of same process d) none of the mentioned

Answer:b

&4) Turnaround time is :

a) the tota! waiting time for a process to finish execution

b) the tota! time spent in the ready 5ueue

c) the tota! time spent in the running 5ueue

d) the tota! time from the comp!etion ti!! the submission of a process

Answer: d

&8) .aiting time is :

a) the tota! time in the b!ocked and waiting 5ueues b) the tota! time spent in the ready 5ueue

c) the tota! time spent in the running 5ueue

d) the tota! time from the comp!etion ti!! the submission of a process

Answer: b

&


7/30

b) chi!d process

c) parent process

d) init process

Answer:a

+) .hen severa! processes access the same data concurrent!y and the outcome of the

execution depends on the particu!ar order in which the access takes p!ace is ca!!ed

a) dynamic condition

b) race condition

c) essentia! condition

d) critica! condition

Answer:b

+&) 9f a process is executing in its critica! section then no other processes can be executing in

their critica! section( This condition is ca!!ed

a) mutua! exc!usion

b) critica! exc!usion

c) synchronous exc!usion

d) asynchronous exc!usionAnswer:a

++) .hich one of the fo!!owing is a synchroni?ation too!/

a) thread

b) pipe

c) semaphore

d) socket

Answer:c

+-) utua! exc!usion can be provided by the

a) mutex !ocks

b) binary semaphoresc) both #a) and #b)


Answer:c

+2) A monitor is characteri?ed by :

a) a set of programmer defined operators

b) an identifier

c) the number of variab!es in it

d) A!! of these

Answer: a+4) Concurrent access to shared data may resu!t in :

a) data consistency

b) data insecurity

c) data inconsistency

d) 0one of these

Answer: c


8/30

+8) A situation where severa! processes access and manipu!ate the same data concurrent!y and

the outcome of the execution depends on the particu!ar order in which access takes p!ace is

ca!!ed :

a) data consistency

b) race condition

c) aging

d) starvation

Answer: b

+


9/30

Answer: c

--) 9n the bounded buffer prob!em there are the empty and fu!! semaphores that :

a) count the number of empty and fu!! buffers

b) count the number of empty and fu!! memory spaces

c) count the number of empty and fu!! 5ueues

d) 0one of these

Answer: a

-2) 9n the bounded buffer prob!em :

a) there is on!y one buffer

b) there are n buffers # n being greater than one but finite)

c) there are infinite buffers

d) the buffer si?e is bounded

Answer: b

-4) To ensure difficu!ties do not arise in the readers writers prob!em ''''''' are given

exc!usive access to the shared ob,ect(

a) readers

b) writersc) 0one of these

Answer: b

-8) The dining phi!osophers prob!em wi!! occur in case of :

a) - phi!osophers and - chopsticks

b) + phi!osophers and - chopsticks

c) & phi!osophers and - chopsticks

d) 2 phi!osophers and - chopsticks

Answer: a

-


10/30

2) A dead!ock avoidance a!gorithm dynamica!!y examines the '''''''''' to ensure that a

circu!ar wait condition can never exist(

a) resource a!!ocation state

b) system storage state

c) operating system

d) resources

Answer: a

2&) ( A memory buffer used to accommodate a speed differentia! is ca!!ed

a) stack pointer

b) cache

c) accumu!ator

d) disk buffer

Answer:b

2+) ( .hich one of the fo!!owing is the address generated by CPU/

a) physica! address

b) abso!ute address

c) !ogica! addressd) none of the mentioned

Answer:c

2-) un time mapping from virtua! to physica! address is done by

a) memory management unit

b) CPU

c) PC9


Answer:a

22) emory management techni5ue in which system stores and retrieves data from secondary

storage for use in main memory is ca!!eda) fragmentation

b) paging

c) mapping


Answer:b

24) Dor a dead!ock to arise which of the fo!!owing conditions must ho!d simu!taneous!y /

# choose a!! that app!y )

a) utua! exc!usion

b) $tarvationc) %o!d and wait

d) 0o preemption

e) Circu!ar wait

Answer: a c d and e

28) .hich of the fo!!owing condition is re5uired for dead!ock to be possib!e/

a) mutua! exc!usion

b) a process may ho!d a!!ocated resources whi!e awaiting assignment of other resources


11/30

c) no resource can be forcib!y removed from a process ho!ding it


Answer:d

2s a!gorithm

b) round;robin a!gorithm

c) e!evator a!gorithm

d) karn>s a!gorithm

Answer:a

4=) .hich one of the fo!!owing is a visua! # mathematica! ) way to determine the dead!ock

occurrence/

a) resource a!!ocation graph

b) starvation graph

c) inversion graph


Answer:a

41) A state is safe if :

a) the system does not crash due to dead!ock occurrence

b) the system can a!!ocate resources to each process in some order and sti!! avoid a dead!ock

c) the state keeps the system protected and safe

d) A!! of these

Answer: b

4) 9f no cyc!e exists in the resource a!!ocation graph :

a) then the system wi!! not be in a safe state

b) then the system wi!! be in a safe state

c) either a or b

d) 0one of these

Answer: b

4&) A D9D rep!acement a!gorithm associates with each page the '''''''

a) time it was brought into memory

b) si?e of the page in memory

c) page after and before itd) A!! of these

Answer: a

4+) .hich of the fo!!owing page rep!acement a!gorithms suffers from "e!ady>s Anoma!y /

a) ptima! rep!acement

b) EU

c) D9D

d) "oth optima! rep!acement and D9D


12/30

Answer: c

4-) A memory page containing a heavi!y used variab!e that was initia!i?ed very ear!y and is in

constant use is removed then the page rep!acement a!gorithm used is :

a) EU

b) EDU

c) D9D

d) 0one of these

Answer: c

*xp!anation: 0one(

42) he aim of creating page rep!acement a!gorithms is to :

a) rep!ace pages faster

b) increase the page fau!t rate

c) decrease the page fau!t rate

d) to a!!ocate mu!tip!e pages to processes

Answer: c

44) ptima! page rep!acement a!gorithm is :

a) ep!ace the page that has not been used for a !ong time

b) ep!ace the page that has been used for a !ong time

c) ep!ace the page that wi!! not be used for a !ong time

d) 0one of these

Answer: c

48) ptima! page rep!acement a!gorithm is difficu!t to imp!ement because :

a) it re5uires a !ot of information

b) it re5uires future know!edge of the reference string

c) it is too comp!ex

d) it is extreme!y expensive

Answer: b

4


13/30

Answer: b

81) The essentia! content#s) in each entry of a page tab!e is @ are :

a) Firtua! page number

b) Page frame number

c) "oth virtua! page number and page frame number

d) Access right information

Answer: b

8) "ecause of virtua! memory the memory can be shared among

a) processes

b) threads

c) instructions


Answer:a

8&) ''''' is the concept in which a process is copied into main memory from the secondary

memory according to the re5uirement(

a) Paging

b) 3emand paging

c) $egmentation

d) $wapping

Answer:b

8+) $wap space exists in

a) primary memory

b) secondary memory

c) CPU


Answer:b

8-) .hen a program tries to access a page that is mapped in address space but not !oaded in

physica! memory then

a) segmentation fau!t occurs

b) fata! error occurs

c) page fau!t occurs

d) no error occurs

Answer:c82) 9n D9D page rep!acement a!gorithm when a page must be rep!aced

a) o!dest page is chosen

b) newest page is chosen

c) random page is chosen


Answer:a


14/30

84) .hich a!gorithm chooses the page that has not been used for the !ongest period of time

whenever the page re5uired to be rep!aced/

a) first in first out a!gorithm

b) additiona! reference bit a!gorithm

c) !east recent!y used a!gorithm

d) counting based page rep!acement a!gorithm

Answer:c

88) Firtua! memory a!!ows :

a) execution of a process that may not be comp!ete!y in memory

b) a program to be !arger than the physica! memory

c) a program to be !arger than the secondary storage

d) execution of a process without being in physica! memory

Answer: a and b

8


15/30

Answer: c


16/30

c) segment !imit

d) segment va!ue

Answer: a and c

1=1) The segment base contains the :

a) starting !ogica! address of the process

b) starting physica! address of the segment in memory

c) segment !ength

d) 0one of these

Answer: b

1=) The segment !imit contains the :

a) starting !ogica! address of the process

b) starting physica! address of the segment in memory

c) segment !ength

d) 0one of these

Fiew Answer

Answer: c

1=&) *xterna! fragmentation exists when :

a) enough tota! memory exists to satisfy a re5uest but it is not contiguous

b) the tota! memory is insufficient to satisfy a re5uest

c) a re5uest cannot be satisfied even when the tota! memory is free

d) 0one of these

Answer: a

1=+) .hen the memory a!!ocated to a process is s!ight!y !arger than the process then :

a) interna! fragmentation occurs

b) externa! fragmentation occurs

c) both a and b

d) neither a nor b

Answer: a

1=-) A so!ution to the prob!em of externa! fragmentation is :

a) compaction

b) !arger memory space

c) sma!!er memory space

d) 0one of theseAnswer: a

1=2) 9n contiguous memory a!!ocation :

a) each process is contained in a sing!e contiguous section of memory

b) a!! processes are contained in a sing!e contiguous section of memory

c) the memory space is contiguous

d) 0one of these

Answer: a


17/30

1=4) The re!ocation register he!ps in :

a) providing more address space to processes

b) a different address space to processes

c) to protect the address spaces of processes

d) 0one of these

Answer: c

1=8) .ith re!ocation and !imit registers each !ogica! address must be ''''''' the !imit register(

a) !ess than

b) e5ua! to

c) greater than

d) 0one of these

Answer: a

1=


18/30

c) write into the fi!e


Answer:d

11+) Di!e type can be represented by

a) fi!e name

b) fi!e extension

c) fi!e identifier


Answer:b

11-) .hich one of the fo!!owing exp!ains the se5uentia! fi!e access method/

a) random access according to the given byte number

b) read bytes one at a time in order

c) read@write se5uentia!!y by record

d) read@write random!y by record

Answer:b

112) 9n which type of a!!ocation method each fi!e occupy a set of contiguous b!ock on the disk/

a) contiguous a!!ocation

b) dynamic;storage a!!ocation

c) !inked a!!ocation

d) indexed a!!ocation

Answer:a

114) The information about a!! fi!es is kept in :

a) swap space

b) operating system

c) seperate directory structure

d) 0one of these

Answer: c

118) The fi!e name is genera!!y sp!it into two parts :

a) name

b) identifier

c) extension

d) type

Answer: a and c11


19/30

1=) Dor a direct access fi!e :

a) there are restrictions on the order of reading and writing

b) there are no restrictions on the order of reading and writing

c) access is restricted permission wise

d) access is not restricted permission wise

Answer: b

1&) The fi!e system G0TD$H stands for

a) 0ew Type Di!e $ystem

b) 0ever Terminated Di!e $ystem

c) 0ew Techno!ogy Di!e $ystem

d) 0on Terminated Di!e $ystem

Answer: c

1+) The PC" contains information that makes the process IIII(( entity

a)dynamic

b)passive

c)an active

d)static

Answer: c

1-) The ready 5ueue is nothing but a !ist of III(( imp!emented as a !inked !ist

a) Process

b)both a and b

c)PC">s

d)processor

Answer: c

12) The operating system schedu!er schedu!es processes from the III( for execution by the

CPU

a) ready 5ueue

b)waiting 5ueue

c)running 5ueue

d)"oth a and b

Answer:a

14) The short;term schedu!er #or CPU schedu!er) carries out the ;;;;;;;;;;;

a) se!ection processb)execution process

c)starter process

d)termination process

Answer:a

18) CPU switching from one process to another re5uires saving the state of the current process

and !oading the !atest state of the next process is known asIII(

a) context switch


20/30

b)packet switch

c)process switch

d)processor switch

Answer:a

1


21/30

1+=)The situation where we have a set of processes each ho!ding some resources each

re5uesting some resources and none of them is ab!e to obtain what it needs( $uch situation is

ca!!ed;;;;;;;;;;;;

a) 3ead!ock

b) reusab!e

c) utua! exc!usion

d) "oth a and b

Answer:a

1+1) A situation where the tota! si?e of ho!e is divided into a set of sma!!er ho!es is !arge enough

to ho!d another process for execution but the process cannot be !oaded as the ho!e is not

contiguous( This is known as ;;;;;;;;;;;;;(

a) externa! fragmentation

b) 9nterna! fragmentation

c) both a and b

d) rea!!ocationAnswer:a

1+) 9n first;in;first;out page rep!acement a!gorithm when a page rep!acement is re5uired the

;;;;;;;;;;;; in memory is the victim(

a) dead page

b) ecent page

c) o!dest page

d) "oth a and b

Answer:c

1+&)An optima! page rep!acement a!gorithm produces the ;;;;;;;;;;;;;rate of a!! a!gorithms

a) !owest page fau!t

b) %ighest page fau!t

c) both a and b

d) fragmentation

Answer:a

1++) 9PC stands for;;;;;;;;;;;;;

a) inte!!ectua! process community

b) 9nter;persona! communication

c) 9nter;processor communication

d) 9nter;persona! community

Answer:c

1+-) The round;robin CPU schedu!ing a!gorithm is basica!!y a ;;;;;;;;;;schedu!ing a!gorithm

designed for ;;;;;;;;;;;;;;; systems

a) non;preemptive time;sharing

b) non;preemptive mu!ti; processor


22/30

c) preemptive resource;sharing

d) preemptive time;sharing

Answer:d

1+2) .hich of the fo!!owing is not the approach to dea!ing with dead!ock/

a) Prevention

b) Avoidance

c) 3etection

d) 3e!etion

Answer:d

1+4) (((((((((((((( refers to a situation in which a process is ready to execute but is continuous!y

denied access to a processor in deference to other processes(

a) $ynchroni?ation

b) utua! *xc!usion

c) 3ead !ock

d) $tarvationAnswer:d

1+4) .ith (((((((((((((((( a page is brought into main memory on!y when the reference is made to a

!ocation on that page(

a) demand paging

b) main paging

c) prepaging

d) postpaging

Answer:a

1+8) Process is ((((((((((((((((((((((((

a) a program in execution

b) an instance of a program running on a computer(

c) the entity that can be assigned to and executed

d) a!! of the above(

Answer:d

1+


23/30

b) rea! memory

c) virtua! memory

d) secondary memory

Answer:c

1-1) A direct method of dead!ock prevention is to prevent the occurrences of (((((((((((((((((((

a) mutua! exc!usion

b) ho!d and waitc) circu!ar waits

d) no preemption

Answer:c

1-) ain function of shared memory is:

a)to use primary memory efficent!y

b)to do intra process communication

c)to do inter process communication

d)none of above

Answer:c1-&) "e!ady anamo!y occurs in

a) ptima! rep!acement

b) D9D

c) EU

d)both in D9D and EU

Answer:b

1-+) .hich schedu!ing po!icy is best suited for time;sharing operating systems

a)$hortest ,ob first

b)ound robinc)Dirst come first serve

d)*!evator

Answer:b

1--) .hich is non pre;emptive

a)ound robin

b)D9D

c)7$

d)7$D

Answer:b

1-2)A page fau!t occurs

a)when a page is not in memory

b) when a page is in memory

c)when a process in the ready state

d) when a process in the ready state

Answer:a

1-4).hat is a she!!/

a)it is a hardware component


24/30

b) it is a software component

c)it is a command interpreter

d) it is a too! in cpu schedu!ing

Answer:c

1-8) 9nterva! between the time of submission and comp!etion of the ,ob is

ca!!ed

#a) .aiting time#b) Turnaround time

#c) Throughput

#d) esponse time

Answer:b

1- page rep!acement po!icy is

a) East ep!aced Unit(

b) East estored Unit(

c) Eeast ecent!y Used(

d) Eeast e5uired Unit(


25/30

Answer:c

12+) A critica! section is a program segment

#a) which shou!d run in a certain specified amount of time(

#b) which avoids dead!ocks(

#c) where shared resources are accessed(

#d) which must be enc!osed by a pair of semaphore operations P and F(

Answer:c12-) 6obs which are admitted to the system for processing is ca!!ed

#a) !ong;term schedu!ing

#b) short;term schedu!ing

#c) medium;term schedu!ing

#d) 5ueuing

Answer:a

122) The memory a!!ocation scheme sub,ect to Gexterna!H fragmentation is

#a) segmentation

#b) swapping

#c) pure demand paging

#d) mu!tip!e fixed contiguous partitions

Answer:a

124) ''''''''''' is a techni5ue of improving the priority of process waiting in 7ueue

for CPU a!!ocation

#a) $tarvation

#b) Ageing

#c) evocation

#d) e!ocation

Answer:b

128) emory management is

a) not used in modern operating system

b)rep!aced with virtua! memory on current system

c) not used on mu!tiprogramming systems

d) critica! for even the simp!est operating system

Answer:b

12


26/30

a) schedu!ing

b)caching

c) swapping

d) spoo!ing

Answer:c

141) .hat are the two types of $emaphore/

a) ( 3igita! $emaphores and "inary $emaphores

b) Ana!og $emaphores and cta! $emaphores

c) Counting $emaphores and "inary $emaphores

d) Critica! $emaphores and $ystem $emaphores

Answer:c

14) .hich of the fo!!owing is not process states/

a) 0ew

b) unning

c) eady

d) Dinished

Answer:d

14&) .hich of the fo!!owing is the a!!ocation method of a disk space/a)Contiguous a!!ocation

b)( Einked a!!ocation

c)( 9ndexed a!!ocation

d) A!! of the AboveAnswer:d14+) .hat do you mean by emory Compaction/

a)Combine mu!tip!e e5ua! memory ho!es into one big ho!e

b) Combine mu!tip!e sma!! memory ho!es into one big ho!e

c) 3ivide big memory ho!e into sma!! ho!esd)( 3ivide memory ho!e by

Answer:b

14-) .hich one of the fo!!owing is not the function of perating $ystem/a) esource anagement

b) Di!e anagement

c) 0etworkingd) Processor anagement

Answer:c

142) The "anker>s a!gorithm is used

a)( to rectify dead!ock

b) to detect dead!ock

c) to prevent dead!ock

d) to s!ove dead!ock


27/30

Answer:c

144) The necessary conditions needed before dead!ock can occur/

a)( 0o utua! *xc!usion %o!d and wait Preemption Circu!ar .ait

b) utua! *xc!usion 0o %o!d and wait Preemption Circu!ar .ait

c) utua! *xc!usion %o!d and wait 0o Preemption Circu!ar .ait

d) utua! *xc!usion %o!d and wait Preemption 0o Circu!ar .ait

Answer:c148) Copying a process from memory to disk to a!!ow space for other processes is Ca!!ed

a)( $wapping

b) 3ead!ockc) 3emand Paging

d) Page Dau!t

Answer:a14


28/30

b) Compi!ers

c) $ystem Ca!!

d)Caching

Answer:c18-) The so!ution to Critica! $ection Prob!em is : utua! *xc!usion Progress and "ounded

.aiting(

a) The statement is fa!se

b) The statement is true(

c) The statement is contradictory(

d)0one of the above

Answer:b

182) The number of processes comp!eted per unit time is known as ''''''''''(

a) utput

b) Throughput

c) *fficiency

d) Capacity

Answer:b184) ''''''''' is the situation in which a process is waiting on another processwhich is a!so

waiting on another process ((( which is waiting on the first process( 0one of the processes

invo!ved in this circu!ar wait are making progress(

a) 3ead!ock

b)$tarvation

c)3ormant

d)0one of the above

Answer:a

188) ) A critica! region

a)is a piece of code which on!y one process executes at a time

b)is a region prone to dead!ock

c)is a piece of code which on!y a finite number of processes execute

d) is found on!y in .indows 0T operation system

Answer:a

18


29/30

a) a!!ows easy storage and retrieva! of fi!e names

b)is a much debated unecessary feature

c)is not essentia! when we have mi!!ions of fi!es

d) none of the above

Answer:a

1


30/30

b)( perating system

c) $ystem operationsd) 0one

Answer:b1

bca 502 operating systems-2

Documents