Mechanical Engineering > Gate 2024 > Geometry
In order to numerically solve the ordinary differential equation 𝑑𝑦/𝑑𝑑 = βˆ’π‘¦ for 𝑑 > 0, with an initial condition 𝑦(0) = 1, the following scheme is employed
Here, Δ𝑑 is the time step and 𝑦𝑛 = 𝑦(𝑛Δ𝑑) for 𝑛 = 0, 1, 2, …. This numerical scheme will yield a solution with non-physical oscillations for Δ𝑑 > β„Ž. The value of β„Ž is
A
1/2
B
1
C
3/2
D
2

Explanation

Correct : a

Similar Questions

What is the worst-case time complexity of insertion in an AVL tree?
Question #23 Medium
Which operations on a binary search tree have O(h) complexity?
Question #31 Easy
Compare search complexities of sorted array vs balanced BST.
Question #47 Hard

Related Topics

Data Structures Binary Search Tree Time Complexity Algorithm Analysis Tree Algorithms Computer Science