## In this blog you will find the correct answer of the Coursera quiz Advanced Algorithms and Complexity Coursera Week 4 Quiz mixsaver always try to bring the best blogs and best coupon codes

Week-4

Coping with NP-completeness

1.
Question 1
What is the weight of a minimum traveling salesman cycle in the following graph?

1 point

 110

2.
Question 2
Recall that the dynamic programming algorithm for the traveling salesman problem uses O(n^2 \cdot 2^n)O(n
2
⋅2
n
) time and O(n \cdot 2^n)O(n⋅2
n
) space (as usual, nn is the number of vertices). You are going to run this algorithm on a graph with 50 vertices. Roughly how much space is needed for this assuming that each cell of the dynamic programming table occupies 8 bytes? (See How much is 1 megabyte, gigabyte, etc?)

1 point

• Kilobyte
• Megabyte
• Gigabyte
• Terabyte
• Petabyte
• Exabyte
• Zettabyte
• Yottabyte

3.
Question 3
What is the maximum size of an independent set in the following tree?

1 point

 10

Programming Assignment: Programming Assignment 4