# Data Structures & Algorithms in Python: Fundamental Data Structures

Python    |    Beginner
• 12 videos | 1h 19m 8s
• Includes Assessment
Rating 4.3 of 343 users (343)
Explore Python data structures and delve into the details of some of the basic structures, such as linked lists, stacks, and queues. Key concepts covered in this 12-video course include the metrics on which algorithms and operations on data are evaluated; learning how the performance of operations and algorithms is expressed in terms of size of input; and learning about linked lists and their contents and structure. Next, study different ways in which nodes can be added to a linked list and how search operations work on this data structure; learn methods to remove nodes from a linked list and the process of reversing the order of nodes in this data structure; and learn techniques used to keep track of numbers of elements in linked lists. You will examine workings of a stack data structure, including the addition and removal of elements; learn some of the operations on stacks, such as ISEMPTY and ISFULL, and the complexities of different stack operations; and learn the queue data structure and how to compare it to stacks.

## WHAT YOU WILL LEARN

• Discover the key concepts covered in this course
Identify what makes a data structure and some of the purposes they serve
Recall the metrics on which algorithms and operations on data are evaluated
Recognize how the performance of operations and algorithms is expressed in terms of the size of the input
Describe a linked list, and its contents and structure
Summarize the different ways in which nodes can be added to a linked list and how search operations work on this data structure
• Recall different methods to remove nodes from a linked list and describe the process of reversing the order of nodes in this data structure
Describe techniques used to keep track of the number of elements in a linked list
Summarize the workings of a stack data structure, including the addition and removal of elements
Identify some of the operations on stacks, such as isempty and isfull, and recall the complexities of the different stack operations
Describe the queue data structure and compare it to stacks
Summarize the time complexities of the common operations on linked lists and compare the stack and queue data structures

## IN THIS COURSE

• In this video, you will learn how to identify what makes a data structure and some of the purposes they serve.
• 3.  Measuring the Performance of Operations
After completing this video, you will be able to recall the metrics on which algorithms and operations on data are evaluated.
• 4.  The Big O Notation
After completing this video, you will be able to recognize how the performance of operations and algorithms is expressed in terms of the size of the input.
• 5.  An Introduction to Linked Lists
Upon completion of this video, you will be able to describe a linked list, its contents, and its structure.
In this video, you will summarize the different ways in which nodes can be added to a linked list and how search operations work on this data structure.
• 7.  Deleting Nodes from a Linked List
Upon completion of this video, you will be able to recall different methods for removing nodes from a linked list and describe the process of reversing the order of nodes in this data structure.
• 8.  Counting the Nodes in a Linked List
After completing this video, you will be able to describe techniques used to keep track of the number of elements in a linked list.
• 9.  An Introduction to Stacks
During this video, you will learn how to summarize the workings of a stack data structure, including how to add and remove elements.
In this video, find out how to identify some of the operations on stacks, such as ISEMPTY and ISFULL, and recall the complexities of the different stack operations.
• 11.  An Introduction to Queues
After completing this video, you will be able to describe the queue data structure and compare it to stacks.
• 12.  Exercise: Fundamental Data Structures
During this video, you will learn how to summarize the time complexities of the common operations on linked lists and compare the stack and queue data structures.

## 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 4.0 of 1 users (1)

## PEOPLE WHO VIEWED THIS ALSO VIEWED THESE

Rating 4.4 of 421 users (421)
Rating 4.5 of 80 users (80)
Rating 4.6 of 801 users (801)