OPERATING SYSTEMS 2 MARK Q & A

UNIT -1
1. What is meant by Mainframe Systems? Mainframe systems are the first computers developed to tackle many commercial and scientific applications. These systems are developed from the batch systems and then multiprogramming system and finally time sharing systems. 2. What is meant by Batch Systems? In this, operators batched together obs !ith similar needs and ran through the computer as a group .The operators !ould sort programs into batches !ith similar re"uirements and as system become available, it !ould run each batch. 3. What is meant by Multiprogramming? #everal users simultaneously compete for system resources $i.e% the ob currently !aiting for I&' !ill yield the ()U to another ob !hich is ready to do calculations, if another ob is !aiting. Thus it increases ()U utili*ation and system throughput. 4. What is meant by Time-sharing Systems? Time #haring is a logical e+tension of multiprogramming .,ere, ()U e+ecutes multiple obs by s!itching among them, but the s!itches occur so fre"uently that the users can interact !ith each program !hile it is running. . What are the !omponents of a !omputer System? -pplication )rograms #ystem )rogram 'perating #ystem (omputer ,ard!are ". What are the a#$antages of Multiprogramming? Increased #ystem Throughput Increased ()U utili*ation %. What are Multiprocessor System? Multiprocessor systems have systems more than one processor for communication, sharing the computer bus, the memory, clock . peripheral devices. &. What are the a#$antages of multiprocessors? Increased throughput /conomy of scale Increased reliability '. What is meant by clustere# system? (lustered systems are collection of multiple ()Us to accomplish computational
1

OPERATING SYSTEMS 2 MARK Q & A

!ork. Those systems share storage and are closely linked via 0-N net!orking. 1(. What are the types of clustering? -symmetric (lustering #ymmetric (lustering . (lustering over a 1-N 11. What is meant by )symmetric !lustering? In this clustering, one machine is in hot standby mode, !hile the other is running the application. The hot standby machine ust monitors the active server. If that server fails, hot stand by host become the active server. 12. What is meant by Symmetric clustering? In this, t!o or more hosts are running applications and they are monitoring each other. This clustering re"uires more than one application be available to run and it uses all of the available hard!are. 13. What is meant by parallel clusters? )arallel clusters allo! multiple hosts to access the same data on the shared storage. /ach machine has full access to all data in the database. 14. What is meant by symmetric multiprocessing? In #ymmetric multiprocessing, each processor runs an identical copy of the operating system and these copies communicate !ith one another as needed. 1 . What is meant by )symmetric Multiprocessing? In -symmetric multiprocessing, each processor assigned a specific task. master processor controls the system and the other processors either look to the master for instruction or have predefined tasks. This master processor also schedules and allocates !ork to the slaves. 1". What is meant by *eal time system? 2eal time systems are systems that have their in-built characteristics as supplying immediate response. In real time system, each process is assigned a certain level of priority according to the relative importance of the events to be processed. 1%. What are the a#$antages of #istribute# systems? 2esource sharing 0oad balancing 2eliability (ommunication link easy 1&. What are the applications of real-time systems? (ontrolling the machines Instruments Industrial process 0anding . tasking off aero planes
3

OPERATING SYSTEMS 2 MARK Q & A

2eal time simulations Military applications. 1'. What are the types of *eal time systems? ,ard 2eal Time #ystem #oft 2eal Time #ystem 2(. What is meant by +ar# *eal time systems? They are generally re"uired to and they guarantee that the critical tasks are completed in given amount of time. 21. What is meant by soft real time system? It provides priority to the tasks based on their criticality. It does not guarantee completion of critical tasks in time. 22. What is meant by #istribute# systems? - distributed system is basically a collection of autonomous computer systems !hich co-operate !ith one another through their h&! and s&! interconnections. 23. What are the #isa#$antages of #istribute# systems? #ecurity !eakness 'ver dependence on performance and reliability Maintenance and control become comple+ 24. What are the mo#es of operation in +ar#,are -rotection? User Mode Monitor Mode 2 . What are .perating Ser$ices? Normally, an operating system provides certain services to programs and to the users of those programs. #ome of them are4 )rogram /+ecution. I&' operations 5ile-system manipulation (ommunications /rror 6etection 2". What is System -rograms? #ystem programs provide a convenient environment for program development and e+ecution. #ome of these programs are user interfaces to system calls and others are more comple+. #ome of them are4 5ile Management #tatus Information 5ile modification )rogramming 0anguage support
7

OPERATING SYSTEMS 2 MARK Q & A

)rogram loading, e+ecution and communication. 2%. What is meant by System !alls? The #ystem (alls acts as a interface to a running program and the 'perating system. These system calls available in assembly language instructions. 2&. What is /irtual machine? The -pplication programs vie! everything under them in the hierarchy as though the system programs !ere part of the machine itself. This layered approach is taken as the logical conclusion in the concept of a 8irtual machine. 2'. What is meant by +an# hel# Systems? ,andheld #ystems have a small amount of memory including slo! processors and also small display screens and are of limited si*e and they al!ays have connectivity to a net!ork. 3(. What is 0no,n as system utilities? Most operating systems are supplied !ith programs that solve common problems or perform common operations. #uch programs include !eb bro!sers, !ord processors and te+t formatters, spread sheets, database systems, compilers, plotting and games. These programs are kno!n as system utilities.

123T -2
1. 4efine -rocess. )rocess is defined as )rogram in e+ecution - synchronous activity. The 9animated spirit9 of a procedure The 9locus of control of a procedure in e+ecution !hich is manifested by the e+istence of a 9process control block9 in the operating system That entity to !hich processors are assigned the dispatch able unit

OPERATING SYSTEMS 2 MARK Q & A

2. What are the #ifferent process states a$ailable? *unning5 if it currently has the ()U *ea#y5 if it could use a ()U if one !ere available Bloc0e#5 if it is !aiting for some event to happen before it can proceed 3. What is meant by 4ispatching? The )rocess of assignment of the ()U to the first process on the ready list is called as 6ispatching. 4. What is 6-!B? 5)(; is a data structure containing certain important information about the process including the follo!ing4 (urrent state of the process Uni"ue identification of the process - pointer to the process<s parent - pointer to the process<s child The process<s priority )ointers to locate the process<s memory and to allocated resources. . +o, is Bloc0e# state #ifferent from others? The ;locked state is different from others because the others are initiated by entities e+ternal to the process. ". What are the #ifferent operations that can be performe# on a process? 1% (reate a process 3% 6estroy a process 7% (hange a process<s priority :% 1akeup a process =% /nable a process to communicate !ith others >% #uspend a process ?% 2esume a process @% ;lock a process

OPERATING SYSTEMS 2 MARK Q & A

%. What is meant by !reating a -rocess? (reating a process involves many operations including 1% Name the process 3% Insert it in the system<s kno!n processes list 7% 6etermine the process<s initial priority :% (reate the process control block =% -llocate the process<s initial resources &. What is means by *esuming a -rocess? 2esuming a process involves restarting it from the point at !hich it !as suspended. '. What is meant by Suspen#ing a -rocess? #uspending is often performed by the system to remove certain processes temporarily to reduce the system load during a peak loading situation. 1(. What is meant by !onte7t S,itching? 1hen an interrupt occurs, the operating system saves the status of the interrupted process routes control to the appropriate first level interrupt handler. 11. What is meant by -SW? )rogram #tatus 1ords $)#1% controls the order of instruction e+ecution and contains various information about the state of a process. There are three types of )#1<s namely (urrent )#1 Ne! )#1 'ld )#1 12. 4efine Mutual 87clusion. /ach process accessing the shared data e+cludes all others from doing simultaneously called as Mutual /+clusion. 13. What is meant by !o-operating process? If a process can affect or be affected by the other processes e+ecuting in the system, that process !hich shares data !ith other process is called as (o-operating process. 14. What is meant by 3nterrupt?

-n Interrupt is an event that alters the se"uence in !hich a processor e+ecutes instructions. It is generated by the hard!are of the computer #ystem.
1 . What is meant by 4egree of Multiprogramming? )n# ,hen it is sai# to be Stable? 6egree of Multiprogramming means the number of processes in memory. -nd it is said to be stable !hen the average rate of the number of process creation is e"ual to the average departure rate of processes leaving the system.

1". What is meant by !-1-boun# process? - ()U-bound process generates I&' re"uests infre"uently using more of its time doing
>

OPERATING SYSTEMS 2 MARK Q & A

computation than an I&' processes. If all processes are ()U-bound, the I&' !aiting "ueue !ill almost be empty and the devices !ill go unused and the system !ill be unbalanced. 1%. What is meant by 39.-boun# process? -n I&'-bound process spends more of its time doing I&' than it spends doing computations .If all processes are I&'-bound, the ready "ueue !ill almost be empty. 1&. What is meant by 3n#epen#ent process? - )rocess is Independent if it cannot affect or be affected by the other processes e+ecuting in the system. ,ere no process shares its data !ith other process available. 1'. What is meant by 4irect !ommunication? In 6irect communication, each process that !ants to communicate must e+plicitly name the recipient or sender of the communication. In this scheme, the #end . 2eceive primitives are defined as4 send $ p , message % - #end a message to process ) receive $ p , message % - 2eceive a message to process p 2(. What is meant by 3n#irect !ommunication? In Indirect (ommunication, the messages are sent to and received from mailbo+es or ports. - mailbo+ is an ob ect into !hich messages can be placed by processes and from !hich messages can be removed. In this scheme, the #end . 2eceive primitives are defined as4 send $ - , message % - #end a message to mailbo+ -. receive $ - , message % - 2eceive a message from mailbo+ -. 21. What are benefits of Multiprogramming? 2esponsiveness 2esource #haring /conomy Utili*ation of multiprocessor architectures. 22. What are the con#itions that must hol# for 4ea#loc0 -re$ention? Mutual /+clusion (ondition ,old and 1ait (ondition No )re-emption condition (ircular 1ait (ondition. 23. What are the options for brea0ing a 4ea#loc0? #imply abort one or more process to break the circular !ait. )reempt some resources from one or more of the deadlocked processes.

24. What are the algorithms a$ailable for 4ea#loc0 a$oi#ance? 1% 2esource--llocation Araph -lgorithm 3% ;anker<s -lgorithm a. #afety -lgorithm b. 2esource-2e"uest -lgorithm
?

OPERATING SYSTEMS 2 MARK Q & A

2 . What is a Monitor? - Monitor is characteri*ed by a set of programmer-defined operators. The representation of a Monitor type consists of declaration of variables !hose value define the state of an instance of the type, as !ell as the bodies of procedures or functions that implement operations on the type. 2". What is meant by !ounting Semaphore? - (ounting #emaphore is a semaphore !hose integer value that can range bet!een B . 1. 2%. What is meant by Binary Semaphore? - ;inary #emaphore is a semaphore !ith an integer value that can range bet!een B and 1. It can be simpler to implement than a counting semaphore, depending on the underlying hard!are architecture. 2&. What is meant by *ace !on#ition? - condition, !hen several processes access and manipulate the same data on currently and the outcome of the e+ecution depends on the particular order in !hich the access takes place is called as 2ace condition. 2'. What #oes a solution for !ritical-Section -roblem must satisfy? Mutual /+clusion. )rogress ;ounded 1aiting 3(. What is meant by 3n#efinite Bloc0ing or Star$ation? Indefinite ;locking is a situation !here process !aits indefinitely !ithin the semaphore. This may occur if !e add and remove processes from the list associated !ith a semaphore in 0I5' order.

123T -3
1. What is meant by !-1 Sche#uler? 1hen the ()U becomes idle, the operating system must select one of the processes in the ready "ueue to be e+ecuted .This selection process is carried out by the ()U #cheduler. 2. What is meant by !-1 Sche#uling?
@

OPERATING SYSTEMS 2 MARK Q & A

The process of selecting among the processes in memory that are ready to e+ecute and allocates the ()U to one of them is called as ()U #cheduling. 3. What are the types of Sche#uling a$ailable? )reemptive #cheduling Non - preemptive #cheduling )riority #cheduling 4. What is meant by -riority Sche#uling? The basic idea here is straight to!ard. /ach process is assigned a priority and the run able process !ith the highest priority is allo!ed to run. . What is -reempti$e Sche#uling? - #cheduling discipline is )re-emptive if the ()U can be taken a!ay before the process completes. ". What is 2on - -reempti$e Sche#uling? - #cheduling discipline is non pre-emptive if once a process has been given the ()U, the ()U cannot be taken a!ay from the process. %. What are the properties of Sche#uling )lgorithms? ()U Utili*ation Throughput Turnaround time 1aiting time 2esponse time &. What is 0no,n as *esource *eser$ation in *eal time Sche#uling? The #cheduler either admits the process, guaranteeing that the process !ill complete on time or re ects the re"uest as impossible. This is kno!n as 2esource 2eservation. '. What is 0no,n as -riority in$ersion? The high priority process !ould be !aiting for a lo!er -priority one to finish. This situation is kno!n as )riority Inversion. 1(. What is meant by 4ispatch latency? The time taken by the dispatcher to stop one process and start another running is kno!n as 6ispatch 0atency. 11. What is meant by 4ispatcher? It is a module that gives control of the ()U to the process selected by the short-term scheduler .This function involves #!itching (onte+t #!itching to User Mode Cumping to the proper location in the user program to restart that program 12. What is meant by 6irst !ome5 6irst Ser$e# Sche#uling? In this #cheduling, the process that re"uests the ()U first is allocated the ()U first. This
D

OPERATING SYSTEMS 2 MARK Q & A

#cheduling algorithm is Non )re-emptive. 13. What is meant by Shortest :ob 6irst Sche#uling? 1hen the ()U is available, it is assigned to the process that has the smallest ne+t ()U burst. This #cheduling algorithm is either )re-emptive or Non )re-emptive. 14. What is meant by -riority Sche#uling? - )riority is associated !ith each process and the ()U is allocated to the process !ith the highest priority. This is also either )re-emptive or Non )re-emptive. 1 . What is meant by Memory-Management 1nit? The run-time mapping form virtual to physical addresses is done by a hard!are device is a called as Memory Management Unit. 1". What is meant by 3nput ;ueue? The (ollection of processes on the disk that is !aiting to be brought into memory for e+ecution forms the Input Eueue. 1%. What is *oun#-*obin Sche#uling? In 2ound-2obin #cheduling, processes are dispatched 5I5', but are given a limited amount of ()U time. If a process doesn<t complete before it<s ()U time e+pires, the ()U is )reemptied and given to the ne+t !aiting process. The )re-emptied is then placed at the back of the ready list.

1&. What is 0no,n as 4ynamic loa#ing?

1ith 6ynamic loading, a routine is not loaded until it is called. -ll routines are kept on disk in a re-locatable load format. The main program is loaded into memory and is e+ecuted. 1hen a routine needs to call another routine, the calling routine first checks to see !hether the another routine has been loaded. If not, the re-locatable linking loader is called to load the desired routine into memory and to update the program<s address tables to reflect this change. Then, (ontrol is passed to the ne!ly loaded routine. 1'. What is meant by S,apping? It is a process of bringing in each process in its entirety, running it for a !hile and then putting it back on the disk.

2(. What is the a#$antage of 4ynamic <oa#ing?

The advantage of 6ynamic 0oading is that an unused routine is never loaded.$i.e% !hen large amounts of code are needed to handle infre"uently occurring cases, such as error routines. ,ere although program si*e may be large, the portion that is used may be much smaller and better memory space utili*ation.

21. What is 0no,n as 4ynamic <in0ing?

In this 6ynamic 0inking, a stub is included in the image for each library-routine reference. This #tub is a small piece of code that indicates ho! to locate the appropriate memory-resident library routine or ho! to load the library if the routine is not already present. 22. What is meant by 87ternal 6ragmentation an# 3nternal 6ragmentation?
1B

OPERATING SYSTEMS 2 MARK Q & A

/+ternal 5ragmentation e+ists !hen enough total memory space e+ists to satisfy a re"uest, but it is not contiguous and storage is fragmented into a large number of small holes. The memory allocated to a process may be slightly larger than the re"uested memory. The difference bet!een these t!o numbers is called as Internal 5ragmentation. 23. What is meant by -aging? =i$e its a#$antages. )aging is a Memory-management scheme that permits the physical -address space of a process to be Non-contiguous. -dvantages4 -voids the considerable problem of fitting the varying -si*ed memory chunks onto the baking store 5ragmentation problems are also prevalent baking store, e+cept that access is much slo!er, so compaction is impossible. 2 . What is T<B an# +it-*atio? Translation 0ookaside ;uffer $T0;% is a small, special and fast cache !hich is associated !ith high speed memory. The )ercentage of times that a particular page number is found in the Translation 0ookaside ;uffer $T0;% is called as ,it- 2atio. 2%. What is meant by Segmentation? #egmentation is a memory-management scheme that supports the user-vie! memory. ;locks of different si*e is called as #egments and its associative virtual storage 'rgani*ation is called as #egmentation. 2'. What is meant by Memory !ompaction? 1hen s!apping creates multiple holes in memory, it is possible to combine them all into one big one by moving all the processes do!n!ard as far as possible. 3(. What is meant by o$erlay? The idea of overlays is to keep in memory only those instructions and data that are needed at any given time. #o, to enable a process to be larger than the amount of memory allocated to it.

123T -4
1. What is meant by 4eman# -aging? 1henever the ()U tries to fetch the first instruction, it gets a page fault causing the B# to bring in the page containing that instruction. Thus the pages are loaded only on demand is called as 6emand )aging. 2. What is meant by <ocality of reference? 6uring any phase of e+ecution, the page references only a relative small fraction of its pages. This reference of fraction of all pages is called as 0ocality of 2eference. 3. What are the principal e$ents of -rocess !reation? #ystem Initiali*ation. /+ecution of a #ystem call by a running process.
11

OPERATING SYSTEMS 2 MARK Q & A

- user re"uest to create a ne! process. Initiation of a batch ob. 4. What is meant by -age 6ault? 1henever memory management unit notices that the page is unmapped and causes the ()U to trap to the 'perating #ystem. This trap is called as )age 5ault. . What is meant by Thrashing? - )rogram !hich is causing page faults every fe! instructions to occur is called as Thrashing. ". What is meant by Te7t 6ile? - Te+t 5ile is a se"uence of characters organi*ed into lines. %. What is meant by Source 6ile? - #ource 5ile is a se"uence of subroutines and functions, each of !hich is further organi*ed as declarations follo!ed by e+ecutable statements. &. What is meant by .b>ect 6ile? -n 'b ect file is a se"uence of bytes organi*ed into blocks understandable by the system<s linker. '. What is meant by 87ecutable file? -n /+ecutable file is a series of code sections that the loader can bring into memory and e+ecute. 1(. What are the )ccess metho#s a$ailable ? #e"uential -ccess 6irect -ccess 'ther -ccess methods 11. What is meant by -age Table? )age Table is a table !hich has the ability to mark an entry invalid through a 8alid F Invalid bit or special value of protection bits. 12. What are the $arious operations performe# in a 6ile? 1% (reating 3% 6eleting 7% 'pening :% (losing =% 2eading >% 1riting ?% -ppending @% #eeking D% 2enaming 1B% Aetting . #etting -ttributes. 13. What are the operations performe# in a 4irectory?
13

OPERATING SYSTEMS 2 MARK Q & A

1% 3% 7% :% =% >% ?% @%

(reate 6elete 'pendir (losedir 2eaddir 2ename 0ink Unlink

14. What are the #ifferent #irectory structures a$ailable? #ingle - 0evel 6irectory T!o - 0evel 6irectory Three - #tructured 6irectory - cyclic - Araph 6irectory Aeneral Araph 6irectory 1 . What is meant by S,apping? It is a process of bringing in each process in its entirety, running it for a !hile, then putting it back on the disk. 1". What is meant by Memory !ompaction? 1hen s!apping creates multiple holes in memory, it is possible to combine them all into one big by moving all the processes do!n!ard as far as possible. 1%. What is meant by Boot !ontrol bloc0? The ;lock !hich contains information needed by the system to boot an operating system from that partition is called as ;oot (ontrol ;lock. 1&. What is meant by -artition !ontrol Bloc0? The ;lock !hich contains partition details such as the number of blocks in that partition, si*e of the blocks, free -block count and free - block pointers is called as partition control ;lock. 1'. What are the #ifferent metho#s for allocation in a 6ile System? (ontiguous -llocation 0inked -llocation Inde+ed -llocation 2(. What is meant by 6ree Space <ist? The list !hich maintains&records all free disk block !hich means blocks that are not allocated to some file or 6irectory. 21. What is meant by Buffering? ;uffering is a process of providing space in the primary storage to hold the physical blocks of files at once. 22. What is 4ouble Buffering? It is a process in !hich the first buffer receives and holds the records generated by the running process until it becomes full. Thus the process continues to deposit the generated records
17

OPERATING SYSTEMS 2 MARK Q & A

in first buffer. 23. Mention fe, -age *eplacement Strategies. 'ptimal )age 2eplacement 5I5' )age 2eplacement 02U )age replacement M5U )age 2eplacement 05U )age 2eplacement 2andom )age 2eplacement 24. What is meant by =lobal *eplacement an# <ocal *eplacement? =lobal -age *eplacement allo!s a process to select a replacement frame from the set of all frames, even if that frame is currently allocated to some other process. <ocal *eplacement re"uires that each process select from only its o!n set of allocated frames. ,ere the number of frames allocated to a process doesn<t change. 2 . What is meant by Wor0ing Set? - 1orking #et is defined as the collection of pages a process is actively referencing. 2". What is meant by 4ouble Buffering? - Memory Mapping proceeds by reading in disk blocks from the file system and storing them in the buffer cache. ;ecause the virtual memory system cannot interface !ith the buffer cache, the contents of file in the buffer cache must be copied into the page cache. This situation is kno!n as 6ouble (aching. 2%. What are 6ile )ttributes? Identifier Type, #i*e 0ocation, protection Time, 6ate . User Identification 2'. What is meant by 3#entifier in 6iles? This has a uni"ue tag, !hich is al!ays a number that identifies the file !ithin the filesystem and it is non-human readable name for the file. 3(. What is meant by 6ile -ointer? This pointer is uni"ue to each process operating on the file and it is the pointer used by the pointer used by the system to track the last read-!rite location as a current - file position pointer.

1:

OPERATING SYSTEMS 2 MARK Q & A

UNIT -=
1. What is meant by See0 Time? It is the time taken for the disk arm to move the heads to the cylinder containing the desired sector. 2. What is meant by *otational <atency? It is defined as the additional time !aiting for the disk to rotate the desired sector to the disk head. 3. What is meant by Ban# Wi#th? ;and 1idth is the total number of bytes transferred, divided by the total time bet!een the first re"uest for service and the completion of the last transfer. 4. What is meant by <o,-le$el formatting? 0o!-level formatting fills the disk !ith a special data structure for each sector .The 6ata structure for a sector typically consists of a header ,a data area and a trailer. . What is meant by S,ap-Space Management? It is a lo!-level task of the operating system ./fficient management of the s!ap space is called as #!ap space management. This #!ap space is the space needed for the entire process image including code and 6ata segments. ". What is meant by 4is0 Sche#uling? 6isk scheduling is a process of allocation of the disk to one process at a time. In multi1=

OPERATING SYSTEMS 2 MARK Q & A

programmed system, many processes try to read or !rite the records on disks as the same time. To avoid disk arbitration, it is necessary. %. Why 4is0 Sche#uling necessary? To avoid 6isk arbitration !hich occurs !hen many processes try to read or !rite the records on disks at the same time, 6isk #cheduling is necessary. &. What are the characteristics of 4is0 Sche#uling? 1% Throughput 3% Mean 2esponse Time 7% 8ariance of 2esponse time D.1hat are the different types of 6isk #cheduling G. #ome of the 6isk #cheduling are $i%.##T5 #cheduling $ii%.5(5# #cheduling $iii% #(-N #cheduling $iv%.(-#(-N #cheduling $v%.0''H #cheduling. 1B.1hat is meant by ##T5 #chedulingG. ##T5 -lgorithm selects the re"uest !ith the minimum seek time from the current head position. and ##T5 chooses the pending re"uest to the current head position. 11.1hat is meant by 5(5# #cheduling G It is #implest form of 6isk #cheduling. This algorithm serves the first come process al!ays and is does not provide 5ast service. 13.1hat is meant by #(-N #cheduling G. In the #(-N algorithm, the disk arm starts at one end of the disk and moves to!ard the other end of the disk. -t the other end, the direction of head movement is reversed and servicing continues across the disk. 17.1hat is meant by (-#(-N #chedulingG (-#(-N means (ircular #(-N algorithm. This #cheduling is a variant of #(-N designed to provide a more !aiting time. This essentially treats the cylinder as a circular list that !raps around from the final cylinder to the first one. 1:.6efing Throughput . It is defined as the number of re"uests serviced per unit time. 1=. 1hat is meant by 6ata #tripingG. 6ata #tripping means splitting the bits of each byte across multiple disks .It is also called as ;it -level #triping . 1>.1hat is meant by ;oot 6isk G. - 6isk that has a boot partition is called as ;oot 6isk. 1?.1hat are the (omponents of a 0inu+ #ystem G 0inu+ #ystem composed of three $i%.Hernel $ii%.#ystem libraries $iii%.#ystem utilities
1>

main

modules.They

are

OPERATING SYSTEMS 2 MARK Q & A

1@. 1hat are the main support for the 0inu+ modules G. The Module support under 0inu+ has three components.They are 4 $i%. Module Management $ii%.6river 2egistration. $iii%.(onflict 2esolution mechanism. 1D. 1hat is meant by )rocess G. - )rocess is the basic conte+t !ithin !hich all user-re"uested activity is serviced !ithin the 'perating system. 3B.1hat is meant by )rocess -I6 G. /ach process has a uni"ue identifier. )I6 <s are used to specify processes to the operating system !hen an application makes a system call to signal, modify or !ait for another process. 31.1hat is meant by )ersonalityG. )rocess )ersonalities are primarily used by emulation libraries to re"uest that system call be compatible !ith certain versions of UNII. 33.1hat is meant by ;uffer cache G. It is the kernel<s main cache for block-oriented devices such as disk drives and is the main mechanism through !hich I&' to these devices is performed.

37.1hat is the 6isadvantage of #tatic 0inking G. The main disadvantage of static linking is that every program generated must contain copies of e+actly the same common system library functions. 3:.1hat is meant by Hernel in 0inu+ system G. Hernel is responsible for maintaining all the important abstractions of the operating system including such things as virtual memory and processes. 3=.1hat is meant by #ystem 0ibrariesG. #ystem 0ibraries define a standard set of functions through !hich applications can interact !ith the kernel and that implement much of the operating -system functionality that doesnJt need the full privileges of kernel code. 3>.1hat is meant by #ystem UtilitiesG. #ystem Utilities are system programs that perform individual, speciali*ed management tasks. #ome of the #ystem utilities may be invoked ust to initiali*e and configure some aspect of the system and others may run permanently, handling such tasks as responding to incoming net!ork connections, accepting logon re"uests from terminals or updating log files. 3?.1hat is the function of Module management G The module management allo!s modules to be loaded into memory and to talk to the rest
1?

OPERATING SYSTEMS 2 MARK Q & A

of the kernel. 3@.1hat is the function of 6river registrationG. 6river 2egistration allo!s modules to tell the rest of the kernel that a ne! driver has become available . 3D.1hat is the function of (onflict 2esolution mechanismG. This mechanism allo!s different device drivers to reserve hard!are resources and to protect those resources from accidental use by another driver. 7B.1hat is meant by 6evice driversG. 6evice drivers include $i% (haracter devices such as printers, terminals $ii% ;lock devices $including all disk drives% and net!ork interface devices.

1@