Homework Answers
Here is your topological sort applied on Directed Graph.
Add Answer to:
Topology Sort Which traversal do we use for Topology Sort of a di-graph? Given the following Di-G...
1. Given a set of numbers: A = {1, 3, 5, 2, 8, 7, 9, 4...
1. Given a set of numbers: A = {1, 3, 5, 2, 8, 7, 9, 4 }. Add each digit of your N-Number (e.g. N0 0 3 2 2 0 1 8) to each element of A separately to get your own final array B. ( e.g. B={1,3,8,4,10,7,10,12} = {B1,B2,B3,B4,B5,B6,B7,B8}. ) a) Your set B = ? b) Use merge-sort to sort the array B. Show each step. c) How many “comparisons” for each algorithm above? 2. Use binary-search for...
3. Show the BFS& DFS traversal order of the following graph 4 BFS Traversal Order: GFE...
3. Show the BFS& DFS traversal order of the following graph 4 BFS Traversal Order: GFE DCE DFS Traversal Order 4. Given a 0/1 Knapsack of 5 objects, (Capacity M=11), value-6, 4,7, 2, 3), weig 4 36. 1 Snecify the highest yaluel combination of objects that can fit in the
Question II - Graph Traversal and Minimum Spanning Trees [40 Points] Consider the following graph: B...
Question II - Graph Traversal and Minimum Spanning Trees [40 Points] Consider the following graph: B 10 1 4 1 H 9 4 a) Traverse the graph starting from vertex A, and using the Breadth-First Search algorithm. Show the traversal result and the data structure you are using. [10 Points] b) Traverse the graph starting from vertex A, and using the Depth-First Search (Post-order) algorithm. Show the traversal result and the data structure you are using. [10 Points] c) Apply...
Use Bubble Sort to Sort the following array. Show the steps you would take. [3, 1,...
Use Bubble Sort to Sort the following array. Show the steps you would take. [3, 1, 4, 1, 5, 9, 2, 6, 5]
For the following questions, use the graph (starting node: S) below: 14. Show DFS traversal. 15....
For the following questions, use the graph (starting node: S) below: 14. Show DFS traversal. 15. Show BFS traversal. 16. Show the result of a topological sorting of the graph 17. Dijikstra's single source shortest paths for all nodes 18. Show a tabular form soultion of following 0/1 knapsack problem. Value {5,7, 3, 10, 12, 4, 10} Weight {2,3,1,5, 6, 2,4} Total Weight: 12 19. Show a solution to Fractional knapsack problem with the same weight, value, and total weight...
3. (8 points) Using the implementation of binary search tree operations we discussed in class, draw...
3. (8 points) Using the implementation of binary search tree operations we discussed in class, draw the trees that result from the following operations: (a) Inserting 142, 400, 205, 127, 100, 320, 160, 141, and 110 into an initially-empty tree (in that order). (b) Deleting 142 from the tree you drew for part (a). 4. (8 points) Draw the unique binary tree that has a preorder traversal of 4, 1, 6, 3, 7, 5, 9, 2, 8 and an inorder...
1. a. Using C++, represent the following graph using adjacency matrix, and implement depth first searching...
1. a. Using C++, represent the following graph using adjacency matrix, and implement depth first searching (DFS) by stack (define it with class) to traverse the graph. 6 7 2 4 b. If starting with node 2, when node 7 is printed, what numbers are in the stack (for DFS)? Please draw the stack step by step to show how the numbers are pushed into and popped out of it. 2. a. Given a set of integer numbers as int...
PROBLEM #11 What are the two algorithms used to sort an array? How do they work?...
PROBLEM #11 What are the two algorithms used to sort an array? How do they work? -------------------------------------------------------------------- */ /* --------------------------------------------------------------------------------------------------------------- PROBLEM #12 Given the following array 'jumbled', what will the array be after the first swap of a selection sort algorithm? (Assume the algorithm sorts in ascending order). --------------------------------------------------------------------------------------------------------------- */ int jumbled[] = {12, 5, 3, 1, 9, 100, 45}; /* --------------------------------------------------------------------------------------------------------------- PROBLEM #13 Given the following array 'jumbled2', what will the array be after the third swap of a...
[5 marks] Using selection sort algorithm to sort the array int array[7]-5, 6, 2, 7, 9,...
[5 marks] Using selection sort algorithm to sort the array int array[7]-5, 6, 2, 7, 9, 4, 3). Assuming we call the following function using statement selection sort (int array, 7); Please fill the table to show the changes of the array int_array after each iteration. The first column is filled. void selection_sort (int list[], int list_size) for (int i = 0; i < list size - 1; 1++) int current min = list[1]; int current_min_index-i for (int j -...
Show the execution of the selection sort algorithm on the following array. Hint: The yellow or...
Show the execution of the selection sort algorithm on the following array. Hint: The yellow or shaded squares should be the remaining unsorted values. Pass # 0 1 2 3 4 5 6 7 0 16 11 21 32 41 20 3 9 1 2 3 4 5 6 7 Show the execution of the insertion sort algorithm on the following array. Hint: The yellow or shaded squares should be the remaining unsorted values. Pass # 0 1 2 3...
3. Show the BFS& DFS traversal order of the following graph 4 BFS Traversal Order: GFE DCE DFS Traversal Order 4. Given a 0/1 Knapsack of 5 objects, (Capacity M=11), value-6, 4,7, 2, 3), weig 4 36. 1 Snecify the highest yaluel combination of objects that can fit in the
Question II - Graph Traversal and Minimum Spanning Trees [40 Points] Consider the following graph: B 10 1 4 1 H 9 4 a) Traverse the graph starting from vertex A, and using the Breadth-First Search algorithm. Show the traversal result and the data structure you are using. [10 Points] b) Traverse the graph starting from vertex A, and using the Depth-First Search (Post-order) algorithm. Show the traversal result and the data structure you are using. [10 Points] c) Apply...
For the following questions, use the graph (starting node: S) below: 14. Show DFS traversal. 15. Show BFS traversal. 16. Show the result of a topological sorting of the graph 17. Dijikstra's single source shortest paths for all nodes 18. Show a tabular form soultion of following 0/1 knapsack problem. Value {5,7, 3, 10, 12, 4, 10} Weight {2,3,1,5, 6, 2,4} Total Weight: 12 19. Show a solution to Fractional knapsack problem with the same weight, value, and total weight...
3. (8 points) Using the implementation of binary search tree operations we discussed in class, draw the trees that result from the following operations: (a) Inserting 142, 400, 205, 127, 100, 320, 160, 141, and 110 into an initially-empty tree (in that order). (b) Deleting 142 from the tree you drew for part (a). 4. (8 points) Draw the unique binary tree that has a preorder traversal of 4, 1, 6, 3, 7, 5, 9, 2, 8 and an inorder...
1. a. Using C++, represent the following graph using adjacency matrix, and implement depth first searching (DFS) by stack (define it with class) to traverse the graph. 6 7 2 4 b. If starting with node 2, when node 7 is printed, what numbers are in the stack (for DFS)? Please draw the stack step by step to show how the numbers are pushed into and popped out of it. 2. a. Given a set of integer numbers as int...
[5 marks] Using selection sort algorithm to sort the array int array[7]-5, 6, 2, 7, 9, 4, 3). Assuming we call the following function using statement selection sort (int array, 7); Please fill the table to show the changes of the array int_array after each iteration. The first column is filled. void selection_sort (int list[], int list_size) for (int i = 0; i < list size - 1; 1++) int current min = list[1]; int current_min_index-i for (int j -...
Most questions answered within 3 hours.
-
On May 1, First Bank perfected a security interest in Debtor’s
inventory. On June 1, Bob...
asked 34 minutes ago -
A new kind of typhoid shot is being developed by a medical
research team. The old...
asked 2 hours ago -
Write a chemical equation for these reactions. (Use
the lowest possible whole number coefficients.) Include
states-of-matter...
asked 4 hours ago -
For each of the Z-scores below, determine two probabilities
(show four three decimal places): (1) the...
asked 4 hours ago -
Oxidative phosphorylation is achieved through chemiosmotic
coupling, which turns chemical energy into osmotic potential energy
that...
asked 7 hours ago -
Hollywood Shoes would like to maintain their cash account at a
minimum level of $64,000, but...
asked 7 hours ago -
Proteins CtrA-P, DnaA, and GcrA behave similarly to what
molecule in the Eukaryotic Cell Cycle?
asked 7 hours ago -
TRUE OR FALSE
In case of a competitive tender procedure, in the request for
quotation, the...
asked 7 hours ago -
I am a little behind please provide some explanation, will
provide thumbs up.
This question considers...
asked 7 hours ago -
Let say the utility function as U(X,Y) = lnX + Y. Show that the
marginal rate...
asked 7 hours ago -
A current of I=8.0A is flowing in a typical extension cord of
length L=3.00m. The cord...
asked 7 hours ago -
1. When balancing the equation H2SO4 (aq) + NaOH (aq) →
Na2SO4(aq) + H2O(aq), would you...
asked 8 hours ago