everything.study
1.204

Computer Algorithms in Systems Engineering

Graduate · Historical course

Spring 2010

Topics

  • Database: Entity-relationship modeling
  • Database: Normalization, SQL basics
  • Database: SQL joins, views, subqueries
  • Database: JDBC
  • Algorithms: Analysis, complexity
  • Stacks, queues, trees, dictionaries
  • Graphs
  • Heaps, sets
  • Divide-conquer: Binary search, quicksort, selection
  • Greedy: Knapsack, job sequence
  • Greedy: Minimum spanning trees
  • Greedy/dynamic programming: Shortest paths
  • Priniciple of optimality, resource allocation
  • Job scheduling, graph/tree generation
  • Knapsack problem, set representation
  • Branch and bound: Backtrack method, knapsack problem
  • Branch and bound: General method, facility location
  • Continuous constrained nonlinear optimization
  • Network equilibrium
  • Linear systems
  • Continuous unconstrained nonlinear optimization
  • Unconstrained methods: Amoeba, BFGS, demand model estimation
  • Analytic approximations: Network design
  • Approximate queuing analysis

Readings

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