Answer Posted / sunil kumar 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 principle ,it
will fail for the search.

What is logical database? : abap hr

1034

---

What is append structure?

1041

---

Mention what is alv programming in abap?

1193

---

Explain the disadvantage of using exec sql statement in abap?

989

---

List the various components of the enterprise structure in systems, applications, and products (sap) in human capital management (him)? : sap abap hr

953

---

What is the lock object?

1075

---

How do you find out whether a file exits on the presentation server?

997

---

What is the max no of match code id's that can be defined for one match code object? : abap data dictionary

1093

---

What is the reserve command?

1278

---

What is the difference between select statement and provide statement ? : abap hr

1073

---

SM35 transaction, How to automate BDC ?

1172

---

What is the difference between skip and reserve?

1178

---

Explain the disadvantages of different types of bdc's?

1048

---

Different types of locks?

1036

---

how do you call third selection screen ?

2112

---