Search & Filtering
Apply Runge-Kutta method of 4th order method to find the approximate
value of 𝑦 for 𝑥 = 0.1, if 𝑑𝑦
đť‘‘đť‘Ą
= 𝑥 + 𝑦
2 given that 𝑦 = 1 where 𝑥 = 0.
Gerhart and Pardee measured ATCase activity in the presence of a variety of purine and pyrimidine derivatives. Their results are presented in Table 16.2. What compound(s) were the most effective inhibitors? activators? Explain the significance of the metabolites that served as inhibitors or activators in the context of the biosynthetic pathway presented in Figure 16.1.
Table 16.2: Effect of nitrogen bases, nucleosides and nucleotides on ATCase activity. *Indicates stimulation. (Based on Gerhart and Pardee, 1962.)
Compound
Inhibition, % (Conc = 2 mM)
Cytosine
0
Cytidine
24
CMP
38
dCMP
48
CTP
86
dCTP
88
UTP
8
GTP
35
dGTP
31
ATP
-180*
dATP
-162*
a wave travels in the x-direction its displacement y at point x in time t is y=0.1 sin (5x-6t) Its wavelength is? (a) π/5 (b) 2π/5 (c) π/2 (d) 5π/6 (e) 5π/3
CH3-CH2-(CH2)3- CH2- CH3 what is the common name of this
A balloon is rising vertically upward with a uniform velocity 'u' as shown At a certain instant, a ball No. 1 is dropped trom it, which takes a 4 seconds to reach the ground. The moment this ball strikes the ground, another ball is dropped from the balloon and this 2nd ball takes 5 seconds to reach the ground. Find the velocity of the balloon 'u' and height from which both the balls must have been dropped.
Write a function that accepts an integer argument and checks if the number is
prime. Write a function that keeps count of number of times it’s been invoked
Given an input undirected graph, write a program to find all articulation points in the graph. An articulation point is a vertex whose removal disconnects the graph. (Assume that the input graph is connected.) If a graph has no articulation points, it is called a
biconnected graph.
Input Format: The input is a text file which describes an undirected graph. The first line of the file specifies n & m, the number of vertices and number of edges in the graph respectively. The next m lines specify the m edges of the graph, one line per edge. An edge is described by its end points. If the number of vertices is n, assume that the vertices of the graph are numbered (0,1,..n-1).Input in terminal taken as python main.py ./input.txt
Output Format: Print “Biconnected Graph” if the input graph has no articulation points. If articulation points are found, print the vertices which are the articulation points.
Sample Input 1:
7 8
0 1
0 2
2 1
2 3
4 2
3 5
4 6
5 6
Sample Output 1
Articulation points found:
2
Given an input undirected graph, write a program to check if the graph is two-edge connected or not. If the graph is not two-edge connected, print all the bridge edges. (Assume that the input graph is connected.)
Input Format: The input is a text file which describes an undirected graph. The first line of the file specifies n & m, the number of vertices and number of edges in the graph respectively. The next m lines specify the m edges of the graph, one line per edge. An edge is described by its end points. If the number of vertices is n, assume that the vertices of the graph are numbered (0,1,..n-1).Code is run in terminal as python3 main.py ./input.txt
Output Format: Print YES, if the input graph is two-edge connected, NO otherwise. If printing NO, print all the bridge edges in the graph.
Sample Input 1
(for the graph shown on the right):
8 10
0 1
1 2
0 3
3 4
3 6
4 6
5 4
5 6
7 6
5 7
Sample Output 1:
NO
1 2
0 1
0 3
On 1.1/20X0, you are hired as a manager for a company with a resource of 1 billion Vietnam Dong in cash (500 million from owner’s money and 500 millionfrom creditor). In January:
Company purchase goods which cost 300 million in cash and then re-sell with 400 million(received cash)
Borrow 200 million cash from bank and purchase a machine which)costs 300 million (paid by cash)
Record the above transactions in terms of changes in the elements of the accounting equation.
A coin is tossed four times.
b. Suppose the outcome of the first two tosses are heads, and Y represents the number of heads landed, what are the possible values of Y?
