Data Structures and Algorithms Part 2

In this course we will look at some advanced data structures and algorithms used in everyday applications. We will discuss the trade-offs involved with choosing each data structure and algorithm and see some real world usage examples. This is part 2 of a two-part series of courses covering algorithms and data structures. In this part we cover data sorting, string searching, sets, AVL trees and concurrency issues.

Sorting Algorithms

Introduction0m

Sorting Overview2m

Bubble Sort6m

Insertion Sort5m

Selection Sort5m

Merge Sort7m

Quick Sort6m

Sorting Demo Overview1m

Sorting Demo4m

Summary1m

Set Collection and Algorithms

Introduction0m

Set Overview1m

The Set Class3m

Union2m

Intersection1m

Set Difference2m

Symmetric Difference2m

Sample Application3m

Other Implementations2m

Summary2m

AVL Tree

Introduction1m

Binary and AVL Trees3m

Unbalanced Trees2m

Balanced Trees4m

Balanced Insertion1m

Balanced Deletion1m

AVL Tree Class Overview3m

AVL Tree Properties4m

Node Rotation Introduction0m

Which Rotation Algorithm?1m

Rotation Algorithms8m

Demo: Visualizing AVL Trees6m

Summary1m

String Searching Algorithms

Introduction1m

API Overview1m

Naive Search5m

Naive Search Performance1m

Boyer-Moore-Horspool Search4m

Boyer-Moore-Horspool Example3m

Boyer-Moore-Horspool Code1m

Boyer-Moore-Horspool Performance0m

Demo: Search and Replace3m

Summary1m

Collection Concurrency

Introduction0m

Multi-Threaded Overview7m

Caller Synchronization5m

Monitor Synchronization1m

Reader Writer Lock Synchronization1m

.NET Framework Concurrent Collections2m

Summary1m