CSE 310 Fall 2003
Data Structures and Algorithms
Archived Class
Charles Cusack
Computer Science and Engineering
University of Nebraska--Lincoln
Main
Schedule
Grading
Gradebook

Policies
Advice
College
    Policies

Notes
Programs

CSCI 255
Others

Admin
previous     next     today     future     all    

Schedule for weeks 1 through 17

Wk Day Date TopicResourcesEvents

1MonAug 25
  • Introduction to the Course

  • WedAug 27
  • Algorithms and Problem Solving
  • IDAA 1.1-1.3

    FriAug 29
  • Fundamental Data Structures
  • IDAA 1.4
  • Data Structures Notes
  • Graphs and Trees Notes
  • Data Structures Examples

  • Fri
  • Introduction to Recitation
  • Discuss Pretest Questions

  • 2MonSep 01
  • Labor Day
  • No Class

  • WedSep 03
  • Analysis of Algorithms
  • Complexity Classes
  • IDAA 2.1-2.2
  • Algorithm Analysis Notes
  • Asymptotic Notation Notes

  • FriSep 05
  • Complexity of Algorithms
  • IDAA 2.3
  • Proving Bounds Examples
  • Pretest Due

  • Fri
  • Discuss Pretest Questions

  • 3MonSep 08
  • Analysis of Recursive Algorithms
  • Recurrence Relations
  • IDAA 2.4-2.5
  • IDAA Appendix B
  • Algorithms and Recurrences Examples
  • Recurrence Relations Notes

  • WedSep 10
  • Solving Recurrence Relations
  • IDAA Appendix B
  • Solving Recurrence Relations Examples

  • FriSep 12
  • Wrap up Algorithm Analysis

  • Fri
  • WS 1

  • 4MonSep 15Brute Force:
  • Sorting (Selection and Bubble)
  • Searching (Sequential)
  • IDAA 3.1-3.2

    WedSep 17
  • Brute Force: Convex Hull, Closest Pair
  • IDAA 3.3
  • HW 1 due

  • FriSep 19
  • Brute Force: Exhaustive Search
  • IDAA 3.4

    Fri
  • Quiz 1

  • 5MonSep 22Divide-and-Conquer:
  • Sorting (Quick and Merge)
  • Searching (Binary)
  • IDAA 4.1-4.3
  • Sorting Notes

  • WedSep 24
  • Divide-and-Conquer: Binary Tree Traversal
  • IDAA 4.4

    FriSep 26
  • Divide-and-Conquer: Strassen's algorithm and Closest Pair
  • IDAA 4.5-4.6

    Fri
  • WS 2

  • 6MonSep 29Decrease-and-Conquer:
  • Sorting (Insertion)
  • Searching (BFS)
  • IDAA 5.1-5.2
  • BFS and DFS Notes
  • HW 2 due

  • WedOct 01Decrease-and-Conquer:
  • Searching (DFS)
  • Sorting (Topological)
  • IDAA 5.3

    FriOct 03
  • Decrease-and-Conquer: Constant Factor
  • IDAA 5.5

    Fri
  • WS 3

  • 7MonOct 06
  • Decrease-and-Conquer: Variable Size
  • IDAA 5.6

    WedOct 08Transform-and-Conquer:
  • Sorting (pre sorting)
  • Searching (Trees)
  • IDAA 6.1,6.3

    FriOct 10
  • Transform-and-Conquer: Heaps and Heapsort
  • IDAA 6.4
  • Sorting Notes
  • HW 3 due

  • Fri
  • Quiz 2

  • 8MonOct 13Transform-and-Conquer:
  • Horner's Rule
  • Binary Exponentiation
  • IDAA 6.5

    WedOct 15
  • Transform-and-Conquer: Reductions
  • IDAA 6.6

    FriOct 17
  • Everything
  • Review for Midterm

  • Fri
  • WS 4

  • 9MonOct 20
  • Fall Break
  • No Class

  • WedOct 22
  • Everything
  • IDAA 1-6
  • Midterm Exam

  • FriOct 24Space-Time Tradeoffs:
  • Counting Sort
  • Radix Sort
  • IDAA 7.1
  • Sorting Notes

  • Fri
  • Fall Break
  • No Class

  • 10MonOct 27Space and Time Tradeoffs:
  • Hashing
  • IDAA 7.3
  • Hashing Notes

  • WedOct 29Space and Time Tradeoffs:
  • B-Trees
  • IDAA 7.4

    FriOct 31

    Fri
  • WS 5

  • 11MonNov 03Dynamic Programming:
  • Matrix Chain Multiplication
  • Knapsack Problem
  • Dynamic Programming Notes
  • IDAA 8.4
  • HW 4 due

  • WedNov 05Dynamic Programming:
  • Warshall's Algorithm
  • IDAA 8.2
  • Warshall's Algorithm Notes

  • FriNov 07Dynamic Programming:
  • Floyd's Algorithm
  • Floyd's Algorithm Animation

  • Fri
  • WS 6

  • 12MonNov 10Greedy Technique:
  • Fractional Knapsack
  • Huffman Encoding
  • IDAA 9.4
  • Greedy Algorithms Notes

  • WedNov 12Greedy Technique:
  • Prim's Algorithm
  • IDAA 9.1
  • Minimum Spanning Trees Notes
  • Spanning Tree Animations

  • FriNov 14Greedy Technique:
  • Kruskal's Algorithm
  • IDAA 9.2

  • Fri
  • Quiz 3

  • 13MonNov 17
  • P and NP
  • IDAA 10.3
  • P, NP, NP-Complete Notes

  • WedNov 19
  • NP-Complete
  • IDAA 10.3
  • P, NP, NP-Complete Notes
  • HW 5 due

  • FriNov 21
  • Languages
  • Grammars
  • Regular Expressions
  • Languages, Grammars, and Regular Expressions Notes

  • Fri
  • WS 7

  • 14MonNov 24
  • Finish Grammars
  • Finite State Machines
  • Finite State Machines Notes

  • WedNov 26
  • Thanksgiving Break
  • Stuffing
  • No Class

  • FriNov 28
  • Thanksgiving Break
  • Turkey
  • No Class

  • Fri
  • Skip Day
  • No Class

  • 15MonDec 01
  • Finite State Automata
  • Finite State Machines Notes
  • FDA Applet

  • WedDec 03
  • Halting problem
  • Halting Problem Notes

  • FriDec 05
  • Turing Machines
  • Distributed Algorithms
  • Introduction to Turing Machines
  • Turing Machine Simulator
  • Sample Program
  • SETI@home
  • Distributed.net

  • Fri
  • Quiz 4

  • 16MonDec 08
  • Distributed/Parallel Algorithms
  • HW 6 due

  • WedDec 10
  • Review for final

  • FriDec 12
  • Review for final

  • Fri
  • WS 8

  • ExMonDec 15
  • Final Exam 7:30am
  • Final Exam