A train can travel 50% faster than a car. Both start from point A at the same time and reach point B 75 kms away from A at the same time. On the way, however, the train lost about 12.5 minutes while stopping at the stations. The speed of the car is
Answer / Shilpi Garg
To solve this problem, let's assume the car's speed is C and the train's speed is T (T being 50% faster than C). Since they both reach point B at the same time and the train lost 12.5 minutes due to stops, their travel times are equal:
Time_C + (Time_T * 0.2) = Distance / Speed_C = 75 km / C
Solving for C:
C^2 = (75 km * C) / (1 - 0.2)
C = sqrt((75 km * C) / (1 - 0.2))
C^2 = 375 km / 0.8
C = sqrt(468.75 km²)
Approximate speed of the car: C = 21.7 m/s or about 78.6 km/h
| Is This Answer Correct ? | 0 Yes | 0 No |
What is planning? How is it used, and what are its advantages? Is it feasible to use planning in real-time games? If so, name any titles where planning has been used for any part of the AI. Describe the architecture of a planning-based AI system for any genre of game.
A boat running upstream takes 8 hours 48 minutes to cover a certain distance, while it takes 4 hours to cover the same distance running downstream. What is the ratio between the speed of the boat and speed of the water current respectively
How to ignore some file in mvc
Explain Transactions?
HOW to click on elements under moving banner, in selenium webdriver
what are the advantages of PO 7.4 version ? new features in it ?
where will movement type get assigned?
Where we can activate Rebates?
A student multiplied a number by 3 instead of 5 . 5 3 What is the percentage error in the calculation?
You have an AI player in an RTS game that occasionally needs to send scouts out onto the map to perform reconaissance. Designers want each scout to move around semi-randomly, exploring various parts of the map, particularly those that have been seen the least recently. Assume that the game is grid-based and has a fog-of-war feature. Also assume that the scouts are very cheap and dispensable, and it's OK for them to walk into the enemy base or other dangerous areas. How would you implement the system to decide where the scouts should go? What sort of data structure do you need to support this? How can you ensure that the scouts do a good job of exploring the map thoroughly? What are the performance characteristics of your approach? Is there any risk of scouts getting stuck trying to go somewhere that isn't even accessible?
How will you execute 1000 test case in a day ??
How can you load large amounts of data from flat-text files?
Software (196885)
Sciences (12521)
Engineering (38019)
Business Management (7371)
Accounting (11552)
Advertising Media (662)
Architecture Design (207)
Call Centre (2483)
Fashion Modelling (332)
Government (17384)
Law (806)
Tourism Hotel (377)
Everything Else (2323)
Military Police (160)
Skills Abilities (0)
Aptitude Questions (4307)
Placement Papers (705)
Certifications (3752)
Visa Interview Questions (2230)
Code Snippets (1098)
Entrance Exams (862)
ERRORS (16636)