Lecture notes

 

November 29 – Lecture 24 -  Information about Language Presentations and handouts

                                            Textbook slides for:  Chapter 7,  Chapter 8,  Chapter 9 – which were discussed in class

                                            Talked about use of  ! (cut)  in Prolog – which prevents backtracking

                                             Talked about parameter passing modes – introduced pass by name which does a textual substitution.

                                             List of people who signed up to present on Dec. 6th.  Everyone else is scheduled for Dec. 1st

 

November 22 – Lecture 23 -  My Slides,  Captured Output from programs in my slides,

                                            algorithm for array element address determination,  Ada code  example to convert base 2 to base 10

     NOTE:  if you did not sign up to present on the second day (December 6th, you are presenting on the first day (December 1st)

 

November 17 – Lecture 22 – Textbook slides for Chapter 16,  My additional slides on Prolog with examples, Directions  for using PDProlog,

 

November 15 – Lecture 21 – Exams returned (keys will not be posted but if you work out a problem you got wrong, you may come to my office and compare your new answer with an answer key) 

Chapter 6  -  please continue reading the chapter and studying the slides.

PDPROLOG.exe is available in public directory  as is information and a setup for GNU Prolog.  You should download a version.

Read Chapter 16  section 16.4 through to the end of the chapter  (pages 666-692)

                                               

November 10 – Lecture 20 – Chapter 15 – Functional Languages  Chapter 6 – Data Types   

Result of dribble on fibonacci function along with function itself can also be found on blackboard under course documents

 

November 1 – Lecture 17 – Introduction to Lisp

 

October 27 – Lecture 16 – Introduction to Alice

 

October 25 – Lecture 15 – power point slides  containing additional information about program requirements  and some sample code.   Ada code examples from class

 

October 20 - Exam

 

October 18 – Lecture 14 – notes (including study guide for exam AND homework not due til next Tuesday but which will be useful in studying for the exam)

 

October 11 – Lecture 13 – notes with links to 3 Ada programs

 

October 6 – Lecture 12 – notes with links to two forms of Pascal file programs

 

October 4 – Lecture 11 – link to Dr. Grove’s notes : http://grove.cs.jmu.edu/cs430/

 

September 29 – Lecture 10 notes and links to programs illustrating use of Pascal records, files, pointers

 

September 27 – Lecture 9   notes and links to Sebesta slides, gradesheets, a program using Pascal’s sets

 

September 22 – Lecture 8   notes and links to Pascal code

 

September 20 – Lecture 7   notes

 

September 15 – Lecture 6    notes

 

September 13 – Lecture 5    slides   lecture notes

 

September 8 – Lecture 4 – programming assignment #2 – notes – code examples  note that these are also available directly from page that comes up when you click on CS430

 

September 6 – Lecture 3 – discussion of Homework #1  -  notes – sample FORTRAN program with subprograms

 

September 1 – Lecture 2 – FORTRAN notes  - requirements for: folder label,  program documentation,  program submission

 

August 30 – Lecture 1  -  Sebesta Chapter 1 slides -   Adams 12:30 class notes  -  3:30 class notes (courtesy R. Robinson)