Data Structures & Algorithms in Python: Implementing Data Structures
Python 3.7
| Beginner
- 13 Videos | 1h 35m 6s
- Includes Assessment
- Earns a Badge
Examine operations that have different values of time complexity and delve into implementation of basic data structures, such as linked lists, stacks, and queues in Python, in this 13-video course. Key concepts covered here include operations that run in constant time regardless of input; code whose time complexity varies directly with value of input; and tasks whose time complexity varies linearly with size of input. Next, you will learn about operations whose time complexity varies as the square of input size; how to use native queue class of Python and perform standard queue operations; and how to code a queue class for many standard queue operations, such as enqueue and dequeue. Then, learn how a Python list can be used as a stack by loading and unloading elements, and how to implement a custom stack class for common stack operations. Finally, study code functions to perform search and delete operations in linked lists and reverse the ordering of its nodes; and create a linked list and test out various operations that have been defined.
WHAT YOU WILL LEARN
-
discover the key concepts covered in this course
identify operations that run in constant time regardless of input
recognize code whose time complexity varies directly with the value of the input
identify tasks whose time complexity varies linearly with the size of the input
recognize operations whose time complexity varies as the square of the input size
use the native Queue class of Python and perform the standard queue operations on it
code a bespoke Queue class that includes definitions for many of the standard queue operations, such as enqueue and dequeue -
recognize how a Python list can be used as a stack by loading and unloading elements from the same end
implement a custom Stack class that includes functions for the common stack operations
define a Linked List class and implement functions to insert a node at the head or the tail of the linked list
code functions to perform search and delete operations in a linked list and to reverse the ordering of its nodes
instantiate a Linked List and test out the various operations that have been defined
summarize common operations on stacks and their time complexities, and list the situations when adding to or removing elements from a stack or queue can throw exceptions
IN THIS COURSE
-
1.Course Overview2m 11sUP NEXT
-
2.O(1) Operations9m 26s
-
3.O(n) Operations - Part 17m 50s
-
4.O(n) Operations - Part 27m 41s
-
5.O(n*n) Operations8m 36s
-
6.Python's Built-in Queue6m 31s
-
7.Defining a Custom Queue7m 9s
-
8.Use a Python List as a Stack3m 59s
-
9.Defining a Custom Stack6m 9s
-
10.Linked Lists: Defining Insert Operations8m
-
11.Linked Lists: Search, Delete, and Reverse Operations9m 2s
-
12.Linked Lists: Testing the Functions8m 37s
-
13.Exercise: Implementing Data Structures in Python4m 26s
EARN A DIGITAL BADGE WHEN YOU COMPLETE THIS COURSE
Skillsoft is providing you the opportunity to earn a digital badge upon successful completion of this course, which can be shared on any social network or business platform
Digital badges are yours to keep, forever.
