THEORY EXAN ON OPERATING SYSTEM COURSE NO DEE (C) 43 DATE: 05 JUL 2006

MM - 0 TIME 3 !"#

$ N% 3 (a) What is an operating system? Explain tasks of operating system. (6) (b) Explain the booting process of the PC. How will yo !etermine that yo r PC is booting. (") $ N% 4 (a) What !o yo know abo t process management? Explain process states brief (#) (b) What !o yo n!erstan! by m ltiprogramming batch system $time sharing system?. Which one is better?. (%) $ N% 5 (a) What is &irt al memory? How it is !iffer from physical memory. (') (b) Write !own the partition naming scheme of ()E !ri&e* +C+( !ri&e in ,in x (') $ N% 6 (a) What are the reso rces of an operating system? Explain in brief. (#) (b) Write the proce! re to mo nt a pen !ri&e in ,in x. -n! also write the comman!. (%) $ N% & (a) What is file system?. .i&e !ifference between /-0%1 $ 20/+ file system.(') (b) What are !ea!locks? What is the con!ition of !ea!lock occ rs $ how can pre&ent it. (') $ N% (a) What is process sche! ling.. Explain non3preempti&e sche! ling. (") (b) 0he following process are sche! le! on a processor which s pports m ltitasking P4*P1*P%*P". the or!er of priority for the processor are P45P15P%5P" Explain the se6 ence of sche! ling of process when the processes arri&e in the following +e6 ence for the gi&en sche! ling algorithms* P"*P4*P1*P% (i) /(/7 (ii) Preempti&e +che! ling (ii) 8o n! 8obin -ss me the time taken for the completion of each 9ob ' millisecon!s. (6) $ N% ' (a) What are the basic re6 irement of loa!ing ,in x 8e! hat :.; * an! write !own the steps to install the ,in x man ally . (") (b) .i&e a brief !escription of )7+ system files. (6) $ N% (0 S!%") *%)+#( E,-! 3 M,".#) (a) < ltitasking (b) 807+ (c) Process synchroni=ation partition (,in x) (e) /ile -llocation table (/-0) >>>>>>> ((0) !) +wap

>>>>>>>>>>>>>>>>

(2+0

.P?7//(CE8

THEORY EXAN ON OPERATING SYSTEM ($UI/) COURSE NO DEE (C) 43 DATE:- 05 JUL 2006 $ N% ( 2133 1* )!+ 43,*.# (a) (b) (c) (!) (e) (f) (g) (h) (9) (k) (l) (m) (n) (o) <+ )7+ is >>>>>>>>>>>>>>>>>bit operating system. Win!ow :@ is a >>>>>>>>>>>>>> ser >>>>>>>>>>>>>>>>>>>>>task operating system. (n win!ow :' /-0 46 s pport partition si=e of har! !isk >>>>>>>>>>>>>.A (n win!ow BP /-0 %1 s pport partition si=e of har! !isk >>>>>>>>>>>> 0A Comman! to create $ !elete a )(8 in ,in x 7+>>>>>>>>>>>>>>>>>>>>>. Win!ow ser&er 1;;% is a >>>>>>>>>>>>> ser >>>>>>>>>>>0ask operating +ystem. Bcopy is a >>>>>>>>>>>>>>>>>>>>>>)7+ comman!. /-0 to 20/+ con&ert Comman! >>>>>>>>>>>>>>>>> (n ,in x ,+ comman! is se! >>>>>>>>>>>>>>>>>>>>> .8CA stan!s for>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> /-0 %1 s pports >>>>>>>>>>character primary name>>>>>>>>>>>character extension name. 8-() stan!s for >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> +hort c t comman! in ,in x CC( mo! to .C( mo!e>>>>>>>>>>>>>>>>>>>>> ,in x 7+ the swap partition sho l! be >>>>>>>>>>>>>>>in si=e of the 8-<. MM - 20 TIME 20 01*

$ N% 2 TRUE52ALSE (a) (b) (c) We can create fo r primary partition in a single har! !isk /(/7 is a preempti&e sche! ling algorithm we can create two exten!e! partition in single har! !isk 0?/ 0?/ 0?/

(!) (e) (f)

,in x is a single ser m ltitasking operating. <+ office is a system software 0hrea!s occ py the memory space of process

0?/ 0?/ 0?/