SE 240 Algorithms and Data StructuresSoftware Engineering (2009-2010)
Design and analysis of data structures and algorithms. Comparison of algorithms on data structures, including operations on sets (balanced search trees, hashing), sorting and priority queues, and graphs. Algorithmic paradigms including greedy algorithms, divide and conquer, dynamic programming, graph exploration, backtracking, and branch and bound. Mathematical analysis of space and time complexity. Overview of NP-completeness. [Offered: S]
Prerequisites: SE 112, STAT 206; Software Engineering students only.
Antirequisites: CS 240, CS 341/CM 339, ECE 250
Sections For Fall 2009
SE 240 is not held in Fall 2009
Sections For Spring 2009
Note: Choose TUT section for Related 1.
| Lectures | ||||||||
| Professor | Time | Capacity | Sec | Assoc | Rel 1 | Rel 2 | Location | Code |
| Tahvildari, Ladan | 02:30-03:50 M T W Th F | 25/60 | 1 | 1 | 201 | DWE 2527 | 3801 | |
| Tutorials | ||||||||
| Professor | Time | Capacity | Sec | Assoc | Rel 1 | Rel 2 | Location | Code |
| TBA | 01:30-02:20 M T W Th F | 14/30 | 101 | 99 | 99 | DWE 1515 | 3802 | |
| TBA | 01:30-02:20 M T W Th F | 11/30 | 102 | 99 | 99 | DWE 1515 | 3803 | |
| Laboratories | ||||||||
| Professor | Time | Capacity | Sec | Assoc | Rel 1 | Rel 2 | Location | Code |
| TBA | TBA | 25/60 | 201 | 1 | UW U | 3815 | ||