Draw a flowchart to input start time and end time of vehicle, Data Structure & Algorithms

Speed cameras read the time a vehicle passes a point (A) on road and then reads time it passes a second point (B) on the same road (points A and B are 100 metres apart). Speed of the vehicle is calculated using:

Speed =100 / (time at point B - time at point A) (metres/sec)

Maximum allowed speed is 100 kilometres per hour. 500 vehicles were monitored using these cameras over a 1 hour period.

Write an algorithm, using a flowchart, that:

Inputs start time and end time for the 500 vehicles that were monitored
calculate speed for each vehicle using the formula above
Outputs speed for each vehicle and also a message if speed exceeded 100 km/hour
Output the highest speed of all 500 vehicles monitored

Related Discussions:- Draw a flowchart to input start time and end time of vehicle

Adjacency matrix, Q. Give the adjacency matrix for the graph drawn below: ...

Q. Give the adjacency matrix for the graph drawn below: Ans: Adjacency matrix for the graph given to us

Define min-heap, Define min-heap A min-heap is a complete binary tree i...

Define min-heap A min-heap is a complete binary tree in which each element is less than or equal to its children. All the principal properties of heaps remain valid for min-hea

Deletion and insertion from queues, explain deletion and insertion in a que...

explain deletion and insertion in a queue

Explain about the abstract data type, Explain about the Abstract data type ...

Explain about the Abstract data type Abstract data type (ADT) A set of values (the carrier set) and operations on those values

Usage of linked lists for polynomial manipulation, Q. Establish the usage o...

Q. Establish the usage of linked lists for polynomial manipulation. Ans. Usag e of Linked List for Polynomial Manipulation. Link

Explain time complexity, Time Complexity, Big O notation The amount of ...

Time Complexity, Big O notation The amount of time needed by an algorithm to run to its completion is referred as time complexity. The asymptotic running time of an algorithm i

Breadth-first search, Breadth-first search starts at a given vertex h, whic...

Breadth-first search starts at a given vertex h, which is at level 0. In the first stage, we go to all the vertices that are at the distance of one edge away. When we go there, we

Multilist file organisation, what is multilist length file organisation? ex...

what is multilist length file organisation? explain with an example

Algorithms and flowcharts, write an algorithm and draw a flowchart to calcu...

write an algorithm and draw a flowchart to calculate the perimeter and area of a circle

What are expression trees, What are expression trees? The leaves of an...

What are expression trees? The leaves of an expression tree are operands, like as constants or variable names, and the other nodes have operators. This certain tree happens to

Write Your Message!

Name

Email id

Message

Verfication Code

User Account

All Pages