1. (Online Address Book Revisited) Programming Exercise 9 in Chapter 3 could handle a maximum of only 500 entries. Using linked list, redo the program to handle as many entries as required. Add the following operations to your program:
a. Add or delete a new entry to the address book.
b. When the program terminates, write the data in the address book to a disk.
12. (Linked List with Header and Trailer Nodes) This chapter defined and identified various operations on a linked list with header and trailer nodes.
a. Write the definition of the class that defines a linked list with header and trailer nodes as an ADT.
b. Write the definitions of the member functions of the class defined in (a). (You may assume that the elements of the linked list with header and trailer nodes are in ascending order.)
c. Write a program to test various operations of the class defined in (a).
13. (Circular Linked List) This chapter defined and indentified various operations on a circular linked list.
a. Write the definitions of the class CircularLinkedList and its member functions. (You may assume that the elements of the circular linked list are in ascending order.)
b. Write a program to test various operations of the class defined in (a).
14. (Programming Example Video Store)
a. Complete the design and implementation of the class customerType defined in the Programming Example Video Store.
b. Design and implement the class customerLinstType to create and maintain a list of customers for the video store.
Chapter 6 Programming Exercise:
#2 Write a recursive function to generate a pattern of stars such as the following:
Also, write a program that prompts the user to enter the number of lines in the pattern and uses the recursive functions to generate the pattern. For example, specifying 4 as the number of lines generates the preceding pattern.
#12 Write a recursive function to implement the recursive algorithm of Exercise 13 (multiplying two positive integers using repeated addition). Also, write a program to test your function.