Section 1 : IntroductionInheritance

lecture 1 About Certification Pdf
lecture 2 Introduction
lecture 3 Review Building A base class 7:12
lecture 4 Creating A Derived Class
lecture 5 Using Protected Memebers Part 1 4:56
lecture 6 Using the Protected Members part 2 4:33
lecture 7 Constructors and Destructors
lecture 8 Exercise 1 5:12
lecture 9 Exercise 2 4:18

Section 2 : Polymorphism

lecture 10 Understanding Polymorphism 4:56
lecture 11 Base Class Pointers 2:50
lecture 12 Virtual Functions 4:21
lecture 13 Abstract Classes 6:14
lecture 14 Exercise 1 2:59
lecture 15 Exercise 2 3:2

Section 3 : Generic Programming

lecture 16 Why Generic Programming 3:47
lecture 17 Generic Functions 5:2
lecture 18 Defining Class Template 6:40
lecture 19 Class Template Specialization 3:32
lecture 20 Function Templates with Mulitple Data Types 5:52
lecture 21 Class Templates with Multiple Data Types 4:22
lecture 22 Exercise 1 4:35
lecture 23 Exercise 2 4:28

Section 4 : Exception Handling_Lecture

lecture 24 Exception Overview 4:11
lecture 25 Throwing Exceptions
lecture 26 Catching Exceptions 4:28
lecture 27 Catch All Exceptions Handlers 2:15
lecture 28 Exercise 1 4:11

Section 5 : Stream InputOutput

lecture 29 Stream Overview 1:39
lecture 30 Managing Stream Output 4:29
lecture 31 Managing Stream Input 4:0
lecture 32 String Streams 3:30
lecture 33 Exercise 1 3:0

Section 6 : Sequential Containers

lecture 34 Vectors Review 3:55
lecture 35 Using Lists Part 1
lecture 36 Using Lists Part 2 4:15
lecture 37 Using Deques Part 1
lecture 38 Using Deques Part 2 5:56
lecture 39 Exercise 1 4:4
lecture 40 Exercise 2 4:15

Section 7 : Associative Containers

lecture 41 Working with The Pair Class 3:57
lecture 42 Using Maps Part 1 4:39
lecture 43 Using Maps Part 2 6:44
lecture 44 Using Sets 4:39
lecture 45 Multimaps and Multisets 5:56
lecture 46 Exercise 1 7:11
lecture 47 Exercise 2 6:0

Section 8 : Generic Algorithms

lecture 48 Read Only Algorithms 6:53
lecture 49 Read Write Algorithms 5:30
lecture 50 Sorting Algorithms
lecture 51 Iterators Front Back Inserter 4:17
lecture 52 Iterators Reverse 4:20
lecture 53 Exercise 1 5:20

Section 9 : Non-STL Data Structures

lecture 54 Stacks Part 1 4:46
lecture 55 Stacks Part 2 4:24
lecture 56 Queues Part 1 5:7
lecture 57 Queues Part 2 4:51
lecture 58 Binary Trees Part 1 3:38
lecture 59 Binary Trees Part 2 10:25
lecture 60 Adv CPP 0907 Linked Lists Part 1 3:31
lecture 61 Linked Lists Part 2 5:18
lecture 62 Linked Lists Part 3 3:57
lecture 63 Exercise 1 3:23
lecture 64 Exercise 2 4:24
lecture 65 Exercise 3 4:50

Section 10 : Non-STL Algorithms

lecture 66 Linear Search 5:41
lecture 67 Binary Search 6:27
lecture 68 Adv CPP 1003 Selection Sort 4:29
lecture 69 Adv CPP 1004 Insertion Sort 3:59
lecture 70 Merge Sort 4:24
lecture 71 Quick Sort 4:50
lecture 72 Exercise 1 5:58

Section 11 : Namespaces

lecture 73 Introduction to Namespaces Part 1 4:20
lecture 74 Introduction to Namespaces Part 2 4:36
lecture 75 Exercise 1 2:46

Section 12 : String Class

lecture 76 String Assignment And Concatenation 5:33
lecture 77 Comparing Strings 4:26
lecture 78 Searching Strings 6:51
lecture 79 Substring and Replace 5:13
lecture 80 C Style Strings 4:30
lecture 81 Exercisse 1 5:22