Augustana Faculty logo and wordmark


COMPUTING SCIENCE 370
Programming Languages

COURSE OUTLINE

Fall Term, 2004



Quick Links
. Course Materials Index . Course Description & Regulations . Instructor Contact Information


The approximate dates on which the various topics of the course will be presented, along with an indication of which pages or sections of the textbook(s) are to be read in connection with each topic, are given in the following table. Students should read the indicated sections prior to each class or lab session.

Exercises are to be handed in at the start of the class session (3:40 p.m.) on the due dates indicated below. Programming assignments are to be submitted using the web-based submission system by midnight of the dates on which they are due.

DATES TOPIC READING
Sept. 9 Introduction: Why Study Programming Languages?
Language Paradigms
Chaps. 0, 14
14 LISP: List Processing — Structural Organization §9.1 - 9.2
16 NO CLASS SESSION
17 LAB: EBNF and Chomsky's Hierarchy of Language Classes
EBNF and Regular Expressions exercise assigned
§4.2
21 LISP: List Processing — Data Structures §9.3
23 LISP: Functional Programming — Control Structures and Name Structures §10.1 - 10.3
24 LAB: Basic LISP
EBNF EXERCISE DUE
LISP Program 1 assigned
LISP Ch. 1 - 4
28 LISP: Implementation — Storage Reclamation §11.2 - 11.3
30 Pseudo-code Interpreters
Fortran: Syntactic Structure and Control Structures
The Compilation Process
Chaps. 1 & 2
Oct. 1 LAB: LISP — Recursion, Mapping, Iteration, Properties LISP Ch. 5 - 7, 11
5 Fortran: Data Structures and Name Structures
7 Algol-60: Structural Organization and Syntactic Structures §3.1 - 3.2 and §4.1
8 LAB: LISP, Editing, Loading, Printing, Reading, Debugging
LISP 2 assigned
LISP Ch. 8 - 10
12 Algol: Name Structures and Data Structures Control Structures; Parameter Passing Mechanisms §3.3 - 3.4
14 Algol: Control Structures and Parameter Passing Mechanisms §3.5, 4.3 - 4.4
15 NO LAB SESSION — Battle River Career Fair
LISP ASSIGNMENT 1 DUE
19 PL/I and Pascal — Data Structures §5.1 - 5.3
21 Pascal — Name Structures and Control Structures §5.4 - 5.5
22 LAB: LISP help session
26 NO CLASS SESSION — OOPSLA conference
Oct. 28 - 29 FALL BREAK
Nov. 2 MID-TERM EXAM
4 Algol
5 Implementation of Block-Structured Languages — Activation Records and Procedure Calls
LISP ASSIGNMENT 2 DUE
§6.1 - 6.2
9 Displays and Blocks §6.3 - 6.5
11 REMEMBRANCE DAY HOLIDAY
12 LAB: Activation Records Exercise assigned
16 Prolog: Programming in Logic
Automated Theorem Proving
§13.1
18 Prolog: Structural Organization and Control Structures — Unification and Backtracking
Nonmonotonic logic, negation, and equality
§13.2 and 13.4
19 LAB: Constructing Prolog Programs
ACTIVATION RECORDS EXERCISE DUE
Prolog Assignment 1 assigned
Prolog Ch. 1 - 2
23 Prolog: Data Structures §13.3 and 13.5
25 Ada: Abstract Data Types and Information Hiding
Syntactic Structures and Structural Organization
§7.1 - 7.2 and §8.2
26 LAB: Prolog lists and procedural algorithms
Prolog Assignment 2 assigned
Prolog Ch. 3 - 4
30 Ada: Data Structures, Typing and Name Structures §7.3 - 7.4
Dec. 2 Ada: Control Structures §8.1 and 8.3
3 LAB: Prolog help session
PROLOG ASSIGNMENT 1 DUE
7 Smalltalk: Classes and Subclasses §12.1 - 12.3
9 Smalltalk: Objects and Message Passing §12.4 - 12.7
10 LAB: PROLOG ASSIGNMENT 2 DUE
Saturday, Dec. 18 FINAL EXAM, 9:00 a.m. – 12:00 m., Gymnasium
 
Links
. Course Materials Index . Top of this Document . Instructor Contact Information
 
Copyright © 2002, 2003, 2004 Jonathan Mohr