What are the properties of an algorithm?
- 1 Answers
- 1164 Views
- I also Faced
- E-Mail Answers
Answer / Shobhit Johri
An algorithm is a step-by-step procedure to solve a problem. It has the following properties: 1) Input - The data or initial state that defines the problem, 2) Output - The final result or solution, 3) Definiteness - Each step must be well-defined and unambiguous, 4) Finiteness - The algorithm must terminate after a finite number of steps, 5) Reliability - If the algorithm follows its defined steps without error, it will always produce the same output for a given input, 6) Uniqueness - Every algorithm has one unique solution path.
| Is This Answer Correct ? | 0 Yes | 0 No |
How to excel in data structures and algorithms?
If you have to store one lakh objects, what will be a better option- a hash map or an array list?
What are the Advantages and disadvantages of Array?
What are the types of linked list?
Give a good data structure for having n queues ( n not fixed) in a finite memory segment. You can have some data-structure separate for each queue. Try to use at least 90% of the memory space.
Does treemap allow duplicate keys?
List the data structures which are used in rdbms, network data modal, and hierarchical data model.
Can constructor be static?
What does isempty() member method determines?
What is array traversing?
Is arraylist heterogeneous?
Does treemap sort automatically?
Windows 
