Section 1 : Introduction

Lecture 1 About Proctor Testing
Lecture 2 Binary Number Introduction 00:11:43 Duration
Lecture 3 Binary Deca Number Conversion 00:08:15 Duration
Lecture 4 Binary Number System Notes

Section 2 : Analyzing Algorithms

Lecture 1 All Notes
Lecture 2 Introduction to Time-Complexity 00:02:12 Duration
Lecture 3 Math Refresher Logarithmic Functions 00:11:08 Duration
Lecture 4 Math Refresher Factorial Functions 00:03:19 Duration
Lecture 5 Math Refresher Algebraic Expressions 00:02:42 Duration
Lecture 6 Math Refresher Notes
Lecture 7 n-notation Introduction 00:10:20 Duration
Lecture 8 n-notation Scaling 00:11:32 Duration
Lecture 9 n-notation Example 00:04:18 Duration
Lecture 10 Big O Notation 00:12:59 Duration
Lecture 11 n-Notation Notes
Lecture 12 Big O Real-World Example

Section 3 : Arrays

Lecture 1 How is Data Stored 00:08:38 Duration
Lecture 2 Fixed Array Introduction 00:05:09 Duration
Lecture 3 Fixed Array Run Times 00:12:23 Duration
Lecture 4 Binary Search Algorithm (Fixed Array Sorted Search) 00:10:00 Duration
Lecture 5 Fixed Array Notes
Lecture 6 About Certification
Lecture 7 INTRODUCTION TO BRAINMEASURES PROCTOR SYSTEM
Lecture 8 Circular Arrays 00:08:01 Duration
Lecture 9 Dynamic Arrays 00:15:52 Duration
Lecture 10 O(1) Approximation 00:12:07 Duration
Lecture 11 Circular and Dynamic Array Notes
Lecture 12 Array Review 00:07:57 Duration
Lecture 13 Array Real World Examples 00:05:42 Duration

Section 4 : Linked Lists

Lecture 1 Nodes 00:04:20 Duration
Lecture 2 Singly Linked List 00:13:36 Duration
Lecture 3 Linked List Run Times 00:14:59 Duration
Lecture 4 About Proctor Testing
Lecture 5 Singly-Linked List Notes
Lecture 6 Doubly Linked Lists 00:08:07 Duration
Lecture 7 Tail Pointers 00:05:14 Duration
Lecture 8 Doubly-Linked List and Tail Pointer Notes
Lecture 9 Linked List Real World Examples 00:03:00 Duration
Lecture 10 Linked List Review 00:03:31 Duration

Section 5 : Stacks and Queues

Lecture 1 Stacks 00:09:41 Duration
Lecture 2 Stack Examples 00:11:05 Duration
Lecture 3 About Certification
Lecture 4 Stack Notes
Lecture 5 Queues 00:08:48 Duration
Lecture 6 Queue Examples 00:09:42 Duration
Lecture 7 Remove - INTRODUCTION TO BRAINMEASURES PROCTOR SYSTEM
Lecture 8 Queue Notes
Lecture 9 Queue and Stack Run Times 00:06:04 Duration
Lecture 10 Stack and Queue Real World Examples 00:07:01 Duration
Lecture 11 Stacks and Queues Quiz Explanation 00:05:33 Duration

Section 6 : Sorting Algorithms

Lecture 1 Introduction to Sorting Algorithms 00:01:41 Duration
Lecture 2 Bubble Sort 00:10:13 Duration
Lecture 3 About Proctor Testing
Lecture 4 Bubble Sort Notes
Lecture 5 Selection Sort
Lecture 6 About Certification
Lecture 7 Selection Sort Notes
Lecture 8 Insertion Sort 00:09:04 Duration
Lecture 9 Insertion Sort Notes
Lecture 10 INTRODUCTION TO BRAINMEASURES PROCTOR SYSTEM
Lecture 11 Quick Sort 00:14:38 Duration
Lecture 12 Quick Sort Run Time 00:10:31 Duration
Lecture 13 Quick Sort Notes
Lecture 14 Remove - INTRODUCTION TO BRAINMEASURES PROCTOR SYSTEM
Lecture 15 Merge Sort 00:11:58 Duration
Lecture 16 Merge Sort Run Times 00:07:39 Duration
Lecture 17 Merge Sort Notes
Lecture 18 About Proctor Testing
Lecture 19 Stable vs NonStable 00:06:34 Duration
Lecture 20 Stable Vs NonStable Notes
Lecture 21 Sorting Algorithm Real World Examples 00:04:02 Duration

Section 7 : Trees

Lecture 1 Trees 00:07:37 Duration
Lecture 2 Binary Search Trees
Lecture 3 Binary Search Tree Run Times 00:07:37 Duration
Lecture 4 INTRODUCTION TO BRAINMEASURES PROCTOR SYSTEM
Lecture 5 Tree Notes
Lecture 6 Tree Traversals 00:13:04 Duration
Lecture 7 Tree Real World Examples 00:04:30 Duration

Section 8 : Heaps

Lecture 1 Heaps Introduction 00:04:07 Duration
Lecture 2 Heap Analysis 00:11:34 Duration
Lecture 3 Heaps Real World Examples 00:06:59 Duration
Lecture 4 Heap Notes

Section 9 : Graphs

Lecture 1 Introduction to Graphs
Lecture 2 Basic Types of Graphs 00:10:28 Duration
Lecture 3 Graph Terminology 00:11:41 Duration
Lecture 4 Graph Terminology Summary
Lecture 5 Depth First Search 00:06:37 Duration
Lecture 6 Breadth First Search 00:06:41 Duration
Lecture 7 BFS and DFS Run Times 00:03:12 Duration

Section 10 : Conclusion

Lecture 1 INTRODUCTION TO BRAINMEASURES PROCTOR SYSTEM

Section 11 : Bonus

Lecture 1 Binary to Hex and Back 00:11:06 Duration
Lecture 2 Decimal to Hex and Back