Practice Reductions (11.1) - Reductions - Design & Analysis of Algorithms

Practise this section

10 questions

Flashcard drill
2 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
4 questions · about 3 min · pass mark 70%. Hints available.
Sign up to start the quiz

6 sample questions

Question 1.
What is a bipartite graph?
Show hintHide hint
Think about how the nodes are structured in pairs.
Question 2.
What is the goal of a matching problem?
Show hintHide hint
Consider how students are assigned to advisors based on preferences.
3Question 3.
What is a reduction in algorithm design?
- Transforming one problem into another
- Simplifying a problem
- Finding a solution directly
Show hintHide hint
Think of problem-solving strategies.
4Question 4.
True or False: A bipartite graph allows edges only within the same group.
- True
- False
Show hintHide hint
Recall how the graph structure is defined.
Question 5.
Given five teachers and four distinct online courses, develop a flow network that represents their allocations. Ensure that each edge reflects the capacity constraint and identify potential matchings.
Show hintHide hint
Use a diagram to visualize flows.
Question 6.
Evaluate the implications if a matching problem cannot be efficiently solved. Discuss how this affects related problems in the context of reduction.
Show hintHide hint
Consider what underlying properties might relate the difficulties of both problems.

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