Suppose you are given a timetable, which consists of:Describe an efficient algorithm for the flight scheduling problem. In this problem, we are given airports a and b, and a time t, and we wish to...
Recent Questions
Inside the Castle of Asymptopia there is a maze, and along each corridor of the maze there is a bag of gold coins. The amount of gold in each bag varies. A noble knight, named Sir Paul, will be...
1. Design an experimental comparison of repeated DFS traversals versus the FloydWarshall algorithm for computing the transitive closure of a directed graph.2. Develop a Java implementation of the...
NASA wants to link n stations spread over the country using communication channels. Each pair of stations has a different bandwidth available, which is known a priori. NASA wants to select n−1...
Ghana cedis has depreciating against all major foreign tradingcurrencies in recent time.Use the experience of the ghanaian firmsto suggest the need for exchange rates forecasting in ghana.b.Discuss...
Where do I get the financial ratio of SEARSHolding?Looking for a brief description of the company financialperformance over the last 10 years, including sales, net income,EPS, dividends, market...
German Motors exports cars to the U.S. Market. On January 20,2008, its most popular model was selling (wholesale) to U.S.dealers for $48,000 (US dollars). What price must GermanMotors charge for the...
George Liu, the CEO of Penn Schumann was a creature of habit.Every month he and Jennifer Rodriquez, the companyAc€?cs chieffinancial officer, met for lunch and an informal chat at...
Generate a Yield Curve for USTreasuries as of July 7th, 2015. Be sure to include the 3 month, 6 month,1-, 2-, 3-, 5-, 7-, 20-, 30- year maturities.show excel formualsplz
Generally speaking, which of the following situations will occurif a seasonal company adopts a compromise financial policy?I. periods where short-term financing is requiredII less long-term debt...
What are the general trends regarding public security issuanceby U.S. corporations? Specifically, which security type is mostoften sold to the public? What is the split between initial andseasoned...
The General Chemical Company uses 150,000 gallons ofhydrochloric acid per month. The cost of carrying the chemical ininventory is 50 cents per gallon per year, and the cost of orderingthe chemical...
Giant Corp. is considering a project that requires a $1,500initial cost for a new machine that will be depreciated straightline to a salvage value of 0 on a 5-year schedule. The project willrequire...
GE has the following two projects that it is considering; it canchoose only one. Project A has an investment outlay/expense todayof $9.7M, and its cash flows over the next three years are...
1. Show that if all the weights in a connected weighted graph G are distinct, then there is exactly one minimum spanning tree for G.2. An old MST method, called Baruvka’s algorithm, works as follows...
Consider the following greedy strategy for finding a shortest path from vertex start to vertex goal in a given connected graph.1: Initialize path to start.2: Initialize set visited to {start}.3: If...
Our implementation of shortestPathLengths in Code Fragment 14.13 relies on use of “infinity” as a numeric value, to represent the distance bound for vertices that are not (yet) known to be reachable...
1. Give an example of an n-vertex simple graph G that causes Dijkstra’s algorithm to run in Ω(n2 logn) time when its implemented with a heap.2. Give an example of a weighted directed graph with...
An independent set of an undirected graph G = (V,E) is a subset I of V such that no two vertices in I are adjacent. That is, if u and v are in I, then (u,v) is not in E. A maximal independent set M...
1. Let be a weighted directed graph with n vertices. Design a variation of FloydWarshall’s algorithm for computing the lengths of the shortest paths from each vertex to every other vertex in O(n3)...
Say that an n-vertex directed acyclic graph is compact if there is some way of numbering the vertices of with the integers from 0 to n−1 such that contains the edge (i, j) if and only if i...
Tamarindo University and many other schools worldwide are doing a joint project on multimedia. A computer network is built to connect these schools using communication links that form a tree. The...
1. Let G be a graph with n vertices and m edges such that all the edge weights in G are integers in the range [1,n]. Give an algorithm for finding a minimum spanning tree for G in O(mlog∗ n) time.2....
The time delay of a long-distance call can be determined by multiplying a small fixed constant by the number of communication links on the telephone network between the caller and callee. Suppose...
An Euler tour of a directed graph with n vertices and m edges is a cycle that traverses each edge of exactly once according to its direction. Such a tour always exists if is connected and the...
A graph G is bipartite if its vertices can be partitioned into two sets X and Y such that every edge in G has one end vertex in X and the other in Y. Design and analyze an efficient algorithm for...
1. Show that if T is a BFS tree produced for a connected graph G, then, for each vertex v at level i, the path of T between s and v has i edges, and any other path of G between s and v has at least...
1. Explain why all nontree edges are cross edges, with respect to a BFS tree constructed for an undirected graph.2. Explain why there are no forward nontree edges with respect to a BFS tree...
Computer networks should avoid single points of failure, that is, network vertices that can disconnect the network if they fail. We say an undirected, connected graph G is biconnected if it contains...
Say that a maze is constructed correctly if there is one path from the start to the finish, the entire maze is reachable from the start, and there are no loops around any portions of the maze. Given...
Write a method, components(G), for undirected graph G, that returns a dictionary mapping each vertex to an integer that serves as an identifier for its connected component. That is, two vertices...
A company named RT&T has a network of n switching stations connected by m high-speed communication links. Each customer’s phone is directly connected to one station in his or her area. The...
1. Let G be an undirected graph with n vertices and m edges. Describe an O(n+m)- time algorithm for traversing each edge of G exactly once in each direction.2. Implement an algorithm that returns a...
George claims he has a fast way to do path compression in a partition structure, starting at a position p. He puts p into a list L, and starts following parent pointers. Each time he encounters a...
Suppose we wish to represent an n-vertex graph G using the edge list structure, assuming that we identify the vertices with the integers in the set {0,1,…,n−1}. Describe how to implement the...
Give a Java implementation of the removeEdge(e) method for our adjacency map implementation of Section 14.2.5, making sure your implementation works for both directed and undirected graphs. Your...
Repeat Exercise R-14.28 for Figures 14.22 through 14.24 that illustrate Kruskal’s algorithm.Exercise R-14.28Describe the meaning of the graphical conventions used in Figure 14.9 illustrating a DFS...
Repeat Exercise R-14.28 for Figures 14.20 and 14.21 that illustrate the PrimJarn´ık algorithm.Exercise R-14.28Describe the meaning of the graphical conventions used in Figure 14.9 illustrating a DFS...
Repeat Exercise R-14.28 for Figures 14.15 and 14.16 illustrating Dijkstra’s algorithm.Exercise R-14.28Describe the meaning of the graphical conventions used in Figure 14.9 illustrating a DFS...
Repeat Exercise R-14.28 for Figure 14.13 that illustrates the topological sorting algorithm.Exercise R-14.28Describe the meaning of the graphical conventions used in Figure 14.9 illustrating a DFS...
Recent Comments