LEC # | TOPICS | LECTURE NOTES | SUPPORTING FILES |
---|---|---|---|
Databases | |||
1 | Database: Entity-relationship modeling | (PDF) | (VPP) |
2 | Database: Normalization, SQL basics | (PDF) | |
3 | Database: SQL joins, views, subqueries | (PDF) |
(SQL) (SQL) |
4 | Database: JDBC | (PDF) | (ZIP) (This ZIP file contains: 11 .java files.) |
Data Structures | |||
5 | Algorithms: Analysis, complexity | (PDF) | (ZIP) (This ZIP file contains: 6 .java files.) |
6 | Stacks, queues, trees, dictionaries | (PDF) | (ZIP) (This ZIP file contains: 10 .java files.) |
7 | Graphs | (PDF) | (ZIP) (This ZIP file contains: 4 .java files and 1 .txt file.) |
8 | Heaps, sets | (PDF) | (ZIP) (This ZIP file contains: 1 .java file.) |
Divide-and-Conquer and Greedy Algorithms | |||
9 | Divide-conquer: Binary search, quicksort, selection | (PDF) | (ZIP) (This ZIP file contains: 4 .java files.) |
10 | Greedy: Knapsack, job sequence | (PDF) | (ZIP) (This ZIP file contains: 2 .java files.) |
11 | Greedy: Minimum spanning trees | (PDF) | (ZIP) (This ZIP file contains: 4 .java files.) |
12 | Greedy/dynamic programming: Shortest paths | (PDF) | (ZIP) (This ZIP file contains: 4 .java files and 1 .txt file.) |
Quiz 1 | |||
Dynamic Programming | |||
13 | Priniciple of optimality, resource allocation | (PDF) | (ZIP) (This ZIP file contains: 1 .java file.) |
14 | Job scheduling, graph/tree generation | (PDF) | (ZIP) (This ZIP file contains: 2 .java files.) |
15 | Knapsack problem, set representation | (PDF) | (ZIP) (This ZIP file contains: 3 .java files.) |
Branch-and-Bound | |||
16 | Branch and bound: Backtrack method, knapsack problem | (PDF) | (ZIP) (This ZIP file contains: 2 .java files.) |
17 | Branch and bound: General method, facility location | (PDF) | (ZIP) (This ZIP file contains: 4 .java files and 2 .txt files.) |
Linear and Nonlinear Optimization | |||
18 | Continuous constrained nonlinear optimization | (PDF) | |
19 | Network equilibrium | (PDF) | (ZIP) (This ZIP file contains: 2 .java files.) |
20 | Linear systems | (PDF) | (ZIP) (This ZIP file contains: 5 .java files and 1 .txt file.) |
21 | Continuous unconstrained nonlinear optimization | (PDF) |
(ZIP A) (This ZIP file contains: 4 .java files.) (ZIP B) (This ZIP file contains: 3 .java files.) |
22 | Unconstrained methods: Amoeba, BFGS, demand model estimation | (PDF) |
(ZIP) (This ZIP file contains: 4 .java files and 1 .zip file.) (ZIP) (This ZIP file contains: 6 .java files.) (ZIP) (This ZIP file contains: 1 .dll file and 1 .java file.) |
Approximate Queues and Network Designs | |||
23 | Analytic approximations: Network design | (PDF) | (ZIP) (This ZIP file contains: 2 .java files.) |
24 | Approximate queuing analysis | (PDF) |
Lecture Notes
Course Info
Instructor
Departments
As Taught In
Spring
2010
Level
Learning Resource Types
notes
Lecture Notes
grading
Exams
assignment
Programming Assignments