2. Suppose we want to schedule final exams for the courses listed below so that for each course, all sections take the exam at the same time. No professor can proctor more than one exam in a time slot, though they teach multiple courses. Course assignments are listed below. (The two tables include the same information, just sorted differently.) In addition to these restrictions, we know that there are several students taking more than one of these classes. We want to schedule so that their exams do not overlap. There are some students taking both Math 263 and Math 301, some taking both both Math 264 and Math 305, and some taking both Math 353 and Math 375. Use a graph model to determine the minimum number of times slots required. Be sure to explain your model, including what the vertices and edges represent. Math 262| Bu Math 262 | Lisi Math 262 | Nguyen Math 263 Bu Math 263 Longla Math 263 Reid Math 263 Roberts Math 264 Khan Math 264 Kocic Math 264 Roberts Bu Math 263 Bu Math 262 Dang Math 375 Khan Math 264 Кoсіc Math 264 Lisi Math 262 Lisi Math 319 Longla Math 263 Longla Math 353 Mina-Diaz Math 353 Math 264 s. Lee Nguyen Math 262 Math 301| Sheppardson Math 305| Sheppardson Math 319 Lisi Math 353 Longla Math 353 Mina-Diaz Math 353 S. Lee Math 375 Dang Math 375 Nguyen Nguyen Math 375 Reid Math 263 Roberts Math 263 Roberts Math 264 S. Lee Math 264 S. Lee Math 353 Math 375 Sang Sheppardson Math 301 Sheppardson Math 305 Math 375 Sang
2. Suppose we want to schedule final exams for the courses listed below so that for each course, all sections take the exam at the same time. No professor can proctor more than one exam in a time slot, though they teach multiple courses. Course assignments are listed below. (The two tables include the same information, just sorted differently.) In addition to these restrictions, we know that there are several students taking more than one of these classes. We want to schedule so that their exams do not overlap. There are some students taking both Math 263 and Math 301, some taking both both Math 264 and Math 305, and some taking both Math 353 and Math 375. Use a graph model to determine the minimum number of times slots required. Be sure to explain your model, including what the vertices and edges represent. Math 262| Bu Math 262 | Lisi Math 262 | Nguyen Math 263 Bu Math 263 Longla Math 263 Reid Math 263 Roberts Math 264 Khan Math 264 Kocic Math 264 Roberts Bu Math 263 Bu Math 262 Dang Math 375 Khan Math 264 Кoсіc Math 264 Lisi Math 262 Lisi Math 319 Longla Math 263 Longla Math 353 Mina-Diaz Math 353 Math 264 s. Lee Nguyen Math 262 Math 301| Sheppardson Math 305| Sheppardson Math 319 Lisi Math 353 Longla Math 353 Mina-Diaz Math 353 S. Lee Math 375 Dang Math 375 Nguyen Nguyen Math 375 Reid Math 263 Roberts Math 263 Roberts Math 264 S. Lee Math 264 S. Lee Math 353 Math 375 Sang Sheppardson Math 301 Sheppardson Math 305 Math 375 Sang
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
Related questions
Question
Please provide an explanation along with the graph model
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 3 steps with 1 images
Knowledge Booster
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.Recommended textbooks for you
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)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
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)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education