0(0)

Algorithms and Data Structures: Part 1

  • Course level: Beginner

Description

Algorithms and Data Structures (DS): Part 1

This course explains the logic behind data structures and algorithms. By using animation of objects essential (DS) and algorithms are explained. Regardless of the knowledge level of programming, this course is for EVERYONE including NON PROGRAMMERS  who want to understand the logic behind the (DS) and algorithms. There is not programming code in this course. The best education practices show that learning things with visualization is the best way to understand them. So here I explained (DS) and algorithms with visualization.

 

Who this course is for:

  1. Everyone who wants to understand (DS) and algorithms and pass the interviews

What Will I Learn?

  • Data Structures
  • Algorithms
  • How data structures and algorithms work
  • The logic behind data structures and algorithms

Topics for this course

31 Lessons

Algorithms and Data Structures: Part 1

Algorithms Course Introduction00:00:00
Algorithms and Data Structures Part 1: Bubble Sort00:00:00
Algorithms and Data Structures Part 1: Selection Sort00:00:00
Algorithms and Data Structures Part 1: Insertion Sort00:00:00
Algorithms and Data Structures Part 1: Recursive Programming00:00:00
Algorithms and Data Structures Part 1: Mergesort00:00:00
Algorithms and Data Structures Part 1: Quicksort00:00:00
Introduction to Time-Complexity Analysis: Part A00:00:00
Introduction to Time-Complexity Analysis (Part B)00:00:00
Algorithms and Data Structures: Part 1- Queues00:00:00
Algorithms and Data Structures Part 1: Linked Lists00:00:00
Priority Queues, Heaps and Heapsort – Part A00:00:00
Priority Queues, Heaps and Heapsort – Part B00:00:00
Binary Search00:00:00
Binary Search Trees (BSTs): Part 100:00:00
Binary Search Trees (BSTs): Part 200:00:00
Binary Search Trees (BSTs): Part 300:00:00
Associative Arrays and Hash Tables: Part 100:00:00
Associative Arrays and Hash Tables: Part 200:00:00
Graphs and Digraphs: Part 100:00:00
Graphs and Digraphs: Part 200:00:00
Graphs and Digraphs: Part 300:00:00
Graphs and Digraphs: Part 400:00:00
Graphs and Digraphs: Part 500:00:00
Graphs and Digraphs: Part 600:00:00
Spanning Trees and Forests: Part 100:00:00
Spanning Trees and Forests: Part 2 – Kruskal’s algorithm00:00:00
Spanning Trees and Forests: Part 3 – Prim’s algorithm00:00:00
Shortest Paths and Dijkstra’s Algorithm: Part 100:00:00
Shortest Paths and Dijkstra’s Algorithm: Part 200:00:00
Shortest Paths and Dijkstra’s Algorithm: Part 3 – Example00:00:00
Algorithms and Data Structures (DS): Part 1
Free

Enrolment validity: Lifetime

Requirements

  • Basic programming knowledge regardless of programming language