In a scheduling program, we want to check whether two appointments overlap. For simplicity, appointments start at a full hour, and we use military time (with hours 0–24). The following pseudocode describes an algorithm that determines whether the appointment with start time start1 and end time end1 overlaps with the appointment with start time start2 and end time end2. If start1 > start2 s = start1 Else s = start2 If end1 < end2 e = endl Else e = end2 If s < e The appointments overlap. Else The appointments don’t overlap. Trace this algorithm with an appointment from 10–12 and one from 11–13, then with an appointment from 10–11 and one from 12–13.

In a scheduling program, we want to check whether two appointments overlap. For simplicity, appointments start at a full hour, and we use military time (with hours 0–24). The following pseudocode describes an algorithm that determines whether the appointment with start time start1 and end time end1 overlaps with the appointment with start time start2 and end time end2. If start1 > start2 s = start1 Else s = start2 If end1 < end2 e = endl Else e = end2 If s < e The appointments overlap. Else The appointments don’t overlap. Trace this algorithm with an appointment from 10–12 and one from 11–13, then with an appointment from 10–11 and one from 12–13.

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter8: Arrays And Strings

Section: Chapter Questions

Problem 20PE

See similar textbooks

Similar questions

Suppose that the first number of a sequence is x, where x is an integer. Define a0= x; an+1=an/2 if an is even; an+1= 3*an +1 if an is odd. Then there exists an integer K such that ak=1. Write a Program that prompts the user to input the value of x. The program outputs the integer K such that ak=1 and the numbers a0, a1, a2,……….., ak.. (For example, if x=75, then K=14, and the numbers a0, a1, a2,……….., a14, respectively, are 75,226,113,340,170,85,256,128,64,32,16,8,4,2,1. ) Enhance your program from part a by outputting the position of the largest number and the largest number of the sequence a0, a1, a2,……….., ak.. (For example, the largest number of the sequence 75,226,113,340,170,85,256,128,64,32,16,8,4,2,1 is 340 and its position is 4. )
Suppose that the first number of a sequence is x, where x is a non-zero positive integer. We define the following sequence: a0 = x, an+1 = an/2 if an is even, and an+1 = 3 ∗ an + 1 if an is odd. In such a sequence, there exists an integer k such that ak = 1. Write a program sequence.cc that prompts the user to enter the value of x, the program outputs the integer k such that ak = 1, the numbers a0, a1, a2, . . . , ak, the largest number of the sequence a0, a1, a2, . . . , ak, and the position of the largest number in the sequence. For example, if x = 75, then k = 14, the numbers a0, a1, a2, . . . , a14, respectively, are 75, 226, 113, 340, 170, 85, 256, 128, 64, 32, 16, 8, 4, 2, 1, the largest is 340, at position 3. Your program should prompt the user to run it repeatedly until she/he wants to quite. Please use break and continue statements. And loop and while statement! Thank you!
Suppose that the first number of a sequence is x, where x is a non-zero positive integer. We define the following sequence: a0 = x, an+1 = an/2 if an is even, and an+1 = 3 ∗ an + 1 if an is odd. In such a sequence, there exists an integer k such that ak = 1. Write a program sequence.cc that prompts the user to enter the value of x, the program outputs the integer k such that ak = 1, the numbers a0, a1, a2, . . . , ak, the largest number of the sequence a0, a1, a2, . . . , ak, and the position of the largest number in the sequence. For example, if x = 75, then k = 14, the numbers a0, a1, a2, . . . , a14, respectively, are 75, 226, 113, 340, 170, 85, 256, 128, 64, 32, 16, 8, 4, 2, 1, the largest is 340, at position 3. Your program should prompt the user to run it repeatedly until she/he wants to quite. Please use break and continue statements. And loop and while statement! make sure k is identified in the output and don't use arrays for the program. thank you very much!!
A Fibonacci sequence is a sequence of numbers where each successivenumber is the sum of the previous two. The classic Fibonacci sequencebegins: 1, 1, 2, 3, 5, 8, 13, .... Write a program that computes the nthFibonacci number where n is a value input by the user. For example, ifn = 6, then the result is 8.
Implement a program that calculates the bill of a sandwich stand. The program should ask theuser to enter the quantity of each of the items. Then compute 13% GST on the total amountand generate a bill with items, their quantity along with price of each item and the total(inclusive GST). The stand has the following items:- Petti for $2.50- Drink for $1.25- Extra cheese topping for $1.25
What is the probability that in a classroom of x people, at least 2 will be born on the same day of the year (ignore leap year)? Use a Monte Carlo Simulation and a frequency table to write a program that calculates this probability, where the number of people (x) in the simulated class is given by the user. The probability for a class of size 23, should be right around 50%. I have an outline for the code but please only use python language and NO "break", "true" language import mathimport random # create and initialize frequency table:ft = []k = 0while(k < 365) : ft.append(0) k = k+1 # Allow the user to determine class size:print("Please type in how many people are in the class: ")x= int(input()) success = 0 # Simulate:c = 0while(c < 10000) : # Step 1: re-initialize the birthday frequency table (it must be re-initialized for each play-through (why?): k = 0 while(k < 365) : ft[k] = 0 k = k+1 # Step 2: randomly get x birthdays and update frequency table: k =…
Write a program that takes in an integer in the range 20-98 as input. The output is a countdown starting from the integer, and stopping when both output digits are identical. Ex: If the input is 93, the output is: 93 92 91 90 89 88 Ex: If the input is 77, the output is: 77 Ex: If the input is not between 20 and 98 (inclusive), the output is: Input must be 20-98 For coding simplicity, follow each output number by a space, even the last one. Use a while loop. Compare the digits; do not write a large if-else for all possible same-digit numbers (11, 22, 33, ..., 88), as that approach would be cumbersome for large ranges.
Write an algorithm that accepts a 2-digit number ranging from 20 to 99 and display all pair of 2-digit combinations that will sum up to your input.For example, let's assume that the user entered a 25, the algorithm should be able to display the following:15+10, 14+11, 13+12the positioning of these numbers doesn't make a difference so, if 15+10 is displayed, you don't have to display 10+15.HINT: There is a pattern on how the left digit is decremented and the right digit is incremented by 1.
Write a program that reads an integer and displays all its smallest factors in an increasing order. For example, if the input integer is 120, the output should be as follows: 2, 2, 2, 3, 5.
Write this using java Write a complete version of the Bresenham Midpoint algorithm to handle ALL slope values. m = 0 m > 0 m < 0 m = 1 m > 1 swap the rolls of x and y m < 1 m = infinity ( needs special test case) Include appropriate tests for ‘special case’ conditions. Insteadof “WritePixel” write to the screen the coordinates of the pixel that would be drawn. Please provide photos that it works and so I can understand the code better
Write a python program that computes the zakat, obligatory charity, on camels. The program asks the user to input the number of camels, and then the zakat is calculated based on the following table: Rule for computing the zakat of 121 camels or more: You need to find the combinations of 40 camels and 50 camels that will minimize the number of “left over” camels not being “counted” in the zakat. For example, for 130 camels, we have (2*40) + (1*50)=130, with no left overs, and hence, the zakat consists of 2 bint Laboun and 1 Hiqqah. When we have 145 camels, we have the following scenarios: 1. (140) + (250) = 140 with 5 camels left over, 2. (240) + (150) = 130 with 15 camels left over, 3. (340) + (050) = 120 with 25 camels left over. Therefore, in this case the zakat is 1 bint Laboun and 2 Hiqqah, following the first scenario. Important Notes: Make sure that the input value is a positive integer. If not, the program must print the following message: Wrong input. Number should be an…
Write a program that simulates a snail trying to crawl up a building of height 6steps. The snail starts on the ground, at height 0. In each iteration, the snaileither crawls up one step, or slips off one step and falls all the way back to theground. In each iteration you would take a number as input from user and if the number is less 50 than the snail will slip otherwise it will crawl up. The program should keep going until the snail gets to the top of the building. It should then print out the number of falls that the snail took before it finally reached the top.Here is a sample execution:Iteration 1: Please enter a number between [1,100]: 60 Snail Moved: UpIteration 2: Please enter a number between [1,100]: 60 Snail Moved: UpIteration 2: Please enter a number between [1,100]: 40 Snail Moved: DownNumber of falls: 8