FUNDAMENTALS OF COMPUTER

COMPUTER THREATS SECURITY

TYPES OF COMPUTER SECURITY

Question [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
A method for determining a solution to a problem by sequentially testing all possible solutions.
A
brute force
B
cracking
C
cipher
D
Personal key
Explanation: 

Detailed explanation-1: -In computer science, brute-force search or exhaustive search, also known as generate and test, is a very general problem-solving technique and algorithmic paradigm that consists of systematically enumerating all possible candidates for the solution and checking whether each candidate satisfies the problem’s statement.

Detailed explanation-2: -The brute force approach is a guaranteed way to find the correct solution by listing all the possible candidate solutions for the problem. It is a generic method and not limited to any specific domain of problems. The brute force method is ideal for solving small and simpler problems.

Detailed explanation-3: -brute force: adj. Describes a primitive programming style, one in which the programmer relies on the computer’s processing power instead of using his or her own intelligence to simplify the problem, often ignoring problems of scale and applying naive methods suited to small problems directly to large ones.

Detailed explanation-4: -Example: If there is a lock of 4-digit PIN. The digits to be chosen from 0-9 then the brute force will be trying all possible combinations one by one like 0001, 0002, 0003, 0004, and so on until we get the right PIN. In the worst case, it will take 10, 000 tries to find the right combination.

Detailed explanation-5: -The brute force algorithm requires no preprocessing phase, and a constant extra space in addition to the pattern and the text. During the searching phase the text character comparisons can be done in any order. The time complexity of this searching phase is O(mn) (when searching for am-1b in an for instance).

There is 1 question to complete.