HOMEWORK
From Dieter
12-8
Module #24
Module
Fatigue of Materials
READING LIST
DIETER: Ch. 12, all
Ch. 14 in Meyers & Chawla
S. Suresh, Fatigue of Materials, 2nd Ed., Cambridge
(1998)
Topics
Topics
Mechanisms for Fatigue
Fatigue Crack Propagation
Fatigu
1/6/2014
CSE 421: Algorithms
Winter 2014
Lecture 1: Introductions
course information
Instructor:
Teaching assistants:
Book:
James R. Lee (me!)
Armando J. Diaz Tolentino
Yanling He
Algorithm Design
Homework: Due WED at start of class
Exams:
a facebook post
1/17/2014
CSE 421: Algorithms
breadth-first search
Winter 2014
Completely explore the vertices in order of their
distance from
Naturally implemented using a queue
Lecture 6: Graph traversal and topological sorting
Reading: Sections 3.3-3.6
1
2
3
4
7
11
1/25/2014
CSE 421: Algorithms
Winter 2014
Dont Forget:
Industry Affiliates Recruiting Fairs
Lecture 8: Greedy algorithms II
are next Tuesday (1/28) and Wednesday (1/29)!
Reading: Sections 4.1-4.5
Please pick up your name badge & lanyard in
advance.
Where:
1/14/2014
CSE 421: Algorithms
undirected graphs
Winter 2014
Mathematically, a graph is a pair = (, )
of vertices () and edges (). The edges are simply
unordered pairs of vertices, i.e. cfw_, for , .
Lecture 5: Graphs and graph traversal II
Reading: Secti
1/11/2014
CSE 421: Algorithms
undirected graphs
Winter 2014
Mathematically, a graph is a pair = (, )
of vertices () and edges (). The edges are simply
unordered pairs of vertices, i.e. cfw_, for , .
Lecture 4: Graphs and graph traversal
Reading: Sections
1/10/2014
CSE 421: Algorithms
defining efficiency
Winter 2014
Runs fast on typical real-world problem instances
Lecture 3: Asymptotic analysis
Reading: Chapter 2 of Kleinberg-Tardos
Pro: sensible, straight to the point
Cons:
moving target (different co
1/31/2014
CSE 421: Algorithms
fast exponentiation
Winter 2014
Power(a,n)
Lecture 11: Divide & Conquer
Reading:
Sections 5.1-5.4
Input: integer n and number a
Output: an
Obvious algorithm
n-1 multiplications
Observation:
if n is even, n=2m, then an=
1/21/2014
CSE 421: Algorithms
directed acyclic graphs
Winter 2014
A directed graph = ( , ) is acyclic if it has no
directed cycles
Lecture 6: Greedy algorithms
Reading: Sections 4.1-4.4
directed acyclic graph
Terminology: A directed acyclic graph is als
2/7/2014
CSE 421: Algorithms
weighted interval scheduling
Winter 2014
Input. Set of jobs with start times, finish times, and weights.
Goal. Find maximum weight subset of mutually compatible jobs.
Lecture 14: Dynamic programming II
Reading:
Sections 6.2-
2/9/2014
CSE 421: Algorithms
segmented least squares
Winter 2014
Least Squares
Lecture 15: RNA secondary structure, sequence alignment
Reading:
Sections 6.3-6.7
Given a set P of n points in the plane
p1=(x1,y1),pn=(xn,yn) with x1 xn determine
a line L gi
2/3/2014
CSE 421: Algorithms
sometimes two sub-problems arent enough
Winter 2014
More general divide and conquer
Lecture 12: The Master theorem & multiplication
Reading:
Sections 5.5-5.6
Youve broken the problem into different subproblems
Each has size
HOMEWORK From Dieter 13-5
Module #23
CREEP & SUPERPLASTICITY
READING LIST
DIETER: Ch. 13, all Chapter 13 in Meyers & Chawla T.G. Nieh, J. Wadsworth and O.D. Sherby, Superplasticity in metals and ceramics, (Cambridge University Press, Cambridge, 1997).
Hig