Loyola College in Maryland
CS 301 - Data Structures and Algorithms I
Fall 2003
Loyola College >
Department of Computer Science >
CS 301 >
Homework >
Homework 9
Due
Friday, October 10 at the beginnging of class
Problems
1. p. 120 25
2. p. 120 26
3. p. 120 27
4. Consider the palidrome-recognition program presented in class. Is it necessary for the algorithm to look at the entire queue and stack? That is, can you reduce the number of items that the loop must execute? If so, would this reduction effect the Big-O running time of the solution?