Due: September 4, 2008
CS 257 (Luke Olson): Homework #1
Problem 1
Problem 1
[Timing] While developing code for a project, we notice that the implementation of our numerical method
strongly depends on the size of the data with which we are working. Suppose
Due: November 20, 2008
CS 257 (Luke Olson): Homework #10
Problem 1
Problem 1
In this problem, we compare the performance of Jacobi, Gauss-Seidel, and Conjugate Gradient versus the problem
size. Using the functions jacobi.m, gauss seidel, and cg.m that you
Due: November 20, 2008
CS 257 (Luke Olson): Homework #10 Solutions
Problem 1
Problem 1
In this problem, we compare the performance of Jacobi, Gauss-Seidel, and Conjugate Gradient versus the problem
size. Using the functions jacobi.m, gauss seidel, and cg.
Due: Dec 9, 2008, 4pm
CS 257 (Luke Olson): Homework #11
Problem 1
Problem 1
Consider a database of 10 faces in faces.zip. Each is 50 by 50 pixel grayscale in PNG format:
person1.png
person2.png
person3.png
person4.png
person5.png
person6.png
person7.png
p
Due: Dec 9, 2008, 4pm
CS 257 (Luke Olson): Homework #11
Problem 1
Problem 1
Consider a database of 10 faces in faces.zip. Each is 50 by 50 pixel grayscale in PNG format:
person1.png
person2.png
person3.png
person4.png
person5.png
person6.png
person7.png
p
CS 251
Data Structures
Fall 2016
Lab Section Handout: Week #5, September 22nd
Attendance: Mandatory
Evaluation: Submit written answers to handout questions
Goal
The TAs have paper copies of a 4-page handout for you to work through. Answer the questions by
Responses
You will write four mini-responses throughout the semester. The first miniresponse is worth 4% of your grade. Responses 2-4 are worth 7% of your grade.
These responses should be between 3-4 sentences. Take your time with these.
You should REVISE
TCF NATIONAL BANK
800 BURR RIDGE PKWY
BURR RIDGE, IL 60527
STATEMENT DATE
05-05-16
6442387647
0
S T A T E M E N T
FDTTTADTTTFADFTFATAFFTDDAAFFFTFDATTFDTTTTDTAFDDAADTDTTFTAFTTFDTDD
0
458 92
CANG B LE
2115 W BALMORAL AVE
CHICAGO IL 60625-1005
NO MATTER IF Y
DHD 204: Disability in the Humanities
Mini-Response Two
Due 9/29 at 11:59
Article Choices
Shpigel, Ben. At 8 Feet Tall, This Paralympian Sat Down and Started Getting Noticed. New York Times 11
Sept 2016. Web. 21 Sept 2016. http:/www.nytimes.com/2016/09/12
Name: Cang Le
Netid: cle8
DHD 204
Mini-Response Two
The article "Pretty Girls Are Supposed to Smile" by Redman,Effy expands one of the
myths that Dolmage outlines because the girl in the article suffers from Moebius syndrome
which leaves her feeling diffe
Reading Cultural Texts
Plan for Today
Reminders
Mini-Response Two Due tonight at 11:59pm
Quiz 6 opens tonight and is due Tuesday at 11:59pm
Lecture
Finish up lecture on Hall
Reading Cultural Texts
The Stakes
According to Stuart Hall (and Tuesdays l
Disability Myths II
Plan for the Day
Reminders:
Mini-Response One feedback will be available on
Friday by end of the day
Mini-Response Two is due a week from today 9/29
at 11:59pm.
Lecture
Mini-response two prompt
Continue unpacking the Myths Dolmag
Disability Myths
Plan for today
Reminder:
QUIZ due tonight at 11:59pm
Update:
We will be grading your Mini-response One throughout this week
Grading will be completed by Friday 9/23
Mini-Response Two prompt will be provided on Thursday
Due 9/29 at
A Brief History of
Disability
Plan for the Day
Welcome to Students who just registered
Responsible for reviewing the syllabus, including the course objectives,
policies, and weekly reading schedule
Look at the posted powerpoint (pulls out key points fr
Due: November 6, 2008
CS 257 (Luke Olson): Homework #9
Problem 1
Problem 1
We are coding for a particle physics team and asked to compute the mass of a region with density =
is, compute
ln(x)
x1 .
That
1
m=
(x) dx.
0
We convince the team use n-point Gauss
Due: November 6, 2008
CS 257 (Luke Olson): Homework #9
Problem 1
Problem 1
We are coding for a particle physics team and asked to compute the mass of a region with density =
is, compute
ln(x)
x1 .
That
1
m=
(x) dx.
0
We convince the team use n-point Gauss
Due: September 4, 2008
CS 257 (Luke Olson): Homework #1 Solutions
Problem 1
Problem 1
[Timing] While developing code for a project, we notice that the implementation of our numerical method
strongly depends on the size of the data with which we are workin
Due: September 11, 2008
CS 257 (Luke Olson): Homework #2
Problem 1
[Range Reduction] We are developing code for a nancial rm and are required to compute tan(10n ) for
various n as a component of our nancial model. Use range reduction to show how to comput
Due: September 11, 2008
CS 257 (Luke Olson): Homework #2 Solutions
Problem 1
[Range Reduction] We are developing code for a nancial rm and are required to compute tan(10n ) for
various n as a component of our nancial model. Use range reduction to show how
Due: September 18, 2008
CS 257 (Luke Olson): Homework #3
Problem 1
[Puzzled] You are proling a loop in your numerical code at work with the following snippet:
Listing 1: First
1
function t = test1 ( n )
2
3
tic;
4
5
6
7
8
x(1) = 150;
for i=2:n
x(i) = .99*
Due: September 18, 2008
CS 257 (Luke Olson): Homework #3
Problem 1
[Puzzled] You are proling a loop in your numerical code at work with the following snippet:
Listing 1: First
1
function t = test1 ( n )
2
3
tic;
4
5
6
7
8
x(1) = 150;
for i=2:n
x(i) = .99*
Due: September 25, 2008
CS 257 (Luke Olson): Homework #4
Problem 1
Problem 1
In the last assignment, you implemented naive Gaussian elimination, and found out that it was lacking an
important feature, row exchanges. These prevent errors from blowing up du
Due: September 25, 2008
CS 257 (Luke Olson): Homework #4 Solutions
Problem 1
Problem 1
In the last assignment, you implemented naive Gaussian elimination, and found out that it was lacking an
important feature, row exchanges. These prevent errors from blo
Due: October 2, 2008
CS 257 (Luke Olson): Homework #5
Problem 1
Problem 1
a. If A is a non-singular square matrix, prove that AT A is symmetric and positive denite. You can
assume that all values in A are real.
b. Experiment with the code below. What can
Due: October 2, 2008
CS 257 (Luke Olson): Homework #5 Solutions
Problem 1
Problem 1
a. If A is a non-singular square matrix, prove that AT A is symmetric and positive denite. You can
assume that all values in A are real.
b. Experiment with the code below.
Due: October 16, 2008
CS 257 (Luke Olson): Homework #6
Problem 1
Problem 1
You are writing an API for a nance company which is in need of a solver for nding the roots of nonlinear
equations (i.e. nding an x such that f (x) = 0). You decide to implement Ne
Due: October 16, 2008
CS 257 (Luke Olson): Homework #6
Problem 1
Problem 1
You are writing an API for a nance company which is in need of a solver for nding the roots of nonlinear
equations (i.e. nding an x such that f (x) = 0). You decide to implement Ne
Due: October 23, 2008
CS 257 (Luke Olson): Homework #7
Problem 1
Problem 1
Consider the following table of values
0
7
x
y
2
11
3
28
1. Write out the interpolating polynomial using a Lagrange basis.
2. Write out the interpolating polynomial using a Newton