CA268-DSA

Data Structures & Algorithms. School Coursework in Python 3

Topics Covered:

• Complextiy (Time + Space) // Big O Notation

• Sequences, Sets and Maps

• Stacks

• Queues

• Linked Lists

• Recursion

• Trees

  1. Traversals
  2. AVL, BST, Map Implementation

• Hashing, collisions, sets & maps

  1. [Extensible] Hash tables, implementation in arrays
  2. Collision resolution // chaining
  3. Set / Map implementation w/ hashing

• Sorting Algorithms (Review):

  1. Quadratic Sorting Algorithms
  2. Quicksort
  3. Merge Sort
  4. Radix Sort

• Graphs & Graph Algorithms:

  1. Depth-First Search (DFS)
  2. Breadth-First Search (BFS)
  3. Dijkstra's Algorithm (Shortest path + variations)
  4. Prim-Jarnik's Algorithm
  5. Minimum Spanning Tree (MST)