IBM ABAP written test at Bangalore

i want answers IBM ABAP written test at Bangalore

good....

excllent

its so so.

i want answers IBM ABAP written test at Bangalore

QUESTIONS FOR IBM WRITTEN TEST - BANGALORE

1. INTERNAL TABLE ITAB HAS 100 RECORDS . WRITE LOGIC TO FIND AND
CALCULATE THE SUM OF AN NUMERIC FIELD IN ITAB FOR RECORDS RANGING FROM
POSITIONS 51 TO 57.


2.WRITE A PROGRAM FOR PRIME NUMBERS FROM 0 TO 100.

3. PROGRAM ON PALINDROME LENTH 35.

4. SELECTION - SCREEN VALIDATIONS FOR S_MATNR.

5. USING THE TABLES ZCUSTOMER AND ZSALES WITH LOWEST SALES BUSINESS IN
FISCAL YEAR DATE RANGE 01-01-2006 TO 31-12-2006.

i want answers IBM ABAP written test at Bangalore

excellent

please provide me the answers for the above asked questions

nice one

it is very useful for the students who is searching for the jobs

I need the full answers for this questions

I want answers

prime number pgrm (using selection screen to find the number upto wich the prime numbers are required.. in this case, we need to put 100 in the selection screen)

REPORT zprime .
DATA : t_no TYPE i,
res TYPE p,
pr_no TYPE p,
tag TYPE i.
SELECTION-SCREEN BEGIN OF BLOCK b1.
PARAMETERS : pr_num TYPE i.
SELECTION-SCREEN END OF BLOCK b1.
pr_no = 1.
WHILE pr_no LE pr_num.
t_no = 2.
tag = 0.
WHILE t_no < pr_no.
res = pr_no MOD t_no.
IF res = 0.
WRITE : / pr_no.
WRITE : 'is not PRIME Number ' COLOR 3 INTENSIFIED OFF.
tag = 1.
EXIT.
ENDIF.
t_no = t_no + 1.
ENDWHILE.
IF tag = 0.
WRITE : / pr_no.
WRITE : 'is PRIME Number ' COLOR 6 INTENSIFIED OFF.
ENDIF.
pr_no = pr_no + 1.
ENDWHILE.

"pgrm to find the palindrome for any string of any length::

Report palindrme.

DATA: BEGIN OF i_tab OCCURS 0,

char TYPE c,

END OF i_tab.

DATA: w_word_len TYPE i,

w_indx TYPE i,

w_word_tmp(20) TYPE c,

w_word_rev(20) TYPE c,

w_yes(20) TYPE c VALUE 'It is a palindrome.',

w_no(20) TYPE c VALUE 'Not a palindrome.'.

PARAMETERS: p_word(20) TYPE c.

**** gets length of word

w_word_len = strlen( p_word ).

w_word_tmp = p_word.

**** goes through the each letter index

DO w_word_len TIMES.

w_indx = w_word_len - sy-index.

* index is equal to the world lenth minus sy-index (starts at 1)

SHIFT p_word BY w_indx PLACES LEFT.

* shifts the word by the index number to the left

i_tab-char = p_word.

APPEND i_tab.

CLEAR i_tab.

p_word = w_word_tmp.

ENDDO.

* loops the char's of the word to reverse it

LOOP AT i_tab.

CONCATENATE w_word_rev i_tab-char INTO w_word_rev.

ENDLOOP.

**** DECIDES WHETHER IT IS A PALIDROME OR NOT ****

* w_yes writes It is a palindrome.

* w_no write Not a palindrome.

IF p_word EQ w_word_rev.

WRITE: w_yes.

ELSE.

WRITE: w_no.

ENDIF.

code for the frst question:
types: begin of ty_tab,
matnr type matnr,
ersda type ersda,
end of ty_tab.

data: it_tab type standard table of ty_tab,
wa_tab type ty_tab,
sum type i.

select matnr from mara into table it_tab where matnr > 0.

sum = 0.

loop at it_tab into wa_tab from 5 to 10.
sum = sum + wa_tab-matnr.
endloop.

write: sum.