Responses to
questions
- You
will not have to write any Ada code.
- Should
we know anything about Ada: we talked about its strong typing and
its parameter passing modes,
- It is
NOT safe to focus only on stuff since the last exam
- The
format of the exam will be similar to the midterm: you will have to be able to read code
in: FORTRAN, Pascal, Lisp, and Prolog and Snobol and to write code in those languages. You will need to be able to answer
questions about the way Alice
works.
- Reviewed
finding the location in memory of a 2 dimensional array element?
- Reviewed
the Ada
parameter modes
- Ada
parameter data modes:
- in - you can retrieve from an in parameter, but you
can’t store any thing in it.
- out
- is intended for storage – but can be used for retrieval
- x:= ____ store
- ___ := retrieve
- In
out - passing a value to be used in, and then smushed
and pushed out.
- usually
value result
- can
be reference
- Reviewed
pass by name
- How to
study:
- Look
at the notes and program examples on the web
- Review
the chapters and look at the questions at the end of each chapter
- Focus
on the items in the study guide
Going through study
guide
- Chapter
1 – referring to Chapter outline
- There’s
really nothing on the list (black or red) that isn’t important
- Alice had
concurrency – which none of our other languages had – in addition to
being a virtual reality
- APL
is the programming language that is hardest to read
- SETL
manipulates sets
- SNOBOL4
manipulates and processes strings very well and does pattern matching