Two buses, X and Y, start their journey at the same time on a 950 km route. Bus X gives a 1-hour break after every 3 hours' drive. So, it is at rest at the 4th, 8th, 12th, 16th, 20th, ... hours. Bus Y gives a 1-hour break after every 4 hours' drive. So, it is at rest at the 5th, 10th, 15th, 20th, 25th,... hours. You are given the speeds of the two buses Vx and V, as 80 and 75, respectively. Write a program that does the following: • Evaluate and display at the end of every hour the distance traveled by each bus. • When either one of the buses reach their destination, the evaluations terminate. Depending on whether X or Y or both reach their destination in the last hour, display one of the following messages before stopping (where n is the number of hours): o "Within hour n, bus X reaches its destination." o "Within hour n, bus Y reaches its destination." "Within hour n, both buses reach their destinations."

Two buses, X and Y, start their journey at the same time on a 950 km route. Bus X gives a 1-hour break after every 3 hours' drive. So, it is at rest at the 4th, 8th, 12th, 16th, 20th, ... hours. Bus Y gives a 1-hour break after every 4 hours' drive. So, it is at rest at the 5th, 10th, 15th, 20th, 25th,... hours. You are given the speeds of the two buses Vx and V, as 80 and 75, respectively. Write a program that does the following: • Evaluate and display at the end of every hour the distance traveled by each bus. • When either one of the buses reach their destination, the evaluations terminate. Depending on whether X or Y or both reach their destination in the last hour, display one of the following messages before stopping (where n is the number of hours): o "Within hour n, bus X reaches its destination." o "Within hour n, bus Y reaches its destination." "Within hour n, both buses reach their destinations."

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

John is training for a marathon and he can easily alternate between running a mile and walking a mile. If he runs for 2 miles in a row, he becomes fatigued, and must then walk for 2 miles in a row in order to no longer be fatigued. When he is fatigued, he can still alternate between running a mile and walking a mile, but if he runs 2 miles in a row while already fatigued, he will collapse on the side of the road. If he runs 3 miles in a row at any point, he will also collapse. Let the letter 'a' stand for John running 1 mile, and the letter 'b' stand for John walking 1 mile. Draw a DFA which accepts all possible runs in which John does not collapse on the side of the road.
Tim is playing a game with two pairs of positive integers A1,A2,.,An and B1,B2,.,BM. He has an integer V, which is initially equal to 0. Tim will play for a number of turns he chooses; he stops playing when he gets bored. In each turn of the game, Tim must perform one of the following operations: y..... Choose an integer X from A and change V to VVX, i.e., the bitwise OR of V and X. Choose an integer X from B and change V to VAX, i.e., the bitwise AND of V and X. Develop a python code which finds out number of possible distinct values which V can have after the game ends. Test Case Result 31 5 12 14 15
The city of BeeOS has a sightseeing tour which departs from a bus stop, takes a city tour and arrives at the same bus stop. There is only one bus that takes these tours indefinitely. The city visitors wait at the bus stop to board the bus, which can hold maximum N people. Each visitor should queue up at the bus stop and not get on until the bus starts its engine. The bus should wait until N visitors have boarded before departing. The bus can start its tour only when it is full. Once the bus has finished the trip, the visitors should get off after the bus stops its engine. All visitors should leave before the bus starts again. The process codes to be run by the bus and visitors are given below without any synchronization. Note that ‘Visitor’ code will be called by each visitor separately.Bus{loop{start_engine();take_tour();stop_engine();}}Visitor{get_on();get_off();}Rewrite the Bus and Visitor codes, with convenient mutex and/or semaphore operations, such that all synchronization…
Four individuals wish to traverse an unstable bridge; they all start on the same side. You have 17 minutes to get everyone to the opposite side. Night has fallen, and they have only one torch. Two individuals may cross the bridge at once at most. Any crossing party, whether one or two individuals, must carry a torch. The torch must be carried back and forth; it cannot, for instance, be hurled. Person 1 crosses the bridge in one minute, person 2 in two minutes, person 3 in five minutes, and person 4 in ten minutes. A dyad must trek together at the slower individual's cadence. Create the algorithm specification that solves the problem.
Intersections in England are often constructed as one-way "roundabouts," such as the one shown in the figure. Assume that traffic must travel in the directions shown. Find the general solution of the network flow. Find the smallest possible value for X8- X₁ = X3 X4 = X5 X is free X₁ = X₂ is free X₂ = X4 = X5 is free X8 is free 60 >>> Find the smallest possible value for xg. The smallest possible value for X is 100 B, *24 A X₁ 120 140 %3 What is the general solution of the network flow? Choose the correct answer below and fill in the answer boxes to complete your choice. A. B. C. D. x₁ is free is free x2 = X₂ is free X₂ is free X5 = X is free D * *1 E x5 F -80 100 X₂ sm X4 = 5 X is free
A very successful cinema director named "Chef" decided to solve the problem. When a customer wants to buy a ticket, the clerk at the ticket window asks the visitor if he or she needs a rest area, and if so, which one: left, right, or both. We know that in the audience they are expected to appear, their L needs a left-handed position, their R needs a right one, Z does not need a single one and B needs both. Your job is to count the number of people who can attend the show. In the theatre there are N rows with each M seat. There is only one lounge between the two adjacent seats. Seats at the beginning and end of the row have two armrests. Help him using the C++ programming language. Input 1 223211 Output: 4
Mr. Cook is the manager of Code cinemas and after a long break the theatres are open to the public again. To compensate for the loss of revenue due to Covid-19, Mr. Chef wants to maximise profits from each show from now on, while following the guidelines set by the government. The instructions are: If two people are sitting in the same row, there must be at least one free seat between them. If two people are sitting in different rows, there must be at least one completely empty row between them. This means that if there are people sitting in rows i and j where i
There are 50 lighting lamps, numbered 1 to 50, on a car race track. Initially all lamps are off. 10 cars numbered from 1 to 10 complete the track on the race track one by one. So, after a car completes track, the next car stars completing the the track. When the car passes in front of the lamp, if the number of the lamp is exactly divided by the number of the car, the lighted lamp turns OFF and the dimed lamp is turned ON. Write the program that finds out and displays on the screen which lamps are ON and which lamps are OFF, after the tenth car comples the track. After 18 cars finish race track driving : Lanps that are ON : 149 11 12 13 14 15 17 18 19 20 21 23 27 29 31 35 37 41 42 43 44 47 Lanps that are 0FF : 235678 18 16 22 24 25 26 28 30 32 33 34 36 38 39 40 45 46 48 49 50 Process exited after 0.02383 seconds with return value 8 Press any key to continue .
A circus is preparing a tower performance in which people stand on top of each other's shoulders. For practical and aesthetic reasons, each individual must be both shorter and lighter than the person below him or her. Develop a formula to calculate the maximum number of people that can fit in such a tower given the heights and weights of each participant in the circus.A circus is preparing a tower performance in which people stand on top of each other's shoulders. For practical and aesthetic reasons, each individual must be both shorter and lighter than the person below him or her. Develop a formula to calculate the maximum number of people that can fit in such a tower given the heights and weights of each participant in the circus.
The Dash Cell Phone Company charges customers a basic rate of $5 per month to send text messages. Additional rates are as follows: The first 100 messages per month, regardless of message length, are included in the basic bill. An additional three cents are charged for each text message after the 100th message, up to and including 300 messages. An additional two cents are charged for each text message after the 300th message. Federal, state, and local taxes add a total of 14 percent to each bill. Design using a pseudocode. A program that continuously accepts data about text messages until a sentinel value is entered, and displays details only about customers whose total bill with taxes is over $10.