1. The Beauty of Computer Science
Welcome!
The Beauty of Computer Science
Cinda Heeren
Lecturer
Department of CS
UIUC

2. Let’s play! 1. People on adjacent vertices must hold different poses.
2. Use the smallest # of poses possible.
3. I specify some poses.

3. This is a very useful problem to know about… but I introduced it to you here because we can play this fun game… and it gets you accustomed to seeing graphs…
Graph Coloring

4. Lunchroom Politics Can you seat your friends?
Suppose you have 16 friends each of whose talkitivity rating is O, L, P, S, 4 friends per type.
No one sitting in the same “column” can have the same talkitivity rating.
No one sitting on the same side of a pair of tables can have the same talkitivity rating.
No one sitting at the same table can have the same talkitivity rating.
We are looking for photos of these women. Also, I think we’ll probably replace the first person with Mary Pacold, who is doing computational biology in graduate school, or something like that.
Can you seat your friends?

5. Lunchroom Politics Can you seat your friends?
Suppose you have 16 friends each of whose talkitivity rating is O, L, P, S, 4 friends per type.
No one sitting at the same table can have the same talkitivity rating.
We are looking for photos of these women. Also, I think we’ll probably replace the first person with Mary Pacold, who is doing computational biology in graduate school, or something like that.
No one sitting on the same side of a pair of tables can have the same talkitivity rating.
No one sitting in the same “column” can have the same talkitivity rating.
Can you seat your friends?

6. Lunchroom Politics Can you solve the puzzle?
Fill in the grid so that each row, column, and bold 2x2 square has exactly one of each of the digits 1 through 4.
We are looking for photos of these women. Also, I think we’ll probably replace the first person with Mary Pacold, who is doing computational biology in graduate school, or something like that.
Can you solve the puzzle?

7. 1 2 2 4 3 Sudoku Can you solve the puzzle?
Fill in the grid so that each row, column, and bold 2x2 square has exactly one of each of the digits 1 through 4. 2
BRING IN THE GRAPH COLORER!!!!!! 2 4 3
Can you solve the puzzle?

8. Sudoku? 1 2
Draw the graph on the boxes… 2 4 3

9. Sudoku? 1
I can use my Graph Colorer to solve my Sudoku puzzles! 2
To do so, I just have to run out to the store and buy an adapter that changes my Sudoku puzzle into the right graph…
Draw the graph on the boxes… 2 4 3

10. What does this have to do with computer science?
You can think of the “adapter” and the “graph colorer” as pieces of software.
They are programs whose inputs and outputs are well defined.
Exam Scheduler / Graph Color
ADAPTER
Ultimate
Graph Colorer
Map Color / Graph Color
ADAPTER
Sudoku / Graph Color
ADAPTER
Beautiful

11. Why are these two problems on the same slide?
CS173 Graphs
Suppose YOU are the person in charge of scheduling finals.
Conflict exams are not allowed…that is, no student can have two exams scheduled for any one time.
How many exam periods do you need?
Why are these two problems on the same slide?
Suppose I give you a graph consisting of vertices and edges. Your task is to label the vertices with colors.
Vertices which share an edge cannot be colored the same.
How many colors do you need?

12. CS173 Graphs
Graphs are a very general way of representing data. We can use graphs to model things as diverse as:
Scheduling problems
Routes for travelling between cities
Connections between atoms in a molecule
Paths that messages can take in a network
Dependence relations between events in a large project

13. CS173 Graphs

14. CS173 Graphs Definitions you should understand: Simple Vertex Edge
Weights
Degree
Neighbors
Connected
Complete
Bipartite
Planar
Cycle
Tree
Path
Circuit

15. CS 173 Announcements Homework #13 available, due 5/7, 8a.
Final exam 5/10, 7-10p, 1404 Siebel, cinda w conflicts.
Exam review: 5/9, 5-6:30p, location TBA
Section this week is review.