Sunteți pe pagina 1din 5

SAP QUESTIONAIRE 3

1. 1
.

What are different elements in layout sets
o o Para!ra"hs
o o #hara$ter Strin!
o o Pa!e
o o Pa!e Windo%s
o o Windo%s
o o &eader 'ata
(. (
.

#an you use if then else) "erform et$. statements in SAP S$ri"t
*ES
3. 3
.

What ty"e of +aria,les normally used in sa" s$ri"t to out"ut data
- . Ta,les name- fields ..
/. /
.

&o% do you num,er "a!es in sa" s$ri"t layout out"uts
o o . "a!e .
o o .ne0t Pa!e .
1. 1
.

What ta2es most time in SAP s$ri"t "ro!rammin!
o o 'efinin! layout set u" 3 sets.
4. 4
.

&o% do you use ta, sets in layout sets
o o 'efine "ara!ra"h %ith defined ta,s.
5. 5
.

What are "resentation and a""li$ation ser+ers in SAP
o o A""li$ation ser+er $ontains soft%are $om"onents to run the "ro!ram. It
$ontains a SAP 6ernel) %hi$h $an run A7AP3/ "ro!ram
o o Presentation ser+er is the $lient throu!h %hi$h %e send our re8uest to
a""li$ation ser+er. It is also $alled as SAP !ra"hi$al user interfa$e.
9. 9
.

In an A7AP3/ "ro!ram ho% do you a$$ess data that e0ists on a "resentation ser+er +3s on an
a""li$ation ser+er
Presentation ser+er : 'OWN;OA' UP;OA' <WS=
A""li$ation ser+er : 'ataset <O"en) >et$h) #lose=

?. ?
.

What are different data ty"e in A7AP3/
Elementary
Predefined : #) ') >) I) N) P) T) @
User defined : T*PES
Stru$tured
Predefined : TA7;ES
User defined : >ield strin!s) internal ta,les
-
Aemory Aana!ement
1. 1. Ad+anta!es of ne% memory mana!ement
o o Qui$2er a$$ess to internal ta,les and lists
o o Qui$2er $onte0t $han!e
o o ;ess load on #PU and dis2
o o Performan$e ad+anta!es
(. (. #an R33 ,e o"erated %ith old SAP "a!in!
o o In emer!en$y B *es 7ut only tem"orarily.
3. 3. Reasons to $ontinue usin! old SAP "a!in! system
o o Os re8uirements for ne% memory m!t. Sys B not met
o o E0tremely lar!e user $onte0ts in ,a$2!round Co,s.
o o E0tremely lar!e total of all dialo! user $onte0ts
o o E0tremely hea+y OS "a!in! due to too little main memory.
/. /. 'oes ne% memory m!t. Re8uire more main memory
o o No more main memory than %ith old SAP "a!in! %ith a lar!e "a!in! ,uffer
lar!e "a!in!
o o 7uffer - needed for !ood "erforman$e.
1. 1. What ha""ens if main memory is not lar!e in ne% memory m!t.
o o OS "a!in! in$reases if it e0$eeds a $ertain +alue) <de"ends on dis2 throu!h"ut=
"erforman$e de$lines.
4. 4. &o% to use the ne% t%o-"art roll area
o o Some data must ,e held in roll area and must ,e rolled into and out of %or2
"ro$esses. Roll area must not dro" ,elo% a minimum siDe. In t%o "art roll area
im"lementation) you $an limit amount of data in roll area ,efore e0tended memory is
used remainin! "ortion of roll area is used only if no further e0tended memory $an
,e allo$ated to a user $onte0t.
'I#TIONAR*
1. 1. What is a di$tionary
o o 'i$tionary $ontains Aeta data or information for the data in data mana!ement
system.
o o It su""orts redundan$y free data stora!e and data inte!rity.
(. (. Primary 6ey
o o field or $om,ination of fields used to uni8uely identify a ro% of the ta,le
3. 3. >orei!n 6ey
o o #om,ination of fields in a ta,le a$tin! as a "rimary 2ey in another ta,le.
/. /. 'ifferen$e ,et%een stru$ture and a Ta,le
Usin! ta,les) data $anEt ,e stored "ermanently in 'ata,ase) and Stru$tures $ontain data only
durin! the runtime of a "ro!ram.
1. 1. Stru$tures
Used for definin! data at the interfa$e ,et%een module "ools and s$reens and for
standardiDin! "arameters of fun$tional modules.
4. 4. Ta,le attri,utes
'etermine %ho is res"onsi,le for maintainin! the ta,le and %hi$h ty"e of a$$ess is allo%ed
for the ta,le e.!.: 'eli+ery $lass B ta,le maintained ,y sa" or $ustomer.
Ta,le maintenan$e allo%ed B Ta,le entries a$$essed usin! std ta,le maintenan$e.
A$ti+ation Ty"e B Whether ta,le $an ,e a$ti+ated dire$tly from A7AP3/ di$tionary or
%hether the runtime o,Ce$t must first ,e !enerated ,y $ "ro!ram.
5. 5. 'ata,ase Utility
Interfa$e ,et%een A7AP3/ 'i$tionary and the data,ase.
9. 9. 'ata Elements
'es$ri,e the role "layed ,y a field in te$hni$al $onte0t. >ields of same semanti$ meanin!
refer same data elements.
?. ?. 'omain
des$ri,e te$hni$al $hara$teristi$s of a ta,le field. It s"e$ifies the +alue ran!e) %hi$h des$ri,es
allo%ed +alues for a field.
1F. 1F. Inde0 B #o"y of data,ase ta,le redu$ed to s"e$ifi$ fields
>un$tion B s"eed u" s$annin! of ta,le for data re$ords satisfyin! a !i+en sear$h $riteria.
11. 11. >orei!n 2ey Ta,le B Ta,le %hi$h $ontains the forei!n 2ey. E.!. GEAP ta,le.
1(. 1(. #he$2 Ta,le B Ta,le %hi$h has forei!n 2ey of another ta,le as its "rimary 2ey e.!. 'EPT.
13. 13. #ardinality B N: A indi$ates ho% many de"endent re$ord or referen$ed re$ords.
1/. 1/. Hie% :- used to summariDe data distri,uted amon! different ta,les ty"e of +ie%s
11. 11. Ty"es of Hie%s
o o 'ata,ase B $reated in data,ase <read only=
o o ProCe$tion - used to su""ress the dis"lay of ta,le fields <all o"erations "ossi,le=
o o &el" +ie%s B 'is"lay information in online hel" system
o o Aaintenan$e +ie%s B used to realiDe $ommer$ially rele+ant +ie%s on data
$ustomiDin! +ies ,usiness oriented a""roa$h to loo2in! at data
14. 14. Hie%s that $annot ,e used to $reate ne% +ie%s
o o Stru$ture +ie%s B used to !enerate a stru$ture from se+eral lo!i$ally $onne$ted
ta,les
o o Entity +ie%s B used to re"resent entity ty"e of 'ata Aodular on ta,les of
A7AP3/ di$tionary
15. 15. Aaintain Status B 'etermine if re$ords $an only ,e read or if it is also "ossi,le to $han!e
them.
19. 19. Aat$h $odes B tool to hel" you sear$h for data re$ords in the system
1?. 1?. Aat$h $odes o,Ce$t B des$ri,es the set of all "ossi,le sear$h "aths for the sear$h term.
(F. (F. Aat$h $odes Id B des$ri,es a s"e$ial sear$h "ath for a sear$h term.
(1. (1. Aat$h $odes
- - fields from se+eral ta,les
- - ,uilt on the ,asis of trans"arent ta,les) $lusters and "ools
- - restri$ted ,y sti"ulatin! sele$tion $onditions
- - use as entry aids
'ata,ase inde0
- fields from only ta,le
((. ((. ;o$2 O,Ce$ts B simultaneous a$$ess of re$ords ,y t%o users syn$hroniDed ,y lo$2 o,Ce$ts.
(3. (3. A$ti+ation B 'urin! a$ti+ation) the runtime o,Ce$t of a!!re!ate o,Ce$t or ta,les is $reated. The
runtime o,Ce$t is ,uffered so that the a""li$ation "ro!ram $an a$$ess it 8ui$2ly. Runtime
o,Ce$t has information a,out the follo%in! o,Ce$ts of ta,le
- domain B data elements B field definition B ta,le definition
(/. (/. Time stam" B %hene+er the ta,le is a$ti+ated) a time stam" is $reated and stored a$ti+ation of
ta,le in A7AP3/ di$tionary affe$ts time stam" of all re"orts usin! it. When the "ro!ram
is $alled %e $an determine %hether to e0e$ute it or re!enerate it ,y $om"arin! the time
stam"s
Ty"e of stam" B #RSTAAP B most re$ent a$ti+ation of ta,le
- - A7STAAP B $om"arison of re"orts
- - '*STAAP B $om"arison %ith s$reens.
(1. (1. Runtime o,Ce$t B of a ta,le $olle$ts the information a,out the data elements) domain field
definition in a form o"timal for "ro!ram a$$ess. It is $reated %hen the ta,le is !enerated
for first time.
(4. (4. Aass a$ti+ation "ro!ram B A$ti+ate lar!e sets of o,Ce$ts Simultaneously.
A'H B 1 B lar!e no of ta,les are affe$ted ,y the $han!e of domains or data elements at a time)
so rea$ti+ated only on$e.
( B related o,Ce$ts and its asso$iated +alue ta,le $ould ,e a$ti+ated to!ether else %e should
maintain se8uen$e $orre$tly.
A$ti+ation Pro$edure B
Ste" 1 B internal and e0ternal $hara$teristi$s $he$2 <namin! $on+ention. Relation ,et%een
$he$2 ta,le and +alue ta,le.
Ste" ( B "artially a$ti+e o,Ce$ts are $he$2ed %hether e0ternal $hara$teristi$s are arran!ed in
order
(5. (5. #han!in! the stru$ture B deletin! the ta,le in data,ase. A$ti+ate the re+ised ta,le in the
di$tionary. Ta,le in data,ase is $reated. 'ata in ta,le is lost.
#han!in! the data,ase $atalo! ,y A;TER TA7;E. 'ata is "reser+ed inde0es B re$reated.
#on+ertin! of ta,les B ori!inal ta,le is renamed and tem"orarily ,uffered) re+ised ta,le is
a$ti+ated in A7AP3/ di$tionary and $reated in data,ase 'ata from tem"orary ta,le is
re$onstru$ted.
(9. (9. #on+ersion "ro$edure B
- - 1 Ieneratin! a "ro!ram
- - ( Renamin! the data,ase ta,le Prefi0 of Q#A is added to ta,le name
- - 3 A$ti+atin! re+ised +ersion
- - / reloadin! data
- - 1 se$ondary inde0
- - %e need at least 14 A7 RAA for $on+ersion
(?. (?. ;o$2 Ae$hanism B "re+ents a ne% data,ase o"eration ,ein! started an e0istin! one has ,een
$orre$tly $om"leted. When $on+ersion is done) lo$2 is $reated automati$ally and
released only %hen $on+ersion is su$$essful.
#learin! of lo$2s
B restart adCustment B attem"t is made to $ontinue $on+ersion at the "oint of
termination
B #an$el adCustment B lo$2 entry is sim"ly deleted from ta,le
3F. 3F. Restart lo! B "ro!ress of ea$h ste" of $on+ersion is noted in restart lo!)
31. 31. AdCust stru$tures B
- - A B stru$tured adCustment is a$ti+ated ,y $han!in! data,ase $atalo!
- - U B stru$tured adCustment is a$ti+ated ,y $on+ertin! ta,les
3(. 3(. Ty"e of +ersions B
- - Hersions in A7AP 'i$tionary B a$ti+e or "artially a$ti+e 3 re+ised
- - Tem"orary +ersions
- - &istori$al +ersions
33. 33. Ty"e of status
- - Ne% B ne%ly $reated ) not a$ti+ated
- - A$ti+ated B a$ti+ated +ersion of o,Ce$t used ,y other $om"onents durin! runtime
- - Partially a$ti+e B not yet ,een fully a$ti+ated
- - Re+ised B +ersion $han!ed after a$ti+ation) ,ut not yet re-a$ti+ated
- - 'ea$ti+ated B mat$h $ode Id is not "ro"osed for sele$tion ,y >/ hel" fun$tion
3/. 3/. Hersion Aana!ement fun$tions B
- - #an$elin! $han!es B reset re+ised +ersion to a$ti+e +ersion
- - Storin! $han!es B a$ti+e +ersion %ill ,e tem"orarily stored in +ersion
- - S%it$hin! $han!es B s%it$h ,et%een a$ti+e and re+ised +ersions
31. 31. Hersion $atalo! B list of all e0istin! +ersions of an o,Ce$t
- - Re+ised +ersion B "rodu$ed %hen %e edit an e0istin! o,Ce$t
- - A$ti+e +ersion B "rodu$ed %hen %e a$ti+ate an o,Ce$t
- - Tem"orary +ersion B "rodu$ed %hen %e $o"y the a$ti+e +ersion tem"orarily to the
data,ase %ith store +ersion fun$tions
- &istori$al +ersions B $reated %hen 1. #orre$tion is $reated ( $orre$tion is released

34. 34. >un$tion "ro+ided
- - 'is"lay old +ersions
- - Retrie+in! histori$al or tem"orary +ersions
- - #om"arin! +ersions in same system
- - #om"arin! +ersions in different systems
35. 35. 7ufferin! B $reated lo$ally on a""li$ation ser+er) $han!es in ,uffer are loaded in lo! ta,le.
Syn$hroniDation me$hanism runs <1 B( min= lo! ta,le is read and ,uffer $ontents
$han!ed ,y other ser+ers are in+alid.
Syn$hroniDation of all ,uffers in a""li$ation ser+ers is ,y asyn$hronous "ro$edure
39. 39. Ta,les that $an ,e ,uffered B trans"arent and "ooled ta,les
3?. 3?. Possi,le ,ufferin! ty"es
- - full ,ufferin! B either) %hole ta,le or none of the ta,le is lo$ated in the ,uffer
<Ta,les u" to 3F 2, done in $lient de"endent fully ,uffered ta,les=
- - Ieneri$ ,ufferin! B !eneri$ areas of the ta,le are fully ,uffered.
- - - Ieneri$ 2ey B left Custified se$tion of "rimary 2ey of a ta,le.
- - - !eneri$ area B all re$ords for %hi$h fields of !eneri$ 2ey $orres"ond
- - Sin!le re$ord ,ufferin! B re$ords a$tually ,ein! a$$essed are loaded to ,uffers)
lar!e re$ords %here fe% re$ords are a$$essed.
/F. /F. When to reset a ,uffer
A= If $onsisten$ies o$$urred ,et%een the ,uffer $ontents and the data,ase.
/1. /1. What is 'ata,ase Utility
A= Interfa$e ,et%een A7AP3/ di$tionary and relational data,ase in SAP system. It allo%s to
$reate) delete and $on+ert o,Ce$ts from A7AP3/ di$tionary in the data,ase.

S-ar putea să vă placă și