Approximate Dates of Lectures:

• Thursday 8/30
  Go over syllabus and start Chapter 1. My overview slides
• Tuesday 9/4
  Start the slides from Sebesta Chapter 1, and started on slides for Chapter 2
• Thursday 9/6
  Continue with the slides on chapter 2.
• Tuesday 9/11

Class was cancelled.
• Thursday 9/13

Guest lecturer. Finished Chapter 2
• Tuesday 9/18

Begin covering the slides for Chapter 3.
Homework 1 due next Tuesday, 9/25: Exercises 15, 16 and 29 from pages 33-34, and exercise 13 from page 35. E-mail submission only!
Visionaries in Information Technology scheduled for October 9, 2001, 7:30am. Shuttle leaves Admin building at 7am. Call Lauren Blumberg at 410-455-1577 to register.

• Thursday 9/20
  Continue Chapter 3. The creator of Pascal, Modula, and several other languages is Professor Niklaus Wirth
  Homework 2 due next Thursday 9/27: Exercises 3a, 4a, 4b,4c, and 5 from page 149. Hardcopy submission.
  
• Tuesday 9/25
  Continue with Chapter 3
  
• Thursday 9/27
  Continue Chapter 3, and design a small programming language. See gl.umbc.edu/~nicholas/pub/331/grammar.
  
• Tuesday 10/2
  Finish Chapter 3. I'll discuss some of the material in Chapter 4, and maybe begin slides for Chapter 5. Assign Homework 3.
  
• Thursday 10/4
  Finish Chapter 5.
  
• Tuesday 10/9
  Start on slides for Chapter 6.
  
• Thursday 10/11
  Continue Chapter 6, and discuss the Scripting Languages paper by John Ousterhout.
  
• Tuesday 10/16
  There are several sets of slides on Java now available. There is an Introduction to Java, Java Basics Part 1, Java Basics Part 2, a review of Objects and Variables, an overview of the Java API, and GUI building with the AWT Still more Java. Return Homeworks 1 and 2.
• Thursday 10/18
  More Java. Code for the echo.java example is available.
  To prepare for the exam, I suggest looking at the sample exam from a previous semester, still on the web. Also, think about ways in which assigned homework problems could be modified to make exam questions. Become more familiar with end-of-chapter exercises that were not assigned as homework. The exam will focus on material that is in the book and was covered in class. I am not interested in testing for obscure detail that was not covered in class.
  
• Tuesday 10/23
  Return Homework 3. More Java.
• Thursday 10/25
  More Java.
  
• Tuesday 10/30
  Midterm exam
• Thursday 11/1
  Return midterms. More Java. Assign the Java project:
  Java Project, due in class Tuesday, November 20
  Create a Java class to support arithmetic for real polynomials in a single variable. Recall that a real polynomial is either 0, a single term consisting of a real coefficient and an integer exponent, or the sum of two or more such terms. For simplicity, we will assume that exponents are positive integers. The choice of an internal representation is up to you, but one possibility is a list of ordered pairs, where each ordered pair is of the form (coefficient, exponent). The coefficient may be a Java real, and the exponent will be a Java integer. Create a Java class for polynomials that includes member functions to create a polynomial, print a polynomial, add one polynomial to another, and compare a polynomial to zero. The terms of a polynomial should be printed in decreasing order by exponent. When adding, terms of like degree should be added, e.g. (x^2+2x) + (x^3+3x) = x^3+x^2+5x.
  You will need to demonstrate the correctness of your implementation by creating a program that constructs four polynomials, i.e.
  p1 = ((3,4),(5,3),(1,2),(4,0)) which is 3x^4+5x^3+x^2+4
  p2 = ((4,5),(2,1)) which is 4x^5+2x
  p3 = ((-2,2),(3,1),(6,0)) which is -2x^2+3x+6, and
  p4 = ((0,0)) i.e. the zero polynomial.
  Your program must demonstrate printing of all four, the sums p1+p2, p3+p4, p2+p3, and the comparison of all four to zero. The comparison function should be a boolean function, with false values for p1, p2 and p3 and true for p4.
  For extra credit, add a polynomial multiplication function, and demonstrate p1*p2, p3*p4, and p2*p3.
  
• Tuesday 11/6
  Guest Lecturer Dr. Scott Cost.
  Continue covering Java. Code for the envSnoop.java example is available.
  A copy of the Windows 98 Java Development Kit is available here. This file is a little more than twenty megs in size.
  Documentation for the Java API is available here.
  Java software for other platforms, and more documentation, is available at the Javasoft site.
  
• Thursday 11/8
  Continue the Java slides.The slides on event loops and the slides on inner classes and the slides on the model-view-contoller design pattern are now available.
  
• Tuesday 11/13
  Go over the Java needed for the project. The program sample.java that demonstrates I/O from standard input is now available.
  More Java. Examples of networking programs.
• Thursday 11/15
  More Java.
  
• Tuesday 11/21
  More Java. Covered the slides on Applets and the slides on the AWT package for GUIs
  
• Thursday 11/22
  Thanksgiving holiday
• Tuesday 11/27
  Begin slides on functional programming, and probably begin the slides for ML. I can also suggest that you read Chapter 15 of the textbook. The slides are available.
  
• Thursday 11/29
  Professor Tim Finin gives a lecture on Lisp. I have some more slides on Lisp
, followed by even more Lisp slides. I hope to demo emacs on the PC, including use of Lisp in emacs. The Lisp tutorial that comes with Common Lisp. If you want to install Common Lisp on your own PC, check out this ftp site.

• Tuesday 12/4
  Continue discussing the functional language ML. There is a version of SML for Windows 95/98/NT in the form of a 5 megabyte self-extracting archive. I strongly recommend letting the system be installed in the default (C:\sml) directory. The example ML program that shows tree traversal is available. The abstract syntax tree handout is now available. The polynomial project handout is available as poly.sml, and the output is polyOutput. The examples LoopIt and factorial comparison are now available.
  ML Project, due by 11:59pm Tuesday, December 11, by email to nicholas@umbc.edu
  Modify the tree traversal example as follows: (1) add a function that prints the number of nodes in the tree, (2) add a function that prints the tree in postorder (i.e. left subtree, right subtree, operator) and (3) add a function that evaluates the tree. An empty tree has zero nodes, and a tree consisting of a single leaf has one node. Assume that the multiplication, addition, and subtraction operators work as usual. Test your program on at least these four trees:
  val t1 = empty;
  val t2 = leaf(4);
  val t3 = node("*",node("+",leaf(5),leaf(3)),node("-",leaf(10),leaf(4)));
  val t4 = node("*",node("+",node("*",node("-",leaf(10),leaf(2)),leaf(6)),node("-",leaf(10),leaf(4))),leaf(2));
  Note: t3 should evaluate to 48, and t4 should evaluate to 108.
  You should use either Linix or Solaris to run SML. I don't have enough disk space to install SML on IRIX as well.
  To use SML on Linux, issue the following command at the shell prompt, as shown in this example:
  linux2.gl.umbc.edu> ln -s ~nicholas/../pub/331/smlnj.linux/bin/sml .
  I have also installed SML on solaris.gl. To use this version of SML, you may issue the following command at the shell prompt:
  solaris1.gl.umbc.edu> ln -s ~nicholas/../pub/331/smlnj.solaris/bin/sml .
  
• Thursday 12/6
  Finish ML. If time permits, I may present an introduction to Smalltalk. The slides for a Brief Overview of Smalltalk are available. If time permits, a demo of Squeak.
  You can read more about Squeak on the Squeak Home Page.
  The latest version of Squeak, Squeak 2.8, is available in zipped form. Squeak2.8 for Windows and NT.
• Tuesday 12/11
  Preview of final exam. Maybe a demo of Smalltalk.
• Wednesday 12/12
  Join industry visionaries, UMBC faculty and students, and corporate partners from throughout the Baltimore/Washington region for the UMBC Visionaries in Information Technology Forum. Share ideas on the future information technology and its critical role in shaping the modern business environment.
  The second breakfast in our series will feature remarks from Mark Hess, vice president of Digital Television at Comcast. Hess began his career in 1982 with TCI managing cable systems in various states and eventually becoming VP for all their systems in New York. He also joined the Sega channel and proceeded to get numerous arrows in his back helping to launch and eventually shut down the pioneering television service. Hess is a true visionary in the Broadband Communication sector and highly respected in the industry.
  This event is free!!! Continental breakfast included! The event will be held on December 12th from 7:30-9:30 a.m. at the BWI Airport Marriott. To RSVP, e-mail lauren@umbc.edu or register online at: http://www.umbc.edu/business/it.html Over 200 outside employers, UMBC staff and faculty attended the October event, we look forward to an even bigger turnout for December!
  
  Final Exam Preview
  The emphasis will be on material covered since the midterm, although topics from before the midterm are fair game.
  • Java and ML, and a little bit of Lisp
  • A program trace involving some sort of graph algorithm is possible.
  • Coding of small functions in Java or ML
  • The final will be similar to the midterm with respect to length and type of questions.

  I will allow you to bring a single page of notes to the Final Exam. One sheet of 8 1/2 by 11 paper, written on only one side. The exam is otherwise closed book.
  
  

• Thursday 12/13, 1-3pm, AC IV 015, Final Exam

Web resources

Free Compilers and Interpreters

Microsoft's Powerpoint Viewer for Windows 95/98 and NT