12. Provide, pseudocode to finding the sum of an array of ints. What is the runtime of your code?

3412 in base 5 to base 2

Q1: We define the capacity of a path in a weighted graph G(V, E) to be the minimum weight of an edge along that path. For example, the capacity of the path [V0, V1, V2] in the graph below is 5 and the capacity of the path V1, V0, V3, V2 is 3. A maximum-capacity path between u and v is a simple path between u and v whose capacity is larger than or equal to those of all paths from u to v. In the graph below, the maximum capacity path from V0 to V3 is [V0, V1, V2, V3]. (a) Show that if [a, b, ... , u, v] is a maximum-capacity path from a to v, then a maximum- capacity path from a to u followed by the edge (u, v) is a maximum-capacity path from a to v. (b) Is it true that if [a, b, c, u, v] is a maximum-capacity path from a to v, then [a, b, c, u] is a maximum-capacity path from a to u? Why? (c) Can you think of an algorithm you have seen before that can be modified to find the maximum-capacity paths from a particular vertex s to all other vertices in the graph? How?

How well versed are you on the workings of port numbers?

3044 in base 5 to base 10