A comparative study of programming languages designed to provide the following: (1) An understanding of language features and limitations; (2) An increased ability to learn new languages; (3) An understanding of the theoretical foundations of languages and the significance of implementation, and (4) An improved background for choosing and using different programming languages.
Instructor: Rebecca Bruce
| Week of | Lectures & Reading | Assignments | Exams |
| Aug 16 | Language Design
& History
Chapter 1 |
||
| Aug 23 | Compilers,
Interpreters & Bindings
Chapter 2 |
||
| Aug 30 | Compilers & Language Syntax
Chapter 3 |
Assignment 1 | |
| Sep 6 | Formal Language Models
Chapter 4 |
Assignment 2 | |
| Sept 13 | Algorithm Complexity & Using XML
(XML presented by Stair & Shurtleff: Examples, Slides) Sample First Exams |
Assignment 3 | |
| Sept 20 | Review of Exam 1 | Exam 1 | |
| Sept 27 | Elementary Data
Types & FORTRAN
Chapter 5 & Appendix 4 Ada example, Java example (Fortran presented by Roddenberry, Pritchitt & Bryan: Webpage) |
Assignment 4 | |
| Oct 4 | Structured Data Types & Ada
Section 6.1 & Appendix 1 (Ada presented by Smith, Roberts & Wagner: Slides) |
Assignment 5 | |
| Oct 11 | Fall Break: No Class | ||
| Oct 18 | Abstract
Data Types,
Inheritance & Smalltalk
Section 6.2, Chapter 7 and Appendix 12 Dynamic Binding Example (Smalltalk presented by Shreve & Dungan: Slides) ) |
Assignment 6 | |
| Oct 25 | Sequence
Control & Prolog
Chapter 8 & Appendix 11 (Prolog presented by Chapman, Hunt & Scharf: Slides & Directory with examples) |
Assignment 7 | |
| Nov 1 | Subprogram Control & ML
Chapter 9 & Appendix 7 Sample Second Exams (ML presented by Brown & Stanley: Slides) |
Assignment 8 | |
| Nov 8 | Review of Exam 2 | Exam 2 | |
| Nov 15 | Subprogram
Control (continued) Chapter 9 (Scheme presented by Sparks, Calloway & Deshaies: Scheme material ) |
Assignment 9 | |
| Nov 22 | Thanksgiving Break: No Class | ||
| Nov 29 |
Storage Management, Chapter 10:
Real Media Presentation Accompanying PowerPoint slides (A free copy of RealPlayer can be downloaded from the real.com web site.) |
||
| Dec 6 | Catch up & Review for Final | ||
| Dec 13 | Final Exam | Final Exam |
| Exam grades | 100 x 2 | 200 |
| Assignment grades | 25 x 8 (1 assignment grade is dropped) |
200 |
| Presentation grades | --- | 50 |
| Final Exam grade | --- | 150 |
| Total Points | --- | 600 |
Lectures: A roll is not taken. Students are expected to attend all class lectures. Failure to do so will be considered a lack of interest in success on the part of the student.
Exams: If you must miss an exam due to illness you must telephone or send email before the scheduled time and perhaps something can be arranged to avoid a zero for this exam. Failure to notify me prior to the scheduled time will produce an automatic zero for the exam.
The programming projects assigned in this class are your way of telling me about your mastery of this course. Because this is a course about writing programs you are expected to take these assignments very seriously. Your programs must be clearly different than those turned in by others in the class and represent a unique and special effort on your part.
Return to the UNCA Computer Science home page