Algorithms and Data Structures

Course Curriculum

Chapter 1: Introduction

Lecture 1: Introduction

Lecture 2: How to get the most out of this course

Chapter 2: Algorithms – Development of programming logic

Lecture 1: Development of programming logic

Lecture 2: Exercises (Includes best practice tips)

Lecture 3: Exercises (Includes tips on how to learn from others)

Lecture 4: Exercises

Lecture 5: Optimization of an Algorithm

Lecture 6: Algorithm for perfect numbers

Lecture 7: How to Debug an Algorithm (Debugging) Part 1

Lecture 8: How to Debug an Algorithm (Debugging) Part 2

Lecture 9: Source code of this section

Chapter 3: Introduction to data structures

Lecture 1: Main data structures

Lecture 2: Other data structures (Struct)

Lecture 3: Other data structures (UNION)

Lecture 4: Other data structures (ENUM)

Lecture 5: Source code of this section

Chapter 4: ARRAYS: Static and dynamical data structures

Lecture 1: Static Arrays

Lecture 2: Dynamic Arrays

Lecture 3: Character Strings – Part 1

Lecture 4: Character Strings – Part 2

Lecture 5: Character Strings – Part 3

Lecture 6: Source code of this section

Chapter 5: Sorting Algorithms

Lecture 1: Sorting Algorithms. Types and why they are important

Lecture 2: Exchange Algorithms (Bubble Sort)

Lecture 3: Code implementation of the Bubble Sort algorithm – Part 1

Lecture 4: Code implementation of the Bubble Sort algorithm – Part 2

Lecture 5: Sorting by selection algorithm

Lecture 6: Code Implementation of the Algorithm by Selection – Part 1

Lecture 7: Coding Implementation of the Selection algorithm – Part 2

Lecture 8: Insertion Algorithm

Lecture 9: Code Implementation of the Insertion Algorithm – Part 1

Lecture 10: Code Implementation of the Insertion Algorithm – Part 2

Lecture 11: Measuring Algorithm Execution Time

Lecture 12: Creating Your Own Sorting Algorithm Project – Part 1

Lecture 13: Project on Creating Your Own Sorting Algorithm – Part 2

Lecture 14: Project on Creating Your Own Sorting Algorithm – Part 3

Lecture 15: Final Tips to improve development skills

Lecture 16: Source code of this section

Chapter 6: BONUS: RECURSION

Lecture 1: What is recursion?

Lecture 2: Recursion Basic Level – Part 1

Lecture 3: Recursion Basic Level – Part 2

Lecture 4: Recursion Intermediate Level

Lecture 5: Recursion Advanced Level (Towers of Hanoi explained in detail) – Part 1

Lecture 6: Recursion Advanced Level (Towers of Hanoi explained in detail) – Part 2

Lecture 7: Recursion Advanced Level (Towers of Hanoi explained in detail) – Part 3

Lecture 8: Source code of this section

Chapter 7: MATRICES (ARRAY OF ARRAYS)- DATA STRUCTURES

Lecture 1: Matrices

Lecture 2: Static Matrices. Real examples of use – Part 1

Lecture 3: Static Matrices. Real examples of use – Part 2

Lecture 4: Static Matrices. Real examples of use – Part 3

Lecture 5: Matrix Index Manipulations (Exercise) – Part 1

Lecture 6: Matrix Index Manipulations (Exercise) – Part 2

Lecture 7: Matrix Index Managements (Exercise) – Part 3

Lecture 8: Dynamic Matrices – Part 1

Lecture 9: Dynamic Matrices – Part 2

Lecture 10: Dynamic Matrices – Part 3

Lecture 11: Clearing Memory

Lecture 12: MultiDimensional Arrays – Part 1

Lecture 13: MultiDimensional Matrices – Part 2

Lecture 14: Source code for this section

Chapter 8: LISTS (Linear Dynamic Data Structures)

Lecture 1: Lists, types and logic

Lecture 2: Code implementation of a list – Part 1

Lecture 3: Code implementation of a list – Part 2 –

Lecture 4: Code implementation of a list – Part 3

Lecture 5: Insert item in the list – Part 1

Lecture 6: Insert element in the list – Part 2

Lecture 7: Delete element from a list – Part 1

Lecture 8: Delete element from a list – Part 2

Lecture 9: BONUS: insert element in a specific position – Part 1

Lecture 10: BONUS: insert element in a specific position – Part 2

Lecture 11: Source code of this section

Chapter 9: QUEUES (Linear Dynamic Data Structures)

Lecture 1: Logic of a queue

Lecture 2: Implementation in Code. Insertion and traversal of elements – Part 1

Lecture 3: Implementation in Code. Insertion and Traversal of Elements – Part 2

Lecture 4: Remove element and CHALLENGE – Part 1

Lecture 5: Remove element and CHALLENGE – Part 2

Lecture 6: Source code of this section

Chapter 10: STACKS (Linear Dynamic Data Structures)

Lecture 1: Logic of a stack

Lecture 2: Implementation in Code. Insertion and traversal of elements – Part 1

Lecture 3: Implementation in Code. Insertion and traversal of elements – Part 2

Lecture 4: Remove element and RETO – Part 1