[Return to Math 61 Homepage]
Math 61 Class Notes Listing Page
As of April 8, 1999, all the following class notes have been
reviewed. Cross references (and web links) have been updated.
References to the procedures using the server have been corrected as
needed. No further corrections are anticipated.
- Pascal/FORTRAN/C++ Overview/Review
- Notes 1: Addendum to Ess. of Data Str.,
Cpt 1
- Notes 2: Addendum to Ess. of Data Str.,
Cpt 2
- Notes 3: Addendum to Ess. of Data Str.,
Cpt 3
- Notes A: classes with Member
Functions
- Notes 4: Addendum to Ess. of Data Str.,
Cpt 4
- Notes B: Templates
- Notes 5a: Addendum A
to Ess. of Data Str.,
Cpt 5
- Ess. of Data Str., Cpt 6, will be covered after
Cpts 7 and 8.
- Notes 7a: Addendum A to
Ess. of Data Str., Cpt 7
- Notes App. C: Addendum to
Ess. of Data Str., Appendix C
- Notes 8: Addendum to Ess. of Data Str.,
Cpt 8
- Notes: Fortran-90/95 Pointers
- Notes 6: Addendum to Ess. of Data Str.,
Cpt 6
- Notes 7b: Addendum B to Ess. of Data
Str., Cpt 7
- Notes 10a: Addendum A to Ess. of Data
Str., Cpt 10
- Notes Lisp 1
- Notes Lisp Example
- Notes Lisp 2
- Notes 10b: Addendum B to Ess. of Data
Str., Cpt 10
- Notes App. E: Addendum to
Ess. of Data Str., Appendix E
- Notes 11: Addendum to Ess. of Data
Str., Cpt 11
- Notes 12: Addendum to Ess. of Data
Str., Cpt 12
- Notes 5b: Addendum B to Ess. of Data
Str., Cpt 5
- Notes 13: Addendum to Ess. of Data
Str., Cpt 13
- Since F&T does not address issues related to
memory management and garbage collection (as do other Data
Structures texts), there is no cross-reference page to the
topics covered in Ess. of Data Str.Cpt 14.
- Notes C: Dynamic Data Structures and Additional
Topics
- Notes D: Priority Queues
- Matrix-Vector Multiplication Routine
(Fortran-77) for sparse matrix storage scheme
This page is maintained by Dennis C. Smolarski, S.J.
Last updated: 6 March 2000.
![[Santa Clara University]](../images/top.gif){kind=small}
