Operating System

For Question No. 1 to 3 check True and False statements.

1. Initialization value of counting semaphore is number of available resources.
True/False
2. Spin lock is used to avoid the context switching. True/False
3. Ageing mechanism is used for allocation of resources. True/False
4. Which of the following are preemptive scheduling scheme?
a.Shortest job frst
b.Shortest remaining time
c.First come frst serve
d.None of These
5. What is the name given to the organized collection of software that controls the overall
operation of a computer?
a.Working system
b.Peripheral system
c.Operating system
d.Controlling System
6. In Multiprogramming Operating System keeps
a) Several resources in memory b) several processes in suspended mode.
c) Several jobs in memory d) none of these
7. Which one controls the degree of multiprogramming?
a. Long Term Sceduler
b. Medium Term Scheduler
c. Short Term Schedular
d. None of the above
8. What is swapping?
a.Copying a process from memory to disk to allow space for other processes
b.Copying a job in disk from place to other place in same disk
c.Copying a process from memory to cache
d.None of the above
9. A trap is a
a. Hardware Interrupt
b. Software Interrupt
b.A secret undocumented entry point into a program
c.All of the above
10. .requires that the operating system be given in advance additional information
concerning which resources a process will request and using during its lifetime.
a. Deadlock prevention b. Deadlock detection
c. Deadlock recovery d. Deadlock avoidance

11. Job Scheduler is a
a. short term scheduler
b. long term scheduler
c. CPU scheduler
d. Medium term scheduler
12. Which memory allows logical address spaces that are larger than the physical address space?
a. Dynamic Memory
b. ogical Memory
c. !irtual Memory
d. "#a$ memory
13. %n absolute loading addresses are bound at&&&&&&&&
a. Com$ile time
b. oad time
c. 'un Time
d. (ll o) abo*e
1+. The collection o) $rocess in)ormation is ke$t in and access through a&&&&&
a. Program "tatus ,ord
b. Process "tates
c. Process Control -lock
d. Process "tack
1.. ,hich loader al#ays loads $rograms into a designated memory location/
a. 'elocatable loader
b. (bsolute loader
c. Dynamic loader
d. (ll o) these
10. The -anker1s algorithm is an e2am$le o) a techni3ue )or4
a. Deadlock $re*ention
b. Deadlock a*oidance
c. Deadlock detection
d. Deadlock reco*ery
15. 6igh $aging acti*ity leads to
a. "#a$$ing
b. Com$action
c. Thrashing
d. 72ternal Fragmentation
18. "ituations #here t#o or more $rocess are reading or #riting some shared data and the )inal result de$ends
on the order o) usage o) the shared data are called.

a. 'ace Condition
b. Critical9"ection
c. Mutual 72clusion
d. Deadlocks
1:. %n)ormation about $rocess is maintained in a
a. "tack
b. Translation ook aside -u))er
c. $rocess Control -lock
d. $rogram control -lock
;<. Multiprocessor system is a
a. Parallel "ystem
b. tightly cou$led system
c. oosely cou$led system
d. -oth a = b
!"#$
1. ,hich %PC #ill be listed on terminal a)ter running the command >i$cs ?s1
a.@ shared memory b.@ sema$hore
c.@ socket d.@ "ignals
;@ ,hich library is used )or im$lementing PA"%B threads/
a.@ l$thread.h b.@ thread.h
c.@ $osthread.h d.@ $thread.h
3@ ,hich )unction #ill use to attach a shared memory segment/
a.@ shat b.@ shmatt
c.@ shmat d.@ shmadt
+@ ,hich )unction #ill be use to send a s$eci)ic signal to the current $rocess/
a.@ raise b.@ kill
c.@ "ignal d.@ $ause

.. ,hich command #ill use to create named $i$e
a.@ $i$e b.@ mk)i)o
c.@ both a = b d.@ none o) these
%. Which Signal handler ignores the generated Signal?
a. "%CDDF b. "%CD%CN
b. "%CD"7C! d. None o) these
&. !n message 'ueue( message type is always
a. unsigned int b. long
c. char d. short
). Which Run Level is used for single user mode?
a. Run level 1 b. Run level 2

c. Run level 3 d. Run level 4
*. When +ernel mo,es in +ernel mode
a.@ it running on behal) o) kernel b@ it running on behal) o) user
Process $rocess
b.@ it running on behal) o) kernel and d@ none o) these
user $rocess
1-. What is the page si.e in inu/?
a. 8 KB b. 8 bytes
c. 4 KB d. 4 bytes

11. 0 process is switching 1rom user mode to +ernel mode can be triggered by
a@ "ystem call b@ e2ce$tion
c@ interru$t d@ all o) the abo*e
12. +ill 2pid3t pid( int sig 45 return
a@ Eero i) success)ul
b@ %d o) $arent $rocess
c@ %d o) child $rocess
d@ 'eturn the $rocess identi)ier o) current $rocess.
13.@ What is the use of calling pthread_self ()?
a. to retrieve identifier for the created thread.
b. sending own identifier to other thread.
c. after the finish the execution thread calling self again.
d. None of these
1+.@ Message Queue is created on
a.Kernel b. Physical Memory
c. Logical Memory d. User Space
1..@ -y calling )ork system call return *alue )or the $arent $rocess is&&&&&
a.@ return status )or the $arent $rocess
b.@ e2it status o) the child $rocess
c.@ $rocess id o) the $arent $rocess
d.@ $rocess id o) the child $rocess
10.@ ,hich )unction is used )or storing return *alue )rom the thread/
a.@ $threadDFoinG@H b.@ $threadDe2itG@H
c.@ $threadDsel) G@H d.@ $threadDdetachG@H
15.@ ,hat is the use o) signal system call/
a.@ install a ne# signal handler
b.@ sending a signal
c.@ catching a signal
d.@ none o) these

18.@ ,hich signal is used )or segmentation )ault/
a.@ "%C%NT b.@"%C"7C!
c.@ "%C% d.@ none o) these
1:.4 hich function is used to sus!end the calling !rocess until any signal is
not received"
a. alar#$% b. !ause$%
c. signal d. &ill$%
;<.@ ,hat is the use o) >#ait1 )unction )or a $arent Process/ Parent $rocess #ill .
a.Block, if all of its children are still running
b.Return immediately with the termination status of a child
c.Return immediately with an error, if doesnt have any child process
d.All Of these
21.) If var=3000
Which of the following is used to display The cost is $3000
a. echo The cost is \$$var
b. echo The cost is $var
c. echo The cost is \$var
d. echo The cost is $3000
22. Which command will be used to list all the fles with extension .list?
a. ls *[lst]
b. ls l *.lst
c. ls lst*
d. ls *.*
23. Go through the following C program
int main()
{
int i,n;
for(i=1;i<=n;++i) fork();
printf(yes); }
For what value of n,will yes printed 24 times?
a. 3
b. 4
c. 5
d. impossible to fnd such an n
24. Consider the following program
main()
{
int p[2];
pipe(p);
fork();
}
a. The pipe will be recognize only by parent process
b. p[0] is the fle descriptor of the write end of the pipe.
c. There will be 4 fle descriptors in memory
d. The pipe will be shared by both the parent and the child processes.
25.) What is the command to show hidden fles in Linux?
a. ls
b.ls a
c.ls l
d.ls *
26.) Which command will be used to know the present working directory?
a. dir
b. echo $PATH
c. pwd
d. All of the above.
27.) Which one will be used to output Linux commands result to end of fle?
a. Linux commands >> flename
b. inu2 commands I )ilename
c. inu2 commands )ilename
d. inu2 commands J )ilename
;8.@ ,hich command #ill be used to dis$lays )ile $age by $age/
a. cat
b. more
c. *i
d. gre$
;:.@ ,hich )ile system is su$$orted by inu2/
a. 72t;
b.72t3
c nt)s
d. -oth a=b
3<.@ What is possible frame size of given jobs?
Task Number Execution time (ms)
T1 2
T2 4
T3 5
T4 3
a. 5 b. 4
c. 3 d. 2
31.) Table Driven scheduling algorithm is
(a) Clock driven scheduling
(b) Event driven scheduling
(c) Hybrid
(d)None of these
32.) A Periodic tasks T1 is defne as:
T1 = (50, 50, 25, 100)
What is its Relative deadline?
a. 50 b. 25
c. 100 d. None
33.) Which statement is true for RTLinux and Linux?
(a)RTLinux is not supported by Linux kernel
(b) Linux and RTLinux kernel having equal priority.
(c) Linux kernel is a higher thread
(d) Linux kernel is a low priority thread
34.) In which RTOS scheduling method priority of task is inversely proportional to its period.
a.)Clock Driven algorithm
b.)Earliest Deadline First
c.)Rate Monotonic Algorithm
d.)Hybrid Round Robin
35.) Which of the following is an example of a soft real time system?
a. Corrosive Chemical plants
b. Nuclear Power Plants
c. Multimedia system
d. Aircraft Control System
36.) Which of the following is an example of a RTOS?
a. VMWare
b. Windows NT
c. VxWorks
d. Linux
37.) Which of the following is a solution to priority Inversion?
a. Priority Scaling
b. Priority Ceiling
c. Static & Unique priority assignment
d. Priority Masking
38.) Which of the following is a static real time scheduling algorithm?

a. Rate Monotonic Scheduling
b. Earliest Deadline First
c. Least Laxity First
d. none of the above
39.) Which of the following scheduling algorithms is best suitable for system with low CPU
utilization?
a. Earliest Deadline First (EDF)
b. Rate Monotonic (RM)
c. Least Slack time First (LLF)
d. All of the above
40.)User #hose user id is <K called as
1@ root ;@ normal user
3@ su$er user +@ no user
a@ only 1 b@ only +

c@ both 1 =; d@ both 1=3

6e,ice 6ri,er
For Question no. 1 to . Fill in the blanks.
1. 7ach $iece o) code #hich is added in kernel at run time is called module.
;. For e2ecuting the Make)ileK ma+e..command is used.

3. "iLe o) the Micro Mernel is smaller&.than the Monolithic kernel.
+. Dri*er Modules are al#ays running inside the +ernel
7. minor number& is used by the kernel to determine e2actly #hich de*ice is being re)erred to.

%. Which one is implemented 1or bloc+ing !89 operations in dri,er?
a. ,ait3ueue b. "lee$
c. #ait d. all o) the abo*e
&. :or de1ining the command type 1or !9;<( ioctl number is .. wide.
a. 8 bits b. 10 bits
c. 3; bits d. None o) these
). Which among the 1ollowing is recommended while writing a de,ice dri,er
1. make less use o) stack
;. make less use o) recursi*e )unctions
3. do not declare local arrays
+. e2tensi*e use o) )unction $ointers
a@1 = ; b@ ;K 3 = +
c@ only 1 = 3 d@ 1K ;K 3K = +
*.4 Which 1unction will be used 1or dynaminc allocation o1 de,ice number?
a@ registerDde*numG@ b@ registerDchrde*DregionG@
c@ allocDchrde*DregionG@ d@ mkde*G@
1-.4 Which o1 the 1ollowing is true regarding ma=or number and minor number
!. Ma=or number tells which dri,er is used to access the hardware.
!!. <he minor number is used by the dri,er to distinguish between the ,arious hardware it
controls.
!!!. >ach dri,er is assigned a uni'ue ma=or number5 all de,ice 1iles with the same ma=or
number are controlled by the same dri,er.
!?. Minor numbers are used to access and identi1y types o1 the de,ices whether char or
bloc+.
a. %K %% and %! only b. (ll o) the abo*e c. None d. %K %% and %%% only
11.4 Which o1 the 1ollowing is false with respect to +ernel modules and application programs@
!. 0n application per1orms a single tas+ 1rom beginning to end( whereas a module registers
itsel1 in order to ser,e 1uture re'uests.
!!. AmainB 1unction o1 a +ernel module terminates immediately.
!!!. 0n application can call 1unctions it doesnCt de1ine@ the lin+ing stage resol,es e/ternal
re1erences using the appropriate library o1 1unctions.
!?. Whereas a module is lin+ed only to the +ernel( and the only 1unctions it can call does the
+ernel e/port the ones5 there are no libraries to lin+ to.
a. % only
b. %% only
c. % and %%
d. all o) the abo*e
12.4 #SD can be categori.ed as
a. Character de*ice b. block de*ice c. net#ork de*ice d. (ll o) these
13.4 <he 1unction 3333333 is used to copy a +ernel data segment to user data segment.
a@. getDuser b.@ $utDuser
c@. #riteDtoDuser d@ co$y
14.4 Struct cde, Ei3cde, 1ield represents which +ernel data structure o1 6e,ice 6ri,er ?
a. )ile structure
b. )ile o$erations structure
c. inode structure
d. None o) these
17.4 =i11ies is a ..bit ,ariable

a4 3; b@ 10
c@ 0+ d@ 8
10@ Using #hich utility in linu2K#ill load the kernel module
a. insmod
b. rmmod
c. dmesg
d. load
15@ ,hich o) the )ollo#ing delayed e2ecution methods allo#s slee$ing inside the scheduling task/
a. ,ork 3ueues
b. Mernel Timers
c. Tasklets
d. -oth Ga@ = Gb@
18@ ,hich o) the )ollo#ing )unctions should $re)erably be called #hen $assing single *alue data )rom the user
s$ace to the kernel s$ace in the %ACT method im$lementation/
a. co$yD)romDuser
b. co$yDtoDuser
c. $utDuser
d. getDuser
1:.@ ;har de,ices are accessed by means o1 1ilesystem nodes( which present in.
a. N$roc b. Nde*
c. Nbin d.NusrNsrcNkernelN;.0&NincludeNlinu2
2-.4 When a module is loaded( any symbol e/ported by the module becomes part o1 the
a. Nde* b.N$rocNde*ices
c. kernel symbol table d.None o) these.