Final Exam Revision

Data Structure Study Lab

Compact lecture revision for trees, Big O, sorting traces, search, MCQs, and cheat sheets.

  • Binary Trees
  • Array Representation
  • BST Search
  • Insertion Trace
  • Traversals
  • Sorting Trace
Tree Visualizers Big O MCQ Cheat Sheet Sorting

Lecture Dashboard

Choose a section

Lecture 8

Tree

Binary trees, BST search, insertion trace, and traversals.

 Algorithm Analysis

Big O

Count statements, loops, recursion, and simplify complexity.

 Lecture 6

Sorting

Selection, Bubble, Merge, Insertion, and Quick Sort traces.

 Find Topics

Search

Quickly locate terms across the lecture notes and practice.

 Practice

MCQ

Exam-style questions with immediate answer checks.

 Review

Cheat Sheet

Short memory cards for formulas, rules, and traces.

Study Chunks

Lecture Coverage

Interactive Visualizers

Tree and Search Visualizer

Use the tabs to inspect tree anatomy, array representation, binary search, BST search, insertion, and traversal output.

Level 0A root
Level 1B, C children of A
Level 2D, E, F, G leaves/subtrees

        Output:

        Lecture Code Only

        Required Lecture Code

        Trace Practice

        Trace Practice

        MCQ / SA

        MCQ and SA Practice

        Cheat Sheet

        Exam Memory Sheet

        Algorithm Analysis

        Algorithm Analysis — Big O

        Trace statements, loops, and recursion. The goal is to identify how many times lines run, then simplify to Big O.

        Recognition

        Quick Recognition Table

        Cheat Sheet

        Algorithm Analysis Big O Cheat Sheet

        Trace Visualizer

        Trace Visualizer

        Practice

        Big O Trace Practice

        Lecture 6

        Lecture 6 Overview

        Sorting revision for Selection Sort, Bubble Sort, Merge Sort, Insertion Sort, and Quick Sort. The instructor focus is trace only: follow array states, passes, swaps, shifts, merges, partitions, and pivots.

        What the instructor wants: Trace the algorithm steps. Do not write sorting code unless a question explicitly asks for it.

        Trace Lab

        Trace Coverage

        Interactive Trace

        Interactive Sorting Trace Visualizer

        Practice the exam trace for each algorithm step by step. Focus on array states, comparisons, swaps, fixed positions, pivots, and merge groups.

        Enter comma-separated numbers for the sorting trace.
        Step 1 / 1
        Comparing Swapped Sorted / Fixed Pivot
        StepActionArray StateExam Note

        Cheat Sheet

        Sorting Trace Cheat Sheet

        Sorting algorithms trace cheat sheet covering Selection, Bubble, Merge, Insertion, and Quick Sort

        Practice

        Sorting Trace Practice