Explanation:
Most presentation programs allow you to save presentations so they can be viewed online by saving them as html
files.
Most presentation programs allow you to save presentations so they can be viewed online by saving them as html files.
The Bellman-Ford algorithm for the shortest path problem with negative edge weights will report that there exists a negative cycle if at least one edge can still be relaxed after performing nm times of relaxations. The algorithm, however, does not specify which cycle is a negative cycle. Design an algorithm to report one such cycle if it exists. You should make your algorithm runs as fast as possible.
Answer:
- Iterate over the Bellman-Ford algorithm n-1 time while tracking the parent vertex and store in an array.
- Do another iteration and if no relaxation of the edges occurs in the nth iteration then print of return "There are no negative cycle".
- Else, store the vertex of the relaxed edge at the nth iteration with a variable name.
- Then iterate over the vertexes starting from the store vertex until a cycle is found then print it out as the cycle of negative weight.
Explanation:
The Bellman-Ford algorithm can be used to detect a negative cycle in a graph. The program should iterate over the algorithm, in search of a relaxed edge. If any, the vertex of the specified edge is used as a starting point to get the target negative cycle.
Is it important to use varied methods when creating digital media presentations? Why or why not?
Yes, because no one method is capable of adequately delivering the information.
No, because using more than one method is confusing to the audience.
No, because the different methods are incompatible with each other.
Yes, because it makes the presentation more interesting for the audience.
g A CPU is equipped with a cache; Accessing a word takes 20 clock cycles if the data is not in the cache and 5 clock cycles if the data is in the cache. What is the effective memory access time in clock cycles if the hit ratio is 90%
Answer:
6.5
Explanation:
The formula to calculate the efficiency is;
= (cache-click-cycle x hit ratio) + ( memory-clock-cycle x 1 - hit ratio)
= (5 x 0.9) + ( 20 x 0.1)
= 4.5 + 2
= 6.5
In this exercise we have to use the knowledge of efficiency, in this way, using the data already informed, we can say that the result of this is:
6.5 effective memory
In this exercise, it was informed that some conditions must be established, that is:
Hit radio: 90%Memory: 20Cache: 5
The formula to calculate the efficiency is;
[tex]efficiency= ((cache-click-cycle)(hit \ ratio)) + ( (memory-clock-cycle)(1 - hit \ ratio))[/tex]
Substituting the known values in the formula above, we find that:
[tex]= (5)(0.9) + ( 20)(0.1)\\= 4.5 + 2\\= 6.5[/tex]
See more about efficiency at brainly.com/question/6672666
g Assume that this program is run on a processor with data cache of size big enough that the entire array arr can fit in the cache. (a) How many paths does the function foo of this program have
Answer:
A. 2
Explanation:
The food function in the C source code uses two for loop statements to fill and array of size 100 with 100 values ranging from 1 to 100 and the second to get the total sum to the values in the array. With this, two program paths are created.