Computer Algorithms in Systems Engineering

View Course Materials

Buying via our links supports this free directory · Affiliate disclosure.
Course facts
  • Payment: Free, no certificate
  • Credits: Non Credit
  • Learning style: Self-paced, start anytime
  • Resources: Exams; Lecture Notes; Programming Assignments
MIT OpenCourseWare details
  • As taught in: Spring 2010
  • Department: Civil and Environmental Engineering
Created byMIT
Available onMIT OpenCourseWareMIT OpenCourseWare

Course Details
Learning Style

Start Anytime

Level

All Levels

Study Mode

100% Online

Outcomes
Academic Credits

Non Credit

Price & Terms
Pricing Model

Free Content (No Certificate)

Technical
Content Medium

Text Based

Specification
Access

Free Access

Academic Level

Graduate

SKU: computer-algorithms-systems-engineering Category: Brand:

Algorithms for engineering systems: databases and SQL, data structures, greedy, dynamic programming, branch and bound and nonlinear optimization.

At a glance
LevelAll Levels
AccessFree access
FormatText Based
As taught inSpring 2010
DepartmentCivil and Environmental Engineering
Add your review
Add to wishlistAdded to wishlistRemoved from wishlist 0
Add to compare

Engineering systems such as building ventilation and transport networks are designed and optimized with computation. This course covers the concepts of computation used to analyze them: data structures, relational database representations of engineering data, and algorithms for solving and optimizing system designs, including greedy methods, dynamic programming, branch and bound, graph algorithms and nonlinear optimization, with an introduction to complexity analysis. Efficient, object-oriented implementations of the algorithms are emphasized throughout.

What You Will Achieve

  • Model engineering data in a relational database and query it with SQL
  • Choose data structures and analyze algorithm complexity
  • Apply greedy, dynamic programming and branch-and-bound methods to design problems
  • Use nonlinear optimization for engineering design and network equilibrium problems


Program Overview

Databases and Data Structures

Representing engineering data.

  • Entity-relationship modeling, normalization and SQL
  • JDBC
  • Complexity analysis
  • Stacks, queues, trees, graphs, heaps and sets

Algorithm Design

Core techniques for combinatorial problems.

  • Divide and conquer: binary search, quicksort, selection
  • Greedy algorithms, minimum spanning trees and shortest paths
  • Dynamic programming and resource allocation
  • Branch and bound and facility location

Optimization and Networks

Continuous methods and network design.

  • Constrained and unconstrained nonlinear optimization
  • Network equilibrium and linear systems
  • Demand model estimation
  • Analytic approximations for queues and network design

Course Completion


Job Outlook

These skills serve systems engineering, transportation and infrastructure analysis, operations research and software for engineering design.


Before you start: 1.001 Introduction to Computers and Engineering Problem Solving is the prerequisite, which has 18.01 Calculus as a prerequisite. 6.005 Elements of Software Construction is also accepted. If you haven’t taken 1.001 and don’t know Java or C++ or C#, you may take 1.204 if you attend at least the first month of 1.001 as a listener. You should have some prior programming experience if you do this.

Our take

Good for: Engineering students who can program and want algorithms and databases applied to real design problems.

Keep in mind: A spring 2010 course with lecture notes, programming assignments in Java and exams; the problem sets use engineering cases such as building ventilation design and staging building materials.

Bottom line: Algorithms and databases taught as tools for designing engineering systems.

Frequently Asked Questions

Which programming language is used?

The assignments use Java, including JDBC for connecting programs to relational databases, with an emphasis on efficient object-oriented implementations.

What kinds of engineering problems appear?

Examples include satellite data sets, project management, building ventilation design solved by dynamic programming, and staging building materials solved by branch and bound.

Does it cover databases?

Yes. The first part covers entity-relationship modeling, normalization, SQL basics, joins, views and subqueries, and JDBC.

User Reviews

0.0 out of 5
★★★★★
0
★★★★★
0
★★★★★
0
★★★★★
0
★★★★★
0

No reviews yet. Be the first to review this course.

There are no reviews yet.

Write your review

Reviews can only be posted by registered learners. Log in, then you will return here to post.

×

    Report this page
    Computer Algorithms in Systems Engineering
    Computer Algorithms in Systems Engineering
    LiveTalent
    Logo
    Compare items
    • Total (0)
    Compare
    0