CS 300 • Tüm Sınavlar • Data Structures

Motivation

Big-O Notation

Big-Omega Notation

Big-Theta Notation

Fundamental Rules

Analyzing Complexity

Example 1

Example 2

Example 3

Recurrences

Example 4

Solving Recurrences

Example 5

Our First Data Structure

Code for Amateurs

Linkedlist.h

ListNode

ListItr

List

Example 1

Example 2

Example 3

What is a Stack?

Stack.h

Implementation

Example 1

Example 2

Example 3

What is a Queue?

Queue.h

Implementation

Example 1

Example 2

Example 3

Tree as a Data Structure

Terminology

How do we implement Trees?

Binary Trees / Binary Search Trees

Example 1

BST.h

Implementation - Constructors/Copying

Implementation - Destructors

Implementation - Find

Implementation - FindMin/FindMax

Implementation - Insert/Remove

Implementation - Printing

Example 2

Example 3

Example 4

Example 5

Example 6

Why AVL Trees?

Height

AvlTree.h

Insertion - Part 1

Insertion - Part 2

Insertion - Part 3

Remove

Example 1

Example 2

Patron çıldırdı, O(1) istiyor!

Handling Collusions

Example 1

Hashtable.h (Seperate Chaining version)

Seperate Chaining Implementation

Example 2

Hashtable.h (Open Addressing version)

Open Addressing Implementation

Example 3

Introduction

Fundamental Properties

BinaryHeap.h

Implementation - Part 1

Implementation - Part 2

Example 1

Example 2

Example 3

What is the point?

How does it work?

Implementation

Example 1

Optimizing Union

Optimizing Find

Algorithm Analysis 1

Algorithm Analysis 2

Algorithm Analysis 3

Algorithm Analysis 4

Algorithm Analysis 5

Algorithm Analysis 6

Algorithm Analysis 7

Algorithm Analysis 8

Algorithm Analysis 9

Linked List 1

Linked List 2

Linked List 3

Linked List 4

Stack 1

Stack 2

Stack 3

Queue

Trees 1

Trees 2

Trees 3

Trees 4

Trees 5

Trees 6

AVL Trees 1

AVL Trees 2

AVL Trees 3

AVL Trees 4

Hash Tables 1

Hash Tables 2

Hash Tables 3

Hash Tables 4

Heaps 1

Heaps 2

Heaps 3

Heaps 4

Algorithm Analysis

Linkedlists

True/False Question 1

True/False Question 2

AVL Trees

Hashtables

Why is this important?

Insertion Sort

Example 1

Insertion Sort - Code

Shell Sort

Example 2

Shell Sort - Code

Heap Sort

Example 3

Heap Sort - Code

Merge Sort

Example 4

Merge Sort - Code

Quick Sort

Example 5

Quick Sort - Code

Introduction and Graph Types

Path, Cycle, Degree

Graph Representations

Example 1

Topological Sort

Example 2

Dijkstra's Algorithm

Example 1

Example 2

Breadth-First Search (BFS)

Example 3

Depth-First Search (DFS)

Example 4

Classification of Arcs

Example 5

Pre/Post Order Numbers

Example 6

Minimum Spanning Tree Problem

Prim's Algorithm

Example 1

Kruskal's Algorithm

Example 2

Algorithm Paradigms

Hash Tables 1

Hash Tables 2

Hash Tables 3

Hash Tables 4

Heaps 1

Heaps 2

Heaps 3

Heaps 4

Sorting - Hand Implementation 1

Sorting - Hand Implementation 2

Sorting - Hand Implementation 3

Sorting - Hand Implementation 4

Sorting - Hand Implementation 5

Sorting - Hand Implementation 6

Sorting - Hand Implementation 7

Sorting - Hand Implementation 8

Sorting - Hand Implementation 9

Sorting - Hand Implementation 10

Sorting - Conceptual 1

Sorting - Conceptual 2

Sorting - Conceptual 3

Sorting - Conceptual 4

Sorting - Conceptual 5

Sorting - Conceptual 6

Sorting - Conceptual 7

Sorting - Conceptual 8

Sorting - Conceptual 9

Sorting - Conceptual 10

Sorting - True/False 1

Sorting - True/False 2

Graph Basics - Conceptual 1

Graph Basics - Hand Implementation 1

Graph Basics - Hand Implementation 2

Graph Basics - Conceptual 2

Shortest Path - Hand Implementation 1

Shortest Path - Hand Implementation 2

Shortest Path - Hand Implementation 3

Shortest Path - Conceptual 1

Shortest Path - Conceptual 2

Shortest Path - Conceptual 3

Shortest Path - Conceptual 4

Shortest Path - Conceptual 5

BFS/DFS - Hand Implementation 1

BFS/DFS - Hand Implementation 2

BFS/DFS - Hand Implementation 3

BFS/DFS - Hand Implementation 4

BFS/DFS - Hand Implementation 5

BFS/DFS - Hand Implementation 6

BFS/DFS - Conceptual 1

BFS/DFS - Conceptual 2

MST - Hand Implementation 1

MST - Hand Implementation 2

MST - Hand Implementation 3

MST - Hand Implementation 4

MST - Hand Implementation 5

MST - Hand Implementation 6

MST - Conceptual 1

Graphs - Conceptual 1

Graphs - Conceptual 2

Algorithm Paradigms 1

Algorithm Paradigms 2

Algorithm Paradigms 3

True/False 1

Graphs

Disjoint Sets 1

Disjoint Sets 2

Heaps

Sorting 1

True/False 2

Sorting 2

Linked List - Conceptual 1

Linked List - Conceptual 2

Stack/Queue - Conceptual 1

Stack/Queue - Conceptual 2

Linked List/Stack/Queue - True/False 1

Linked List/Stack/Queue - True/False 2

Linked List/Stack/Queue - Conceptual 1

Linked List/Stack/Queue - Conceptual 2