Introduction to Computer Science, part 2

This open text is designed for use in CS 211 at University of Oregon and in CS 162 at other Oregon colleges and universities. You can find part 1 here, the text for CS 210, here.

Instructors and authors: You are welcome to use, borrow from, or fork these texts for your own customizations, under a permissive open source license. Instructions are in the github repository.

00 Preliminaries

• A Course in Computational Thinking
• Installing Python and IDLE
• Installing an Interactive Development Environment (IDE)

01 Objects

• Objects

02 Inheritance

• Class Hierarchies and Inheritance
• Inheriting from built-ins
• Notifiers

03 Recursion

• Recursion in Object-Oriented Programs
• Refactoring Repetitive Code

04 Aliasing

• Aliasing on Purpose

05 Guess and Check

• Recursive Guess and Check

06 Binary

• Bit Twiddling
• Negative Binary Numbers
• What the Hex?

07 Functional

• Sometimes Functions are Values

08 Assembler

• Two Pass Algorithms
• Regular expressions

Appendices

• Glossary of Terms
• Appendix – What for?
• Appendix – Magic Methods
• Style Guide for Python Programs
• How Python Works