Consider the alphabetized linear array DICTIONARY in figure below:

1. How many words that must be pushed or moved if B,J and P which are new words are inserted in to DICTIONARY at three different places?
2. How many words are to be moved or shifted to a new locations if new three words are inserted in the DICTIONARY simultaneously at a time?
3. What do you think that how a publisher handles the insertion process in the DICTIONARY?
4. If we are Using Linear Search Algorithm How many comparisons C and swaps S of the words are to be made to locate the Words H,M and F? Specify the criteria for unsuccessful search (Where and the searching process stops)?
5. Let the binary searching algorithm is applied on DICTIONARY to find and locate the word G .

• At this point what is the value of BEG ,END and MID variables?

1 A 2 D 5 G H 7 8 K 10 M 11 R 12 13 14