CMPS 102 Practice Midterm
Quiz 3 on June 07, 2019; counts like the other midterms.
期中考试代考 That is, if budget part of the input is T what values of T make the problem NP-complete and what values of T permit polynimial solutions?
1 Estimating Sums, Recurrences (Big Θ) 期中考试代考
Mainly, similar in format to midterms 1 and 2. The Master Theorem will be stated, as it has been.
MASTER THEOREM, ETC. — OK TO TEAR THIS PAGE OFF.
As on midterm 1 and midterm 2.
2 NP Completeness (8–16 pts)
Multiple-choice questions about definitions: NP, NP-complete, reduction.
Also, what is known and what is unknown, about relationships between NP, NP-complete, and P (the polynomial-time problems).
What are some well-known problems like Satisfiability, Independent Set, Vertex Cover, Clique, Graph Coloring, Hamiltonian Cycle, Set Cover, Hitting Set.
You should know boundaries between versions of a problem that are NP-complete and those that are polynomial. 期中考试代考
That is, if budget part of the input is T what values of T make the problem NP-complete and what values of T permit polynimial solutions?
3 Network Flow and Min Cut (20–40 pts) 期中考试代考
Algorithm problems like those on 5th homework. Identify a minumum-weight cut.
Multiple-choice questions about Ford-Fulkerson and Edmonds-Karp and minimum-weight cuts may be asked as well.
4 Bipartite Matching (10–15 pts)
Show knowledge of the alternating path algorithm by following the steps to find a maximum bipartite matching.
Three copies of the bipartite graph are given so you can clarify the order in which you do steps. Write comments for further clarifications, if needed.
Proceed in alphabetical order to match a vertex on the left (if possible) that is so-far unmatched.
更多代写：生物学代写 多益代考 商科quiz网课代考 人类学essay代写 瑞士assignment论文代写 大学论文
合作平台：essay代写 论文代写 写手招聘 英国留学生代写
