CSC 533: Organization of Programming Languages
Spring 2005


2:00-3:15 TuTh
411 Old Gymnasium
Dr. David Reed
207 Old Gymnasium      x2583
DaveReed@creighton.edu



Text: Concepts of Programming Languages (6th ed.), Sebesta, Addison-Wesley, 2004.


Course Description

This course is concerned with the concepts and practice of programming languages. The first part of the course will focus on general programming language concepts such as binding, type checking, and parameter passing. The implementation of these concepts in different languages will be examined, with special attention paid to C/C++ and Java. The second part of the course will focus on different programming paradigms: procedural, object-oriented, and functional programming. C++, Java, and JavaScript will be studied as hybrid languages, combining both procedural and object-oriented features with varying design goals. Scheme will be studied as an example of a completely different programming paradigm, one which focuses on functional composition as opposed to state transformation or object interaction.

The specific goals of this course are:


Required Work

There will be approximately six homework assignments, most of which will involve programming. Assignments are due at the beginning of class on the date specified. Late assignments will receive 75% of full credit if they are handed in within one week of the specified due date. After one week, no credit will be given. In addition, there will be weekly quizzes, two 75-minute tests and a cumulative final exam.

There is no specific attendance policy for the course, although it is expected that absences will leave the student unprepared for tests and assignments. Quizzes and tests will not be rescheduled except in extreme circumstances. However, the lowest quiz grade will be dropped.

Grades will be determined as follows:

homework assignments 40 %
weekly quizzes 05 %
two 75-minute tests 30 %
(cumulative) final exam 25 %

At the minimum, traditional grading cutoffs will apply. That is, 90% is guaranteed an A, 87% is guaranteed a B+, etc. Depending on class performance, some shifting of grades (in an upward direction only) may occur as final letter grades are assigned.


Policy on Collaboration

The college policy on cheating and plagiarism is spelled out in the Student Handbook. In addition to this, the following guidelines hold pertaining to programs. Programs are to be the sole work of the student -- collaboration on the design or coding of a program is not allowed. Questions regarding homework assignments should be directed at the instructor only. Students may seek debugging assistance or clarifications on assignments via the class mailing list (accessible via Blackboard). Repeat: All student interactions regarding homework assignments must take place via email to the entire class!

Violations of this policy will be dealt with severely, with possible outcomes including failure in the course. In the case of programming assignments, you are encouraged to start early so that there is time to seek help from the instructor as the need arises.


Tentative Schedule

DATES
TOPICS
READINGS
HOMEWORK
Jan 13
Introduction, overview. (ppt)
(pdf)
Chapter 1 HW1: Due 1/25
18
20
Background, language paradigms,
   syntax, BNF grammars.
(ppt)
(pdf)
Chapter 2
25
27
Variables, bindings,
   stack vs. heap,
(ppt)
(pdf)
Chapter 5  
HW2: due 2/8
Feb 1
3
   scoping rules.
Data types, pointers,
(ppt)
(pdf)
Chapter 6
8
10
   memory management,
   structured data.
Chapter 7
15
17
Procedural and data abstraction,
   parameters, run-time stack.
(ppt)
(pdf)
Chapters 8 - 10
22
24
TEST 1
NO CLASS
Mar 1
3
Object-oriented-programming,
   abstract data types, classes.
(ppt)
(pdf)
Chapter 11 HW3: Due 3/24
 
8
10
SPRING BREAK
15
17
Java, design goals, execution model,
   classes/objects, reference types,
(ppt)
(pdf)
Chapter 12
22
24
   data structures.
OOP in Java,
(ppt)
(pdf)
Online  
HW4: Due 4/14
29
31
   abstract classes, interfaces,
   Java v. JavaScript.
Apr 5
7
TEST 2
in-class Java exercise
12
14
Functional programming,
   Scheme, atoms & lists,
(ppt)
(pdf)
Chapter 15
19
21
   conditionals, recursion.
Advanced Scheme, asssoc,
(ppt)
(pdf)
Online HW5: Due 4/29
 
26
28
   trees, I/O, OOP.
course overview
 
May 5
FINAL EXAM     (Thursday, 8:00 - 9:40)