COMP2123 Data Structures and Algorithms

Course outline

Every module and topic at a glance — start the free trial to practice inside them.

1. 01

   Measuring Algorithm Efficiency

   3 topics
   • What is data structure and algorithms?
   • Algorithm Analysis
   • Time Complexity and Big O Notation
2. 02

   Basic Data Structures: Lists, Stacks and Queues

   4 topics
   • Arrays: Index-based Lists
   • Linked Lists: Positional Lists
   • Stacks: Last-In, First-Out
   • Queues: First-In, First-Out
3. 03

   Loop Invariants and Searching

   2 topics
   • Understanding Loop Invariants
   • Loop Invariants
4. 04

   Trees

   4 topics
   • Basic Tree Concepts
   • Recursion Fundamentals
   • Recursive Tree Traversal
   • Iterative Tree Traversal
5. 05

   Binary Search Trees

   4 topics
   • Searching in Regular Binary Trees
   • Binary Search Tree Operations
   • Balanced Binary Search Trees (AVL Trees)
   • Insertion and Deletion of AVL tree
6. 06

   Heaps

   4 topics
   • Priority Queues and Heap Motivation
   • Basic Heap Operations
   • Maintaining the Bottom Node
   • Heap Sort and Array Implementation
7. 07

   Hash Functions

   4 topics
   • Hash Functions
   • Hash Table
   • Hash Collision
   • Cuckoo Hashing Time Complexity Analysis
8. 08

   Graphs

   3 topics
   • Graph Definition
   • Graph Representation
   • Graph Traversal
9. 09

   Graph Algorithms

   3 topics
   • Shortest Path
   • Minimum Spanning Tree
   • Disjoint-Set Union
10. 10

    Greedy Algorithms

    2 topics
    • From Local Optimum to Global Optimum
    • Proof of Greedy Algorithm
11. 11

    Divide and Conquer Algorithms

    3 topics
    • Divide and Conquer Algorithm
    • Divide and Conquer
    • Study Case

What's included