Ask you to write various functions and classes. You should test them with driver programs as instructed in Programming Problems 7-12 at the end of this chapter.
For the List class in Exercise 19, add a Boolean-valued function that determines whether the data items in the linked list are arranged in ascending order.
Exercise 19,
Ask you to write various functions and classes. You should test them with driver programs as instructed in Programming Problems 7-12 at the end of this chapter.
Build a complete List class, using a linked-list implementation as described in this section. For basic operations it should have a constructor, destructor, copy constructor, assignment, and the basic list operations: empty, traverse, insert, and delete. Also, include a linear search operation to search the linked list for a given item, returning a pointer to a node containing the item in its data part, or a null pointer if it is not found.
Problems 7,
A limited number of tickets for the Hoops championship basketball game go on sale tomorrow, and ticket orders are to be filled in the order in which they are received. Write a program that a box-office cashier can use to enter the names and addresses of the persons ordering tickets together with the number of tickets requested, and store this information in a list. The program should then produce a sequence of mailing labels (names, addresses, and number of tickets) for orders that can be filled.
Problem 8,
Modify the program in Problem 7 to check that no one receives more than four tickets and that multiple requests from the same person are disallowed.
Problem 9,
Write a memory management library as described in this section. Then build and test a list class that stores the list elements in a linked list as described in this section.
Problems 7,
A limited number of tickets for the Hoops championship basketball game go on sale tomorrow, and ticket orders are to be filled in the order in which they are received. Write a program that a box-office cashier can use to enter the names and addresses of the persons ordering tickets together with the number of tickets requested, and store this information in a list. The program should then produce a sequence of mailing labels (names, addresses, and number of tickets) for orders that can be filled.
Problem 8,
Modify the program in Problem 7 to check that no one receives more than four tickets and that multiple requests from the same person are disallowed.
Problem 9,
Write a memory management library as described in this section. Then build and test a list class that stores the list elements in a linked list as described in this section.
Problems 7,
A limited number of tickets for the Hoops championship basketball game go on sale tomorrow, and ticket orders are to be filled in the order in which they are received. Write a program that a box-office cashier can use to enter the names and addresses of the persons ordering tickets together with the number of tickets requested, and store this information in a list. The program should then produce a sequence of mailing labels (names, addresses, and number of tickets) for orders that can be filled.
Problem 8,
Modify the program in Problem 7 to check that no one receives more than four tickets and that multiple requests from the same person are disallowed.
Problem 9,
Write a memory management library as described in this section. Then build and test a list class that stores the list elements in a linked list as described in this section.