Assignment 2
Assignment 2
2. Obtain the Picard’s second approximation for the initial value problem ;
0.321810
𝑦(0) = 0, find 𝑦(1).
3. 𝑑𝑦
Use Euler’s method to find the solution of = 3𝑥 + 4𝑦 at 𝑥 = 1 with 𝑦(0) = 0
𝑑𝑥
2.0625
and step size ℎ = 0.25 .
4. 𝑑𝑦
Use Euler’s method to find the solution of = 𝑦 2 𝑒 𝑥 at 𝑥 = 6 with 𝑦(0) = 0.01
𝑑𝑥
5.115
and step size ℎ = 0.5 . Also, compare it with the exact solution.
5. A ball at 1200K is allowed to cool down in air at an ambient temperature of 300K.
Assuming heat is lost only due to radiation, the differential equation for the
temperature of the ball is given by
𝜽(480) = 647.57K
d
dt
( )
= −2.2067 10 −12 4 − 81108 , (0) = 1200 K
Find the temperature at t = 480 seconds using Euler’s method. Assume a step size
of h=240 seconds.
6. Use modified Euler’s method to find 𝑦(0.2) and 𝑦(0.4) given that y(0.2) = 0.2468
y(0.4) = 0.6031
7. 𝑑𝑦 1.10125
Given that = 𝑙𝑜𝑔10 (𝑥 + 𝑦); 𝑦(0) = 1. Find 𝑦(0.2) using modified Euler's
𝑑𝑥
method.
8. 𝑑𝑦 𝑦 2 −𝑥 2 1.196
Using fourth order R-K method, solve 𝑑𝑥 = 𝑥 2+𝑦 2 with 𝑦(0) = 1 at 𝑥 = 0.2.
1
9. 𝑑𝑦 2𝑥𝑦+𝑒 𝑥
Using fourth order R-K method, solve 𝑑𝑥 = 𝑥 2 +𝑥𝑒 𝑥 with 𝑥0 = 1, 𝑦0 = 0 at 𝑥 = 1.2.
0.1402
10. Apply Runge-Kutta fourth order method to find an approximate value of 𝑦 when
𝑑𝑦 1.2428
𝑥 = 0.2 given that 𝑑𝑥 = 𝑥 + 𝑦 and 𝑦 = 1 when 𝑥 = 0.
11. Determine whether each of these sequences is graphic. For those that are, draw a
graph having the given degree sequence:
Yes
(a) < 3, 3, 3, 3, 2 >
No
(b) < 5, 4, 3, 2, 1 > No
(c) < 4, 4, 3, 2, 1 > Yes
(d) < 3, 2, 2, 1, 0 > .
12. Verify Hand Shaking theorem for the following graph:
2
16. Find the adjacency and incidence matrix for the given graph:
17. Determine whether the given pair of graphs is isomorphic or not. Justify your
answer with proper explanation.
Not isomorphic
(a)
(b)
Isomorphic
18. Prove that the maximum number of edges in a simple graph with n vertices is
n(n-1)/2.
19. Describe the following families of graphs:
(a) 𝐾𝑛
(b) 𝐾𝑚,𝑛
(c) 𝐶𝑛
20. Represent each of these graphs with an adjacency matrix:
(a) 𝐾4
(b) 𝐾1,4
21. Are the simple graphs with the following adjacency matrices isomorphic?
Yes
22. How many vertices does a regular graph of degree four with 10 edges have? 5
23. Show that the size of a bipartite graph of order 𝑛 is at most 𝑛2 ⁄4.