CS451: Week Eleven

CS 451 Programming Paradigms
Week Eleven

Lecture 21 : Tuesday, 4/4/00

Discussed recursive path algorithm for graph search
"BagOf" for generating children of states
Discussed abstract data types for queue, stack, and priority queue
Gave example of creation and use of heuristics for priority queue search
Discussed use of cut (!) for memory management in recursive searches
Showed pattern matching over expanded and complex patterns
Introduced meta-predicates (e.g. functor, clause)
Reminder that Java assignment (as well as both PROLOGs) are available to start on

Lecture 22 : Thursday, 4/6/00

Discussed origins of Java
Discussed virtual machine and bytecode design for platform independence
Discussed programming philosophy of Java
Discussed briefly how (and how well) Java handles each of the issues it attempts to address
Discussed some possible misconceptions about Java
Went through most of the basic details of using the language
This included coverage of most basic syntactic features (similar to C++)
As well as some of the library packages available
Compared the major differences with C++
A significant difference discussed was the use of interfaces instead of multiple inheritance
The notes from this lecture are on the web
See Java Introduction