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


Week- 1

Flow Algorithms


Question 1
Which vertices are in the minimum S-T cut in the network below?

1 point

  • A
  • B
  • C
  • D
  • E
  • S
  • T

Question 2
What is the augmenting path that will be used by the Edmonds-Karp algorithm to increase the flow given below?

1 point

  • S-B-D-C-T
  • S-B-A-C-D-T
  • S-B-A-C-T
  • S-B-T
  • S-A-C-T

Question 3
Which of the statements below is true?

1 point

  • The sum of the capacities of the edges of a network equals the sum of the capacities of the edges of any residual network.
  • The Edmonds-Karp algorithm is always faster than the Ford-Fulkerson algorithm.
  • The Ford-Fulkerson algorithms runs in polynomial time on graphs with unit edge capacities.

Question 4
What is the size of the maximum matching of the following graph?

1 point
Enter answer here


Question 5
Consider the image segmentation problem on a picture that is given by an n by n grid of pixels. Suppose that separation penalties are imposed only for adjacent pairs of pixels. If we use the Edmonds-Karp algorithm to solve this problem as described in class, the final runtime is O(n^a) for some a. What is the best such a?

1 point



Programming Assignment: Programming Assignment 1


Click Here To Download





Important Links: