Assignment 7

Programming Assignment #7

Due: Fri, Apr 26

IMPORTANT NOTE: No late submissions will be accepted for this one. Apr 26 is the ABSOLUTE DEADLINE, in order to leave appropriate time for grading

This assignment contains two exercises based on linked list and stack classes

Before You Start

Here are the List and Stack examples that we looked at in lecture class (From Deitel edition 5). Here are links to copies of the files:

You will need these files for both exercises.

Exercise 1

Filename: palindrome.cpp

Write a program that uses a stack object to determine if a string is a palindrome (i.e. the string is spelled identically backward and forward). The program should ignore spaces and punctuation.

Go ahead and start your program by reading in a C-style string from standard input, using the getline function. You may assume a limit of 100 characters on the string (although this can be written, with a little more effort, to accept any size string). Your algorithm must make use of a stack (of type char). Use the Deitel implementation of the Stack from "stack.h" (you don't need to change this file).

Ignore spacing and punctuation, as well as special characters and digits (i.e. only count letters as part of a palindrome, and account for upper/lower case. For example, 'B' and 'b' are matching letters).

Sample runs: (user input underlined)

  Please enter a string:
  > ABCDEFGHGFEDCBA

  "ABCDEFGHGFEDCBA"  IS a palindrome


  Please enter a string:
  > The quick brown fox

  "The quick brown fox"  is NOT palindrome


  Please enter a string:
  > Cigar? Toss it in a can. It is so tragic.

  "Cigar? Toss it in a can. It is so tragic."  IS a palindrome

Want some palindromes to test with? Try this site
AND.... one more palindrome...

General

Since you are reading data into a C-style string to begin, you may use any of the libraries <iostream>, <cstring>, and <cctype>, if you like. (The first, of course, for I/O, and the other two, since they deal with C-style strings and characters).

Exercise 2

Modify the List class (file list.h) to add the following functions in the public interface:

insertMiddle
removeMiddle
copy constructor
assignment operator

Your extra insert and remove functions should have all the same features as the given insert and remove functions, except that yours each have one extra parameter. The second parameter on each of your functions should be of type int, representing the position at which to insert (or delete). Sample calls for a list of integers:

  L.insertMiddle(345, 5);	// attempts to insert the value 345
				//  as the 5th item in the list

  L.removeMiddle(x, 10);	// attempts to delete the 10th item in the
				//  list and captures its value into x.

Handling out of bounds position:

For insertMiddle, if the position number is larger than the number of items in the list, just insert the item at the back. If it's too small (i.e. 0 or less), insert at the front.
For removeMiddle, return false if the position is invalid (too large or too small), without removing anything.

Examples:

If the list L is:
```
   10 20 30 40 50 60 70 80 90 100
```
then a call to L.insertMiddle(345, 5) would result in this list:
```
   10 20 30 40 345 50 60 70 80 90 100
```
From the above state, a call to L.insertMiddle(500, 20) would result in:
```
   10 20 30 40 345 50 60 70 80 90 100 500
```
If the list L is:
```
   10 20 30 40 50 60 70 80 90 100
```
then a call to L.removeMiddle(x, 11) would return false and not change the list. But a call to L.removeMiddle(x, 4) would result in this list:
```
   10 20 30 50 60 70 80 90 100
```
and the value 40 would be stored in x, and the function would return true for success.

For the copy constructor and the assignment operator, you should add these member functions so that they do the appropriate job of making a deep copy (not shallow copy) of a List object. All attached data is copied appropriately. Make sure that the assignment operator works in the same context as with other types. This means cleaning up prior data, protecting against self-assignments, and cascading of calls should work as well. For example:

 L1 = L2 = L3; // L1, L2, L3 are all List objects

I've modified the menu program of Figure 21.5 so that it adds in two more menu options for testing the insert and remove features. After insert/delete testing, the main program runs one test each of the copy constructor and the assignment operator. You should not limit your testing to ONLY these cases (you are advised to write other test cases into the main routine), but you can use this menu program as a foundation to help you test your additions to the List class:

menu7.cpp

Submitting:

Submit the files:

  list.h
  palindrome.cpp