0
(
ratings
)
students
Created by:
![Profile Photo](https://opencoursa.com/wp-content/uploads/avatars/809/62de1041c5027-bpfull.jpg)
Last updated:
July 27, 2022
Duration:
Unlimited Duration
FREE
This course includes:
Unlimited Duration
Badge on Completion
Certificate of completion
Unlimited Duration
Description
This course covers concepts of computation used in analysis of engineering systems.
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 Curriculum
-
- 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
- Branch and bound: Backtrack method, knapsack problem Unlimited
- Branch and bound: General method, facility location Unlimited
- Analytic approximations: Network design Unlimited
- Approximate queuing analysis Unlimited
About the instructor
5
5
Instructor Rating
1
Reviews
1520
Courses
1916
Students
![Profile Photo](https://opencoursa.com/wp-content/uploads/avatars/809/62de1041c5027-bpfull.jpg)
Massachusetts Institute of Technology