3. spooling is a technique fora. improving utilisation of CPU and i/o devicesb. improving -do- of diskc. -do- of taped. -do- of printer

2. A dynamic link librarya. can be loaded explicitlyb. is loaded when the application linking to it is being loadedc. both of the aboved. none

3. Which of the following CPU scheduling algorithm is optimum and required to thoroughly of a systema. First come first serveb. shortest job firstc. round robind. none

4.synchronisation is a process by whicha. It is ensured that only one processes or accesses of a resource at atimeb. ************* accesses to a resources is prohibitedc. two computers communicate on internetd. none

5. a system can be prevented from entering into dead lock bya. Allowing a process to start executing only after itb has requested and acquired all the resourcesb. Allow a peocess to hold only one resourcesc. Numbering all the resources and making processes required them in strictly increasing no.d. any

6. Which of the following short method will have the poorest performance in already sorted lista. radix sortb. quick sortc. insertiond. shell

10. which is not true for a friend functiona. a function may be declared a friend of more than one classb. it does not have a class scopec. it can be declared any where without affecting its meaningd. it requires an object that declares it friend for invoking it

11. The normal form that solves the problem of repitition of a constant is called multivalued dependenta. 3NFb. BCNFc. 4NFd. 5NF