[Solved]Swebdav Pid 13274109 Dt Content Rid 102248695 1 Courses Wl 17208201920 Hw11pdf Automatic Z Q37227366
swebdav/pid-13274109-dt-content-rid-102248695 1/courses/wl 17208.201920/hw11.pdf – + Automatic Zoom 1. You have been asked to solve a problem that is described as a system of difference constraint where each constraint is of the form xi-rj bij, where xi,x/ are variables and b) ís a constani The following is an example of such a system of difference constraints: 6×38. Specify suitable data structure(s) and algorithm that would allow you to solve such a problem By solving such a problem, it means that you determine suitable values for the variables such that all constraint are satisfied or you determine that the problem does not have a solution. If a tree data structure is suitable, for example, you can specify what a tree node is, what a tree edge is, and what a root node is. You may actually use more than one data structure in your solution (you may use a queue for a breadth-first traversal of the tree, for example). If an algorithm from the class lectures is suitable, you can simple state the name of the algorithm (breadth-first tree traversal, for example). Be concise. What is the time complexity of your algorithm, assuming that there are n variables and m constraints? Express the time complexity in terms of n and m For the given system of difference constraints, use the proposed data structures to represent it (if you have chosen a tree data structure, for example, you can draw a suitable tree). Use your proposed algorithm to determine suitable values for the variables or determine that the problem does not have a solution. DENT Show transcribed image text swebdav/pid-13274109-dt-content-rid-102248695 1/courses/wl 17208.201920/hw11.pdf – + Automatic Zoom 1. You have been asked to solve a problem that is described as a system of difference constraint where each constraint is of the form xi-rj bij, where xi,x/ are variables and b) ís a constani The following is an example of such a system of difference constraints: 6×38. Specify suitable data structure(s) and algorithm that would allow you to solve such a problem By solving such a problem, it means that you determine suitable values for the variables such that all constraint are satisfied or you determine that the problem does not have a solution. If a tree data structure is suitable, for example, you can specify what a tree node is, what a tree edge is, and what a root node is. You may actually use more than one data structure in your solution (you may use a queue for a breadth-first traversal of the tree, for example). If an algorithm from the class lectures is suitable, you can simple state the name of the algorithm (breadth-first tree traversal, for example). Be concise. What is the time complexity of your algorithm, assuming that there are n variables and m constraints? Express the time complexity in terms of n and m For the given system of difference constraints, use the proposed data structures to represent it (if you have chosen a tree data structure, for example, you can draw a suitable tree). Use your proposed algorithm to determine suitable values for the variables or determine that the problem does not have a solution. DENT
Expert Answer
Answer to swebdav/pid-13274109-dt-content-rid-102248695 1/courses/wl 17208.201920/hw11.pdf – + Automatic Zoom 1. You have been ask… . . .
OR
