Important Information
most recent information at the top
FINAL EXAM has been scheduled for: Tuesday, December 11th 7pm room ISAT/CS 136
Syllabus
Required Folder Cover
Required program submission information
Required Program header information
Useful URLs
Project Information
Lectures / Homework / Programming AssignmentsLecture 29 – December 6, 2007
Chapter 7 slides
Chapter 9 slides / l Study for final
l Put your project summary on your M drive as LanguageName.doc (do NOT use Word 2007), use Word 2003
Lecture 28 – December 4, 2007
Possible addendum information discussed in class can be found at the end of Lecture 28. / 1. put a file named ADDENDUM.doc or ADDENDUM.txt on your M drive which adds information about things you left out of your summary. It should be put up there by midnight tonight.
2. By Friday noon (not a minute later) your Summary sheets should be modified to include the Addendum information plus any other important information you omitted from the Summary sheets. You do not have to print them, you need to put them on your M drive as LanguageLastname.doc (e.g. AdaAdams.doc)
3. Begin reviewing for final and come in with questions for me. / none
Lecture 27 - November 29, 2007 / Read chapter 9 – fill in the output for the 4 .jpg links.
Summary sheets for your programming language project are due on Tuesday and will NOT be accepted late. / none
Lecture 26 – November 27, 2007 / Read chapter 7
Write a prolog program to solve either Agatha or the alternate problem and put it on your M drive. / Finish your Prolog Assignment on Blackboard
Lecture 25 - November 20, 2007 / read chapter 16 in our text
Have a happy thanksgiving
Drive safely / Prolog program on Blackboard
Lecture 24 - November 15, 2007 / learn the material in your text book in chapter 6 about array address computation
Lecture 23 - November 13, 2007
We will start Prolog on Tuesday -
You can download an interpreter pdprolog.exe from https://users.cs.jmu.edu/adamses/public / Both classes: write a recursive Lisp program to print out the elements on a list in reverse order. Put your program on your M drive, call it reverse.lsp, and bring a printout of it to class (no folder).
2pm class - here is the program we were working on at the end of class - figure out how to fix it. / Submission 3 for your language will be due soon (next Tuesday - i.e. before Thanksgiving) - work on iteration, selection and subprograms.
Lecture 22 - November 8th 2007
will be an assignment to be submitted electronically to Blackboard. There will be different versions for the 2 sections. Make sure you do the one for your section. It must be done and submitted during the class period for your section to earn any credit. I do NOT want printouts. If you do it in the classroom during that time, you may work in pairs otherwise it is to be an individual assignment. The TA will be present to take attendance. You should only submit one version for the two of you. Make sure you put both names in the comment field of your submission. / Find a good version of Eliza online and have fun talking to the psychologist. If
your interaction is really good, capture it and print it and bring it in. / Submission2 for your language project is now visible and due electronically Monday night by 11:59pm
Lecture 21 - November 6th 2007
pages 52-57 in our text are about LISP. / Read the lecture notes carefully BEFORE Thursday's class or you will have trouble completing the assignment in lieu of class in the allotted time. The notes are long and contain links to other documents / Submission2 for your language project is now visible and due electronically Monday night by 11:59pm
Lecture 20 - November 1st 2007
quiz / download xlisp.exe, xlispsml.exe from https://users.cs.jmu.edu/adamses/public / See Assignment on Blackboard which must be submitted by Monday night at 11:59pm
Lecture 19 – Go Over Exam
Lecture 18 – Exam
Lecture 17 – Oct 23
Lecture 16 – October 18
Again, I have merged all of the examples we went over in class into a single .txt file which is linked below. Two things to note:
1. almost none of the code is commented so you may have to work hard to figure out what it is doing and what the subtle differences are between examples with the same name and a different number. This is deliberate. You should make sure you understand them both for your program and for the exam.
2. all parameters in SNOBOL are passed by value so you can not do the kind of swap we were able to do in FORTRAN (by default) and in Pascal with VAR parameters.
In-Class Examples / study for exam on Thursday the 25th / continue working on assignment 8
Lecture 15 – October 16 / if you didn't already put the code for the program you bright to class (see assignment from October 11th) up on your N (or M drive – I don't remember which it is) please do so now to receive full credit for the assignment. / Start working on Assignment8 (Snobol program) which you need to submit to Blackboard.
Lecture 14 - October 11, 2007
Note: all of the Snobol programs referred to in the lecture notes have been merged into a single txt file which is linked below. In order to try them, you will need to save each one separately with the .sno extension.
Snobol Examples / · download a SNOBOL4 interpreter or compiler if you haven't already
· start working on project as soon as you know what your language is. E-mail me your choice from the list of available languages if it wasn't Python, Ruby or Perl.
· study the lecture notes and run all of the programs that are linked to them. there may be a quiz on the Snobol material in the notes or on the programs
· bring your books to class / See if you can write a snobol4 program to count the number of vowels in a line of text. Hint: look up how to form a pattern using ANY. Bring a printout to class. DO NOT submit it to Blackboard. DO make sure that it is available on your N drive.
Lecture 13 - October 9, 2007 is currently incomplete. / · problems 12 and 13 on page 247 of text. Do each on separate page. Bring to class on Thursday
· download a SNOBOL4 interpreter or compiler
· start working on project / Complete Chapter 5 outline - posted to Blackboard as Assignment 7 - submit by start of class on Thursday.
Lecture 12 – October 4, 2007
input files I tested previous program with. First one has blank lines at the end, second one doesn't.
infile.txt
infile2.txt / bring your books to class! / POSTED on Blackboard as SecondPascal – electronic version due Monday night (October 8th) by 11:59pm – paper version due at start of class on Tuesday, October 9th.
Lecture 11 – October 2, 2007
PointerTest.pp
linkedListTest.pp
chapter5 slides / · Complete the posted outline and submit it as Blackboard Assignment Review1.
· Read chapter 5 and begin filling in the chapter 5 outline
· Start playing with Pascal pointers. First run the programs attached to the notes. / None assigned yet
but one will be due NEXT Monday night by 11:59pm
POSTED on Blackboard as SecondPascal
Lecture 10 - September 27, 2007
· arith.pp
· eoftest.pp
· eoffile.pp
· string.pp / Read chapter 5 and come in with questions.
work on FirstPascal program / still FirstPascal
output clarification
Lecture 9 – September 25, 2007
· Questions re: FirstPascal with some answers / Things to Verify -- Assignment is on Blackboard and is due electronically by tomorrow night at 11:59 / Changes to FirstPascal program are on the Blackboard assignment in red.
Lecture 8 - September 20, 2007
p3.pp
showArray.pp
eoftest.pp / · Go over the lecture notes.
· Study the example programs.
· Start working on the programming assignment.
· Start reading chapter 5 / First Pascal Program can also be found on Blackboard under assignments.
Lecture 7 – September 18, 2007 / page 171 in text book - Problems 6a,b,c,8,10, 11 – Each problem is to be done on a separate page. Copy the problem to the top of the page. NOTE: if I can’t read what you’ve written, you get no credit / · re-submit first FORTRAN programming assignment on Blackboard if you previously submitted it zipped or to the drop box.
· do, finish, or improve your Alice programs and bring to class on Thursday.
Lecture 6 – September 13, 2007
contains information about Alice / · finish the Alice assignment you started in class and bring it to class on Tuesday, September 18th, 2007
Lecture 5 – September 11,2007
First program grade sheet
separate compilation in Force
code with compilation problems
fixed code / · review the lecture notes
· review the chapter2 and chapter2 slides (1-20)
· read Chapter 3 (sections 3.1 through 3.3) and study chapter 3 slides (1-21) / see Blackboard for Program2
Lecture_4 - September 6, 2007
links to code in the lecture
input data used to test Program1 / · review the lecture notes / Program _2
Lecture_3 - September 4, 2007
Array
DoLoop
SubroutineBefore
SubroutineAfter
ArithmeticIf
Function
LackOfReservedWords
Output
PassingArray
ImpliedDoLoop
ComputedGoTo
EndEquals
ErrorEquals
IntegerDivision
LoopIndexTest
ArrayDoLoopImpliedDoLoop / · Try messing around with the loop control variable in Java and see what happens
(i.e. change the loop control variable’s value inside the loop; make the ending value a variable and change it within the loop)
· Look at the ImpliedDoLoop program. You need it for your program
· Study the programs we didn’t have time for in class (i.e. read and run them) / please see the Blackboard announcement of what to turn in (submit and print)
Lecture_2 - Auaust 30, 2007
FORTRAN Information
Code examples discussed
TRAP.f
SOURCE1.f
CHARACTER2.F
IMPLIED_DO_LOOP.F
Final Exam Scheduled
Tuesday, December 11th, 2007
7:00pm room ISAT/CS 136 / · read chapter 1 of text
· run the sample programs / FORTRAN program 1 on Blackboard. It must be submitted to Blackboard by midnight September 5th and your folders with the hardcopy are due at the start of class on September 6th.
Blackboard has been activated. Here’s a copy of the assignment.
FORTRAN programming assignment 1.htm
Lecture_1 – August 28, 2007
FORTRAN Information
Ch01.ppt / · install FORTRAN
· check exam schedules
· make folder cover
· buy text
· think about which programming language you want to learn on your own.