• Index of Digital Reading Room
• Search

1. Home
2. COMP
3. COMP 272: Data Structures and Algorithms (Revision 9)

COMP 272: Data Structures and Algorithms (Revision 9) Report a Broken Link

Computer Science 272: Data Structures and Algorithms builds on the concepts introduced in COMP 268, COMP 206, or COMP 218 and shows how to use data structures as tools to design computer programs that will cope with the complexity of actual applications.

Course Orientation

Required Reading

Morin, P. (2013). Open Data Structures. Athabasca University Press.

Supplementary Reading

Barnett, G., & Del Tongo, L. (2008). Data structures and algorithms: Annotated reference with examples. DotNetSlackers.

Open data structures. (n.d). Open Data Structures. Retrieved January 19, 2024, from https://opendatastructures.org/

Buell, D. A. (2013). Data structures using Java. Jones & Bartlett Learning. Note: You must login to Books24x7 through the AU Library before you can access this resource.

Mehlhorn, K., & Sanders, P. (2008). Algorithm and data structures: The basic toolbox. Springer. 10.1007/978-3-540-77978-0

Goodrich, M. T., & Tamassia, R. (2016). Data structures and algorithms in Java (6th ed.). Wiley.  Note: For purchase or rental only.

Dale, N. (2013). C++ plus data structures. Jones & Barlett Learning. Note: You must login to Books24x7 through the AU Library before you can access this resource.

Venkateshwara Rao, K., Srujan Raju, K., & Ravinder, B. (2014). C programming and data structures. University Science Press. Note: You must login to Books24x7 through the AU Library before you can access this resource.

Campesato, O. (2022). Python data structures: Pocket primer. Mercury Learning.

Chawla Bhatia, S. (2021). Python internals for developers: Practice python 3.X fundamentals, including data structures, asymptotic analysis, and data types. BPB.

Lambert, K. A. (2014). Fundamentals of Python: Data structures. Cengage Course Technology.

Miller, B., & Ranum, D. (2011). Problem solving with algorithms and data structures using Python (2nd ed.). Franklin, Beedle & Associates.

Unit 1: Introduction

Required Reading

List of algorithms. (2023, November 17). In Wikipedia. https://en.wikipedia.org/w/index.php?title=List_of_algorithms&oldid=1185527238

Supplementary Reading

The importance of algorithms. (2018, October 31). Topcoder. Retrieved January 19, 2024, from https://www.topcoder.com/thrive/articles/The%20Importance%20of%20Algorithms

Required Videos

Morin, P. (2020, September 9). COMP2402: September 9, 2020 [Video]. Youtube. https://www.youtube.com/watch?v=dnklgh85RE0&t=1102s Note: This video begins at 00:18:22.

Pat Morin. (2020, September 11). COMP2402: Sep 11, 2020 [Video]. Youtube. https://www.youtube.com/watch?v=5kQfRMC64Vk&t=300s Note: This video begins at 00:05:00. The relevant portion ends at 00:33:28.

Unit 2: Array-Based Lists

Required Reading

Morin, P. (2013, August). 2.1 ArrayStack: Fast stack operations using an array. Open data structures. https://opendatastructures.org/newhtml/ods/latex/arrays.html#tex2htm-19

Galles, D. (2011). Data structure visualizations. https://www.cs.usfca.edu/~galles/visualization/Algorithms.html

Galles, D. (2011). Stack (Array implementaion). Data structure visualizations. https://www.cs.usfca.edu/~galles/visualization/StackArray.html

Galles, D. (2011). Queue (Array implementaion). Data structure visualizations. https://www.cs.usfca.edu/~galles/visualization/QueueArray.html

Unit 3: Linked Lists

Required Reading

Morin, P. (2013, August). 3 Linked lists. Open data structures. https://opendatastructures.org/newhtml/ods/latex/linkedlists.html#tex2htm-37

OpenDSA Project Contributors. (2023, October). 9.3. Array-Based list implementation. OpenDSA data structures and algorithms modules collection. https://opendsa-server.cs.vt.edu/ODSA/Books/Everything/html/ListArray.html

OpenDSA Project Contributors. (2023, October). 9.4. Linked lists. OpenDSA data structures and algorithms modules collection. https://opendsa-server.cs.vt.edu/ODSA/Books/Everything/html/ListLinked.html

Galles, D. (2011). Data structure visualizations. https://www.cs.usfca.edu/~galles/visualization/Algorithms.html

Galles, D. (2011). Stack (Linked list implementaion). Data structure visualizations. https://www.cs.usfca.edu/~galles/visualization/StackLL.html

Galles, D. (2011). Queue (Linked list implementaion). Data structure visualizations. https://www.cs.usfca.edu/~galles/visualization/QueueLL.html

Unit 4: Skiplists

Required Reading

Morin, P. (2013, August). 4 Skiplists. Open data structures. https://opendatastructures.org/newhtml/ods/latex/skiplists.html#tex2htm-53

Unit 5: Hash Tables

Required Reading

Morin, P. (2013, August). 5 Hash Tables. Open data structures. https://opendatastructures.org/newhtml/ods/latex/hashing.html#tex2htm-61

Agarwal, M. (2012, October 14). Hashing. Code 365. https://code365.in/hashing/

Geeks for Geeks. (2023, December 29). Separate chaining sollision handling technique in hashing. Geeks for Geeks. https://www.geeksforgeeks.org/separate-chaining-collision-handling-technique-in-hashing/

Hash table. (2024, January 18). In Wikipedia. https://en.wikipedia.org/w/index.php?title=Hash_table&oldid=1196850001

Supplementary Reading

Coleman, B. (2019, September 12). Minimal perfect hash functions. Randorithms. https://randorithms.com/2019/09/12/MPH-functions.html

Required Videos

Paul Programming. (2013, May 20). What is a hash table data structure: Introduction to hash tables, part 0 [Video]. Youtube. https://www.youtube.com/watch?v=MfhjkfocRR0

Unit 6: Recursion

Required Reading

Topcoder. (2018, October 31). An introduction to recursion part one. TopCoder. https://www.topcoder.com/thrive/articles/An%20Introduction%20to%20Recursion%20Part%20One

Barnett, G., & Del Tongo, L. (2008). Data structures and algorithms: Annotated reference with examples. DotNetSlackers.

Geeks for Geeks. (2023, April 11). Decimal to binary number using recursion. Geeks for Geeks. https://www.geeksforgeeks.org/decimal-binary-number-using-recursion/

Thakur, A. (2023, October 31). How to convert decimal to binary?. Tutorials Point. https://www.tutorialspoint.com/how-to-convert-decimal-to-binary

Geeks for Geeks. (2023, April 11). Print revese of a string using recursive. Geeks for Geeks. https://www.geeksforgeeks.org/reverse-a-string-using-recursion/

University of Central Florida. (n.d.). Recursion - II. https://www.cs.ucf.edu/courses/cop3502/spr07/730/recursion2.pdf

Required Videos

HackerCS. (2011, February 23). Time complexity of recursive algorithms using recurrences part 1/4 [Video]. Youtube. https://www.youtube.com/watch?v=cBGLEa6WcrQ

HackerCS. (2011, February 23). Time complexity of recursive algorithms using recurrences part 2/4 [Video]. Youtube. https://www.youtube.com/watch?v=oZ0MP5euLQ0

HackerCS. (2011, February 23). Time complexity of recursive algorithms using recurrences part 3/4 [Video]. Youtube. https://www.youtube.com/watch?v=t4mwbA46KF8

HackerCS. (2011, February 23). Time complexity of recursive algorithms using recurrences part 4/4 [Video]. Youtube. https://www.youtube.com/watch?v=agy0GW9-uyM

Unit 7: Binary Trees

Required Reading

Morin, P. (2013, August). 6 Binary trees. Open data structures. https://opendatastructures.org/newhtml/ods/latex/binarytrees.html#tex2htm-74

Geeks for Geeks. (2023, November 2). AVL tree data structure. Geeks for Geeks. https://www.geeksforgeeks.org/introduction-to-avl-tree/

Galles, D. (2011). Data structure visualizations. https://www.cs.usfca.edu/~galles/visualization/Algorithms.html

Galles, D. (2011). Binary search tree. Data structure visualizations. https://www.cs.usfca.edu/~galles/visualization/BST.html

Galles, D. (2011). AVL tree. Data structure visualizations. https://www.cs.usfca.edu/~galles/visualization/AVLtree.html

Supplementary Reading

AVL tree. (2023, December 28). In Wikipedia. https://en.wikipedia.org/w/index.php?title=AVL_tree&oldid=1192212776

Geeks for Geeks. (2023, October 3). Insertion in an AVL tree. Geeks for Geeks. https://www.geeksforgeeks.org/insertion-in-an-avl-tree/

Unit 8: Scapegoat Trees

Required Reading

Morin, P. (2013, August). 8 Scapegoat trees. Open data structures. https://opendatastructures.org/newhtml/ods/latex/scapegoat.html#tex2htm-92

Unit 9: Red-Black Trees

Required Reading

Morin, P. (2013, August). 9 Red-black trees. Open data structures. https://opendatastructures.org/newhtml/ods/latex/redblack.html#tex2htm-97

Galles, D. (2011). Data structure visualizations. https://www.cs.usfca.edu/~galles/visualization/Algorithms.html

Galles, D. (2011). Red/Black tree. Data structure visualizations. https://www.cs.usfca.edu/~galles/visualization/RedBlack.html

Unit 10: Heaps

Required Reading

Learnc.net. (n.d.) C Binary Heap. Learnc.net. https://www.learnc.net/c-data-structures/binary-heap/

Galles, D. (2011). Data structure visualizations. https://www.cs.usfca.edu/~galles/visualization/Algorithms.html

Galles, D. (2011). Min heap. Data structure visualizations. https://www.cs.usfca.edu/~galles/visualization/Heap.html

Galles, D. (2011). Binomial queue. Data structure visualizations. https://www.cs.usfca.edu/~galles/visualization/BinomialQueue.html

Galles, D. (2011). Fibonacci heap. Data structure visualizations. https://www.cs.usfca.edu/~galles/visualization/FibonacciHeap.html

Galles, D. (2011). Leftist heap. Data structure visualizations. https://www.cs.usfca.edu/~galles/visualization/LeftistHeap.html

Galles, D. (2011). Skew heap. Data structure visualizations. https://www.cs.usfca.edu/~galles/visualization/SkewHeap.html

Required Videos

Pat Morin. (2020, November 6). COMP2402: November 6, 2020 [Video]. Youtube. https://www.youtube.com/live/NdpVFGicNrg?si=M1W9bIQq3eAA_wGl&t=545 Note: This video begins at 00:09:05.

Unit 11: Sorting Algorithms

Required Reading

Galles, D. (2011). Data structure visualizations. https://www.cs.usfca.edu/~galles/visualization/Algorithms.html

Galles, D. (2011). Comparison sorting algorithms. Data structure visualizations. https://www.cs.usfca.edu/~galles/visualization/ComparisonSort.html

Galles, D. (2011). Bucket sort. Data structure visualizations. https://www.cs.usfca.edu/~galles/visualization/BucketSort.html

Galles, D. (2011). Counting sort. Data structure visualizations. https://www.cs.usfca.edu/~galles/visualization/CountingSort.html

Galles, D. (2011). Radix sort. Data structure visualizations. https://www.cs.usfca.edu/~galles/visualization/RadixSort.html

Galles, D. (2011). Heap sort. Data structure visualizations. https://www.cs.usfca.edu/~galles/visualization/HeapSort.html

Required Videos

Pat Morin. (2020, November 18) COMP2402: November 18, 2020 [Video]. Youtube. https://www.youtube.com/live/mnCBesegEls?si=PJF0lPy3gUOXRb0X&t=417 Note: This video begins at 00:06:57.

Unit 12: Graphs

Required Reading

Galles, D. (2011). Data structure visualizations. https://www.cs.usfca.edu/~galles/visualization/Algorithms.html

Galles, D. (2011). Breadth-First search. Data structure visualizations. https://www.cs.usfca.edu/~galles/visualization/BFS.html

Galles, D. (2011). Depth-First search. Data structure visualizations. https://www.cs.usfca.edu/~galles/visualization/DFS.html

Galles, D. (2011). Connected components. Data structure visualizations. https://www.cs.usfca.edu/~galles/visualization/ConnectedComponent.html

Galles, D. (2011). Dijkstra shortest path. Data structure visualizations. https://www.cs.usfca.edu/~galles/visualization/Dijkstra.html

Galles, D. (2011). Prim minimum cost spanning treeh. Data structure visualizations. https://www.cs.usfca.edu/~galles/visualization/Prim.html

Galles, D. (2011). Topological sort (Indegree). Data structure visualizations. https://www.cs.usfca.edu/~galles/visualization/TopoSortIndegree.html

Galles, D. (2011). Topological sort (DFS). Data structure visualizations. https://www.cs.usfca.edu/~galles/visualization/TopoSortDFS.html

Galles, D. (2011). Floyd-Warshall all-pairs shortest path. Data structure visualizations. https://www.cs.usfca.edu/~galles/visualization/Floyd.html

Galles, D. (2011). Kruskal minimum cost spanning treeh. Data structure visualizations. https://www.cs.usfca.edu/~galles/visualization/Kruskal.html

Unit 13: Binary Tries

Required Reading

Galles, D. (2011). Data structure visualizations. https://www.cs.usfca.edu/~galles/visualization/Algorithms.html

Galles, D. (2011). B-Trees. Data structure visualizations. https://www.cs.usfca.edu/~galles/visualization/BTree.html

Galles, D. (2011). B+ trees. Data structure visualizations. https://www.cs.usfca.edu/~galles/visualization/BPlusTree.html

Required Videos

Pat Morin. (2020, November 25). COMP2402: November 25, 2020 [Video]. Youtube. https://www.youtube.com/live/GaJw19hgZyA?si=9eNhVK82UXN1SEhV&t=420 Note: This video beginst at 00:07:00. The relevant portion ends at 01:04:35.