Electronic Dara Interchange and its advantages.
Define portfolio....What is portfolio weight give example.Difference between Cash Cycle and Operating Cycle.
What is the reason of tax deduction on the difference between book value and market value.
What is the relationship between Capital structure and WACC.
Two aspects of short term financial policy.
Draw the cost table for chain matrix multiplication problem with initial state.
(2)
What is the common problem in communications networks and circuit designing?
(2)
How shortest path information is propagated in graph using Bell-Ford algorithm?
(2)
The following adjacency matrix represents a graph that consists of four vertices labeled 0.
1, 2 and 3. The entries in the matrix indicate edge weights.
0 1 2 3
0 0 1 0 3
1 2 0 4 0
2 0 1 0 1
3 2 0 0 0
Answer the following question.
Supposing we encounter an algorithm that works on weighted graphs, but we want to run
it on an un-weighted graph. How do we do this?
(2)
Consider the following two problems. In P1 we are given as input a set of n squares
(specified by their corner points), and a number k. The problem is to determine whether
there is any point in the plane that is covered by k or more squares.
In P2 we are given as input an n–vertex graph, and a number k; the problem is to
determine whether there is a set of k mutually adjacent vertices. (E.g. for k = 3 we are just
looking for a triangle in the graph.).
Obviously, the problems are both in NP. There exists a simple translation from P1 to P2:
just make a graph vertex for each square, and add an edge between a pair of vertices if
the corresponding two squares overlap.
If P1 is NP-complete, would this translation imply that P2 is NP-complete?
(Give your Answer in Yes or No)
(3)
Briefly discuss at least three variants of the shortest path problem.
