Homework Help is Here – Start Your Trial Now!
Engineering
Computer Science
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.

Database System Concepts
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
icon
Related questions
Question

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.

Expert Solution
steps

Step by step

Solved in 3 steps

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Knowledge Booster
Random Class and its operations
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education
SEE MORE TEXTBOOKS