DISCRETE MATHMATICS

PRESENTION
Guided By – Prof .Gunjal sir
 PRESENTED BY
RENUKA MALI -83
PITUSH MOHOJKAR -84
SUJATA MORE -85
PRATIK MULE -86
 PROBLEM STATMENT

■ 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.
Making Schedule or Time
Table
1) Suppose we want to make am exam schedule for a university.

2) We have list different subjects and students enrolled in every subject.

3) Many subjects would have common students (of same batch, some
backlog students, etc).

4) How do we schedule the exam so that no two exams with a common

student are scheduled at same time?

5) How many minimum time slots are needed to schedule all exams?

6) This problem can be represented as a graph where every vertex is a

subject and an edge between two vertices mean there is a common
student.

7) So this is a graph coloring problem where minimum number of time

slots is equal to the chromatic number of the graph.
 SOLUTION
■ The above problem based on Graph coloring
■ In this problem we have find the time slotes Courses Exam

■ Graph coloring - is called colorinpanning all the vertices of an graph with colores
such that no two Adjacent vertices have the same colore
■
■ Chromatic Number- the latest number of colore required for coloring of graph G id
called its cromatic number

■ Information
■ The chromatic number of 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
■ . schedule for final exam courses..
■ • Total No of 8
■ 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 courses.
■ 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 185 and Math 195
■ The fewest number of different time slot we need
■ To solve the problem Use the concept of graph coloring method .
■ As well as chromatic number is use
■ In this figure there are 5 chromatic slots
■ In graph we are take a 5 different color slots
■ Red
■ Yellow
■ Blue
■ Green
■ Orange
■ The first slot of the exam consider will be red
■ The number of student taken the Math 115 and math 185
■ Because no any relation in that .student was not select the thise both corses at one time

■ The next slot of the exam consider will be yellow

■ In the this slot no of student math 196 and cs 101
■ There is no any relation student was not choise the is corses at a time

■ The next slot means 3 rd slotes is blue

■ In this slot no of student math 115 and CS 473
■ No any relation in between this course

■ Now , 4 th slot is orange

■ number of few student the course Cs102

■ Last one is the green .this is the 5 th slot

■ No of all student taken the course CS 273
■ .Now we are procced the next step
■ First slot is :math 115 and math 185
■ Second slot is : math 116 and CS 473
■ Third slot is : math 195 and CS 101
■ Fourth slot is : CS 102
■ Fifth slot is : CS 273
There are total use the 5 graph coloring
therefor,
there is 5 chromatic number
There is 5 slot of the above exam
APPLICATION GRAPH COLORING

■ Mobile Radio Frequency Assignment,

■ Register Allocation
■ Map Coloring
■ Sudoku
■ Biparted Graph
■ GSM Network
 REFERENCES

■ Discrete mathematics E book – knneth H.Rosen

■ Lec
6 | MIT 6.042J Mathematics for Computer Science, Fall 2
010 | Video Lecture
■ http://www.natna.info/English/Teaching/CSI35-materials/
BookPages/Rosen_732-733.pdf
■ https://www.mu.edu.sa/sites/default/files/1435-1436%201s
t%20Term%20DM%20%20-%20Lecture04.pdf
THANK YOU