Practice Matching Problem (11.1.1) - Reductions - Design & 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 is the matching problem?
Show hintHide hint
Think about matching pairs.
Question 2.
Define a bipartite graph.
Show hintHide hint
Remember the two groups in the graph.
3Question 3.
What is a bipartite graph?
- A graph with no edges
- Edges between two distinct sets
- A circular graph
Show hintHide hint
Think about the sets involved in the graph.
4Question 4.
In a matching problem, can a teacher teach more than one course?
- True
- False
Show hintHide hint
Consider the rules of allocation.
Question 5.
Suppose there are 6 teachers and 3 courses. Each teacher has their preferences for the courses. Describe the steps to find an optimal matching.
Show hintHide hint
Think about how you would visualize the preferences.
Question 6.
If a new course is added to an existing matching scenario, how would you approach adjusting the current allocations?
Show hintHide hint
Consider how additional options can lead to new combinations.

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