Class Central is learner-supported. When you buy through links on our site, we may earn an affiliate commission.

YouTube

Data Structures and Algorithms in Python for Beginners

Great Learning via YouTube

Overview

Prepare for a new career with $100 off Coursera Plus
Gear up for jobs in high-demand fields: data analytics, digital marketing, and more.
This course on Data Structures and Algorithms in Python aims to teach learners the fundamentals of data structures and algorithms using Python programming language. By the end of the course, students will be able to understand and implement various data structures such as arrays, stacks, queues, linked lists, binary trees, binary search trees, graphs, and hash tables. They will also learn algorithmic analysis, time and space complexity, and sorting and searching algorithms like linear search, binary search, insertion sort, selection sort, and quicksort. The course employs a combination of theoretical explanations, examples, and hands-on Python programming exercises. It is designed for beginners who are interested in building a strong foundation in data structures and algorithms using Python.

Syllabus

Course Introduction.
Agenda.
Introduction to Data Structure.
Inbuilt and User-Defined Data Structure in Python.
Arrays Introduction.
Arrays Implementation.
Advantages and Disadvantages of Arrays.
Stack.
Advantages and Disadvantages of Stack.
Queue introduction.
Queue implementation.
Advantages and Disadvantages of Queue.
Linked list.
Advantages and Disadvantages of Linked List.
Binary tree introduction.
Binary tree implementation.
Advantages and Disadvantages of Binary Tree.
Binary search tree introduction.
Binary search tree implementation.
Advantages and Disadvantages of Binary search Tree.
Graphs introduction.
Breadth-first search implementation.
Depth-first search implementation.
Hash tables introduction.
Hashing implementation.
Algorithms introduction and algorithmic analysis.
Finding space and time complexity.
Linear Search.
Linear search implementation.
Complexity analysis of Linear Search.
Binary Search.
Binary search implementation.
Complexity analysis of Binary Search.
Insertion sort.
Insertion sort implementation.
Complexity analysis of Insertion sort.
Selection sort.
Selection sort implementation.
Complexity analysis of Selection sort.
Quicksort.
Quicksort implementation.
Complexity analysis of Quicksort.
Introduction to Divide and Conquer approach.
Merge sort.
merge sort implementation.
Introduction to Greedy's approach.
Prim's minimal Spanning Tree algorithm.
Prim's minimal Spanning Tree algorithm implementation.
Introduction to Dynamic Programming.
Tower of Hanoi.
Tower of Hanoi implementation.
Summary.

Taught by

Great Learning

Reviews

Start your review of Data Structures and Algorithms in Python for Beginners

Never Stop Learning.

Get personalized course recommendations, track subjects and courses with reminders, and more.

Someone learning on their laptop while sitting on the floor.