Lectures -- CS 241 Data Structures 2010

• CS 241 Lecture 26, 4/30 The last lecture , ever!
• CS 241 Lecture 25, 4/25 Time vs space , and Images
• CS 241 Lecture 24, 4/18 support , for your programming efforts.
• CS 241 Lecture 23, 4/16 Bioinformatics & , the File class.
• CS 241 Lecture 22, 4/11 Bioinformatics & , directed by your questions.
• CS 241 Lecture 21, 4/9 Nary review, directed by your questions.
• CS 241 Lecture 20, 4/2 lab, and trading space for time.
• CS 241 Lecture 19, 3/21 game trees implementation
• CS 241 Lecture 18, 3/19 nary trees and game trees
• CS 241 Lecture 17, π Day! painting a tree and heapsort
• CS 241 Lecture 16, 3/12 mid feedback and trees again
• CS 241 Lecture 15, 3/12 trees! binary tree and BST
• CS 241 Lecture 14, 2/28 implementation details
• CS 241 Lecture 13, 2/26 bugs and debugging
• CS 241 Lecture 12, 2/21 Various sorts - quick, merge, radix and table(counting) sort pseudocode
• CS 241 Lecture 11, 2/19 abstract classes - and interfaces
• CS 241 Lecture 10, V-day Sorts - Selection and insertion sort, and analysis thereof
• CS 241 Lecture 9, 2/12 FSA - Infix feedback, abstract classes, FSA
• CS 241 Lecture 8, 2/7 Abstraction - Interfaces and abstract classes
• CS 241 Lecture 7, 2/5 Big O! - Bubble sort, big-O notation, timing an algorithm, Fibonacci
• CS 241 Lecture 6, 1/31 Expressions - Postfix expression evaluation (in service of infix expression evaluation)
• CS 241 Lecture 5, 1/29 Timing - Last life hints, timing random sort
• CS 241 Lecture 4, 1/24 Life II (again) - Deep copy, comparison, and file input
• CS 241 Lecture 3, 1/22 Life II - Graphics and infinite loops
• CS 241 Lecture 2, 1/17 Intro II - Introduction/Life
• CS 241 Lecture 1, 1/15 Intro - Introduction/seeding