Python




CS256

Chris Pollett

Sep 13, 2017

Outline

Introduction

In-Class Exercise

Suppose we want to learn an `n`-bit nested boolean formula so that at least `1- 1/1000` of the time, the error rate was at most `1/(n+1)`. How many examples would the proof of the previous theorem suggest one should look at? Be specific on the value of `k` (look at our earlier proofs). Also, for what size `n` does this really make sense?

Post your solution to the Sep 13 In-Class Exercise Thread.

Python as Calculator; Programs in Files

Variables and Arithmetic Expressions

Conditionals

File I/O