{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

MIT1_204S10_lec01

MIT1_204S10_lec01 - 1.204 Lecture 1 Course introduction...

Info iconThis preview shows pages 1–4. Sign up to view the full content.

View Full Document Right Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: 1/31/2010 1.204 Lecture 1 Course introduction Data models Announcements • How-to install documents on Web: – Java, Eclipse, submit problem sets (1.00 Web site) – SQL Server, Visual Paradigm, JDBC (1.204 Web site) • We will give you access to 1.00 Web site – Sign up as 1.00/1.001 listener if you plan to sit in on 1.001 • Software installation help – Email me with questions or to set up a time for help • MySQL: Mac users can use MySQL to avoid Boot Camp, etc. – No support for MySQL installation problems • Homework 0: Software installation, due Mon Feb 8. Ungraded. • Homework 1: Air schedule, due Tue Feb 16. Graded. – Initial modeling/coding exercise, using straightforward solution method – Homework 1 only: You may code in a language other than Java • Lecture notes: Printed notes handed out each lecture • Readings: On reserve at Barker, and on electronic reserve 1 orge ) ( 1/31/2010 Course outline • Staff: – Ge George Kocur Kocur - • Class Monday, Wednesday 1-2:30pm • Office hours – George Kocur MW4:45-5:45 • Prerequisite: 1.00/1.001/6.005. – Can listen to 1.00 this semester • Grading: – 7 homework sets (70%) – 2 quizzes (30%) • Bring your laptop to office hours for help – Not needed in class, though you’re welcome to bring it Topics • Databases – Data modeling, normalization – SQL, JDBC • Data structures – Stacks, queues, trees/dictionaries, heaps, sets, graphs • Divide and conquer, greedy models – Sorting, selection – Knapsack, job scheduling, spanning trees, shortest paths • Dynamic programming – Resource allocation, job scheduling, knapsack • Branch and bound – Knapsack, facility location • Linear/nonlinear systems, linear programming – Nonlinear optimization, constrained and unconstrained – Network equilibrium (convex combinations), choice estimation – Solution of linear systems, linear programming • Approximate queuing theory – Time-varying queues, deterministic queues, graphical methods 2 1/31/2010 Homework • Homework topics 1. Informal algorithm design (warm-up homework) 2. Database 3. Network data structure 4. Greedy algorithm 5. Network algorithm 6. Dynamic programming 7. Branch and bound 8. Nonlinear optimization • Work individually Work individually – You may discuss approach to homework with others – You must write your own Java and SQL code...
View Full Document

{[ snackBarMessage ]}

Page1 / 12

MIT1_204S10_lec01 - 1.204 Lecture 1 Course introduction...

This preview shows document pages 1 - 4. Sign up to view the full document.

View Full Document Right Arrow Icon bookmark
Ask a homework question - tutors are online