Computer Science III Spring 2008

Lect # |
Tuesday |
Thursday | ||

1 | 1/15 | Introduction and Python Built-in Collections (sections 1.1-1.4.1) | 1/17 | Python Control Structures (section 1.4.2) |

3 | 1/22 | Python Files and Functions (section 1.4.3) | 1/24 | Python Classes (section 1.4.4-1.5) |

5 | 1/29 | Stack ADT and implementation (sections 2.1-2.3.3) | 1/31 | Stack Applications (sections 2.3.4-2.3.7) |

7 | 2/5 | Queue ADT and implementation (sections 2.4.1-2.4.3) | 2/7 | Queue Applications (sections 2.4.4-2.4.5.3) |

9 | 2/12 | Deque ADT, implementation, and Application (sections 2.5) | 2/14 | List ADT and linked list implementation (section 7.2) |

11 | 2/19 | 2/21 | Test 1 | |

13 | 2/26 | Recursion and Run-time stack (sections 3.1-3.3) | 2/28 | Application of recursion and divide-and-conquer algorithms (sections 3.4) |

15 | 3/4 | Dynamic Programming (section 7.3) | 3/6 | Algorithm Analysis and searching (sections 4.1-4.3) |

17 | 3/11 | Hash Tables (section 4.3) | 3/13 | Simple Sorts (section 4.4) |

3/18 | Spring Break |
3/20 | Spring Break | |

19 | 3/25 | Advanced Sorts (section 4.4) | 3/27 | Test 2 |

21 | 4/1 | Tree ADT and implementation (sections 5.1-5.4) | 4/3 | Binary Tree applications and traversals (section 5.5) |

23 | 4/8 | Binary Search Tree ADT and implementation (section 5.6) | 4/10 | Priority Queue ADT and heap implementation (section 5.7) |

25 | 4/15 | Advanced Tree applications | 4/17 | Graph ADT and implementations (sections 6.1-6.3) |

27 | 4/22 | Graph Algorithms | 4/24 | Graph Algorithms |

29 | 4/29 | File structures | 5/1 | Review for Final |

Final: Thursday, May 8 from 10-11:50 AM in ITT 322 |