Data Structures & Algorithms in Python: Implementing Data Structures

Python    |    Beginner
• 13 videos | 1h 29m 36s
• Includes Assessment
Rating 4.4 of 226 users (226)
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
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

• Find out how to identify operations that run in constant time regardless of the size of the input.
• 3.  O(n) Operations - Part 1
Upon completion of this video, you will be able to recognize code whose time complexity varies directly with the size of the input.
• 4.  O(n) Operations - Part 2
In this video, learn how to identify tasks whose time complexity varies linearly with the size of the input.
• 5.  O(n*n) Operations
After completing this video, you will be able to recognize operations whose time complexity varies as the square of the input size.
• 6.  Python's Built-in Queue
During this video, you will learn how to use the native Queue class of Python and perform the standard queue operations on it.
• 7.  Defining a Custom Queue
Find out how to code a bespoke Queue class that includes definitions for many of the standard queue operations, such as enqueue() and dequeue().
• 8.  Use a Python List as a Stack
Upon completion of this video, you will be able to recognize how a Python list can be used as a stack by loading and unloading elements from the same end.
• 9.  Defining a Custom Stack
Learn how to implement a custom Stack class that includes functions for the common stack operations: push, pop, peek, and isEmpty.
• 10.  Linked Lists: Defining Insert Operations
Learn how to define a Linked List class and implement functions to insert a node at the head or the tail of the linked list.
• 11.  Linked Lists: Search, Delete, and Reverse Operations
Find out how to code functions to perform search and delete operations in a linked list and to reverse the ordering of its nodes.
• 12.  Linked Lists: Testing the Functions
Find out how to create a Linked List and test out the various operations that have been defined.
• 13.  Exercise: Implementing Data Structures in Python
In this video, you will learn how to 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 cause exceptions.

EARN A DIGITAL BADGE WHEN YOU COMPLETE THIS COURSE

Skillsoft is providing you the opportunity to earn a digital badge upon successful completion on some of our courses, which can be shared on any social network or business platform.

Digital badges are yours to keep, forever.

YOU MIGHT ALSO LIKE

Rating 5.0 of 1 users (1)

PEOPLE WHO VIEWED THIS ALSO VIEWED THESE

Rating 4.6 of 52 users (52)
Rating 4.6 of 80 users (80)
Rating 4.5 of 183 users (183)