Write the code in Java and C++ .... Given arrival and departure times of all trains that reach a railway station. Find the minimum number of platforms required for the railway station so that no train is kept waiting. Consider that all the trains arrive on the same day and leave on the same day. Arrival and departure time can never be the same for a train but we can have arrival time of one train equal to departure time of the other. At any given instance of time, same platform can not be used for both departure of a train and arrival of another train. In such cases, we need different platforms. Example 1: Input: n = 6 arr[] = {0900, 0940, 0950, 1100, 1500, 1800} dep[] = {0910, 1200, 1120, 1130, 1900, 2000} Output: 3 Explanation: Minimum 3 platforms are required to safely arrive and depart all trains. Example 2: Input: n = 3 arr[] = {0900, 1100, 1235} dep[] = {1000, 1200, 1240} Output: 1 Explanation: Only 1 platform is required to safely manage the arrival and departure of all trains.

Write the code in Java and C++ .... Given arrival and departure times of all trains that reach a railway station. Find the minimum number of platforms required for the railway station so that no train is kept waiting. Consider that all the trains arrive on the same day and leave on the same day. Arrival and departure time can never be the same for a train but we can have arrival time of one train equal to departure time of the other. At any given instance of time, same platform can not be used for both departure of a train and arrival of another train. In such cases, we need different platforms. Example 1: Input: n = 6 arr[] = {0900, 0940, 0950, 1100, 1500, 1800} dep[] = {0910, 1200, 1120, 1130, 1900, 2000} Output: 3 Explanation: Minimum 3 platforms are required to safely arrive and depart all trains. Example 2: Input: n = 3 arr[] = {0900, 1100, 1235} dep[] = {1000, 1200, 1240} Output: 1 Explanation: Only 1 platform is required to safely manage the arrival and departure of all trains.

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter10: Classes And Data Abstraction

Section: Chapter Questions

Problem 19PE

See similar textbooks

Similar questions

Answer in python language only 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 331209 Output: 8
vvvHarry has a big wall clock, that got hit while he was playing. Now, the minute hand doesn't rotate by the angle 2π/3600 each second, but now it moves according to different angle x. You can assume that coordinates of the centre of the clock are (0, 0) and the length of the minute hand is l. One endpoint of the minute hand is always located at the clock centre; the other endpoint is initially located at the point (0, l). One second later, Harry observes that this endpoint is at distance d above the x-axis, i.e., the y-coordinate of this endpoint is equal to d. Harry is curious about where the minute hand will be (specifically, its y-coordinate) after t seconds. Because t can be very large, Harry can't wait for that moment. Please help him to write a python code that prints a single line containing the output.Input: 4 2 2Output4Harry has a big wall clock, that got hit while he was playing. Now, the minute hand doesn't rotate by the angle 2π/3600 each second, but now it moves according…
This is for a Java Progrsm problem but If you could fully explain it to me then I should be okay to try to create this program based off your explaination. Thank you! Trigonometry is needed A pipe is to be carried around a right-angled corner of two intersecting corridors. Suppose that the widths of the two intersecting corridors are 5 feet and 8 feet. Your objective is to find the length of the lingest pipe, rounded to the nearest foot, that can be carried level around the right-angled corner. What I have to do is the following: Write a program that prompts the user to input the widths of both the hallways/ The program then outputs the length of the longest pipe, rounded to the nearest foot, that can be carried level around the right-angled cprner. Note that the length of the pipe os goven by l = AB + BC = 8 /SIN 0 (Omega) + 5 / cos 0(Omega), where 0 < > Omega < pi/ 2
In practical life, the employees get salaries and pay taxes honestly. Sometimes, the process of drawing salariesand payment of taxes may lead to some interesting situation. Suppose, a person draws salary of Rs. 10,000 permonth. A certain percentage of tax is charged on that amount, which is deducted every month. But if the salaryof the person is more than Rs. 10,000 per month, then the tax rate is different. Similarly if a person is getting Rs.20,000 per month, he/she would be charged more under a different tax rate slab. The interesting situationdevelops if there is an anomaly in the tax rates i.e. a person who is getting higher salary takes home lesser moneyas compared to the other person with less gross salary.To further elaborate it, we suppose that there is company 'C' where 100 or less than 100persons are employed. The salaries of the employees and their tax rates are known to us.We are required to list those unlucky persons, who are getting lesser take-home salary(net salary)…
Please write Lisp code for the following problem. Write a function that computes the surface area of a cylinder. In other words use surface area = 2(pi xr2)+(2 xpi xr) xh, where r = radius and h = height. Test your function on at least: (r h) = (2 1); (r h) = (8 2); (r h) = (3 7).
2. Define the function O(k), with k > 2, as 22 + 4? + 62 + ·..+ m? where m is the largest even number that is < k. Please implement the function in MIPS and make sure your implementation indeed works on the simulator, by printing the value O(15) to the terminal.
A Python Programming in Physics and Materials Science. In physics, chemistry and materials science, percolation refers to the movement and filtering of fluids through porous materials.(Wikipedia.org). Consider a simplified model below. Imagine, this is a filter or maybe some layers of stones such that when a certain amount of fluid is put on top, it will reach the bottom only if there is a direct passage. In this case, the blue squares serve as the porous materials or the holes where fluid may pass. Your task is to simulate this simple percolation by representing them in a 2-dimensional array. The input would be in a string, while the output would either be yes or no to indicate whether the fluid can pass through the filter or not. Example: Input: “1,0,0,0,0;0,1,0,0,0;0,1,0,0,0;0,0,1,0,0;0,0,0,1,0” Output: Yes Note: It should also work with these two inputs: “1” -> Yes “0” -> No
Please do it in c++ as soon as possible. From the get go, Mr. Chanek has a grid an of size n×m Each phone (x,y) contains a number ax,y demonstrating the course of how the ball will move. ax,y=1 — the ball will move aside (the accompanying cell is (x,y+1)); ax,y=2 — the ball will move to the base (the accompanying cell is (x+1,y)); ax,y=3 — the ball will move aside (the accompanying cell is (x,y−1)). Each time a ball leaves a cell (x,y), the number ax,y will change to 2. Mr. Chanek will drop k balls progressively, each start from the primary line, and on the c1,c2,… ,ck-th (1≤ci≤m) segments. Choose in what segment each ball will end up in (position of the ball in the wake of leaving the grid). Input The chief line contains three whole numbers n, m, and k (1≤n,m≤1000, 1≤k≤105) — the size of the cross section and the amount of balls dropped by Mr. Chanek. The I-th of the accompanying n lines contains m numbers ai,1,ai,2,… ,ai,m (1≤ai,j≤3). It will satisfy ai,1≠3 and ai,m≠1. The…
Code in C++ only. Correct answer will upvoted else downvoted. framework of size n×m, with the end goal that every cell of it contains either 0 or 1, is considered lovely if the total in each adjoining submatrix of size 2×2 is actually 2, i. e. each "square" of size 2×2 contains precisely two 1's and precisely two 0's. You are given a network of size n×m. At first every cell of this network is unfilled. How about we indicate the cell on the crossing point of the x-th line and the y-th segment as (x,y). You need to handle the inquiries of three sorts: x y −1 — clear the cell (x,y), in case there was a number in it; x y 0 — compose the number 0 in the cell (x,y), overwriting the number that was there already (assuming any); x y 1 — compose the number 1 in the cell (x,y), overwriting the number that was there beforehand (assuming any). After each question, print the number of ways of filling the unfilled cells of the grid so the subsequent network is delightful. Since the appropriate…
Please do it in c++ as soon as possible. From the get go, Mr. Chanek has a grid an of size n×m Each phone (x,y) contains a number ax,y demonstrating the course of how the ball will move. ax,y=1 — the ball will move aside (the accompanying cell is (x,y+1)); ax,y=2 — the ball will move to the base (the accompanying cell is (x+1,y)); ax,y=3 — the ball will move aside (the accompanying cell is (x,y−1)). Each time a ball leaves a cell (x,y), the number ax,y will change to 2. Mr. Chanek will drop k balls progressively, each start from the primary line, and on the c1,c2,… ,ck-th (1≤ci≤m) segments. Choose in what segment each ball will end up in (position of the ball in the wake of leaving the grid). Info The chief line contains three whole numbers n, m, and k (1≤n,m≤1000, 1≤k≤105) — the size of the cross section and the amount of balls dropped by Mr. Chanek. The I-th of the accompanying n lines contains m numbers ai,1,ai,2,… ,ai,m (1≤ai,j≤3). It will satisfy ai,1≠3…
Help Me With C Programming. At Lili's birthday party, there is a game arranged by Jojo as the host. The game is handing out a number of Y candies to a number of X people where all the sweets taste sweet except for the last one candy that tastes like rotten beans. The distribution of sweets will be sequential starting from position Z and if it passes the last position then the distribution of candy continues to the first position. Write down the person in the position of who will get the last candy. Format Input The first line of input is T, which is the number of test cases. The second row and the next number of T lines are X, Y, Z. X is the number of people who will be handed out candy. Y is the number of candies available. Z is the initial position of the person who will be handed out the candy. Format Output A string of "Case #N: " and a number that is the position of the person who got the last candy [Look at Image] In the sample above, for example, which is inputted in the…
Although the plot function is designed primarily for plotting standard xy graphs, it can be adapted for other kinds of plotting as well. b. Make a plot of the curve, which is defined parametrically by the equations x = 2cosθ + cos2θ, y = 2sinθ - sin2θ, where 0 < θ < 2π. Take a set of values of θ between zero and 2π and calculate x and y for each from the equations above, then plot y as a function of x. b. Taking this approach a step further, one can make a polar plot r = f(θ) for some function f by calculating r for a range of values of θ and then converting r and θ to Cartesian coordinates using the standard equations x = r cosθ, y = r sinθ. Use this method to make a plot of the function r = ecosθ – 2 cos(4θ) + sin5 (θ/12) in the range 0 <= θ <= 24π. use python code to answer the highlight one