Course details

Data Structures & Algorithms in Python: Fundamental Data Structures

Data Structures & Algorithms in Python: Fundamental Data Structures


Overview/Description
Expected Duration
Lesson Objectives
Course Number
Expertise Level



Overview/Description

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.



Expected Duration (hours)
1.3

Lesson Objectives

Data Structures & Algorithms in Python: Fundamental Data Structures

  • 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
  • Course Number:
    it_pydsapdj_01_enus

    Expertise Level
    Beginner