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

 

Posted Date: 9/11/2013 3:30:45 AM | Location : United States

Ask an Expert

Related Discussions:- Draw a flowchart to input start time and end time of vehicle, Assignment Help, Ask Question on Draw a flowchart to input start time and end time of vehicle, Get Answer, Expert's Help, Draw a flowchart to input start time and end time of vehicle Discussions

Write discussion on Draw a flowchart to input start time and end time of vehicle
Your posts are moderated

Write your message here..

Related Questions

Threads in main method, Create main method or a test class that creates 2 E... Create main method or a test class that creates 2 Element objects that are neighbours of each other, the first element temperature set at 100, the 2nd at 0 and use an appropriate h

Define dynamic programming, Define Dynamic Programming  Dynamic  progra... Define Dynamic Programming  Dynamic  programming  is  a  method  for  solving  problems  with  overlapping  problems.  Typically, these sub problems arise from a recurrence rel

State the complex reallocation procedure, State the complex reallocation pr... State the complex reallocation procedure Some languages provide arrays whose sizes are established at run-time and can change during execution. These dynamic arrays have an in

The space - time trade off, The Space - Time Trade Off The best algorit... The Space - Time Trade Off The best algorithm to solve a given problem is one that needs less space in memory and takes less time to complete its implementation. But in practic

State flowchart that take temperature input using pseudocode, Write an algo... Write an algorithm using pseudocode which takes temperatures input over a 100 day period (once per day) and output the number of days when the temperature was below 20C and the num

Compare and contrast various sorting techniques, Q. Compare and contrast va... Q. Compare and contrast various sorting techniques or methods with respect to the memory space and the computing time.

Binary search tree, A binary search tree (BST), which may sometimes also be... A binary search tree (BST), which may sometimes also be named a sorted or ordered binary tree, is an edge based binary tree data structure which has the following functionalities:

Homework, Write a recursive function the computes the number of digits in a... Write a recursive function the computes the number of digits in a positive integer n. For example if n = 6598, the function should return 4. Find a variant expression and a thresho

How conquer technique can be applied to binary trees, How divide and conque... How divide and conquer technique can be applied to binary trees?  As the binary tree definition itself separates a binary tree into two smaller structures of the similar type,

frequenty count of function, Ask question find frequency count of function... Ask question find frequency count of function- {for(i=1;i {for(j=1;j {for(k=1;k } } }