CPSC 340: Data Structures and Algorithms

• Modules:
  0. Course Syllabus
  1. Course Introduction and Arraylists
     1. Introduction to data structures and algorithms
     2. Arrays as a data structure
     3. Understanding memory
     4. Creating an Araylist
     5. Generics
     6. Lab 1: DynamicList Methods
  2. Linked Lists
     1. Linked Lists
     2. Linked Lists Continued
     3. Doubly Linked Lists
     4. Doubly Linked Lists Continued
     5. Lab 2: Linked Lists vs. Array Lists
  3. Stacks and Queues
     1. Stacks
     2. Stacks Continued
     3. Queues
     4. Queues Continued
     5. Lab 3: Matching Parenthesis
  4. Algorithm Analysis
     1. Algorithm Analysis
     2. Algorithm Analysis Part 2
     3. Algorithm Analysis Part 3
     4. Lab 4: Big-O Exercise
  5. Hash Tables
     1. Hash Tables
     2. Hash Tables Continued
     3. Lab 5: Hash Functions
  6. Recursion
     1. Recursion
     2. Recursion Part 2
     3. Recursion Part 3
     4. Lab 6: Recursive Powers
  7. Searching and Sorting
     1. Search Algorithms
     2. Bubble Sort
     3. Merge Sort
     4. Lab 7: Sort Comparison
  8. Binary Search Trees
     1. Binary Trees
     2. Binary Search Trees
     3. Binary Search Tree Removal
     4. Binary Search Tree Analysis
     5. Lab 8: Binary Search Tree Count
  9. Heaps
     1. Heaps
     2. Heap Operations
     3. Lab 9: Heapsort
  10. Graphs
      1. Graphs
      2. Dijkstra's Algorithm
      3. Prim's Algorithm
      4. The Travelling Salesman Problem
      5. Lab 10: Complete Graphs
  11. Bonus Material: Huffman Coding
      1. Huffman Coding
      2. Huffman Coding Continued
• Assignments:
  1. Grayscale Image Converter
  2. Playlist Manager
  3. Simple Sentiment Analysis
  4. Spell Checker
  5. Course Scheduler