CS 253 Introduction to Data Structure and Algorithms

0 Summary of Data Structures

Coding

Java

Algorithm

Data Structure

This lecture introduces the basic data structures and their relationships.

1 Array List

Coding

Java

Data Structure

Array List

This lecture introduces the basic concepts of array and ArrayList in Java.

2 Linked List, Stack, and Queue

Coding

Java

Data Structure

Linked List

Stack

Queue

This lecture introduces the basic concepts of linked list, stack, and queue in Java.

3 Priority Queues and Heaps

Coding

Java

Data Structure

Priority Queue

Heaps

This lecture introduces the basic concepts of priority queues, heaps, and how to implement them in Java.

4 Trees and Binary Search Trees

Coding

Java

Data Structure

Trees

This lecture introduces the basic concepts of trees and binary search trees in Java.

5 Balanced Search Trees and other Types of Trees

Coding

Java

Data Structure

Balanced Search Trees

AVL Trees

Splay Trees

2-4 Trees

This lecture introduces balanced search trees, AVL trees, splay trees, and 2-4 trees in Java.

6 Graph Basics

Coding

Java

Data Structure

Graph

This lecture introduces the basics of graph theory.

7 Directed Acyclic DAG (DAG)

Coding

Java

Data Structure

DAG

This lecture introduces Directed Acyclic Graphs (DAG) and their properties, including cycle detection and topological sorting.

8 Shortest Path

Coding

Java

Algorithm

Shortest Path

This lecture introduces the concept of shortest path in graphs, including BFS for unweighted graphs and Dijkstra’s algorithm for weighted graphs.

9 Union-Find

Coding

Java

Algorithm

Union-Find

This lecture introduces the Union-Find data structure, which efficiently supports dynamic connectivity operations in graphs.

10 Minimum Spanning Tree (MST)

Coding

Java

Algorithm

Minimum Spanning Tree

This lecture introduces the minimum spanning tree algorithm

11 Maximum Flow

Coding

Java

Algorithm

Maximum Flow

This lecture introduces the Maximum Flow algorithm

12 Tries

Coding

Java

Algorithm

Tries

This lecture introduces the Trie data structure and its applications