0
Difference between deterministic and nondeterministic algorithm in design and analysis of algorithm?
Wiki User
∙ 14y ago
Algorithm is deterministic if for a given input the output generated is same for a function. A mathematical function is deterministic. Hence the state is known at every step of the algorithm.Algorithm is non deterministic if there are more than one path the algorithm can take. Due to this, one cannot determine the next state of the machine running the algorithm. Example would be a random function.FYI,Non deterministic machines that can't solve problems in polynomial time are NP. Hence finding a solution to an NP problem is hard but verifying it can be done in polynomial time. Hope this helps.Pl correct me if I am wrong here.Thank you.Sharada
Wiki User
∙ 14y ago
Wiki User
∙ 14y agoSee this:
Difference_between_deterministic_and_nondeterministic_algorithm_in_design_and_analysis_of_algorithm
Thank you
Sharada
Add your answer:
Earn +20 pts
What is the criteria of algorithm analysis?
The term "analysis of algorithms" was coined by Donald Knuth. Algorithm analysis is an important part of a broader computational complexity theory, which provides theoretical estimates for the resources needed by any algorithm which solves a given computational problem.
Analysis of algorithm question bank?
An algorithm is a set of instructions that performs a particular task making sure that those instructions are followed. Analysis of algorithm question bank is needed when any of the following occurs: when a working program is not good enough, when program may be inefficient or when a running time of a program becomes an issue.
Why you study algorithm?
There are so many reasons for a programmer to study algorithm. This will help in proper analysis of problems and coming up with fast solutions that relate to programming.
What is prori analysis and posteriori testing of algorithms?
A priori analysis of an algorithm refers to its time and space complexity analysis using mathematical (algebraic) methods or using a theoritical model such as a finite state machine. (In short, analysis prior to running on real machine.) A posteriori analysis of an algorithm refers to the statistical analysis of its space and time complexity after it is actualy run on a practical machine. (in short, anaysis of its statistics after running it on a real machine)
What is the difference between heat and product analysis in steel Why should this be?
what is the difference between product analysis and heat analysis
What is the difference between an algorithm and a flowchart in general?
Algorithm is step wise analysis of the work to be done. Flow chart is a pictorial representation of an algorithm. As flow chart is a picture of work to be done,it may be printed in our mind when we observe it.
What is the criteria of algorithm analysis?
The term "analysis of algorithms" was coined by Donald Knuth. Algorithm analysis is an important part of a broader computational complexity theory, which provides theoretical estimates for the resources needed by any algorithm which solves a given computational problem.
What do you mean by analysis of algorithm?
it is a processor of the work
What has the author Walter Goessens written?
Walter Goessens has written: 'An analysis of the first-fit binpacking-algorithm' 'An analysis of the next-fit binpacking-algorithm' 'An exact calculation of the expected waste for a bin-packing algorithm using items that are exponentially distributed'
What is the worst case analysis for matrix multiplication algorithm?
n^3
What is the value of h in numerical analysis when doing differentiation?
h, being the step size of an algorithm in numerical analysis, is always (b-a)/N where x is in the interval [a, b] and N is the number of iterations in the algorithm.
Why need algorithm?
if u want to work any program then the first step is perform step by step analysis so that algorithm is needed
What are various forecasting techniques in managerial economics?
econometric model Deterministic time series analysis Smoothing techniques Barometer techniques
What is algorth?
Wikipedia gives this definition: An algorithm is a finite sequence of well-defined, computer-implementable instructions, typically to solve a class of problems or to perform a computation. An algorithm, literally, is a method for computing by which a desired result of a computation can be achieved. Currently, the widely accepted professional definition of an algorithm is: an algorithm is a set of feasible, deterministic, and finite rules for model analysis. In layman's terms, an algorithm can also be understood as a problem-solving step, consisting of some basic operations and a prescribed sequence. But from the point of view of computer programming, the algorithm consists of a series of instructions to solve the problem and can obtain effective output results in a limited time according to the normative input. Algorithms represent a strategic mechanism for describing problem solving in a systematic way.
Analysis of algorithm question bank?
An algorithm is a set of instructions that performs a particular task making sure that those instructions are followed. Analysis of algorithm question bank is needed when any of the following occurs: when a working program is not good enough, when program may be inefficient or when a running time of a program becomes an issue.
Need of fft?
FT is needed for spectrum analysis, FFT is fast FT meaning it is used to obtain spectrum of a signal quickly, the FFT algorithm inherently is fast algorithm than the conventional FT algorithm
Why you study algorithm?
There are so many reasons for a programmer to study algorithm. This will help in proper analysis of problems and coming up with fast solutions that relate to programming.
