0
Add your answer:
Earn +20 pts
What problem is solved by banker's algorithm?
deadlock avoidance
What is a step by step solution of a programming problem?
An algorithm.
When you choose iterative or recursive algorithm?
If you cannot find any iterative algorithm for the problem, you have to settle for a recursive one.
Where do you run an algorithm?
By preparing test cases we can test an algorithm. The algorithm is tested with each test case.
What are the features of algorithm?
An algorithm is just a description of a series of steps used to solve a specific problem.
What is an intractable problem in computer limitations and can give the example?
An intractable problem is one for which there is an algorithm that produces a solution - but the algorithm does not produce results in a reasonable amount of time. Intractable problems have a large time complexity. The Travelling Salesman Problem is an example of an intractable problem.
What are the differences between Chinese postman problem and travelling salesman problem?
Imagine an island with a road network joining several towns. You want to visit each town before returning to your start point. Finding the best solution to this is the travelling salesman problem. now imagine you want to resurface every road on the network. To do this in the shortest distance is the Chinese postman problem. Essentially for the travelling salesman problem you have to visit every vertex. For the Chinese postman problem every edge must be visited.
What are the two applications of dynamic programming?
1)Multistage graph 2)Travelling salesman problem
What is a packman?
A packman is a person who travels with a pack, especially a travelling salesman.
What has the author Harry A Thompson written?
Harry A. Thompson has written: 'The travelling salesman'
What does the word algorithm mean today?
An algorithm is the process by which you solve a problem
Why algorithm needs to solve programming problem?
This is the definition of an algorithm - a list of orders of how to solve a given programming problem.
What are the release dates for Travelling Salesman - 2012?
Travelling Salesman - 2012 was released on: USA: 16 June 2012 (Philadelphia, Pennsylvania) (premiere) USA: 13 August 2012 (New York City International Film Festival)
What are the qualities required for a Good salesman?
A good salesman is a good problem solver.
What type of computer would be suitable for a salesman who need to work on his computer while travelling?
A laptop
In math what is traveling sales man problem?
The "travelling salesman problem" is the problem where you have to find the shortest route to visit each of several cities. Even if the distances between the cities are known, the solution is actuall quite complicated; a lot of different algorithms (methods) have been developed to optimize the problem under certain circumstances.
What is an algorithm to calculate the sum of the digits of a three digit number?
algorithm is a way to solve your problem
