Lecture Notes: Introduction to Programming (6.111/6.600)

General Information

• Creative Commons License: The content is provided under a CC license.
• Course Info: This is the first lecture of 6.111 and 6.600.
• Instructors: Anabelle Bell and Professor Eric Grimson.
• Course Format: Lectures will be recorded for OCW.

Course Overview

Course Objectives

1. Knowledge of Concepts: Fundamental understanding of programming concepts.
2. Programming Skills: Building hands-on coding abilities.
3. Problem-Solving: Engage in problem sets (psets) to apply knowledge.

Course Structure

• Main Areas of Focus:
  • Learning how to program (data structures, control flow).
  • Writing good, readable code.
  • Comparing algorithms and understanding efficiency.
• Practice: Emphasis on hands-on coding practice as key to mastery.

Administration Notes

• Class Pace: Fast-paced; follow along with provided slides and code.
• Recommended Practices:
  • Read problem sets as soon as they are available.
  • Practice coding regularly.
  • Don't fear making mistakes; practice is essential.

What is Computation?

Fundamental Functions of Computers

• Calculations: Perform numerous calculations rapidly.
• Memory: Store results of calculations.

Types of Calculations

1. Primitive Calculations: Basic operations built into programming languages (addition, multiplication, etc.).
2. User-defined Calculations: More complex calculations can be defined by the programmer.

Important Note

• Limitations of Computers: They can only perform calculations as instructed; they lack inherent knowledge.

Types of Knowledge in Programming

1. Declarative Knowledge

• Definition: Statements of fact (e.g., mathematical truths).
• Example: "The square root of X is Y such that Y * Y = X."

2. Imperative Knowledge

• Definition: How-to instructions or processes (e.g., algorithms).
• Example: Steps to find a square root through an iterative process.

Historical Context of Computers

1. Fixed-Program Computers

• Description: Early computers that could perform a limited set of operations without flexibility.

2. Stored-Program Computers

• Description: Modern computers that can store instructions and adapt to perform various tasks.

Basic Computer Architecture

• Key Components:
  • Memory: Stores data and instructions.
  • Input/Output: Interfaces for data entry and output.
  • Arithmetic Logic Unit (ALU): Performs calculations.
  • Control Unit: Manages instruction execution.

Programming Basics in Python

Object Types

• Scalar Objects: Basic types (integers, floats, booleans).
• Non-Scalar Objects: More complex types (lists, dictionaries).

Basic Operations

• Arithmetic Operations: +, -, *, /, %, ** (power).
• Variable Assignment: Use = to store values in variables.

Writing Code

• Print Function: Use print() to output results.
• Expressions: Combine objects and operators to evaluate values.
• Naming Variables: Use descriptive names for better readability.

Important Concepts

• Assignment vs. Equality: The equal sign in programming (=) is for assignment, not equality like in mathematics.
• Rebinding Variables: Variables can be reassigned to new values, affecting future references.

Upcoming Topics

• Control Flow: Next lecture will cover how to direct program execution (if-else statements, loops, etc.).

Summary

• Practice is crucial for mastering programming concepts and computational skills. Computers require explicit instructions to perform tasks.