|
TEXTBOOKS
|
ASSIGNED CHAPTERS
|
|
[Algorithms] = Horowitz, Ellis, Sartaj Sahni, and Sanguthevar Rajasekaran. Computer Algorithms / C++. Summit, NJ: Silicon Press, 2007. ISBN: 9780929306421.
|
1-6, 8 (most sections)
|
 Cormen, Thomas, Charles Leiserson, Ronald Rivest, and Clifford Stein. Introduction to Algorithms. 2nd ed. Cambridge, MA: MIT Press, 2001. ISBN: 9780262032933.
|
None. Use to supplement Horowitz as needed.
|
|
Horstmann, Cay. Big Java. 4th ed. New York, NY: Wiley, 2009. ISBN: 9780470509487.
|
None. Use as a Java reference.
|
|
[SQL] = Syverson, Bryan, and Joel Murach. Murach’s SQL Server 2005 for Developers. Fresno, CA: Murach & Associates, 2006.
|
1-7
|
|
[JDBC] = Fisher, Maydene, Jon Ellis, and Jonathan Bruce. JDBC API Tutorial and Reference. 3rd ed. Upper Saddle River, NJ: Prentice Hall, 2003. ISBN: 9780321173843.
|
1-2
|
|
[Newell] = Newell, C. Application of Queuing Theory. New York, NY: Springer, 1982. ISBN: 9780412245008.
|
1-2
|
|
[Press] = Press, William, Saul Teukolsky, William Vetterling, and Brian Flannery. Numerical Recipes: The Art of Scientific Computing. 3rd ed. New York, NY: Cambridge University Press, 2007. ISBN: 9780521880688.
|
2
|
|
[Sheffi] = Sheffi, Yosef. Urban Transportation Networks: Equilibrium Analysis with Mathematical Programming Methods. Upper Saddle River, NJ: Prentice Hall, 1985. ISBN: 9780139397295.
|
4, 5.1-5.2
|
|
[Kocur] = Kocur, George, and Chris Hendrickson. “Design of Local Bus Service with Demand Equilibration.” Transportation Science 16, no. 2 (1982): 149-170.
|
All
|
|
LEC #
|
TOPICS
|
READINGS
|
|
Databases
|
|
1
|
Database: Entity-relationship modeling
|
SQL 9
|
|
2
|
Database: Normalization, SQL basics
|
SQL 1-3, 7
|
|
3
|
Database: SQL joins, views, subqueries
|
SQL 4-6
|
|
4
|
Database: JDBC
|
JDBC 1-2
|
|
Data Structures
|
|
5
|
Algorithms: Analysis, complexity
|
Algorithms 1
|
|
6
|
Stacks, queues, trees, dictionaries
|
Algorithms 2.1-2.3
|
|
7
|
Graphs
|
Algorithms 2.6
|
|
8
|
Heaps, sets
|
Algorithms 2.4-2.5
|
|
Divide-and-conquer and Greedy Algorithms
|
|
9
|
Divide-conquer: Binary search, quicksort, selection
|
Algorithms 3.1-3.3, 3.5-3.6
|
|
10
|
Greedy: Knapsack, job sequence
|
Algorithms 4.1-4.2, 4.4
|
|
11
|
Greedy: Minimum spanning trees
|
Algorithms 4.5
|
|
12
|
Greedy/dynamic programming: Shortest paths
|
Algorithms 4.8
|
|
|
Quiz 1
|
|
|
Dynamic Programming
|
|
13
|
Priniciple of optimality, resource allocation
|
Algorithms 5.1-5.2
|
|
14
|
Job scheduling, graph/tree generation
|
|
|
15
|
Knapsack problem, set representation
|
Algorithms 5.7
|
|
Branch-and-bound
|
|
16
|
Branch and bound: Backtrack method, knapsack problem
|
Algorithms 7.1, 7.6
|
|
17
|
Branch and bound: General method, facility location
|
Algorithms 8.1-8.2
|
|
Linear and Nonlinear Optimization
|
|
18
|
Continuous constrained nonlinear optimization
|
Sheffi 3-3.2, 4.1, 4.3
|
|
19
|
Network equilibrium
|
Sheffi 5.1-5.2
|
|
20
|
Linear systems
|
Press 2
|
|
21
|
Continuous unconstrained nonlinear optimization
|
Press 10
|
|
22
|
Unconstrained methods: Amoeba, BFGS, demand model estimation
|
|
|
Approximate Queues and Network Designs
|
|
23
|
Analytic approximations: Network design
|
Kocur
|
|
24
|
Approximate queuing analysis
|
Newell 1, 2
|
