Exercises

The following exercises provide you with the opportunity to practice with arrays. The solutions to these exercises are found in the section .

1. For an array containing 100 elements, provide the number of steps the following operations would take:
   1. Reading
   2. Searching for a value not contained within the array
   3. Insertion at the beginning of the array
   4. Insertion at the end of the array
   5. Deletion at the beginning of the array
   6. Deletion at the end of the array
2. For an array-based set containing 100 elements, provide the number of steps the following operations would take:
   1. Reading
   2. Searching for a value not contained within the set
   3. Insertion of a new value at the beginning of the set
   4. Insertion of a new value at the end of the set
   5. Deletion at the beginning of the set
   6. Deletion at the end of the set
3. Normally the search operation in an array looks for the first instance of a given value. But sometimes we may want to look for every instance of a given value. For example, say we want to count how many times the value “apple” is found inside an array. How many steps would it take to find all the “apple”s? Give your answer in terms of N.