Golgappa.net | Golgappa.org | BagIndia.net | BodyIndia.Com | CabIndia.net | CarsBikes.net | CarsBikes.org | CashIndia.net | ConsumerIndia.net | CookingIndia.net | DataIndia.net | DealIndia.net | EmailIndia.net | FirstTablet.com | FirstTourist.com | ForsaleIndia.net | IndiaBody.Com | IndiaCab.net | IndiaCash.net | IndiaModel.net | KidForum.net | OfficeIndia.net | PaysIndia.com | RestaurantIndia.net | RestaurantsIndia.net | SaleForum.net | SellForum.net | SoldIndia.com | StarIndia.net | TomatoCab.com | TomatoCabs.com | TownIndia.com
Interested to Buy Any Domain ? << Click Here >> for more details...


1-What is Report Painter ?
ALE / IDoc. ?
User Exit ?
Variances ?
Please revert back with answer & if u have any Documents
for above question, then plse. send me in my mail ID-
sundarnmishra@gmail.com

thanks & regards
Sundar



1-What is Report Painter ? ALE / IDoc. ? User Exit ? Variances ? P..

Answer / paropkar

ALE stands for application link enabling . It is used for
distributed systems . IDoc is a container which carries the
data so using ALE we can transfer IDocs .

User Exit : SAP has provided the facilty to the customer
for adding there own code without modifying the standard
SAP program . there are 3 user exits -
1. field exit
2. Menu exit
3. Screen exit
Variances : there is nothing like " variances " in SAP
however we use variants which are used to store
the input data for a program to avoid data to be given
manually each time .

Is This Answer Correct ?    3 Yes 0 No

Post New Answer

More Software Design AllOther Interview Questions

What is the role of the W3C in Web accessibility?

0 Answers  


I would like to submit the following question I was asked recently during my technical interview at Google. I'm rephrasing the question to make it clear for everyone to understand: - You are going on a one-way flight trip that includes billions of layovers. - You have 1 ticket for each part of your trip (i.e: if your trip is from city A to city C with a layover in city B, then you will have 1 flight ticket from city A to city B, and 1 flight ticket from city B to city C. - Each layover is unique. You are not stopping twice in the same city. - You forgot the original departure city. - You forgot the final destination city. - All the tickets you have are randomly sorted. Question are: - Design an algorithm to reconstruct your trip with minimum complexity. - How would you improve your algorithm. Example: - randomly sorted: New York->London San Francisco-> Hong Kong Paris->New York London->San Francisco - sorted: Paris->New York New York->London London->San Francisco San Francisco-> Hong Kong

3 Answers   Google,


How to Design a Good Newsletter?

0 Answers  


how to downlaod image to target system? what is the vi editor?

0 Answers  


Write a command to find all of the files which have been accessed within the last 30 days. Output should be stored in a file “December.files”

0 Answers  


Explain various phases of the SDLC.

0 Answers   Agilent, ZS Associates,


what is called when you add pixels to a rastered image when you resize?

1 Answers  


Ford Software engineer interview process and model questions

0 Answers   Ford,


which is the better institute for software design in bangalore please tell me as soon a possible?

0 Answers  


why don't we allow a minimum degree of t=1? in B-tree

4 Answers   TCS,


How to Design a Good Ad?

0 Answers  


. What is a Design System?

1 Answers  


Categories