Introduction to Data Structures and Algorithms -By Animation

Introduction to Data Structures and Algorithms -By Animation

Data Structures and algorithms: Queue, Stack, Linked List, Graphs, Trees, Heap, Sorting Algorithms, Searching Algorithms.

In this course, you will learn about the most popular topics corresponding to data structures and algorithms through live animation. The data structure is the key component of Computer Science and is used in the areas of artificial intelligence, operating systems, graphics, etc. This course aims to turn complexity into simplicity via illustrations and live animation. Visualization of data structures is provided for the most popular topics, such as queue, stack, linked list, graphs, trees, heap data structure, sorting algorithms, and searching algorithms. This course is provided for anyone who is interested in data structure and algorithms. All sorting and searching algorithms are covered by the implementation. The main programming language is based on Python. However, very basic knowledge about programming skills is required, and this knowledge is only required for sorting and searching algorithms in which they are discussed with Python programming language. All lectures are discussed from scratch and don’t be afraid if you think your knowledge is not enough for this course. In fact, both implementation and illustrations are discussed in a simple manner.

The most popular topics that are covered are:
1. Queue
2. Stack
4. Graph Theory
5. Spanning Trees
6. Minimum Spanning Trees (Prim’s and Kruskal’s)
7. Graph Traversal (BFS and DFS)
8. Sorting Algorithms
9. Searching Algorithms
10. Heap Data Structure
11. Introduction to Trees
12. Binary Search Trees (BST)
13. Tree Traversal (Preorder, Inorder, Postorder)

I hope you enjoy this course.

What you’ll learn?
• Learn most demanded topics in data structure and algorithms through live animation
• Learn complex topics in a simplified manner
• Develop analytical skills by turning complexity into simplicity
• Queue, Stack, Linked List, Graph Theory, Spanning Trees, Minimum Spanning Trees (Prim’s and Kruskal’s), Graph
• Traversal(BFS and DFS), Sorting Algorithms, etc.
• Learn most popular sorting and searching algorithms and their implementation through live animation in Python
Who is this course for?
• Anyone who is interested in learning Data Structure and Algorithms
• Students currently studying computer science
Requirements:
• Basic Understanding of python programming language for sorting and searching algorithms
• No experience with data structures or algorithms is required
Course content
1. Introduction to Queue
—————
2. Queue Types
—————
3. Introduction to stack and its operations
—————
4. Linekd list types and Operations (Deletion and Insertion)
—————
2. Graph Theory
1. Introduction to Graph – Graph Types
—————
2. Graph Representation
—————
3. Spanning Tree and Minimum Spanning Tree
—————
4. Kruskal_s Algorithm (Minimum Spanning Tree)
—————
5. Prim_s Algorithm (Minimum Spanning Tree)
—————
6. Depth First Search And Breadth First Search (Graph Traversal)
—————
3. Trees
1. Introduction to Tree
—————
2. Tree Traversal (Preorder-Inorder-Postorder)
—————
3. Binary Tree
—————
4. Binary Search Tree (BST) – Introduction and Operations
—————
4. Heap Data Structure
1. Introduction to Heap
—————
2. Array Representation of Heap
—————
3. Heap Creation (Top-down and Bottom-up)
—————
4. Heap Deletion and Insertion
—————
5. Searching Algorithms
1. Binary Search Introduction
—————
2. Binary Search Implementation
—————
3. Linear Search Introduction
—————
4. Linear Search Implementation
—————
6. Sorting Algorithms
1. Merge Sort – Part One (Introduction, Example, Implementation)
—————
2. Merge Sort – Part Two (Example, Implementation)
—————
3. Quick Sort (Introduction, Example, Implementation)
—————
4. Heap Sort (Introduction, Example, Implementation)
—————
5. Bubble Sort (Introduction, Example, Implementation)
—————
6. Selection Sort (Introduction, Example, Implementation)
—————
7. Insertion Sort (Introduction, Example, Implementation)
—————
8. Counting Sort Introduction
—————
9. Counting Sort (Example, Implementation)
—————