From Worcester State University Computer Science Department Wiki

*Resources are grouped by sections of the chapter. When adding a new resource, please try to add it to the appropriate section.*

### Section 2.1 Objectives

### Section 2.2 What is PI?

### Section 2.3 More about the `math`

Module

### Section 2.4 The Archimedes Approach

#### Section 2.4.1 The Python Implementation

#### Section 2.4.2 Developing a Function to Compute Pi

### Section 2.5 Accumulator Approximations

#### Section 2.5.1 The Accumulator Pattern

#### Section 2.5.2 Summation of Terms: The Leibniz Formula

#### Section 2.5.3 Product of Terms: The Wallis Formula

### Section 2.6 A Monte Carlo Simulation

#### Section 2.6.1 Boolean Expressions

#### Section 2.6.2 Compound Boolean Expressions and Logical Operators

#### Section 2.6.3 Selection Statements

#### Section 2.6.4 Completing the Implementation

#### Section 2.6.5 Adding Graphics

### Section 2.7 Summary