Homework Assignment # 4

Due Wednesday October 2, 2013 by 11:59 PM. See the following link for turnin instructions:

https://piazza.com/class/hkuo0jreo4q3wa?cid=39

[10 Points] Please have the following at the top of HW4.py (Please don't put you name on the homework for privacy reasons.)

# HW4.py
# Homework 4
#  
# UT EID: XXX999, UTCS username: XXXXXXXX 
# CS313e, Fall 2013, Dr. P. Cannata 
# Department of Computer Science, The University of Texas at Austin --

Problem 1 [5 Points]: In Chapter 18 of your textbook, Section 18.5 defines a Stack data structure
and describes its methods and their implementation. For this homework, I want you to implement a
Stack in a different way. Define a Stack class which inherits from the LinkedList class and
then implement the Stack methods by rewriting some of the LinkedList methods.


Problem 2 [5 Points]: In Chapter 18 of your textbook, Section 18.6 defines a Queue data structure
and describes its methods and their implementation. For this homework, I want you to implement a
Queue in a different way. Define a Queue class which inherits from the LinkedList class and
then implement the Queue methods by rewriting (overriding) some of the LinkedList methods.

No partial credit will be given for each problem in this homework. The code you submit must work for
a set of tests that will be determined by Dr. Cannata and the TAs. So make sure you test your code.
Your code should include the LinkedList code from the Homework 3 Solution.