CS 342 Lecture -*- Outline -*- * exam preparation for problem solving ** language vs. data structures available *** LISP: lists, sets, relations, queues *** Scheme: lists, sets, functions *** CLU: lists, points, polynomials, arrays, your own *** Smalltalk: lists, all kinds of collections, numbers, queues, your own *** Prolog: lists, your own ** langauges vs. kinds of problems that work well *** LISP list processing relational data bases *** Scheme polymorphism infinite data structures tool building *** CLU conceptual modeling abstract data types critical systems (can more easily verify) *** Smalltalk conceptual modeling simulation *** Prolog databases expert systems (rule based) search and pattern matching specification prototypes ** What kinds of things are not easily done in a given language? LISP: tool building mutation Scheme: mutation CLU: tool building Smalltalk: tool building functional programming Prolog: tool building