What is exact and approximation algorithm, Computer Engineering

What is Exact and Approximation algorithm?

The principal decision to choose solving the problem exactly is called exact algorithm. The   principal decision to choose solving the problem approximately is known as Approximation algorithm.  

 

Posted Date: 7/27/2013 5:01:26 AM | Location : United States







Related Discussions:- What is exact and approximation algorithm, Assignment Help, Ask Question on What is exact and approximation algorithm, Get Answer, Expert's Help, What is exact and approximation algorithm Discussions

Write discussion on What is exact and approximation algorithm
Your posts are moderated
Related Questions
Preparation of writing the program 1.  Write an algorithm for your program closer to assembly language. For instance the algorithm for preceding program will be: get NUM1

Q. Find the complement of following functions and reduce to minimum literals 1. (A+C+D) (A+C+D') (A+C'+D)(A+D') 2. ABC(ABC' + AB'C + A'BC) 3. AB + AB' + A'C +A'C'

Q. Example to show a single digit ? Displaying a single digit (0 to 9) Presume that a value 5 is stored in BL register then to output BL as ASCII value add character ‘0' to

Perform the subtraction using 1's complement of 11001 - 10110 Ans. 11001 - 10110 = X - Y                            X = 11001 1's complement of Y = 01001

Adding Operations of describe function  Whenever take a look at the operations in OOPs you find queries about attributes or associations in object model (such as student.name)

Q. Explain about Deadlock Avoidance? To prevent deadlocks two kinds of techniques are used: 1) Static prevention:  It employs P and V operators in addition to Semaphores to

POSIX is the IEEE's Portable Operating System Interface for Computer Environments. The standard provides compliances criteria for operating system services and is designed to allow

Q. Programmed input - output technique for computers? Programmed input/output is a useful I/O technique for computers where hardware costs need to be minimised. Input or output

Fixed Arithmetic pipelines  We obtain the example of multiplication of fixed numbers. The Two fixed-point numbers are added by the ALU using shift and add operations. This sequ

Proof by Contradiction: Now for forward chaining and backward chaining both have drawbacks. But another approach is to think about proving theorems by contradiction. So we can