GUPTA CLASSES

A Premier Institute for MCA/MBA Entrance

6, Utsav Complex, Shivaji Road Meerut
(O) 400313 (M) !"3#$3111, !"3#464$0# Operati%& S'stem Sp(l )ssi&%me%t
1) Round robin scheduling is essentially the preemptive
version of ________.
1 FIFO 2 Shortest ob first ! Shortes remaining
" #ongest time first
2) $ page fault occurs
1 %hen the page is not in the memory
2 %hen the page is in the memory
! %hen the process enters the bloc&ed state
" %hen the process is in the ready state
!) 'hich of the follo%ing %ill determine your choice of
systems soft%are for your computer (
1 Is the applications soft%are you %ant to use compatible
%ith it ( 2 Is it e)pensive (
! Is it compatible %ith your hard%are ( " *oth 1 and !
") #et S and + be t%o semaphores initiali,ed to 1- %here ./
and .1 processes the follo%ing statements %ait0S)1%ait0+)1
2221 signal0S)1signal0+) and %ait0+)1
%ait0S)12221signal0+)1signal0S)1 respectively. 3he above
situation depicts a _________ .
1 Semaphore 2 4eadloc& ! Signal " Interrupt
5) 'hat is a shell (
1 It is a hard%are component 2 It is a command interpreter
! It is a part in compiler " It is a tool in 6.7 scheduling
8) Routine is not loaded until it is called. $ll routines are
&ept on dis& in a relocatable load format. 3he main program
is loaded into memory 9 is e)ecuted. 3his type of loading is
called _________
1 Static loading 2 4ynamic loading ! 4ynamic lin&ing
" Overlays
:) In the bloc&ed state
1 the processes %aiting for I;O are found
2 the process %hich is running is found
! the processes %aiting for the processor are found
" none of the above
<) 'hat is the memory from 1= 2 8"/= called (
1 >)tended ?emory 2 @ormal ?emory
! #o% ?emory " 6onventional ?emory
A) Birtual memory is __________.
1 $n e)tremely large main memory
2 $n e)tremely large secondary memory
! $n illusion of e)tremely large main memory
" $ type of memory used in super computers.
1/) 3he process related to process control- file
management- device management- information about
system and communication that is reCuested by any higher
level language can be performed by __________.
1 >ditors 2 6ompilers ! System 6all " 6aching
11) If the 4is& head is located initially at !2- find the
number of dis& moves reCuired %ith F6FS if the dis& Cueue
of I;O bloc&s reCuests are A<-!:-1"-12"-85-8:.
1 !1/ 2 !2" ! !15 " !21
12) ?ultiprogramming systems ________.
1 $re easier to develop than single programming systems
2 >)ecute each ob faster
! >)ecute more obs in the same time
" $re used only on large main frame computers
1!) 'hich is not the state of the process (
1 *loc&ed 2 Running ! Ready " .rivileged
1") 3he solution to 6ritical Section .roblem is D ?utual
>)clusion- .rogress and *ounded 'aiting.
1 3he statement is false 2 3he statement is true.
! 3he statement is contradictory. " @one of the above
15) 3he problem of thrashing is effected scientifically by
________.
1 .rogram structure 2 .rogram si,e
! .rimary storage si,e " @one of the above
18) 3he state of a process after it encounters an I;O
instruction is __________.
1 Ready 2 *loc&ed;'aiting ! Idle " Running
1:) 3he number of processes completed per unit time is
&no%n as __________.
1 Output 2 3hroughput ! >fficiency " 6apacity
1<) _________ is the situation in %hich a process is %aiting
on another process-%hich is also %aiting on another
process ... %hich is %aiting on the first process. @one of the
processes involved in this circular %ait are ma&ing progress.
1 4eadloc& 2 Starvation ! 4ormant " @one of the above
1A) 'hich of the follo%ing file name e)tension suggests that
the file is *ac&up copy of another file (
1 3E3 2 6O? ! *$S " *$=
2/) 'hich techniCue %as introduced because a single ob
could not &eep both the 6.7 and the I;O devices busy(
1 3ime2sharing 2 S.OO#ing ! .reemptive scheduling
" ?ultiprogramming
21) $ critical region
1 is a piece of code %hich only one process e)ecutes at a
time 2 is a region prone to deadloc&
! is a piece of code %hich only a finite number of processes
e)ecute " is found only in 'indo%s @3 operation system
22) 3he mechanism that bring a page into memory only
%hen it is needed is called _____________
1 Segmentation 2 Fragmentation ! 4emand .aging
" .age Replacement
2!) .6* F
1 .rogram 6ontrol *loc& 2 .rocess 6ontrol *loc&
! .rocess 6ommunication *loc& " @one of the above
2") FIFO scheduling is ________.
1 .reemptive Scheduling 2 @on .reemptive Scheduling
! 4eadline Scheduling " Fair share scheduling
25) S%itching the 6.7 to another .rocess reCuires to save
state of the old process and loading ne% process state is
called as __________.
1 .rocess *loc&ing 2 6onte)t S%itch
! 3ime Sharing " @one of the above
28) 'hich directory implementation is used in most
Operating System(
1 Single level directory structure
2 3%o level directory structure
! 3ree directory structure
" $cyclic directory structure
2:) 3he *an&erGs algorithm is used
1 to prevent deadloc& in operating systems
GUPTA CLASSES
A Premier Institute for MCA/MBA Entrance
6, Utsav Complex, Shivaji Road Meerut
(O) 400313 (M) !"3#$3111, !"3#464$0# Operati%& S'stem Sp(l )ssi&%me%t
2 to detect deadloc& in operating systems
! to rectify a deadloc&ed state " none of the above
2<) $ thread
1 is a light%eight process %here the conte)t s%itching is
lo%
2 is a light%eight process %here the conte)t s%ithching is
high
! is used to speed up paging " none of the above
2A) ______ is a high level abstraction over Semaphore.
1 Shared memory 2 ?essage passing ! ?onitor
" ?utual e)clusion
!/) $ tree sturctured file directory system
1 allo%s easy storage and retrieval of file names
2 is a much debated unecessary feature
! is not essential %hen %e have millions of files
" none of the above
31. Translator for low level programming language were
termed as
(A) Assembler (B) Compiler (C) Linker (D) Loader
3. Anal!sis w"i#" determines t"e meaning of a statement
on#e its grammati#al stru#ture be#omes known is termed as
(A) $emanti# anal!sis (B) $!nta% anal!sis
(C) &egular anal!sis (D) 'eneral anal!sis
33.Load address for t"e first word of t"e program is #alled
(A) Linker address origin (B) load address origin
(C) ("ase librar! (D) absolute librar!
3). $!mboli# names #an be asso#iated wit"
(A) *nformation (B) data or instru#tion
(C) operand (D) mnemoni# operation
3+. T"e translator w"i#" perform ma#ro e%pansion is #alled a
(A) ,a#ro pro#essor (B) ,a#ro pre-pro#essor
(C) ,i#ro pre-pro#essor (D) assembler
3. $"ell is t"e e%#lusive feature of
(A) /0*1 (B) D2$ (C) $!stem software
(D) Appli#ation software
33. A program in e%e#ution is #alled
(A) (ro#ess (B) *nstru#tion (C) (ro#edure (D) 4un#tion
35. *nterval between t"e time of submission and #ompletion of
t"e 6ob is #alled
(A) 7aiting time (B) Turnaround time
(C) T"roug"put (D) &esponse time
38. A s#"eduler w"i#" sele#ts pro#esses from se#ondar!
storage devi#e is #alled
(A) $"ort term s#"eduler. (B) Long term s#"eduler.
(C) ,edium term s#"eduler (D) (ro#ess s#"eduler.
)9. T"e s#"eduling in w"i#" C(/ is allo#ated to t"e pro#ess
wit" least C(/-burst time is #alled
(A) (riorit! $#"eduling (B) $"ortest 6ob first $#"eduling
(C) &ound &obin $#"eduling
(D) ,ultilevel :ueue $#"eduling
)1. T"e term ;page traffi#< des#ribes
(A) number of pages in memor! at a given instant.
(B) number of papers re=uired to be broug"t in at a given
page re=uest.
(C) t"e movement of pages in and out of memor!.
(D) number of pages of e%e#uting programs loaded in
memor!.
). T"e >turn-around? time of a user 6ob is t"e
(A) time sin#e its submission to t"e time its results be#ome
available.
(B) time duration for w"i#" t"e C(/ is allotted to t"e 6ob.
(C) total time taken to e%e#ute t"e 6ob.
(D) time taken for t"e 6ob to move from assembl! p"ase to
#ompletion p"ase.
)3. 7"i#" of t"e following #an be used as a #riterion for
#lassifi#ation of data stru#tures used in language pro#essing.
(A) nature of a data stru#ture
(B) purpose of a data stru#ture
(C) lifetime of a data stru#ture (D) all of t"e above.
)). ,emor! utili@ation fa#tor s"all be #omputed as follows
(A) memor! in useAallo#ated memor!.
(B) memor! in useAtotal memor! #onne#ted.
(C) memor! allo#atedAfree e%isting memor!.
(D) memor! #ommittedAtotal memor! available
)+. (rogram ;preemption< is
(A) for#ed de allo#ation of t"e C(/ from a program w"i#" is
e%e#uting on t"e C(/.
(B) release of C(/ b! t"e program after #ompleting its task.
(C) for#ed allotment of C(/ b! a program to itself.
(D) a program terminating itself due to dete#tion of an error.
).. An assembler is
(A) programming language dependent.
(B) s!nta% dependant. (C) ma#"ine dependant.
(D) data dependant.
)3.7"i#" of t"e following is not a fundamental pro#ess state
(A) read! (B) terminated (C) e%e#uting (D) blo#ked
)5. ;L&/< page repla#ement poli#! is
(A) Last &epla#ed /nit. (B) Last &estored /nit.
(C) Least &e#entl! /sed. (D) Least &e=uired /nit.
)8. 7"i#" of t"e following is trueB
(A) Blo#k #ip"er te#"ni=ue is an en#r!ption te#"ni=ue.
(B) $team #ip"er te#"ni=ue is an en#r!ption te#"ni=ue.
(C) Bot" (A) and (B). (D) 0eit"er of (A) and (B).
+9. 7"i#" of t"e following approa#"es do not re=uire
knowledge of t"e s!stem stateB
(A) deadlo#k dete#tion (B) deadlo#k prevention.
(C) deadlo#k avoidan#e. (D) none of t"e above.
+1. (rogram generation a#tivit! aims at
(A) Automati# generation of program
(B) 2rgani@e e%e#ution of a program written in (L
(C) $kips generation of program
(D) $peedens generation of program
+. 7"i#" amongst t"e following is not an advantage of
Distributed s!stemsB
(A) &eliabilit! (B) *n#remental growt"
(C) &esour#e s"aring (D) 0one of t"e above
+3. An imperative statement
(A) &eserves areas of memor! and asso#iates names wit"
t"em
(B) *ndi#ates an a#tion to be performed during e%e#ution of
assembled program
(C) *ndi#ates an a#tion to be performed during optimi@ation
(D) 0one of t"e above
GUPTA CLASSES
A Premier Institute for MCA/MBA Entrance
6, Utsav Complex, Shivaji Road Meerut
(O) 400313 (M) !"3#$3111, !"3#464$0# Operati%& S'stem Sp(l )ssi&%me%t
+). 7"i#" of t"e following loader is e%e#uted w"en a s!stem
is first turned on or restarted
(A) Boot loader (B) Compile and 'o loader
(C) Bootstrap loader (D) &elating loader
++. (oor response time is usuall! #aused b!
(A) (ro#ess bus! (B) Cig" *A2 rates
(C) Cig" paging rates (D) An! of t"e above
+.. >T"roug"put? of a s!stem is
(A) 0umber of programs pro#essed b! it per unit time
(B) 0umber of times t"e program is invoked b! t"e s!stem
(C) 0umber of re=uests made to a program b! t"e s!stem
(D) 0one of t"e above
+3. T"e >blo#king fa#tor? of a file is
(A) T"e number of blo#ks a##essible to a file
(B) T"e number of blo#ks allo#ated to a file
(C) T"e number of logi#al re#ords in one p"!si#al re#ord
(D) 0one of t"e above
+5. 7"i#" of t"ese is a #omponent of a pro#ess pre#eden#e
se=uen#eB
(A) (ro#ess name (B) $e=uen#e operator ;D<
(C) Con#urren#! operator ;E< (D) All of t"e above
+8. 7"i#" amongst t"e following is valid s!nta% of t"e 4ork
and Foin (rimitiveB
(A) 4ork GlabelH (B) 4ork GlabelHFoin GvarH
(C) 4or GvarH (D) 4ork GvarH
.9. 0ested ,a#ro #alls are e%panded using t"e
(A) 4*42 rule (4irst in first out)
(B) L*42 (Last in 4irst out)
(C) 4*L2 rule (4irst in last out) (D) 0one of t"e above
.1. A parser w"i#" is a variant of top-down parsing wit"out
ba#ktra#king is
(A) &e#ursive Des#end. (B) 2perator (re#eden#e.
(C) LL(1) parser. (D) LAL& (arser.
.. T"e e%pansion of nested ma#ro #alls follows
(A) 4*42 rule.(B) L*42 rule (C) L*L2 rule.
(D) priorit! rule.
.3.*n a two-pass assemblerE t"e task of t"e (ass ** is to
(A) separate t"e s!mbolE mnemoni# op#ode and operand
fields. (B) build t"e s!mbol table.
(C) #onstru#t intermediate #ode
(D) s!nt"esi@e t"e target program.
.). A linker program
(A) pla#es t"e program in t"e memor! for t"e purpose of
e%e#ution.
(B) relo#ates t"e program to e%e#ute from t"e spe#ifi#
memor! area allo#ated to it.
(C) links t"e program wit" ot"er programs needed for its
e%e#ution.
(D) interfa#es t"e program wit" t"e entities generating its
input data.
.+. 7"i#" s#"eduling poli#! is most suitable for a time-s"ared
operating s!stem
(A) $"ortest-6ob 4irst. (B) Ilevator. (C) &ound-&obin.
(D) 4irst-Come-4irst-$erve.
... A #riti#al se#tion is a program segment
(A) w"i#" s"ould run in a #ertain spe#ified amount of time.
(B) w"i#" avoids deadlo#ks.
(C) w"ere s"ared resour#es are a##essed.
(D) w"i#" must be en#losed b! a pair of semap"ore
operationsE ( and J.
.3. An operating s!stem #ontains 3 user pro#esses ea#"
re=uiring units of resour#e & .T"e minimum number of units
of & su#" t"at no deadlo#ks will ever arise is
(A) ). (B) 3. (C) +. (D) ..
.5. Lo#alit! of referen#e implies t"at t"e page referen#e being
made b! a pro#ess
(A) will alwa!s be to t"e page used in t"e previous page
referen#e.
(B) is likel! to be t"e one of t"e pages used in t"e last few
page referen#es.
(C) will alwa!s be to one of t"e pages e%isting in memor!.
(D)will alwa!s lead to a page fault.
.8.7"i#" of t"ese is not a part of $!nt"esis p"ase
(A)2btain ma#"ine #ode #orresponding to t"e mnemoni# from
t"e ,nemoni#s table
(B) 2btain address of a memor! operand from t"e s!mbol
table (C) (erform LC pro#essing
(D) $!nt"esi@e a ma#"ine instru#tion or t"e ma#"ine form of a
#onstant
39.T"e s!nta% of t"e assembler dire#tive I:/ is
(A) I:/ Gaddress spa#eH
(B) Gs!mbolHI:/Gaddress spa#eH
(C) Gs!mbolHI:/ (D) 0one of t"e above
31. T"e following features are needed to implement top down
parsing
(A) $our#e string marker (B) (redi#tion making me#"anism
(C) ,at#"ing and Ba#ktra#king me#"anism
(D) All of t"e above
3. A ma#ro definition #onsists of
(A) A ma#ro protot!pe statement
(B) 2ne or more model statements
(C) ,a#ro pre-pro#essor statements (D) All of t"e above
33. T"e main reason to en#r!pt a file is to KKKKKKKKK.
(A) &edu#e its si@e (B) $e#ure it for transmission
(C) (repare it for ba#kup
(D) *n#lude it in t"e start-up se=uen#e
3). 7"i#" of t"e following is not a ke! pie#e of informationE
stored in single page table
entr!E assuming pure paging and virtual memor!
(A) 4rame number
(B) A bit indi#ating w"et"er t"e page is in p"!si#al memor! or
on t"e disk
(C) A referen#e for t"e disk blo#k t"at stores t"e page
(D) 0one of t"e above
3+. A /0*1 devi#e driver is
(A) $tru#tured into two "alves #alled top "alf and bottom "alf
(B) T"ree e=ual partitions
(C) /nstru#tured (D)0one of t"e above
3..T"e following is not a la!er of *2 management module
(A) (*2C$ (("!si#al *nput 2utput Control $!stem)
(B) L*2C$ (Logi#al *nput 2utput Control $!stem)
(C) 4$ (4ile $!stem)
(D) ,C$ (,anagement Control $!stem)
GUPTA CLASSES
A Premier Institute for MCA/MBA Entrance
6, Utsav Complex, Shivaji Road Meerut
(O) 400313 (M) !"3#$3111, !"3#464$0# Operati%& S'stem Sp(l )ssi&%me%t
33. 7"i#" amongst t"e following is not a valid page
repla#ement poli#!B
(A) L&/ poli#! (Least &e#entl! /sed)
(B) 4*42 poli#! (4irst in first out)
(C) &/ poli#! (&e#urrentl! used)
(D) 2ptimal page repla#ement poli#!
35. Consider a program wit" a linked origin of +999. Let t"e
memor! area allo#ated to it "ave t"e start address of 39999.
7"i#" amongst t"e following will be t"e value
to be loaded in relo#ation registerB
(A) 9999 (B) +9999 (C) 39999 (D) 89999
38. An assembl! language is a
(A) low level programming language
(B) ,iddle level programming language
(C) Cig" level programming language
(D) *nternet based programming language
59. T** stands for
(A) Table of in#omplete instru#tions
(B) table of information instru#tions
(C) translation of instru#tions information
(D) translation of information instru#tion
51.An anal!sisE w"i#" determines t"e s!nta#ti# stru#ture of
t"e sour#e statementE is #alled
(A) $ementi# anal!sis (B) pro#ess anal!sis
(C) $!nta% anal!sis (D) fun#tion anal!sis
5 A#tion implementing instru#tion<s meaning are a a#tuall!
#arried out b!
(A) *nstru#tion fet#" (B) *nstru#tion de#ode
(C) instru#tion e%e#ution (D) *nstru#tion program
53 T"e field t"at #ontains a segment inde% or an internal
inde% is #alled
(A) target datum (B) target offset
(C) segment field (D) fi% dat
5). A program in e%e#ution is #alled
(A) pro#ess (B) fun#tion (C) C(/ (D) ,emor!
5+. Fobs w"i#" are admitted to t"e s!stem for pro#essing is
#alled
(A) long-term s#"eduling (B) s"ort-term s#"eduling
(C) medium-term s#"eduling (D) =ueuing
5. A set of te#"ni=ues t"at allow to e%e#ute a program w"i#"
is not entirel! in memor! is #alled
(A) demand paging (B) virtual memor!
(C) au%iliar! memor! (D) se#ondar! memor!
53. $$T4 stands for
(A) $"ortest-$eek-time-first s#"eduling
(B) small L small-time-first (C) simple-seek-time-first (D)
small-simple-time-first s#"eduling
55. Before pro#eeding wit" its e%e#utionE ea#" pro#ess must
a#=uire all t"e resour#es it needs is #alled
(A) "old and wait (B) 0o pre-emption
(C) #ir#ular wait (D) starvation
58. Jirtual memor! is
(A) simple to implement
(B) used in all ma6or #ommer#ial operating s!stems
(C) less effi#ient in utili@ation of memor!
(D) useful w"en fast *A2 devi#es are not available
89. &elo#ation bits used b! relo#ating loader are spe#ified b!
(A) &elo#ating loader itself (B) Assembler or Translator
(C) ,a#ro pro#essor (D) Bot" (A) and (B)
81. &esolution of e%ternall! defined s!mbols is performed b!
(A) Linker (B) Loader (C) Compiler (D) Iditor
8. &elo#atable programs
(A) #annot be used wit" fi%ed partitions
(B) #an be loaded almost an!w"ere in memor!
(C) do not need a linker
(D) #an be loaded onl! at one spe#ifi# lo#ation
83. (age stealing
(A) is a sign of effi#ient s!stem
(B) is taking page frames ot"er working sets
(C) s"ould be t"e tuning goal
(D) is taking larger disk spa#es for pages paged out
8). T"e total time to prepare a disk drive me#"anism for a
blo#k of data to be read from is its
(A) laten#! (B) laten#! plus transmission time
(C) laten#! plus seek time
(D) laten#! plus seek time plus transmission time
8+. To avoid ra#e #onditionE t"e ma%imum number of
pro#esses t"at ma! simultaneousl! inside t"e #riti#al se#tion
is
(A) @ero (B) one (C) two (D) more t"an two
8.. T"e memor! allo#ation s#"eme sub6e#t to >e%ternal?
fragmentation is
(A) segmentation (B) swapping
(C) pure demand paging (D) multiple fi%ed #ontiguous
partitions
83. (age fault fre=uen#! in an operating s!stem is redu#ed
w"en t"e
(A) pro#esses tend to t"e *A2-bound
(B) si@e of pages is redu#ed
(C) pro#esses tend to be C(/-bound
(D) lo#alit! of referen#e is appli#able to t"e pro#ess
85.*n w"i#" of t"e following page repla#ement poli#ies
Balad!<s anomal! o##ursB
(A) 4*42 (B) L&/ (C) L4/ (D) 0&/
88. 7"i#" of t"e following are language pro#essorsB
(A) Assembler (B) Compiler (C) *nterpreter
(D) All of t"e above
199.Jirtual memor! #an be implemented wit"
(A) $egmentation (B) (aging (C) 0one (D) all of t"e above
191. &e#ognition of basi# s!nta#ti# #onstru#ts t"roug"
redu#tionsE t"is task is performed b!
(A) Le%i#al anal!sis (B) $!nta% anal!sis
(C) $emanti# anal!sis (D) $tru#ture anal!sis
19. A grammar for a programming language is a formal
des#ription of
(A) $!nta% (B) $emanti#s (C) $tru#ture (D) Code
193.KKKKKKK is a te#"ni=ue of temporaril! removing ina#tive
programs from t"e memor! of #omputer s!stem
(A) $wapping (B) $pooling (C) $emap"ore (D) $#"eduler
19)KKKKKK is a te#"ni=ue of improving t"e priorit! of pro#ess
waiting in :ueue for C(/ allo#ation
(A) $tarvation (B) Ageing (C) &evo#ation (D) &elo#ation
GUPTA CLASSES
A Premier Institute for MCA/MBA Entrance
6, Utsav Complex, Shivaji Road Meerut
(O) 400313 (M) !"3#$3111, !"3#464$0# Operati%& S'stem Sp(l )ssi&%me%t
19+.KKKKKKK is t"e time re=uired b! a se#tor to rea#" below
readAwrite "ead.
(A) $eek Time (B) Laten#! Time (C) A##ess time (D) 0one
19.. 7"i#" of t"e following is most general p"ase stru#tured
grammarB
(A) Conte%t L $ensitive (B) &egular
(C) Conte%t L 4ree (D) 0one of t"e above
193 4ile re#ord lengt"
(A) $"ould alwa!s be fi%ed (B) $"ould alwa!s be variable
(C) Depends upon t"e si@e of file
(D) $"ould be #"osen to mat#" t"e data #"ara#teristi#s.
195. A publi# ke! en#r!ption s!stem
(A) Allows onl! t"e #orre#t re#eiver to de#ode t"e data
(B) Allows onl! one to de#ode t"e transmission.
(C) Allows onl! t"e #orre#t sender to de#ode t"e data.
(D) Does not en#ode t"e data before transmitting it.
)%s*er Sheet+
1,1 ,1 3,4 4, $, 6,3 #,1 ",4
!,3 10,3 11,4 1,3 13,4 14, 1$,1 16,
1#, 1",1 1!,4 0,4 1,1 ,3 3, 4,
$, 6,3 #,1 ",1 !,3 30,1 31,1 3,a
33,- 34,- 3$,- 36,a 3#,a 3",- 3!,( 40,-
41,( 4,( 43,d 44,- 4$,a 46,( 4#,d 4",(
4!,( $0,d $1,a $,a $3,- $4,( $$,d $6,a
$#,( $",d $!,a 60,- 61,a 6,- 63,d 64,(
6$,( 66,( 6#,a 6",- 6!,( #0,- #1,d #,d
#3,- #4,( #$,a #6,d ##,( #", #!,a "0,a
"1,( ",( "3,a "4,a "$,a "6,- "#,a "",a
"!,- !0,- !1,a !,- !3,- !4,( !$,- !6,a
!#,d !",a !!,d 100,d 101,- 10,( 103,a 104,-
10$,- 106,a 10#,d 10",a