Answer Posted / 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 |
Post New Answer View All Answers
Write a program for Sorting an Array. Which sorting will you prefer?
“int a[] = new int[3]{1, 2, 3}” – This a legal way of defining the arrays?
Can you declare an array without assigning the size of an array?
What sort of serious problems have you experienced, and how have you handled them?
Draw a binary Tree for the expression : A * B - (C + D) * (P / Q)
For the following COBOL code, draw the Binary tree? 01 STUDENT_REC. 02 NAME. 03 FIRST_NAME PIC X(10). 03 LAST_NAME PIC X(10). 02 YEAR_OF_STUDY. 03 FIRST_SEM PIC XX. 03 SECOND_SEM PIC XX.
