Wednesday, January 6, 2016

Data Structures: Arrays (Dynamic)

Dynamic Arrays:

(1) Can be restricted on the fly.
(2) Size can be specified in terms of a variable. Therefore, not known until run-time.

Q. What do we have to hold space for in every Activation Record.
A. Local variables(usr var's), old program counter (where to return back), base pointer, top pointer, temporary variable (automatically created),


Q. What is a dynamic chain in respect to activation record?
A. when you point back to the environment where you have been called.


Q. What is a "Dope Vector"?
A. Any information we need during the runtime, all the information is stored inside the DopeVector.



Q. What kind of other relevant information be stored in Dope Vector?
A.



Q. If compiler writer was care less, it may lead to garbage issues and memory wasn't de-allocated at the rite time.
A. There has to be appropriate code for de-allocation in the compiler or else how would anyone know the generated code is leading to garbage.



Talked about the resumption model in pl1 (known as try{} catch{} block in .net)

Fortran Flat Memory Model:- is contrasted to the stack memory model.

Fortran didn't support recurssion because of the flat memory model. We know how much memory is required at the compile time. and all the functions. All the varriables are static in nature.


Realization: Students listining in the class what leads to the feedbacks from student. How much does the teacher in class motivates student to input + process. A student motivated by the teacher would have developed a way of inputing and processing, be able to follow the thinking process.
input + processing v.s input only (then Process powerfully)




No comments: