computer science

Requirements

Design a final project of your choice which exemplifies and

requires the use of Data Structures studied in this course.

The project must have components from the following list to receive full credit.

1. Main class with commented author, date, project name. and description of the project (5%)

2. A list of all the classes used in the project with a reason for their use (5%)

3. A UML diagram of the class structure for the main program class and any you write (5-10%)

4. Program Logic of the main program class(es) (10%)

5. Properly commented main program class(es) (10%)

6. Sample output, screen shots acceptable for GUI application (5%)

7. Creativity (10%)

8. Presentation (5%)

9. Working Program (40-45%)

Due Date

--------

Dec 15, 2015 from 1:00 PM to 3:15 PM

Room W215

Presentation of your final project

----------------------------------

Final Project Ideas

-------------------

Create an Array List or Linked List To Implement One Of The Following

1. Play A Game - GUI or non GUI, GUI is Below

a) First create the Data Structure of your choice to hold the images

b) Put the card images in the Data Structure in order

c) Display the contents of the Data Structure one card image at a time

d) Play a card game of your choice: Black Jack, War, Poker, etc

2. Database File Management System

Create a management system that presents the following list of options.

a) Read a file and convert the contents to a list

b) Display the contents of the list

c) Find an entry in the list

d) Delete an entry from the list

e) Update and entry in the list

f) Write the list back to the original file

g) Anything else that make sense to you

3. Infix to Postfix

Create a system to evaluate an algebraic expression and calculate the resulting number.

a) Implement an Infix notation to Postfix notation translator using stacks.

b) Integrate that program with the Postfix Calculator presented in Chapter 12 p. 491-495

c) Input will be the Infix expression. An example is: (45-23)*(15+12)/(26*(9-32))

d) The output of program converts this expression to Postfix notation:

45 23 - 15 12 + * 26 9 32 - * / =

e) Send the Postfix notation expression to the Postfix Calculator:

(45-23)*(15+12)/(26*(9-32)) = 45 23 - 15 12 + * 26 9 32 - * / = 0.993310368

4. Implement An Integer Calculator

a) Use 3 stacks to add integers

b) Extend it to do additional operations:

1. multiplication

2. subtraction

3. division

4. modulus

5. Queue Project

Using the Programming Projects at the end of Chapter 14, select one that fits you.