Section 1 : Introduction

Lecture 1 About Proctor Testing Pdf
Lecture 2 Binary Number Introduction 11:43
Lecture 3 Binary Deca Number Conversion 8:15
Lecture 4 Binary Number System Notes Text

Section 2 : Analyzing Algorithms

Lecture 5 All Notes Text
Lecture 6 Introduction to Time-Complexity 2:12
Lecture 7 Math Refresher Logarithmic Functions 11:8
Lecture 8 Math Refresher Factorial Functions 3:19
Lecture 9 Math Refresher Algebraic Expressions 2:42
Lecture 10 Math Refresher Notes Text
Lecture 11 n-notation Introduction 10:20
Lecture 12 n-notation Scaling 11:32
Lecture 13 n-notation Example 4:18
Lecture 14 Big O Notation 12:59
Lecture 15 n-Notation Notes Text
Lecture 16 Big O Real-World Example

Section 3 : Arrays

Lecture 17 How is Data Stored 8:38
Lecture 18 Fixed Array Introduction 5:9
Lecture 19 Fixed Array Run Times 12:23
Lecture 20 Binary Search Algorithm (Fixed Array Sorted Search) 10:0
Lecture 21 Fixed Array Notes Text
Lecture 22 About Certification Pdf
Lecture 23 INTRODUCTION TO BRAINMEASURES PROCTOR SYSTEM Pdf
Lecture 24 Circular Arrays 8:1
Lecture 25 Dynamic Arrays 15:52
Lecture 26 O(1) Approximation 12:7
Lecture 27 Circular and Dynamic Array Notes Text
Lecture 28 Array Review 7:57
Lecture 29 Array Real World Examples 5:42

Section 4 : Linked Lists

Lecture 30 Nodes 4:20
Lecture 31 Singly Linked List 13:36
Lecture 32 Linked List Run Times 14:59
Lecture 33 About Proctor Testing Pdf
Lecture 34 Singly-Linked List Notes Text
Lecture 35 Doubly Linked Lists 8:7
Lecture 36 Tail Pointers 5:14
Lecture 37 Doubly-Linked List and Tail Pointer Notes Text
Lecture 38 Linked List Real World Examples 3:0
Lecture 39 Linked List Review 3:31

Section 5 : Stacks and Queues

Lecture 40 Stacks 9:41
Lecture 41 Stack Examples 11:5
Lecture 42 About Certification Pdf
Lecture 43 Stack Notes Text
Lecture 44 Queues 8:48
Lecture 45 Queue Examples 9:42
Lecture 46 Remove - INTRODUCTION TO BRAINMEASURES PROCTOR SYSTEM Pdf
Lecture 47 Queue Notes Text
Lecture 48 Queue and Stack Run Times 6:4
Lecture 49 Stack and Queue Real World Examples 7:1
Lecture 50 Stacks and Queues Quiz Explanation 5:33

Section 6 : Sorting Algorithms

Lecture 51 Introduction to Sorting Algorithms 1:41
Lecture 52 Bubble Sort 10:13
Lecture 53 About Proctor Testing Pdf
Lecture 54 Bubble Sort Notes Text
Lecture 55 Selection Sort
Lecture 56 About Certification Pdf
Lecture 57 Selection Sort Notes Text
Lecture 58 Insertion Sort 9:4
Lecture 59 Insertion Sort Notes Text
Lecture 60 INTRODUCTION TO BRAINMEASURES PROCTOR SYSTEM Pdf
Lecture 61 Quick Sort 14:38
Lecture 62 Quick Sort Run Time 10:31
Lecture 63 Quick Sort Notes Text
Lecture 64 Remove - INTRODUCTION TO BRAINMEASURES PROCTOR SYSTEM Pdf
Lecture 65 Merge Sort 11:58
Lecture 66 Merge Sort Run Times 7:39
Lecture 67 Merge Sort Notes Text
Lecture 68 About Proctor Testing Pdf
Lecture 69 Stable vs NonStable 6:34
Lecture 70 Stable Vs NonStable Notes Text
Lecture 71 Sorting Algorithm Real World Examples 4:2

Section 7 : Trees

Lecture 72 Trees 7:37
Lecture 73 Binary Search Trees
Lecture 74 Binary Search Tree Run Times 7:37
Lecture 75 INTRODUCTION TO BRAINMEASURES PROCTOR SYSTEM Pdf
Lecture 76 Tree Notes Text
Lecture 77 Tree Traversals 13:4
Lecture 78 Tree Real World Examples 4:30

Section 8 : Heaps

Lecture 79 Heaps Introduction 4:7
Lecture 80 Heap Analysis 11:34
Lecture 81 Heaps Real World Examples 6:59
Lecture 82 Heap Notes Text

Section 9 : Graphs

Lecture 83 Introduction to Graphs
Lecture 84 Basic Types of Graphs 10:28
Lecture 85 Graph Terminology 11:41
Lecture 86 Graph Terminology Summary Text
Lecture 87 Depth First Search 6:37
Lecture 88 Breadth First Search 6:41
Lecture 89 BFS and DFS Run Times 3:12

Section 10 : Conclusion

Lecture 90 INTRODUCTION TO BRAINMEASURES PROCTOR SYSTEM Pdf

Section 11 : Bonus

Lecture 91 Binary to Hex and Back 11:6
Lecture 92 Decimal to Hex and Back