CP2001 Data Structures [Lecture Notes]

week 1

• Wednesday, February 28 - Introduction to CP2001
• Thursday, February 29 - Introduction to C
• Friday, March 1 - C Statements

week 2

• Wednesday, March 6 - Variables and Name Spaces
• Thursday, March 7 - Addresses and Arrays
• Friday, March 8 - The Preprocessor and Calling Mechanisms

week 3

• Wednesday, March 13 - Structs, Typedefs, and Calling Mechanisms
• Thursday, March 14 - C style
• Friday, March 15 - Strings

weeks 4-10

(Nota Bene: The paper PostScript version of the following notes is also available in the Reserve Section of the JCU Library)
• I/O and Unix C Library Calls (HTML) (PostScript)
• Structures in C (HTML) (PostScript)
• Abstract Data Types (HTML) (PostScript)
• Analysis of Algorithms (HTML) (PostScript)
• Linear Data Structures (HTML) (PostScript)
• Lists and Generalised Lists (HTML) (PostScript)
• Dynamic Memory Allocation (HTML) (PostScript)

week 10

• Wednesday, May 8 - Quiz 1
• Thursday, May 9 - Introduction to Trees
• Friday, May 10 - No class

week 11

• Wednesday, May 15 - Heaps and Binary Search Trees
• Thursday, May 16 - More Fun with Binary Search Trees
• Friday, May 17 - Balanced Binary Trees

week 12

• Wednesday, May 22 - 2-3 Trees, Tries, Table ADT
• Thursday, May 23 - Hash Tables
• Friday, May 24 - Hash Tables Continued

week 13

• All lectures combined - Sorting

Copyright © 1996 Olivier de Vel and Curtis Dyreson. All rights reserved.