IMMIGRATION COURSE IN COMPUTER SCIENCE

Mary Shaw Jack Buchanan

September 1, 1974

Carnegie-Mellon University Department of Computer Science

Pittsburgh, Pa. 15213

-1-

The Iinraigration Course (IC) is a process for initializing new stu­

dents into the environment of the Computer Science Department at CMU.

It is an intensive six-week program intended to provide a common founda­

tion for students with diverse backgrounds. The goals of the IC are to

provide each new student with

A general view of computer science

Establishment in the department with respect to:

people,

what active research is going on,

the administrative requirements of a graduate education in computer science,

the next steps to be taken in his own education,

social activites;

An appreciation of some problems in depth, or at least an appreci­ation that computer science contains some problems that can be studied in depth;

Some operating familiarity with the languages, concepts, and techniques of computer science, particularly those used at CMU.

These goals will be fulfilled through a program of lectures, problem

sessions, and laboratories. In order to provide an intensive course,

the department will not ask first-year graduate assistants to begin

their duties until the end of the IC.

Other members of the department are encouraged to participate in

any part of the IC; in particular, many of the lectures are of general

interest.

-2-

LECTURES

A lecture series will meet in the mornings from 9:30 to 11:00 and

in the afternoons from 3:30 to 5:00. The lectures include a number of

outside speakers, introductions to the areas and core courses in computer

science, descriptions of departmental projects, presentations of problems

for students to work on during the IC, and some "hands-on 1 1 demonstrations.

The lecture schedule is given at the end of this memo. Extra lectures

and discussions will be scheduled on request of IC students.

STUDY PROBLEMS

IC students will work on some problems, mostly involving extensive

programming, from various areas of computer science. These problems will

be presented in the lecture sessions, and follow-up discussions will be

scheduled as appropriate. Writeups of the problems and details about the

form of the presentation are given in the collection, "IC Study Problems 1 1.

Students in the IC are expected to complete solutions to five of the prob­

lems by the end of the I C

LABORATORIES

The goal of operating familiarity with local systems will be achieved

through laboratory sessions. These are driven primarily by the initiative

of the students involved. There are two laboratories:

Learning lab: There are several areas in which students should be familiar

with the concepts, techniques and vocabulary because this knowledge will

-3-

be assumed by formal courses and informal discussions in the department.

These topics will be offered in the form of guided self-study. Study

guides for the topics have been prepared under the direction of interested

faculty members. They are:

Algebra and Boolean Algebra, Profs. Schkolnick and Buchanan including logic

Hardware Concepts Profs. Fuller and Siewiorek

Probability Prof. Fuller

Programming Systems Prof. Shaw

At the beginning of the IC each student will decide which of the

topics he will 'self-study' and make a commitment to finish those topics

with the faculty members concerned.

Most learning labs will be held from 1:30 to 3:00 in the afternoons.

On Mondays, Wednesdays and Fridays the lab will be devoted to Programming

Systems. Since this part of the IC is also the beginning of a formal

course (15-710), these presentations will be much more structured than

the other topics.

The labs for Hardware Concepts and for Algebra, Boolean Algebra,and

Logic will be conducted in the following way: Each student receives a

study guide for each topic he commits himself to learn. He will work his

way through these study guides, reading and working problems as indicated.

Each time a student finishes a section, the learning assistant will help

him determine whether he has mastered the material and suggest further

review of new work as appropriate. With this organization, the responsi­

bility for learning lies primarily with the student. Both of these labs

will start operating at the beginning of the IC and continue as long as

students are working actively.

-4-

Students who are studying Probability will work out individual sched­

ules with Professor Fuller. Do this by working through the familiarity

quiz and returning it to Professor Fuller .

At the end of the IC, students will be expected to be familiar with

the material covered in all these topics. We expect that they already

know a good deal of the material y so no one should have to assimilate

all of it in a few weekr. One reason for the self-paced presentation is

that the entering students have varied backgrounds, so we do not expect

that they will necessarily study the same things or spend the same amount

of time on them. Students should learn the topics during the IC rather

than waiting to do it later because

- after the IC, lecturers will feel free to assume that they know the material and will not pause to explain notation or vocabulary

- time and teaching resources are being made available to learn them now.

As with the rest of the Computer Science curriculum, the assignments are

informal and no grades are given. The time during the IC should therefore

be used to learn new things and refresh hazy memories rather than to cover

familiar material again.

Computing lab: The periods from 11:00 A.M. to 12:30 P.M. and from 7:00 P.M.

to 10:00 P.M. are computing laboratory sessions. Until everyone is familiar

with the PDP-10 and its use, graduate students, staff, and faculty members

will be in the lab to give assistance. Most of these periods will be un­

structured, so they may be used for programming, informal discussions,

independent study in connection with the learning labs, or learning new

-5-

programming languages. The three programming languages which will be

taught in connection with the Programming Systems lab are APL, Algol, and

LISP.

MANUALS, TEXTS, AND WHAT TO DO WITH THEM

Manuals. You will need the following manuals. The three that are

indicated must be purchased by everyone, but the rest will be supplied

to Computer Science graduate Students.

General system description

PDP-10 Assembly Language Handbook PDP-10 Users Handbook PDP-10 Mathematical Languages Handbook CMU Introductory Users Manual SOS Manual

For APL

Pakin APL 360 Reference Manual BOOKSTORE APLSS/APL Reference Handbook

For Algol

Algol-60 Report PDP-10 Algol Manual

For LISP

Weissman LISP 1.5 Primer BOOKSTORE CMU LISP 1.6 Manual and SAILON 41 Perdue UCI LISP

For SNOBOL (optional)

Griswold The Snobol 4 Programming Language BOOKSTORE

Start with the PDP-10 Users Handbook and the CMU Introductory Users

Guide. The Timesharing Handbook and the Reference Manual listed below are

published by Digital Equipment Corporation (DEC) and are often called "the

-6-

telephone books 1 1. The Introductory Users Guide has a blue cover, and is

often called "the primer". The Users Handbook has an overview of the

system, a long and fairly gentle introduction to the monitor, and good

instructions to get you started in Fortran, Basic, and AID (a relative

of JOSS). The monitor introduction is augmented by short write-ups and

demonstrations to teach usage style. The primer was created because

several of us believe that the hardest single problem with learning a new

language is getting into the language system, figuring out where to put

things, finding the local conventions about I/O, and getting a mental image

of what a complete program looks like and how it acts* The primer is thus

a collection of material with remarks, examples, and annotated scripts of

terminal sessions for many of the languages and systems used at CMU. It

may be revised this winter, so please keep written comments about errors,

omissions, and other systems to include. Any time someone is going to

teach you about a new language (like later this semester, in 15-710),

read the appropriate section of the primer be for is you go to class.

Next, take the PDP-10 Assembly Handbook (the other telephone book) and

the SOS Manual. These are reference manuals, and reference manuals just

don't read like prose. Use them to look up specific pieces of information

or to read about some aspect of a system, or to get more details about

something you have seen. If you try to read them to get onto a system

for the first time, you will probably get very frustrated.

-7-

The Algol-60 Report is a piece of reference material, not a primer.

The Algol Manual is supposed to be enough for anyone who knows Fortran

or some other Algol. If you know neither, ask around about an Algol text.

The APL manual describes our implementation. You also need Pakin*s

book, APL\360, from the bookstore.

The LISP 1.6 Manual is a reference manual for LISP on the PDP-10.

You also need Weissman's LISP 1.5 Primer and Perdue 1s UCI LISP,

Problems. Descriptions of the problems which will be presented and

discussed in the lectures have been supplied to Computer Science students.

They may also be purchased in the bookstore: look for IC Study Problems

under 15-700. This is the other blue-cover paper. The organization of

this part of the IC, the requirements for a complete solution, and sug­

gestions on which problems to choose are given in the Introduction of this

document. Start by reading the entire Introduction.

Textbooks. You need buy these only as they become necessary for

study guides or whatever. At least one of the following statements is

true for each book on the list:

1. It is an inexpensive paperback and appropriate for the study topic that assigned it.

2. It will be needed for a core course later, and you might as well get it now.

3. It is optional and also a good addition to your personal technical library.

Two copies of each book will be on reserve in the Engineering and Science

Library. The following should be available in the bookstore, listed for

15-700.

-8-

For Hardware

Bell and New,ell Computer Structures

For Probability

Lipschutz Probability

For Programming Systems

Knuth Fundamental Algorithms Hopgood Compiling Techniques Elson Concepts of Programming Languages Dahl, Dijkstra and Structured Programming

Ho are

SOCIAL ACTIVITIES

Anumber of social activities are scheduled. They include a reception,

a picnic, a party, the beginning of volleyball season, a CSFSU meeting, and

occasional TGIF 1s (beer blasts). Spouses of department members are welcome

at the activities. MDEC-5 f f will be delighted to talk to volunteers.

-9-

SCHEDULE FOR 1974 IMMIGRATION COURSE

WEEKLY SCHEDULE

This is the schedule for a typical weekday:

0930-1100 Lecture

1100-1230 Computing Laboratory (except that Learning Laboratory in Logic runs in parallel on Mondays)

1230-1330 Lunch 1330-1500 Learning Laboratory 1500-1530 Break, sometimes with coffee and doughnuts in CS Lounge 1530-1700 Lecture 1700-1900 Dinner 1900-2200 Computing Laboratory

On weekends, the only thing scheduled is the computing lab.

Saturday 1000-1300

Informal discussions will be scheduled as demand arises. Since the

schedule can be dynamically redefined, ultimate Truth will be posted on the

bulletin board in the short hall near the CS Lounge.

One lecture session a week (usually Friday afternoon) will be devoted

to feedback from participants in the IC to the organizers. Since the IC is

an intensive course, we have found that the fine tuning that can be done, in

response to feedback makes the course run much more smoothly.

LECTURE SCHEDULE

The lectures include seminars by off-campus speakers, descriptions of

research, demonstrations, and other topics of interest by CMU computer sci­

entists, outlines of the Computer Science curriculum and research areas in

-10-

the department, presentations of problems to work on during the IC, and feed­

back sessions. They will be given in Room 5409 or in other rooms as announced,

Off-Campus Lecturers

Coffee and doughnuts will be served in the Computer Science Lounge at

3:00 P.M. before these lectures. The lectures will begin at 3:40 P.M. in

Room 5409 or 7500, as announced. The visiting lecturers this year are as

follows.

Prof. J. Eve Department of Computer Science University of Newcastle Upon Tyne

"Error Recovery in Compilers 1 1

Monday, September 9

Prof. John McCarthy Department of Computer Science Stanford University

"The Epistemological Part of the AI Problem"

Thursday, September 12

Dr. Harlan D. Mills Federal Systems Division

International Business Machines, Incorporated

"How to Write Correct Programs and Know It"

Monday, September 16

Dr. James E. Thornton Network Systems Corporation

"LSI For Super Computers - Problems and Issues"

Thursday, September 19

\

-11-

Prof. James L. McKenney School of Business Harvard University

"Five Unsolved Management Problems of Computer Systems 1 1

Monday, September 23

Dr. William M. Kahan Dept. of Electrical Engineering and Computer Science University of California ,

"Do You Trust Your Calculator?"

Thursday, September 26

Dr. Albert Meyer Project MAC

Massachusetts Institute of Technology

"Some Computationally Hopeless Problems"

Tuesday, October 1

Prof. Jurg Nievergelt Department of Computer Science University of Illinois

"ACSES, an Automated Computer Science Education System"

Friday, October 4

Prof. Michael Rabin Department of Mathematics Hebrew University

"Complexity of Computations: Its Uses and Misuses"

Tuesday, October 8

Dr. J. T. Godfrey On-Line Systems, Incorporated

"The New Computer Service Industry"

Wednesday, October 9

-12-

Prof. D. Knuth Department of Computer Science Stanford University

"Fast Pattern Matching in Strings" - 9:30 A.M "Computer Programming as an Art" - 3:40 P.M

Friday, October 11

Dr. Kenneth M. Colby Artificial Intelligence Laboratory Stanford University

"Simulation of Paranoid Processes"

Tuesday, October 15

-13-

CMU Lecturers

Wed. Sept. 4 3:30 P.M. The Ph.D Program in Computer Science at CMU

Thur. Sept. 5 3:30 P.M. Why Computer Science is a Science

Tues. Sept. 10 9:30 A.M. Speech Understanding Systems

Wed. Sept. 11 3:30 P.M. The Status of Computer Chess

Thur. Sept.^12 9:30 A.M. Automatic Programming

Thur. Sept. 12 1:30 P.M. Research Funding

Fri. Sept. 13 9:30 A.M. Computer Vision, Image Processing and Graphics

Tues. Sept. 17 9:30 A.M. Secondary Index Optimization in a Relational Data Base

Wed. Sept. 18 3:30 P.M. The Impact of Technology on University Computer Centers

Fri. Sept. 20 9:30 A.M. PUB: A Document Compiler

Mon. Sept. 23 9:30 A.M. TECO: A Text Editor

Tues. Sept. 24 3:30 P.M. Implementation Problems of ALGOL 68

Thur. Sept. 26 3:30 P.M. Automatic Program Generation

Fri. Sept. 27 9:30 A.M. Data Bases for Design

Fri. Sept. 27 3:30 P.M. Machine Architecture in the Real World

Tues. Oct. 1 9:30 A.M. Precedence Parsers

Tues. Oct. 1 1:30 P.M. Mechanical Theorem Proving

Wed. Oct. 2 3:30 P.M. C.mrap - A Multi-Mini Processor

Thur. Oct. 3 9:30 A.M. Symbolic Manipulation of Machine Descriptions

Thur. Oct. 3 3:30 P.M. Synchronization of Concurrent Processes

Mon. Oct. 7 9:30 A.M. Beyond Humpty-Dumpty: Toward Discipline in the Art of Programming

J. Buchanan

A. Newell

L. Erman

H. Berliner

J. Buchanan

J. Traub

R. Reddy

M. Schkolnick

J. McCredie

R. Johnsson

R. Levin

P. Hibbard

J. Buchanan

C. Eastman

C. Bell

M. Schkolnick

M. Stickel

W # Wulf

M. Barbacci

N. Habermann

M, Shaw

-14-

Tues. Oct. 8

Wed. Oct. 9

Thur. Oct. 10

Thur. Oct. 10

Mon. Oct. 14

Mon. Oct. 14

Tues. Oct. 15

Wed. Oct. 16

Wed. Oct. 16

Thur. Oct. 17

9:30 A.M. The Security of Information within aii information System

9:30 A.M. Measurement and Evaluation of Computer Systems

9:30 A.M. Fault Tolerant Computer Systems

3:30 P.M. Computational Complexity

9:30 A.M. BLISS - A Language for Implementing Systems Software

3:30 P.M. More on Psychology of Programming

9:30 A.M. Understanding and/or Verifying Programs

9:30 A.M. Complexity of Parallel Computation

3:30 P.M. Pricing Models in Computer Services

3:30 P.M. Programs That Understand Languages

A. Jones

S. Fuller

D. Siewiorek

J. Traub

W. Wulf

A. Newell

J. Buchanan

H. Kung

C Kriebel

H* Simon

' . - . . . . . . « *

Monday . Tuesday Wednesday Thursday Friday Weekend

Sept. 3 4 5 6 7,8 |

Lecture 9:30-11:00

• R

E

[

Organization of Learning Labs and Study Problems

(Buchanan)

Computing Lab

Computing Lab

11:00-12:30

u 1,

I

S

Departmental Meeting

(Johnsson) (Karlton)

LUNCH R Lunch on lawn out­side Science Hall

Learning Lab

1:30-3:00

A

T

T

Programming Languages PDP-10 System

Computer Systems I Programming Languages' PDP-10 System

1 (Levin & Karlton) (Fuller) (Levin & Karlton)

BREAK 0

N

Lecture

3:30-5:00

The Ph.D Program in Computer Sci. at CMU

(Buchanan)

Why Computer Sci. is a Science

CSFSU Meeting

DINNER Reception at home of Mary Shaw &

Conputing Lab

7:00-10:00 (Cohen) (Hilfinger)

Roy Weil

IC SCHEDULE 0

1

Monday Tuesday Wednesday Thursday Friday Weekend

9 10 11 12 13 14,15

Lecture 9:30-11:00

Speech Understand­ing Sys. and Res,

More on Speech Understanding Systems

f E rmar r t ,

AI Research and Education

(Newell, Reddy, Buchanan & Erman)

Automatic Programming

(Buchanan)

Computer Vision, Image Processing & Graphics

(Reddy)

Computing Lab

Computing Lab

11:00-12:30 (Weinstock) (Corwin) (Bauer)

Move Paper for Recycling

(Forgy)

Computing Lab

LUNCH

Computing Lab

Learning~ Lab

1:30-3:00

Programming Languages

ALGOL

(Habermann)

Computer Systems II

(Fuller)

Programming Languages

ALGOL

(Flon)

Everything You Have Wanted to Know about Re­search Funding (Traub)

Programming Languages

ALGOL

(Schneider)

Computing Lab

BREAK

Computing Lab

Lecture

3:30-5:00

Error Recovery in Compilers

(Eve)

The Status of , Computer Chess

i

(Berliner)

The Epistemologic-al Part of the Artificial Intel­ligence Problem (McCarthy)

Feedback

Computing Lab

DINNER TGIF

Computing Lab

Computing Lab

7:00-10:00 (Schneider) (Stevenson) (Marathe) (Leverett) (Hilfinger)

Computing Lab

Monday

16

Tuesday

17

Wednesday

18

Thursday

19

Friday

20 Weekend 21,22

Lecture 9:30-11:00

Secondary Index Optimization in a Relational Data Base (Schkolnick)

PUB: A Document Compiler

(Johnsson)

CS DEPT. Picnic at Mars Grove

Computing Lab

11:00-12:30 (Cooprider) (Levin)

Study Problem Presentations

(Cooprider) (McCracken)

LUNCH

Learning Lab

1:30-3:00

Programming Languages

APL

Programming Languages

APL

(Pollack & Fenne 1 ll)

AI

Programming [Languages *

APL

(Pollack & Fennell

BREAK

Lecture

3:30-5:00

DINNER

Computing Lab

7:00-10:00

How to Write Correct Programs and Know It

(Mills)

Impact of Tech­nology on Univers-J ity Computer Centers

(McCredie)

LSI for Super Computers -Problems and Issues

(Thornton)

Feedback

(Pollack) (Knueven) (Pollack) (Knueven) (Hilfinger)

Monday Tuesday Wednesday Thursday Friday

23 24 25 26 27

Lecture 9:30-11:00

TECO - A Text Editor

(Levin)

Computer Sys. Ed. and Research

(Siewiorek, Fuller and Reddy) 1 .

Computer Animated Film: Space Filling Curves

f M a v )

Data bases tor Design

(Eastman)

Computing Lab

11:00-12:30

ALGOL 68

(Hibbard)

LUNCH

Learning Lab

1:30-3:00

Programming Languages

/Shaw.)

Systems Perfor­mance Evaluation

(Fuller and

Programming Languages

(Shaw)

Programming Languages

(Shaw)

BREAK

Lecture

3:30-5:00

Five Unsolved Management Prob­lems of Computer Systems

(McKenney)

Implementation Problems of ALGOL 68

(HibbarA)

Do You Trust Your Calculator? (4:00)

(Kahan)

Automatic Program Generation

(Buchanan)

Machine Architec­ture in the Real World

(Bell)

DINNER

Computing Lab

7:00-10:00

•

* Monday Tuesday Wednesday Thursday Friday Weekend

— 30 Oct. 1 2 3 4 5,6 |

Lecture 9:30-11:00

Math Foundations Res. and Ed.

(Schkolnick and Buchanan)

Precedence Parsers

(Schkolnick) '

Programming Languages and Systems Res. & Ed.

(Habermann, Wulf, Shaw and Jones)

Symbolic Manipula­tion of Machine Descriptions

(Wulf, Siewiorek, Barbacci & Shaw)

(cont'd.)

Computing Lab

11:00-12:30

LUNCH

Learning Lab

1:30-3:00

Programming Languages

LISP

(Perdue)

Mechanical Theorem Proving

(Stickel)

Programming Languages

LISP

(Perdue)

Systems Perfor­mance Evaluation

(Fuller)

Programming Languages

LISP

(Perdue)

BREAK •

Lecture

3:30-5:00

System Science Res. and Ed.

(Kriebel and Buchanan)

Some Computation­ally Hopeless Problems

(Meyer)1

C.mmp - A Multi-Mini Processor'

(Wulf)

Synchronization of Concurrent Processes

(Habermann)

ACSES, An Auto­mated Computer Science Education System

(Nievergelt)

DINNER TGIF

Computing Lab

7:00-10:00

5

Monday Tuesday Wednesday Thursday Friday Weekend

7 8 9 10 11 12,13

Lecture 9:30-11:00

Beyond Humpty-Dumpty: Toward Discipline in the Art of Programming

The Security of Information withir an Infotmatidti System

Measurement and Evaluation of Computer Systems

Fault Tolerant Computer Systems

Fast Pattern Matching in Strings

(Shaw) (Jones) (Fuller) (Siewiorek) (Knuth)

Computing Lab

11:00-12:30

LUNCH

Learning Lab

Programming Languages

Resolution and Problem Reduction

Programming Languages

Math Foundations Programming Languages '

1:30-3:00

(Shaw) (Stickel) (Shaw) (Schkolnick) (Shaw)

BREAK

Lecture

3:30-5:00

Alg. Anal. & Comp Complexity (Traub and Kung)

Sys. Performance Evaluation (Fuller a-McCredie

Complexity of Computations: It Uses and Misuses

(Rabin)1

The New Computer ; Service Industry

(Godfrey)

Computational Complexity

(Traub)

Computer Program­ming as an Art

(Knuth)

DINNER TGIF

Computing Lab

7:00-10:00

Monday Tuesday Wednesday Thursday Friday Weekend

14 15 16 17 18 19,20

Lecture 9:30-11:00

BLISS - A Language for Implementing Systems Software

Understanding and/or Verifying Programs

(Buchanan) ,

Complexity of Parallel Computa­tion

(Kung)

Computing Lab

11:00-12:30

LUNCH •

Learning Lab

1:30-3:00

Programming Languages

(Shaw)

Programming Languages

. (Shaw)

Programming Languages

(Shaw)

BREAK

Lecture

3:30-5:00

More on Psychol­ogy of Program­ming

(Newell)

Simulation of Paranoid Processes

(Colby)'

Pricing Models in Computer Services

(Kriebel)

Programs That Understand Languages

(Simon)

Final Feedback and

Critique

DINNER TGIF

Computing Lab

7:00-10:00

It SCHEDUI& 1977

Monday Tuesday , Wednesday Thursday Friday Weekend i Sept. 5 Sept. 6

1

• Sept. 7 Sept. 8 Sept. 9 Sept. 10

Lectuf^Ub 9:30-11:00

L R

IC Organization

Rung

Introduction to PDP-10 (I)

r Everhart

Introduction to PDP-10 (II)

Everhart Break A

Lecture /Lab 11:15-12:30

B

0

G

The Ph.D. Program at CMU

Traub

Departmental Facilities

Wactlar '

[Everything You fv« Always Wanted to Know about Re- • search Funding, but...

Traub Lunch

a.

i

Learning Lab 1:30-3:00

D

S

T

Seeing Beyond the Smog: Learning to Love Pittsbuigh

Reid

Use of E and S Library and Com­puter Science Browsing Room Mounts

Research and Education in . Algorithms and Complexity at CMU Shamos

Computing Lab. Saturday, 1:30-4:30

Break 3:00-3:30

A R

Lecture 3:30-5:00

Y A

T

Departmental Meeting

f -.."*'

Research in Algo­rithms and Com­plexity - Survey

Bentley

Programming Sys­tems - Basic Concepts and Survey Wulf

•

Dinner I TG/Meet IC Sapsford Dinner

Advisors Departmental Reception at Jones-Wulf Home Sunday - 6:00 P fM. Computing Lab

7:00-10:00

1 0

N Durham Lehman Render

Departmental Reception at Jones-Wulf Home Sunday - 6:00 P fM.

Week 0

Lecture/Lab 9:30-11:00

Break

Lecture/ Lab-11:15-12:30

Lunch

Learning Lab 1:30-3:00

Break

Lecture 3:30-5:00

Dinner

Monday

Sept. 12

J 3.

Cm*

Fuller/jones/ Ousterhoiit/g^

Research and Education in Pro­gramming Systems at CMU

Programming [Languages - APL

Cohen

Computer Systems - Basic Concepts and Survey

Fuller

Computing Lab I 7:00-10:00

Almes

Tuesday

Sept. 13

IC SCHEDULE 1977

Computer Systems Lab :; Anatomy of a Computer

Abstraction and Verification in ALFHARD

Computer Systems Lab : Anatomy of a Computer

Fuller

Research and Education in Computet Systems at CMU

Is lew ior ek/Fu 1 ler

Programming Systems (I)

Leverett

HYDRA

Wulf

Vegdahl

Sept. 14

Programming Languages - APL

Cohen

Artificial Intel­ligence - Basic Concepts

Newell

Irffri rgo

Sept. 15 AI Lab: Search

Berliher/Erman

AI Lab; Search

• Berliner/Erman

Algorithms and Complexity Lab : Divide-and-Conquejr

Bentley

Fault Tolerant Computing

Slewioirek

Sannriprq,

Friday

Sept. 16

Computational Statistics

ShaiBgfi

Research and Education in Artificial Intel­ligence at CMU

Erman/McDermot t

Programming • Languages - APL

Cohen

Feedback (25 min

TGIF

Rflmahrighna

Weekend Sept. 17

Week 1

1

Wednesday Thursday

Monday

Sept, 19-Tuesday

Sept, 2n,

_ IC SCHEDULE 1977

Wednesday Thursday

jtepft. 71 1 ' Sep*-Friday Sppf, ?1

Weekend Sppf, ?4

Lecture/Lab 9:30-11:00

Algorithm Design Techniques

Bentley

Computer Systems [Lab Semiconduc­tor Technology: Basic Principles and Trends

Sharfetter

AI Lab: Knowledg| Representation

Simon

Algorighms and

Lecture/Lab I C ^ £ * U b :

11:15-12:30 P«allelism

IKung

Computer Systems |Lab Semiconduc­tor Technology: Basic Principles Sharfetter

AI Labi: Knowledge Representation

Simon

Lunch U

Learning Lab| 1:30-3:00

Programming I Languages - LISP

Rychener

Programming Sys­tems (II)

Leverett

Programming Languages - LISP

Rychener Break

Lecture 3:30-5:00

Dinner

Computing Lab

Image Understand* ing Systems

Reddy

Fast Algorithms for Symbolic Computation

Traub

Computer Archi­tecture and Des ign

Fuller

Schwanke Smith Rosenbloom

TBA

Hibbard

Algorithms and Complexity Lab : Combinatorics and Graphs Shamos

Programming Languages - LISP

Rychener

Feedback (25 min.l ZOG and Man-Computer Inter­action

Newell

Picnic on

Sunday

Week 2

Break

7:00-10:00

Monday Sept. 26

Tuesday SeptV 27

IC SCHEDULE 1977

Friday Sept. 30

Lecturfc/Lab 9:30-11:00

Break

Lecture/Lab 11:15-12:30

Lunch

Learning Lab] 1:30-3:00

Break

Lecture 3:30-5:00

Dinner

systems with (Under standing

Simon

Computer Systems Lab- Networks, Multiprocessors, and other Multipl Processor Systemq SprnuH/Fuller

Toward a Science of Scientific Discovery

AI Lab* Schemas (Machine Under­standing of News? |paper Articles)

Lenat

TBA

tSproull.

Some Theoretical Problems Related to the Multipro­cessor Algorithm Design Kune

Computer Systems Lab• Networks, Multiprocessors, and other Multip Processor System^ Spronn/Fnllpr

Programming Languages ALGOL 68

Hibbard

Programming Systems (III)

Leverett

Secure Computatioh TBA

Jones Habermann

AI Lab: Schemas (Machine Under-Istanding of News* (paper Articles)

Lenat

Algorithms and Complexity Lab: You've come a long way,Newton

Traub

Programming Languages ALGOL 68

Hibbard

Theory of Computation Lab

Jefferson

Programming Languages (ALGOL 68

Hibbard

Algebraic Com­plexity of Com­putation: Theory and Applications (7500) Wiriograd

Decomposing AI Systems for Dis­tributed Archi­tectures" Ermau

TGIF

Computing Lab

Week 3

Wednesday Thursday Sept. 28 ( Sept. 29

7:00-10:00

•IC SCHEDULE• 1977

Monday

Oct. 3 Tuesday

Oct. 4 Wednesday

Oct. 5 Thursday

Oct. 6 Friday

Oct. 7 Weekend

Oct. 8

Lecture/Lab 9:30-11:00

Break

Lecture/Lab 11:15-12:301

Lunch

Learning Lab 1:30-3:00

Break

Lecture 3:30-5:00

Dinner

Computing Lab

PQCC

Newcomer

Computer Systems Lab: Digital Sys tern Design with Integrated Circuits

Siewiorek

Computer Graphics

Sproull

AI Lab: Signals and Symbols

Reddy

Computer System Selection: the CMU Long Range Plan

McCredle

Education in Theory of Compu­tation at CMU

Bentlev •

Computer Systems Lab: Digital Sys tem Design with Integrated Circuig| ewiorek

Computer Graphics

Sproull,

AI L a b : Signals and Symbols

Reddy

Theory of Compu­tation Lab

Jefferson

Programming Systems (IV)

Levefett

Document Produc­tion

Re id

Programming Sys­tems (V)

Leverett

Final Feedback

The Instruetable Production System Project

c Dermo 11/ Newe 1 \J Rychener

Search and Knowledge

Berliner.

Computer Aided Design

J Eastman

Speech Under­standing Systems

Goodman/ Reddy

TGIF

4 -

Week 4

7:00-10:00