Python Data Structures

Start Date: 07/05/2020

Course Type: Common Course

Course Link:

Explore 1600+ online courses from top universities. Join Coursera today to learn data science, programming, business strategy, and more.

About Course

This course will introduce the core data structures of the Python programming language. We will move past the basics of procedural programming and explore how we can use the Python built-in data structures such as lists, dictionaries, and tuples to perform increasingly complex data analysis. This course will cover Chapters 6-10 of the textbook “Python for Everybody”. This course covers Python 3.

Course Syllabus

In this class, we pick up where we left off in the previous class, starting in Chapter 6 of the textbook and covering Strings and moving into data structures. The second week of this class is dedicated to getting Python installed if you want to actually run the applications on your desktop or laptop. If you choose not to install Python, you can just skip to the third week and get a head start.

Deep Learning Specialization on Coursera

Course Introduction

Python Data Structures This is the third course in the Python 3 Programming Specialization. This class will cover the programming fundamentals of Python 3. In the first course, Python Programming, we learned about the core Python programming language and its associated libraries and objects. We also introduced the basic data structures used in Python programs. This class will focus on the types of Python programs that are run inside a program. We will introduce the main types of Python programs, including simple strings, regular expressions, and Python variables. We will explain how these objects are created, how they are managed, and what happens to them when they run. This class will cover the objects and functions included in the Python classes for the common types of Python programs, such as strings, regular expressions, and Python variables. We will cover the object creation process, the use of classes, and the control structure used inside a program. This second class will take you deeper into Python. We will cover the object creation process, the use of classes, and the control structure used inside a program. As we learn Python, you will also learn about the types of classes, the different types of closures, the use of classes to implement interfaces, and the different ways to create threads and threads that implement common Python programs. This second class will take you deeper into Python, as we will cover the object creation process, the use of classes, and the control structure used inside a program. The assignment and execution of Python programs are covered in

Course Tag

Python Syntax And Semantics Data Structure Tuple Python Programming

Related Wiki Topic

Article Example
Biopython Very large sequence files can exceed a computer's memory resources, so Biopython provides various options for accessing records in large files. They can be loaded entirely into memory in Python data structures, such as lists or dictionaries, providing fast access at the cost of memory usage. Alternatively, the files can be read from disk as needed, with slower performance but lower memory requirements.
List of data structures This is a list of data structures. For a wider list of terms, see list of terms relating to algorithms and data structures. For a comparison of running time of subset of this list see comparison of data structures.
Retroactive data structures At first glance the notion of a retroactive data structures seems very similar to persistent data structures since they both take into account the dimension of time. The key difference between persistent data structures and retroactive data structures is "how" they handle the element of time. A persistent data structure maintains several versions of a data structure and operations can be performed on one version to produce another version of the data structure. Since each operation produces a new version, each version thus becomes an archive that cannot be changed (only new versions can be spawned from it). Since each version does not change, the dependence between each version also does not change. In retroactive data structures we allow changes to be made directly to previous versions. Since each version is now interdependent, a single change can cause a ripple of changes of all later versions. Figures 1 and 2 show an example of this rippling effect.
List of data structures In these data structures each tree node compares a bit slice of key values.
List of data structures These are data structures used for space partitioning or binary space partitioning.
Comparison of Python based data storage "This is a review of Python-based data-stores and databases, with some history of an active user base."
List of terms relating to algorithms and data structures It defines a large number of terms relating to algorithms and data structures. For algorithms and data structures not necessarily mentioned here, see list of algorithms and list of data structures.
Range query (data structures) In data structures, a range query consists of preprocessing some input data into a data structure to efficiently answer any number of queries on any subset of the input. Particularly, there is a group of problems that have been extensively studied where the input is an array of unsorted numbers and a query consists of computing some function on a specific range of the array. In this article we describe some of these problems together with their solutions.
Data (computing) Data can be organized in many different types of data structures, including arrays, graphs, and objects. Data structures can store data of many different types, including numbers, strings and even other data structures. Data pass in and out of computers via peripheral devices.
Mahogany (email client) The program features an optional embedded Python interpreter. Python scripts have full access to all internal Mahogany data structures and objects and can be used to extend Mahogany.
Data structure Data structures provide a means to manage large amounts of data efficiently for uses such as large databases and internet indexing services. Usually, efficient data structures are key to designing efficient algorithms. Some formal design methods and programming languages emphasize data structures, rather than algorithms, as the key organizing factor in software design. Data structures can be used to organize the storage and retrieval of information stored in both main memory and secondary memory.
Gadfly (database) The most basic data structures of the implementation are given in either or the faster kjbucketsmodule.c, which implement the same data type signatures in Python and in a C extension to Python respectively.
Data model Patterns are common data modeling structures that occur in many data models.
Data structure There are numerous types of data structures, generally built upon simpler primitive data types:
Data structure Data structures are generally based on the ability of a computer to fetch and store data at any place in its memory, specified by a pointer—a bit string, representing a memory address, that can be itself stored in memory and manipulated by the program. Thus, the array and record data structures are based on computing the addresses of data items with arithmetic operations; while the linked data structures are based on storing addresses of data items within the structure itself. Many data structures use both principles, sometimes combined in non-trivial ways (as in XOR linking).
Range query (data structures) All the problems described above have been studied for higher dimensions as well as their dynamic versions. On the other hand, range queries might be extended to other data structures like trees, such as the level ancestor problem. A similar family of problems are orthogonal range queries also known as counting queries.
Retroactive data structures The running time of retroactive data structures are based on the number of operations, "m", performed on the structure, the number of operations "r" that were performed before the retroactive operation is performed, and the maximum number of elements "n" in the structure at any single time.
Algorithms + Data Structures = Programs is a 1976 book written by Niklaus Wirth covering some of the fundamental topics of computer programming, particularly that algorithms and data structures are inherently related. For example, if one has a sorted list one will use a search algorithm optimal for sorted lists.
Set (abstract data type) An abstract data structure is a collection, or aggregate, of data. The data may be booleans, numbers, characters, or other data structures. If one considers the structure yielded by packaging or indexing, there are four basic data structures:
Array data structure Arrays are used to implement other data structures, such as lists, heaps, hash tables, deques, queues, stacks, strings, and VLists. Array-based implementations of other data structures are frequently simple and space-efficient (implicit data structures), requiring little space overhead, but may have poor space complexity, particularly when modified, compared to tree-based data structures (compare a sorted array to a search tree).