COMPUTER SCIENCE AND ENGINEERING
ALGORITHMS
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
All Algorithms can be updated
|
|
True
|
|
|
False
|
|
|
Either A or B
|
|
|
None of the above
|
Explanation:
Detailed explanation-1: -Algorithms have unambiguous operations. Algorithms have effectively computable operations. Algorithms produce a result. Algorithms halt in a finite amount of time.
Detailed explanation-2: -As it turns out, it’s difficult to prove that an algorithm is correct. Programmers often use empirical analysis to find faults in an algorithm, but only formal reasoning can prove total correctness.
Detailed explanation-3: -Answer. Answer: Any algorithm is a program. Explanation: The statement is false.
Detailed explanation-4: -Can all problems be solved with algorithms? No. There are some problems that are known to be formally undecidable, and hence there is no algorithm which solves them completely.
There is 1 question to complete.