practiceExam1Sample4

# practiceExam1Sample4 - CHBE 2120 Exam 1 Fall 2009 7:15 PM...

This preview shows pages 1–5. Sign up to view the full content.

CHBE 2120 Exam 1, Fall 2009 7:15 PM – 9:00 PM, September 16, 2009 By signing below, I am agreeing to abide by the rules of this exam and by the Georgia Tech Honor Code. In particular, I agree to use no printed materials other than a single 8.5x11” sheet of paper with notes on one side, and I will only use standard scientific functions on my calculator (I will not use any programmable or graphing functions on my calculator). Name: _________________________________ Signature: ______________________________ Write your answers in the spaces provided. Blank paper is available for scratch work. If you need additional room for your answers, staple extra sheets to the exam and clearly indicate the problem numbers for your solutions. In problems that ask for a specific calculated value, highlight your solution with a box. Note the credit will not be given for calculated results that are correct if incorrect reasoning for that result is used. You must turn off all cell phones and other wireless devices for the duration of the exam . (for instructor use) Part 1 (max. 12) Part 2 (max. 15) Part 3 (max. 25) Part 4 (max. 15) Part 5 (max. 33) TOTAL (MAX. 100)

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

View Full Document
Part 1: Choose the best answer for each problem. (2 points each, 12 points total) 1) Which answer be problem? A. First-order st describes this ௗ௬ ௗ௧ ൌݕ݁ ି௧ ൅ݐ B. Linear C. Linear first-order D. None of the above 2) Which answer best describes this problem? A. First-order ௗ௧ ൌݕ B. Initial value problem y(0) = 2 C. First-order initial value problem y’(3) = 5 D. None of the above 3) You derived an ODE integration method from the Taylor series. Your global error for this method is O(h 7 ). What is your local error? A. O(h 6 ) B. O(h 7 ) C. O(h 8 ) D. O(7h) E. None of the above 4) What is the complexity of the number of operations in this Matlab code? A = eye(n); foo = 1; for i = 1:n A. O(n) for j = 1:n B. O(n 2 ) for k = j:n C. O(n 3 ) foo = foo + A(i,j); D. O(n 4 ) end E. None of the above end end
Suppose you have a system of equations such that: 300 150 300 150.01 ቃቂ ݔ ݔ ቃൌቂ 600 605 5) What does the above system of equations look like in graphical form? A. B. C. D. E. None of the above 6) How would you characterize this system? A. It has an exact, real solution B. It is ill-conditioned C. It is ill-conditioned with an exact, real solution D. None of the above

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

View Full Document
Part 2. Free response. (15 points total) Suppose you have 3 matrices: ܣൌቂ 12 22 ቃ,ܤൌ ൥ 38 42 11 ൩,ܥൌቂ 201 213 For each of the following 4 operations, state if the operation is defined.
This is the end of the preview. Sign up to access the rest of the document.

## This note was uploaded on 05/01/2011 for the course CHBE 2120 taught by Professor Gallivan during the Spring '07 term at Georgia Tech.

### Page1 / 12

practiceExam1Sample4 - CHBE 2120 Exam 1 Fall 2009 7:15 PM...

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

View Full Document
Ask a homework question - tutors are online