Answer Posted / saksham gautam

Binary search algorithm is based on middle value , first
data is divided into two part on the basis of middle value
so that left side data is less than middle value and right
side data greater than middle value. Search value is equal
to middle value then it give result middle value. If search
value is greater than middle value it will be search right
side of middle value ,if search value is less than middle
value it will search left side. So Data should be ascending
order so that greater value will be right side of middle
value and lesser value will be left side of middle value.
For example 1,2,3,4,5,6,7,8,9 here middle value is 5.Now we
search 7 it will be search in right part from 5.It is give
result. It’s opposite if it is in descending order
9,8,7,6,5,4,3,2,1.Here 5 is middle value and 7 is searched
in right from 5 according to binary search algorithm ,it
will fail for the search.

What are the differences between se01, se09 and se10?

960

---

Which objects are independent transport objects? : abap data dictionary

973

---

Why do we use logical blocks in abap program?

2040

---

What is a transport?

1068

---

What is the difference between Exit and Stop?

1082

---

What is the difference b/t Session method and call transaction method ??

6102

---

What is buffering in abap?

1163

---

How does the interface between the dynpro and the abap/4 modules take place?

985

---

What is the collect statement?

1098

---

What are indexes? : sap abap data dictionary

1052

---

How is conversion of data types done between abap/4 & external level? : abap data dictionary

1106

---

How do you backup Sapscript layout sets? Can you download and upload? How?

965

---

Explain what are the problems in processing batch input sessions?

1019

---

In BDC, data transfer is done success in foreground mode but if we done the same in background mode it shows errors. What is the reason?

1425

---

How to create user interfaces for lists?

971

---