Scribd
Upload
183 views11 pages

Discrete Mathmatics

This document discusses scheduling final exams for 8 courses using graph theory and minimum spanning trees. It explains that there are no students taking certain pairs of courses together. The goal is to schedule the exams using the fewest time slots possible. Graph theory concepts like coloring and chromatic number are introduced to help solve the scheduling problem.

Uploaded by

Sujatas More
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
183 views11 pages

Discrete Mathmatics

This document discusses scheduling final exams for 8 courses using graph theory and minimum spanning trees. It explains that there are no students taking certain pairs of courses together. The goal is to schedule the exams using the fewest time slots possible. Graph theory concepts like coloring and chromatic number are introduced to help solve the scheduling problem.

Uploaded by

Sujatas More
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

Guided By –Gunjal sir

PRESENTED BY -

• RENUKA MALI – 83
• PIYUSH MOHOJKAR -84
• SUJATA MORE – 85
• PRATIK MULE - 86
• Schedule the final exams for Math 115, Math 116, Math
185, Math 195, CS 101, CS 102, CS 273, and CS 473, using
the fewest number of different time slots, if there are no
students taking both Math 115 and CS 473, both Math 116
and CS 473, both Math195 and CS 101, both Math 195 and
CS 102, both Math 115 and Math 116, both Math 115 and
Math 185, and both Math 185 and Math 195, but there are
students in every other pair of courses
• The above problem based on Graph minimum spanning
Tree
• In this problem we have find the time slotes Courses
Exam
•
• Graph theory-panning all the vertices of an graph with colores
such that no two Adjacent vertices have the same colore is
called coloring
• Chromatic Number-the latest number of colore required for
coloring of graph G id called its cromatic number
• Information
• The chromatic number pf graph G is denoted by x(G)
• If x(G) =k then graph J called k-chromatic
• Chromatic number of complete graph k of n vertices is n
• If graph is circuit with n vertices then
• 1) it is 2-Chromatic if n is even
• it is 3 Chromatic is n is add
• No of coloring is a point chromatic point x(G)
•
• schedule for final exam.
• total No of 8 cources
• 1 Math 115
• 2 Math 116
• 3 Math 185
• 4 Math 195
• 5 CS 101
• 6 CS 102
• 7 CS 273
• 8 CS 473
• No of student choices the cources

1. No of student both both math 115 and CS 473


2. No of student both both math 116 and CS 473
3. No of student both both math 195 and CS CS 101
4. No of student both both math 115 and CS 102
5. No of student both both math 115 and math 116
6. No of student both both math 115 and math 185
7. No of student both both math math 185 andmath 195
THE
Graph theory-panning all the vertices of an graph with colores
such that no two Adjacent vertices have the same colore is
called coloring.
What is inertia?

Resistance to motion or change


AMeasurement
ratio betweenofmass
electrical resistance
and velocity
The speed at which an object falls

All of the above


Match the device to what it measures:

Stop Watch Distance

Scale Temperature

Thermometer Elapsed Time

Speedometer Weight

Odometer Rate of Travel

You might also like