This page provides links to screen reader versions of the unit reading materials where they can be provided. Some items link to electronic versions as provided by the publisher

  • Berman, K. A., & Paul, J. L. (2005). APPENDIX G: Pseudocode Conventions. In Algorithms: sequential, parallel, and distributed (pp. 919–932). Boston, Mass: Thomson/Course Technology. Download
  • Johnsonbaugh, R., & Schaefer, M. (2003). Chapter 1. In Algorithms (1st International edition). Upper Saddle River: Pearson Education (US). Download
  • Johnsonbaugh, R, & Schaefer, M. (2004). Chapter 2 : Mathematics for algorithms. In Algorithms (Vol. The JK computer science and mathematics series, pp. 41–65). Upper Saddle River, NJ: Pearson Education. Download
  • Johnsonbaugh, Richard, & Schaefer, Marcus. (2004). Chapter 6: Sorting & selection. In Algorithms (Vol. The JK computer science and mathematics series, pp. 239–270). Upper Saddle River, NJ: Pearson Education.Download
  • Levitin, Anany. (2007a). Chapter 1 : Introduction. In Introduction to the design & analysis of algorithms (2nd ed, pp. 1–40). London: Pearson Addison-Wesley. Retrieved from http://libcat.library.qut.edu.au/search/t?SEARCH=Algorithms:+Sequential,+Parallel+and+Distributed&searchscope=8&SORT=D&submit=Search
  • Levitin, Anany. (2007b). Chapter 2 : Fundamentals of the Analysis of Algorithm Efficiency. In Introduction to the design & analysis of algorithms (2nd ed, pp. 41–96). London: Pearson Addison-Wesley.Download
  • Levitin, Anany. (2007c). Chapter 5 : Decrease and Conquer. In Introduction to the design & analysis of algorithms (2nd ed, pp. 157–196). London: Pearson Addison-Wesley. Download