Practice Finding A Route In Directed And Undirected Graphs (18.2.7) - Design and Analysis of Algorithms

Practice: Finding a Route in Directed and Undirected Graphs

Lesson 18.2.7Design and Analysis of Algorithms

Practise this section

9 questions

Flashcard drill
4 cards from this section. Quick, good the night before a test.
Exercise
6 questions · about 4 min · pass mark 70%. Hints available.
Sign up to start the exercise
Quiz
3 questions · about 2 min · pass mark 70%. Hints available.
Sign up to start the quiz

6 sample questions

Question 1.
What are the two main components of a graph?
Show hintHide hint
Think about what connects the points in a graph.
Question 2.
Define what a vertex is.
Show hintHide hint
What do we call the points on a map?
3Question 3.
What are the two main types of graphs we discussed?
- Directed and Undirected
- Circles and Triangles
- Colored and Non-colored
Show hintHide hint
Recall the types mentioned during our discussions.
4Question 4.
True or False: Every map can be colored using just two colors.
- True
- False
Show hintHide hint
Think about the complexity of borders in different regions.
Question 5.
You have a directed graph where cities A, B, and C are connected as follows: A to B, B to C, but not A to C. You want to travel from A to C. Is it possible, and why?
Show hintHide hint
Consider the direction of each connection.
Question 6.
In a political map with states represented as vertices, find a sequence of coloring with five colors that represents the same map, but shows that four colors are still sufficient. Which are the states that could share colors and why?
Show hintHide hint
Visualize states and their borders on a map.

5 more questions in this section. Enroll free to practise them all.