Use Prim’s and Kruskal’s Algorithm to find the minimum spanning tree

INSTRUCTIONS TO CANDIDATES

ANSWER ALL QUESTIONS

Question1 :

Use Prim’s and Kruskal’s Algorithm to find the minimum spanning tree for the following networks:

Question 3:

For the following network find the maximum flow from s to t.

Question 4:

Solve the following travelling salesman problem:

Question 5:

Solve:

𝑀𝑎𝑥 𝑧 = 3𝑥1 + 5𝑥2 + 3𝑥3

𝑥1 + 2𝑥2 + 2𝑥3 ≤ 14 2𝑥1 + 4𝑥2 + 3𝑥3 ≤ 23

0 ≤ 𝑥1 ≤ 4, 0 ≤ 𝑥2 ≤ 5, 0 ≤ 𝑥3 ≤ 3

Attachments:

Related Questions

. The fundamental operations of create, read, update, and delete (CRUD) in either Python or Java

CS 340 Milestone One Guidelines and Rubric  Overview: For this assignment, you will implement the fundamental operations of create, read, update,

. Develop a program to emulate a purchase transaction at a retail store. This  program will have two classes, a LineItem class and a Transaction class

Retail Transaction Programming Project  Project Requirements:  Develop a program to emulate a purchase transaction at a retail store. This

. The following program contains five errors. Identify the errors and fix them

7COM1028   Secure Systems Programming   Referral Coursework: Secure

. Accepts the following from a user: Item Name Item Quantity Item Price Allows the user to create a file to store the sales receipt contents

Create a GUI program that:Accepts the following from a user:Item NameItem QuantityItem PriceAllows the user to create a file to store the sales receip

. The final project will encompass developing a web service using a software stack and implementing an industry-standard interface. Regardless of whether you choose to pursue application development goals as a pure developer or as a software engineer

CS 340 Final Project Guidelines and Rubric  Overview The final project will encompass developing a web service using a software stack and impleme