This course covers concepts of computation used in analysis of engineering systems.

FREE
This course includes
Hours of videos

638 years, 9 months

Units & Quizzes

23

Unlimited Lifetime access
Access on mobile app
Certificate of Completion

It includes the following topics: data structures, relational database representations of engineering data, algorithms for the solution and optimization of engineering system designs (greedy, dynamic programming, branch and bound, graph algorithms, nonlinear optimization), and introduction to complexity analysis. Object-oriented, efficient implementations of algorithms are emphasized.

Course Currilcum

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