Answer Posted / saplead.sai

The solution provided by Siddhart is though correct, I
would like to project the solution in a much detailed with
example.
Binary Search Basic rule - Sort the data in Ascending order.
Suppose we have random numbers ranging from 1 to 10000 and
we are searching for 4219. If the data is unorganized and
random....a sequential search would be time consuming.
Hence once the data is sorted in Ascending order. Binary
search would reduce the LOOKUP time.
In the FIRST PASS BINARY search would split the range of 1 -
10000 in to two halfs (i.e 1 - 4999 & 5000 - 10000) and
compares the 4219 which happens to fall in the first half.
In the next pass again two halfs are made and compared.
This way BINARY SEARCH works by dividing either data into
two halfs.
For internal table......or for anything else....this is it

What is an “on request field” statement?

1184

---

What is native sql?

1220

---

What are internal tables? How do you get the number of lines in an internal table? How to use a specific number occurs statement?

1074

---

Example of table cluster and cluster tables.

1146

---

How to write a code for multiple transactions? : abap bdc

1010

---

Explain how data is stored in cluster table?

1178

---

What are the relational operations that can be performed on view in sap? : abap data dictionary

944

---

Explain the components of selection table?

1129

---

What is abap dictionary or data dictionary? What is the transaction to access abap dictionary? : abap data dictionary

962

---

What are the function modules that are generated when you activate a lockobject? : sap abap data dictionary

1010

---

What are screen painter? Menu painter? Gui status?

1120

---

Explain the disadvantages of logical databases?

980

---

How many secondary indexes can we create in a table?

1052

---

Explain what is a foreign key relationship? Explain this with the help of an example.

1063

---

What are control tables? : abap data dictionary

1013

---