Computer Science with Applications
  • Preface
  • 1. Getting Started
  • 2. Data Structures
    • 2.1. Lists, Tuples, and Strings
    • 2.2. Dictionaries and Sets
    • 2.3. Implementing a Data Structure: Stacks and Queues
    • 2.4. Classes and Objects
  • 3. Functional Programming and Recursion
  • 4. Working with Data
Computer Science with Applications
  • »
  • 2. Data Structures
  • View page source

2. Data Structures

  • 2.1. Lists, Tuples, and Strings
    • 2.1.1. Creating lists
    • 2.1.2. Accessing elements in a list
    • 2.1.3. Iterating over a list
    • 2.1.4. Modifying a list
    • 2.1.5. Creating a list based on another list
    • 2.1.6. Other operations on lists
    • 2.1.7. Variables revisited
    • 2.1.8. The heap
    • 2.1.9. List parameters
    • 2.1.10. Lists of lists
    • 2.1.11. Shallow copy versus deep copy
    • 2.1.12. Tuples
    • 2.1.13. Strings
    • 2.1.14. Practice Problem Solutions
  • 2.2. Dictionaries and Sets
    • 2.2.1. Introducing Dictionaries
    • 2.2.2. Useful operations with dictionaries
    • 2.2.3. Other ways to construct dictionaries
    • 2.2.4. Accumulating values with dictionaries
    • 2.2.5. Nested dictionaries
    • 2.2.6. Data structures and their complexity
    • 2.2.7. Sets
    • 2.2.8. Practice Problem Solutions
  • 2.3. Implementing a Data Structure: Stacks and Queues
    • 2.3.1. Interfaces and APIs
    • 2.3.2. Stacks
    • 2.3.3. Queues
  • 2.4. Classes and Objects
    • 2.4.1. Defining a new class
    • 2.4.2. Composition
    • 2.4.3. Public vs private attributes
    • 2.4.4. Properties
    • 2.4.5. Class/static attributes vs instance attributes
Previous Next

© Copyright 2021-2024, Anne Rogers and Borja Sotomayor.

Built with Sphinx using a theme provided by Read the Docs.