This course introduces data structures and algorithms, focusing on practical implementation in Python.

java.tar.gz

Data structures and algorithms are essential in computer science since they play a crucial role in efficient information retrieval and processing, dealing with files, storing contacts on phones, social networks and web searches.

In this course, you’ll learn about the array-based implementation of various linear data structures, stack, and queues. You’ll also learn about linked list-based implementation. Next, you’ll explore advanced data structures like skiplists and hashing. You’ll learn how to implement a variety of trees and graphs, and data structures related to bits of an integer. Toward the end of the course, you’ll learn the implementation of structures based on external storage.

After completing this course, you’ll be able to create reusable programs with template-based collections that can efficiently analyze how to optimize the storage and retrieval of very large amounts of data. Overall, this course will enhance your productivity and performance as a software developer.

Data Structures with Generic Types in Python

Skiplists are a data structure that can only be used to implement a `List` with $O(\log n)$ time complexity for `get(i)`, `set(i, x)`, `add(i, x)`, and `remove(i)`.

The efficiency of skiplists relies on their use of deterministic algorithms.

 Skiplists use random coin tosses to determine the height of new elements added to the list.

The skiplist structure is a sequence of doubly and singly-linked lists $L_0, ..., L_h$.

Which statement is *true* about skiplists?

Which statement is true about skiplists?

Which data structure uses a skiplist structure to implement the `SSet` interface?

Which data structure uses a skiplist structure to implement the <code>SSet</code> interface?

What is the time complexity for adding, removing, and accessing elements in a `SkiplistList`?

What is the time complexity for adding, removing, and accessing elements in a <code>SkiplistList</code>?

What is the expected height of a skiplist containing $n$ elements?

What is the expected height of a skiplist containing <math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>n</mi></mrow><annotation encoding="application/x-tex">n</annotation></semantics></math>n elements?

Test yourself on what you've learned about skiplists.

Overview

Array-Based Lists

Linked Lists

Skiplists

Hash Tables

Binary Trees

Random Binary Search Trees

Scapegoat Trees

Red-Black Trees

Heaps

Sorting Algorithms

Graphs

Data Structures for Integers

External Memory Searching

Wrap Up

Quiz on Skiplists