* TA office hours next week Wednesday June 13, 11am-1pm
* Check the FAQ page for A2 (link on the website)

* Recursion: recursive fib  was really inefficient!
      Let's do a non-recursive version.
      How to make the recursive function efficient?

    will get back to recursion when working with LinkedList/Trees

* memory model/tracing code?
  Debugging in Dr Java
  Memory Model:
	Heap for:
           Static information (Class & Interface boxes)
           Instance information (Objects boxes)
        Stack for
	   Storing method information (run time information like
           line number, local variables, parameters,...) 
            
       How to find variables and methods the program refers to?
       Be careful with:
	* Overloading (method with same name different signature): 
		easy to find by looking at parameters
  	* Shadowing   (variable or static methods with same signature):
		look at type of object or the way it's casted

  	* Overriding (non-static methods with the same signature):
		only "super" can be used to access the overridden method!

Next week we will finish time analysis quickly and will see how to implement 
linked lists (read the slides and come prepared).