Data Structures and Algorithms In Python
Learn Data Structures and Algorithms in Python to provide efficient solutions to complex problems
This "Data Structures and Algorithms In Python" course is thoroughly detailed and uses lots of animations to help you visualize the concepts.
What you'll learn
- Understand the details of Data Structures and algorithms through animations
- Learn to write programs for different Data Structures and Algorithms in Python
- Get the confidence to face programming interviews
- Test your knowledge with over 100 Quiz questions
- Learn how to analyse algorithms
- Get the ability to write and trace recursive algorithms
- Basic knowledge of programming in Python
Who this course is for
- Programmers looking for jobs
- Programmers wanting to write efficient code
- Computer Science students having Data Structures as part of their curriculum
- Non Computer science students wanting to enter IT industry
- Introduction to Data Structures and Algorithms
- Linked List
- Stack and Queue
- Binary Tree
- Binary Search Tree
This "Data Structures and Algorithms In Python" tutorial will help you develop a strong background in Data Structures and Algorithms. The course Data Structures and Algorithms In Python is broken down into easy to assimilate short lectures, and after each topic there is a quiz that can help you to test your newly acquired knowledge. The examples are explained with animations to simplify the learning of this complex topic. Complete working programs are shown for each concept that is explained.
This course provides a comprehensive explanation of data structures like linked lists, stacks and queues, binary search trees, heap, searching and hashing. Various sorting algorithms with implementation and analysis are included.
This course covers following topics with Python implementation :
Algorithm Analysis, Big O notation, Time complexity, Singly linked list, Reversing a linked list, Doubly linked list, Circular linked list, Linked list concatenation, Sorted linked list.
Stack, Queue, Circular Queue, Dequeue, Priority queue, Polish Notations, Infix to Postfix, Evaluation of Postfix, Binary Tree, Binary Search Tree, Tree Traversal (inorder, preorder, postorder, level order), Heap, Searching, Hashing
Sorting : Selection, Bubble, Insertion, Shell, Merging, Recursive Merge, Iterative Merge, Quick, Heap, Binary tree, Radix, Address calculation sort
Throughout the course, a step by step approach is followed to make you understand different Data Structures and Algorithms. You will see implementation of different data structures in python and algorithms are explained in step-wise manner. Through this course you can build a strong foundation and it will help you to crack Data Structures and Algorithms coding interviews questions and work in the industry.
In this Data Structures and Algorithms course, Python is used for implementing various concepts, but you can easily implement them in any other language like C++, Java or C#.
This Data Structures and Algorithms In Python online course will help software developers to refresh the concepts studied in book and also to students learning from referred book.
30-Day Money-Back Guarantee
This course explains all the concepts and implementation in detail, we are sure you will have great learning. But if you get another opinion or better resource, then just ask us for a refund in the first 30 days, our refund policy is to give you money back with no question asked.
FREE Course for YOU
You get FREE course "Test Your Data Structures and Algorithms Skills" with this course. This has 150+ questions and will help you to test your Data Structures and Algorithms skills and you will have opportunity to not only evaluate yourself but also make it stronger.
You will get a link to avail this course FREE in last lecture called Bonus Lecture.
So what are you waiting for, enroll now and start learning.
Deepali Srivastava has a Master's degree in Mathematics and is the author of popular books "C in Depth" and "Data Structures Through C in Depth" loved by 350,000+ engineering students. She loves programming and is passionate about teaching. Whether writing a book or making a course, she always tries to present the concepts in a simplified way which helps students develop interest in the topic being taught. Her books have been appreciated by students and she hopes that her online courses will also prove to be helpful.
PreviewData Structures and Algorithms (4:20)
PreviewMeasuring Running time of Algorithms (3:06)
PreviewAsymptotic Analysis (3:13)
PreviewBig O Notation (3:40)
StartFinding Big O (4:24)
StartTight and Loose Upper Bounds (1:29)
StartBig O analysis of Algorithms (2:05)
StartFinding Time complexity (3:26)
StartBig O analysis of Algorithms: Examples (7:27)
StartWorst case, Best case and Average Case Analysis (4:17)
StartCommon Complexities (3:03)
StartAbstract Data Types (5:05)
StartTraversing and Searching a Single Linked List (7:35)
StartFinding references in a single linked list (6:24)
StartInsertion in a Single Linked List (5:47)
StartInsertion in a Single Linked List ..contd (7:36)
StartDeletion in a Single Linked List (4:22)
StartReversing a Single Linked List (2:49)
StartSorting a Linked list using Bubble Sort (9:22)
StartMerging of sorted Linked lists (13:19)
StartSorting a Linked list using Merge Sort (5:08)
StartFinding and Removing a cycle in a Linked list (12:27)
StartDoubly linked list (3:30)
StartInsertion in a doubly linked List (7:32)
StartDeletion from doubly linked list (6:20)
StartReversing a doubly linked list (3:30)
StartCircular linked list (3:09)
StartInsertion in a circular Linked List (4:39)
StartDeletion in a circular linked list (4:13)
StartLinked List with Header Node (5:03)
StartSorted linked list (5:57)