Monash University > School of Computer Science and Software Engineering > CSE1303s > Part B > Lectures
Lecture notes will appear here as they become available.
Formats available include:
| |
Overview & Revision | PPT format PDF format |
| Pointers | PPT format PDF format | |
| Stacks | PPT format PDF format | |
| Queues | PPT format PDF format | |
| Lists & ADTs | PPT format PDF format | |
| The example and explanation is available | DOC format PDF format | |
| Dynamic Memory | PPT format PDF format | |
| Nodes and Linked Structures | PPT format PDF format | |
| Linked Stack and Queues | PPT format PDF format | |
| Additional examples available for lectures 6 - 8: | DOC format PDF format | |
| Linked Lists | PPT format PDF format | |
| Elementary Algorithms | PPT format PDF format | |
| Recursion | PPT format PDF format | |
| Binary Trees | PPT format PDF format | |
| Information Retrieval | PPT format PDF format | |
| Hash Tables | PPT format PDF format | |
| Collision Detection | PPT format PDF format | |
| Recursive Sorting | PPT format PDF format | |
| Revision | PPT format | |
Last modified 2002-02-14