This course will help you in better understanding of the basics of Data Structures and how algorithms are implemented in the high level programming language. This course consists of lectures on data structures and algorithms which covers the computer science theory + implementation of data structures in python language. This course will also help students to face interviews at the top technology companies. This course is like having personal tutors to teach you about data structures and algorithms.
There’s tons of concepts and content in this course. To begin the course:
- We have a discussion of why we need data structures.
- Then we move on to discuss Analysis of Algorithms ie Time and Space complexity, though the Asymptotic Notation ie Big O, Omega and Theta are taken up at the end of this course so that you do not get confused and concentrate on understanding the concepts of data structures.
- We have a programming environment set up to make sure you have all the software you need in order to get the hands-on experience in implementing Data structures and algorithms.
Then we get to the essence of the course; algorithms and data structures. Each of the specific algorithms and data structures is divided into two sections. Theory lectures and implementation of those concepts in Python.
We then move on to learn:
- Recursion
- Stacks, Queues, Deques
- Linked List
- Trees & Binary Trees
- Binary Search Trees
- Priority Queues and Heaps
- Graphs & Graph Traversal Algorithms
- Searching and Sorting algorithms
Again, each of these sections includes theory lectures covering data structures & their Abstract Data Types and/or algorithms. Plus the implementation of these topics in Python.
Find out the time complexity of:
- Linear Search Algorithm
- Different Sorting Algorithms
Create Project
