Algorithms Interview Question Part 4

22. An algorithm whose behavior can be completely predicted from the input. (practice test question)
a.Probabilistic algorithm
b.Randomized algorithm
c.Deterministic algorithm
d.Non deterministic algorithm
Ans:c
Any algorithm that makes some random (or pseudorandom) choices is called randomized algorithm.
Any algorithm that works for all practical purposes but has a theoretical chance of being wrong is called probabilistic algorithm.
A conceptual algorithm with more than one allowed step at certain times and which always takes the right or best step. It has the super computational characteristic of choosing the optimal behavior is called non-deterministic algorithm.

23. A conceptual algorithm with more than one allowed step at certain times and which always takes the right or best step. It has the super computational characteristic of choosing the optimal behavior. (practice test question)
a.Probabilistic algorithm
b.Randomized algorithm
c.Deterministic algorithm
d.Non deterministic algorithm
Ans:d
Any algorithm that makes some random (or pseudorandom) choices is called randomized algorithm.
Any algorithm that works for all practical purposes but has a theoretical chance of being wrong is called probabilistic algorithm.
An algorithm whose behavior can be completely predicted from the input is called deterministic algorithm.
24. An algorithm that usually, but not always, works or that gives nearly the right answer. (practice test question)
a.Probabilistic algorithm
b.Heuristic algorithm
c.Deterministic algorithm
d.Non deterministic
Ans:b
Any algorithm that works for all practical purposes but has a theoretical chance of being wrong is called probabilistic algorithm.
An algorithm whose behavior can be completely predicted from the input is called deterministic algorithm.
A conceptual algorithm with more than one allowed step at certain times and which always takes the right or best step. It has the super computational characteristic of choosing the optimal behavior is called non-deterministic algorithm.

25. A high-level algorithmic framework or approach that can be specialized to solve optimization problems and a high-level strategy that guides other heuristics in a search for feasible solutions. (practice test question)
a.Probabilistic algorithm
b.Heuristic algorithm
c.Meta hueristic algorithm
d.Non deterministic
Ans:c
An algorithm that usually, but not always, works or that gives nearly the right answer is called heuristic algorithm.
Any algorithm that works for all practical purposes but has a theoretical chance of being wrong is called probabilistic algorithm.
A conceptual algorithm with more than one allowed step at certain times and which always takes the right or best step. It has the super computational characteristic of choosing the optimal behavior is called non-deterministic algorithm.

26. An algorithm that must process each input in turn, without detailed knowledge of future inputs. (practice test question)
a.On-line algorithm
b.Off line algorithm
c.Adversary algorithm
d.Deterministic algorithm
Ans:a
An algorithm which is given the entire sequence of inputs in advance is called an off-line algorithm.