Udemy Fundamental of Data Structure and Algorithms-Animation Based

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

What you'll learn​

• learn most demanded topics in data structure and algorithms through live animation
• Learn complex topics in a simplified manner
• Develope 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

Requirements​

• Basic Understanding of python programmimng language for sorting and searching algorithms
• No experience with data structures or algorithms is required

Description​

In this course, you will learn about the most popular topics corresponding to data structure and algorithms through live animation. The data structure is a 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. Most popular topics are covered, 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. I hope you enjoy this course.
The most popular topics that are covered are:

1. Queue
2. Stack
3. Linked List
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)

Do not hesitate to ask if you have any questions.

Who this course is for:​

• Anyone who is interested in learning Data Structure and Algorithms
• Students currently studying computer science