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
00. Sorting Algorithms
|
|
|
|
|
|
0 Introduction
|
1 Sorting
|
2 Bubble
|
3 Insertion Sort
|
|
|
|
|
|
|
4 Selection Sort
|
5 Merge Sort
|
6 Quick Sort
|
7 Sorting Demo Overview
|
|
|
|
||
|
8 Sorting Demo
|
9 Summary
|
01. Set Collection and Algorithms
|
|
|
|
|
|
10 Introduction
|
11 Set Overview
|
12 The Set Class
|
13 Union
|
|
|
|
|
|
|
14 Intersection
|
15 Set Difference
|
16 Symmetric Difference
|
17 Sample Application
|
|
|
|
||
|
18 Other Implementations
|
19 Summary
|
02. AVL Tree
|
|
|
|
|
|
20 Introduction
|
21 Binary and AVL Trees
|
22 Unbalanced Trees
|
23 Balanced Trees 20120611222552
|
|
|
|
|
|
|
24 Balanced Insertion
|
25 Balanced Deletion
|
26 AVL Tree Class Overview
|
27 AVL Tree Properties
|
|
|
|
|
|
|
28 Node Rotation Introduction
|
29 Which Rotation Algorithm
|
30 Rotation Algorithms
|
31 Demo Visualizing AVL Trees
|
|
|
|||
|
32 Summary
|
03. String Searching Algorithms
|
|
|
|
|
|
33 Introduction
|
34 API Overview
|
35 Naive Search
|
36 Naive Search Performance
|
|
|
|
|
|
|
37 Boyer-Moore-Horspool Search
|
38 Boyer-Moore-Horspool Example
|
39 Boyer-Moore-Horspool Code
|
40 Boyer-Moore-Horspool Performance
|
|
|
|
||
|
41 Demo Search and Replace
|
42 Summary
|
04. Collection Concurrency
|
|
|
|
|
|
43 Introduction
|
44 Multi-Threaded Overview
|
45 Caller Synchronization
|
46 Monitor Synchronization
|
|
|
|
|
|
|
47 Reader Writer Lock Synchronization
|
48 .NET Framework Concurrent Collections
|
49 Summary
|