Introduction

Tom Kelliher, CS 116

Sept. 1, 2000

Administrivia

Announcements

There is a section 2, at 2:00, with fewer students.

Assignment

Read 1.1--4.

From Last Time

What last time?

Outline

1. Syllabus.

2. Survey.

3. Background.

Coming Up

Overview of Java.

Syllabus

1. Personal home page, office hours, class time.

2. Objectives: Introduction to CS, OOP in Java, program and algorithm development.

3. Texts: Take the lab manual back to the bookstore.

4. Course points:
   1. Labs and assignments: Labs, partners. Post-lab assignments, individually. Late work. Toolbox.

   2. Quizzes: Six scheduled. Beginning of class. Lowest score dropped. No make-ups.

   3. Exams: Two. Make-ups with good reason.

   4. Final. Cumulative. Scheduled by registrar.

5. Course home page: Items of general interest, labs, solutions, meeting outlines.

6. Attendance: participation is an essential part of the learning process. Readiness: Assigned readings expectation. Integrity: Honor code.

Survey

1. Major/minor, career interests?

2. Previous programming experience? Emphasize: none required; some, perhaps, harmful.

3. HLL familiarity?

4. Describe a program you've written.

5. Math background?

6. Why are you here?

Background

1. Components of a computer:

   

2. Computers are general purpose machine, because they can be re-programmed easily. Contrast: ENIAC.

3. Machine code, assembly, HLLs. Concepts: abstraction, binding.

   Compilation process example:

   a = b + c;
   

   may become:

   lw $2, b
   lw $3, c
   add $2, $2, $3
   sw $2, a
   

   which is translated to 32-bit numbers.

   Recurring concepts: abstraction, binding.