UUM 535
Engineering Mathematics
Fall 2020-2021
Midterm Exam II
Assoc. Prof. N. Kemal Ure
Istanbul Technical University
Due date is January 10th, 14:00
Exam Policy:
Solutions should be submitted through Ninova. No hard copy submission are allowed.
There is no late submission policy, if you do not submit your solutions by the deadline, you
will get 0 from the exam.
You cannot discuss the solution strategies with your classmates, you must completely solve
the problems and type your solutions on your own. If any cheating is detected, you will get
a −100 (yes that is a negative score) from the exam.
1
Problem 1 (20 Points)
Assess whether the propositions below are True or False. If the proposition is True, justify your
answer with a short proof. If it is False, provide a counterexample. Each answer is worth 4 points
(1 point for correctly detecting T/F and 3 points for correct justification).
Let F ⊂ Rn be closed and let K ⊂ Rn be compact. Then F ∩ K is compact.
Let xν be a sequence in R. If the sequence |xν | converges, then there exists a convergent
subsequence of xν .
Let Ai be an infinite collection of open subsets of Rn such that all the finite intersections are
non-empty. That is, ∩ki=1 Ai 6= ∅ for all k. Then the infinite intersection ∩∞
i=1 Ai 6= ∅ too.
Let Bi be an infinite collection of compact subsets of Rn such that all the finite intersections
are non-empty. That is, ∩ki=1 Bi 6= ∅ for all k. Then the infinite intersection ∩∞
i=1 Bi 6= ∅ too.
Let f : K → Rm , where K ⊂ Rn is compact. Let f be continuous on K except a finite number
of points. Then f (K) ⊂ Rm is compact.
Problem 2 (10 Points)
Let f : R2 → R defined as f (x, y) = 2xy + ex sin y. Without using any partial derivatives, use the
Bachman-Landau notation to show that the derivative of f at point (a, b) is given as Df(a,b) (h, k) =
2bh + ea sin bh + 2ak − ea cos bk. That is, show thatf (a + h, b + k) − f (a, b) − Df(a,b) (h, k) is o(h, k).
Problem 3 (30 Points)
Consider the following unconstrained optimization problem in R2 :
minimize f (x, y) = ax3 + bx2 y + cy 2 ,
where a, b, c ∈ R are constants.
Use the critical value theorem to compute solution candidates, in terms of a, b, c. (5 points).
Use the Hessian matrix to assess whether the candidates found in previous part correspond
to a local minimum, maximum or saddle point for different values of a, b, c. (10 points).
Now set a = 1, b = 1, c = 1 and consider the following constrained optimization problem.
minimize f (x, y) = x3 + x2 y + y 2
subject to g(x, y) = x2 + x + y + 7 = 0
2
Figure 1: Integration region R for Problem 5. The coordinates of the rectangle are A = (0, 0) and
B = (3, 1). The circle is centered at C = (5/2, 1/2) and the radius is r = 1/3.
Assume that we have a candidate solution (x∗ , y ∗ ) to the optimization problem above. Use
the inverse function theorem to compute a function x = φ(y) such that g(φ(y), y) ≈ 0 around
(x∗ , y ∗ ). Make sure to show that inverse function theorem is applicable in this case. (5 points)
Show that by using φ(y), we can convert the constrained optimization problem to a local
unconstrained optimization problem. (5 points)
Attempt to solve the converted problem by computing the gradient and Hessian. (5 points)
Problem 4 (20 Points)
Find the volume of region enclosed by z = x2 + y 2 and z = (x2 + y 2 + 8)/3. (10 points)
Assume that we have a compact set S ⊂ Rn with volume vol(S) = v. Let A ∈ Rn×n be a
diagonal matrix, and let AS ⊂ Rn be defined as AS = {Ax ∈ Rn : x ∈ S}. What is the
volume of AS? (10 points)
Problem 5 (20 Points)
R
Let f : R2 → R be defined as f (x, y) = x2 + y 2 + xy. We want to compute the integral I = R
f,
where the region R is the shaded region displayed in Fig. 1.
Compute I by using Fubini’s Theorem. (10 points)
Compute I by converting it into a path integral via Green’s Theorem. (10 points)
