Create Quiz

# Polynomial Time Approximation Scheme -Quiz

## Polynomial Time Approximation Scheme (PTAS) is a type of approximate algorithms that provide user to control over accuracy which is a desirable feature. These algorithms take an additional parameter ε > 0 and provide a solution that is (1 + ε) approximate for minimization and (1 – ε) for maximization

You can mute/unmute sounds from here

## You May Get Result Of Polynomial Time Approximation Scheme -Quiz

Polynomial Time Approximation Scheme (PTAS) is a type of approximate algorithms that provide user to control over accuracy which is a desirable feature. These algorithms take an additional parameter ε
Polynomial Time Approximation Scheme (PTAS) is a type of approximate algorithms that provide user to control over accuracy which is a desirable feature. These algorithms take an additional parameter ε
Polynomial Time Approximation Scheme (PTAS) is a type of approximate algorithms that provide user to control over accuracy which is a desirable feature. These algorithms take an additional parameter ε
Polynomial Time Approximation Scheme (PTAS) is a type of approximate algorithms that provide user to control over accuracy which is a desirable feature. These algorithms take an additional parameter ε

N log N times
log N times
N2 times
None

Bubble sort
Quick sort
Merge sort

## In analysis of algorithm, approximate relationship between the size of the job and the amount of work required to do is expressed by using _________

Central tendency
Differential equation
Order of execution
Order of magnitude

R=Q; P=R; Q=R;
R=P; P=P; Q=Q;
P=P; P=Q; R=Q;
R=P; P=Q; Q=R;

1
3
4
None