(Latest Revision: Fri May 8 2020 )
cs4440q2Recap.txt
cs4440q2Recap.txt
Quiz #2 Answer Information
What You Needed to Know
- There were four five-point questions in which you needed to use the
skills involved in
this homework problem, which is found under the title
"Minimum Cost Spanning Tree Problem"
in this list. The solution to the problem is in the list too, plus
a screencast that shows how to work the problem
("Screencast: Solutions to Min Spanning Tree; Sort and Count;
and Weighted Intervals Problems "). Kruskal's algorithm and
Prim's algorithm are covered in section 4.5 of the text, as well as
under "Information about Minimum Cost Spanning Tree Algorithms" here.
- There was a question asking about the computational complexity of Kruskal's
algorithm. The answer can be found
under the heading
"Summary of Information about Efficiency of Some Greedy Algorithms" here,
as well as in the chapter four information in "review.html,"
found here.
- There were four five-point questions about the Union-Find Data Structure
(Disjoint Sets) covered in section 4.6, which is essential to the efficiency
of Kruskal's algorithm. My notes on that subject, which introduce the notation
used in the quiz questions,
are here under "Information about Disjoint Set Representation"
- There was a question asking you to apply the work function theorem
for divide and conquer, which I covered
in the notes here.
Click on "The Work Function Theorem for Divide and Conquer Algorithms (HTML)"
to see the web page about the theorem, and click on
"Screencast on The Work Function Theorem for Divide and Conquer Algorithms (MP4)"
to see my screencast explaining how to use the theorem.
- There were four five-point questions in which you needed to use the
skills involved in
this homework problem, which is found under the title
"Sort and Count Problem"
in this list. The solution to the problem is in the list too, plus
a screencast that shows how to work the problem
("Screencast: Solutions to Min Spanning Tree; Sort and Count;
and Weighted Intervals Problems ").
- A question asked the computational complexity of the algorithm that finds the
closest pair of points. This algorithm is covered in section 5.4, and
the complexity of the algorithm is stated explicitly in item 5.12 on page 231.
It's also in the chapter five information in "review.html,"
found here.
- A question asked the computational complexity of the algorithm that multiplies two
n-bit numbers. This algorithm is covered in section 5.5, and
the complexity of the algorithm is stated explicitly on page 233.
It's also in the chapter five information in "review.html,"
found here.
- There was a question about the back-tracking part of the weighted intervals
problem. It is part of the skills you need to solve
this homework problem, which is found under the title
"Weighted Intervals Problem "
in this list. The solution to the problem is in the list too, plus
a screencast that shows how to work the problem.
("Screencast: Solutions to Min Spanning Tree; Sort and Count;
and Weighted Intervals Problems ").
- A question asked the overall computational complexity
of the algorithm that solves the weighted intervals problem.
The algorithm is covered in section 6.1 and 6.2. The information
about the complexity is in the chapter six information in "review.html,"
found here.