- Trending Categories
- Data Structure
- Networking
- RDBMS
- Operating System
- Java
- iOS
- HTML
- CSS
- Android
- Python
- C Programming
- C++
- C#
- MongoDB
- MySQL
- Javascript
- PHP

- Selected Reading
- UPSC IAS Exams Notes
- Developer's Best Practices
- Questions and Answers
- Effective Resume Writing
- HR Interview Questions
- Computer Glossary
- Who is Who

# Fig 8.11 shows the distance-time graph of three objects A, B,and C. Study the graph and answer the following questions:

$(a)$. Which of the three is traveling the fastest?$(b)$. Are all three ever at the same point on the road?$(c)$. How far has C traveled when B passes A?$(d)$. How far has B traveled by the time it passes C?"

To do: To study the given graphs and find:

$(a)$. Fastest traveling object among the three.

$(b)$. To find if all three are ever at the same point on the road.

$(c)$. To find how far has C traveled when B passes A.

$(d)$. To find how far has B traveled by the time it passes C.

Solution:

$(a)$. It is known that the slope of a distance-time graph represents the speed of the object. Here, slope B is greatest in the given distance-time graph.

So, object B is moving fastest.

$(b)$. In the given graph, lines A, B, and C never intersect at a single point. So, all the three objects are never at the same point on the road.

$(c)$. On the graph, let us mark the point of intersection of line A and line B with a blue dot. This intersecting point represents when A passes B.

From this intersecting point

On the graph, it is clearly seen that C is at 8 km when Object A passes object B.

$(d)$. On the graph below, let us mark the point where lines B and C intersect with a blue dot. this intersecting point represents where object B passes object C.

From this intersecting point, it is clearly seen that B is at 9 graph unit.

Here in the given graph, there are 7 units area of the graph from 0 to 4 km.

So, $7\ units =4\ km$

Therefore, $1\ unit=\frac{4}{7}\ km$

So, $9\ units=9\times\frac{4}{7}\ km$

$=5.14\ km$

So, object B has traveled $5.14\ km$ when it passes object C>

- Related Questions & Answers
- The Graph Coloring
- Edges and Vertices of Graph
- Finding the matching number of a graph
- Program to find the diameter, cycles and edges of a Wheel Graph in C++
- Graph and its representations
- C++ Program to Perform Edge Coloring to the Line Graph of an Input Graph
- C++ Program to Find the Edge Connectivity of a Graph
- C++ Program to Find the Vertex Connectivity of a Graph
- C++ program to Calculate the Edge Cover of a Graph
- Find the maximum value permutation of a graph in C++
- Finding the number of regions in the graph
- 8085 program to implement the following function (a*b) + (c*d)
- Finding the line covering number of a graph
- How can we measure the similarity or distance between two vertices in a graph?
- Show that the following grammar is LR (1) S → A a |b A c |B c | b B a A → d B → d
- What is protocol graph? Compare the network interface and protocol