Lab 1 - due Jan 18
1. Arrays. Write a program which creates an array x containing 100 randomly chosen
integers in the range 0 .. 99. The main() function asks the user to enter a target number to
search for, then tells the user how many times it was found in the array.
You may use this code for generating random numbers:
srand( (unsigned)time( NULL ) ); /* to seed the random
number stream for fresh random numbers */
rand()%n; /* to generate a random number in the range 0 ..
n-1 */
2. You are to create a personal telephone directory with these capabilities:
1. Add new entry
2. Lookup phone number
3. Change phone number
4. Remove entry
5. Print all entries
6. Exit
A phone entry is a struct with these fields:
firstname: 10 chars
lastname: 15 chars
phone: 15 chars
Use either a struct or a class to create the ENTRY type.
The main() function sets up an infinite loop which presents a menu of choices to the user
and carries out the request.
Phone entries are to be kept in an array of size MAXSIZE, which is defined. The main()
function declares the array, and keeps track of the next available slot for adding a new
entry. When an entry is removed, the entries following it are moved down to fill the gap.
Provide a find function, which asks the user for the first and last names of the entry to
find. It then returns the array index of the entry, or -1 if not found. The lookup, change
and remove functions start off by calling find.
3. Modify problem 2 in the following ways:
Change the array to be an array of pointers to ENTRY, rather than an array of ENTRY.
The function, which adds a new entry, must allocate space for it using malloc and return a
pointer. Removing an entry should free the memory.
