COMPUTER THREATS SECURITY
TYPES OF COMPUTER SECURITY
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
Random Substitution Cipher
|
|
|
Bug
|
|
|
Computationally Hard
|
|
|
None of the above
|
Detailed explanation-1: -In computational complexity theory, a computational hardness assumption is the hypothesis that a particular problem cannot be solved efficiently (where efficiently typically means “in polynomial time").
Detailed explanation-2: -In 1936, the brilliant mathematician and codebreaker Alan Turing proved that it’s impossible for a computer to inspect any code that you give it, and correctly tell you whether the code will halt or run forever. In other words, Turing showed that a computer can never solve the Halting Problem.
Detailed explanation-3: -computational complexity, a measure of the amount of computing resources (time and space) that a particular algorithm consumes when it runs.
Detailed explanation-4: -Computation time (also called “running time") is the length of time required to perform a computational process. Representation a computation as a sequence of rule applications, the computation time is proportional to the number of rule applications.