Search & Filtering
An effective rate of 29.61% corresponds to a nominal rate,compounded weekly,of?
Use the octet rule to predict the formula of the compound that would form between arsenic and iodine , if the molecule contains only one arsenic atom and only single bonds are formed. Formula:
The equation for a distance, s(m), travelled in time t(s) by an object starting with an initial velocity u(ms-1) and uniform acceleration a(ms-2) is: 𝑠=𝑢𝑡+12𝑎𝑡2 The tasks are to: a) Plot a graph of distance (s) vs time (t) for the first 10s of motion if 𝑢=10𝑚𝑠−1 and 𝑎=4𝑚𝑠−2. b) Determine the gradient of the graph at 𝑡=2𝑠 and 𝑡=6𝑠. c) Differentiate the equation to find the functions for i) Velocity (𝑣=𝑑𝑠𝑑𝑡) ii) Acceleration (𝑎=𝑑𝑣𝑑𝑡=𝑑2𝑠𝑑𝑡2) d) Use your result from part c to calculate the velocity at 𝑡=2𝑠 and 𝑡=6𝑠. e) Compare your results for part b and part d.
a curve is such that d²y/dx²=12x-12. find the equation at point (2,9)?
If a 25 ppm Nitrogen dioxide in the air contains 25 mg of the compound in every liter of solution. How many milligrams are contained in 2.5 L sample of the air?
(2xy-y^2+2x) dx-(2xy-x^2-2y) dy=0?
Given an input undirected graph, write a program to find all articulation points in tgraph. An
articulation point is a vertex whose removal disconnects graph. (Assume that input graph is
connected.) If a graph has no articulation points, it is called a biconnected graph.
Input Format: input text file which describes an undirected graph. first line of file
specifies n & m, number of vertices and number of edges in the graph respectively.next m
lines specify the m edges of graph, one line per edge. An edge is described by its end points. If
number of vertices is n, assume vertices of graph are numbered (0,1,..n-1).
Output Format: Print “Biconnected Graph” if input graph has no articulation points. If
articulation points are found, print vertices articulation points.
Sample Input 1 (for graph shown on the right):
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
Sample Input 2 (for the graph shown on the right):
4 4
0 1
1 2
2 3
3 0
Sample Output 2
Biconnected Graph
Alow car spots car has aday coefficient of 0.29 and frantalace of 1.85m and travelling at 160km/hrs. How much polar is required to Over come are adynamic resistance if g=1.23kg/m?
Weak interactions in aqueous solution state and explain 7 points
Problem 1: 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). 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 Sample Input 2 (for the graph shown on the right): 8 12 0 1 0 2 0 6 1 3 1 7 2 3 2 4 3 5 4 5 4 6 5 7 6 7 Sample Output 2: YES
