Question: Consider the alphabetized linear array DICTIONARY in figure below: How many words that must be pushed or moved if B,J and P which are new
Consider the alphabetized linear array DICTIONARY in figure below:

- 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?
- 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?
- What do you think that how a publisher handles the insertion process in the DICTIONARY?
- 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)?
- 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
Step by Step Solution
3.48 Rating (164 Votes )
There are 3 Steps involved in it
Given Dictonery is Note it is a Linear Array A C D E G H I K L M R S T W 1 2 3 4 5 6 7 8 9 10 11 12 13 14 a inserting B at proper position A C B D E G ... View full answer
Get step-by-step solutions from verified subject matter experts
