Scientific Programming II

Programming in Python

2015 Final

For your final examination, you will be implementing data structures in Python. As this is primarily a data structures course, this will be the best assessment of what you have learned this year.

This year, we have covered lists, stacks, queues, trees, graphs, and maps, along with associated algorithms. We have already done lists, so your job will be to pick FOUR of the FIVE remaining structures to implement in Python. I have provided links to the Java write-ups for each of these structures:

• Stacks
• Queues
• Trees
• Graphs
• Maps

There are some special requirements, however:

• If your data structure is empty, then the method that converts it to a string should explicitly say so, e.g. "Empty stack" or "empty map"
• Your classes must be named a normal name (Stack, Queue, Tree, Map, and Graph), in a file with the same name; therefore, Stack should be in Stack.py

I have provided below a small script to test your programs with.

Tests

To submit, you should add your Python files to the unzipped tests folder, re-zip it, and email it to me. Any errors that occur will be sent back to you for resubmission, but you will be penalized as this is the final.