![]() |
Welcome to
Data Structures! |
|
|
Last Update |
Documents |
Online Lecture |
|
|
Online: Review: Pointers: There will be a quiz to check understanding. |
2008-06-11 |
☻ |
||
|
Online Review: Using Visio for Memory Maps |
2008-06-11 |
|
☻ |
|
|
Lab 1: Sorting Experiments and the Big-O |
2008-06-11 |
|
☻ |
|
|
Lecture:
Simple Sorts: Selection |
|
|
☻ |
|
|
Lecture:
Simple Sorts: Insertion |
|
☻ |
||
|
Online Lecture: Quantifying Efficiency: The Big-O: There will be a quiz to check understanding. |
2007-09-06 |
☻ |
||
|
Lecture:
qsort( ) |
2007-09-26 |
|
☻ |
|
|
Lab 2: Sorting with qsort( ): There will be a quiz to check understanding. |
2008-09-17 |
|
☻ |
|
|
Lecture
and Online Review: Recursion |
2007-09-13 |
☻ |
||
|
Lecture and Online Review: Merge Sort |
2007-09-13 |
☻ |
||
|
Lab 3: Sorting with Merge Sort |
2008-09-23 |
|
☻ |
|
|
Lecture and Online Review: Inheritance / Virtual Functions |
2008-09-26 |
|
☻ |
|
|
Lecture and Online Review: Linked Lists: Overview |
2008-09-26 |
☻ |
||
|
Lecture and Online Review: Linked Lists: Adding at Head |
2008-09-26 |
☻ |
||
|
Lecture and Online Review: Linked Lists: Adding at Tails |
2008-10-01 |
☻ |
||
|
Lecture and Online Review: Linked Lists: Friendship BAD; Nesting GOOD |
2008-10-05 |
|
☻ |
|
|
Lecture:
Linked Lists: Using Recursion with Reference
Arguments / Return Values |
2008-10-05 |
|
☻ |
|
|
Lab 4: Implementing Linked List Code |
2008-10-07 |
|
☻ |
|
|
Lecture: Templates and the STL |
2008-10-19 |
|
☻ |
|
|
Lab 5: Using the STL vector Container |
2008-10-21 |
|
☻ |
|
|
Online and Lecture: Stack Uses: Parse, Reverse, Postpone, Backtrack |
2007-10-10 |
Introduction:
PDF |
☻ |
|
|
Lecture: Stack Implementation: Array or Linked List |
|
|
|
☻ |
|
Lecture: Inheritance to implement Stack |
|
|
|
☻ |
|
Lecture:
Review: Operator Overloading: < == > |
2007-10-10 |
|
☻ |
|
|
Lab 6: Spell Checking using the STL |
2008-11-13 |
|
☻ |
|
|
Online: Trees: Introduction: There will be a quiz to check understanding. |
2007-11-05 |
☻ |
||
|
Lecture: Trees: Binary: Expression |
2007-11-05 |
|
☻ |
|
|
Lecture: Trees: Binary Search |
2007-11-05 |
|
☻ |
|
|
Online:
Trees: Binary Search: Traversal:
preorder, inorder, postorder |
2007-11-05 |
☻ |
||
|
Lecture: Searching Lists: Linear / Binary / Trees: Binary Search: Searching |
2007-11-14 |
|
☻ |
|
|
Lecture and Online: Hash Tables |
2007-11-14 |
☻ |
||
|
Lab 7: Hash Function |
2008-11-11 |
|
☻ |
|
|
Lecture: Tree Variations: B-Tree |
2008-11-19 |
|
☻ |
|
|
Lecture: Tree Variations: Heap |
2007-11-19 |
|
☻ |
|
|
Lecture: Tree Variations: Trie-Tree |
2008-11-19 |
|
☻ |
|
|
Final Project: Concordance Generator |
2008-11-19 |
|
☻ |
|
|
Date of Posting |
|
|
|
Previous First Quiz |
2008-06-14 |
|
|
|
Previous Midterm |
2008-06-14 |
|
|
|
Quiz 1 |
2008-09-22 |
|
|
|
Midterm |
2008-11-13 |
|
|
|
Quiz 2 |
2008-11-19 |
|