COMPUTER SCIENCE AND ENGINEERING
ALGORITHMS
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
Routing
|
|
|
Encryption
|
|
|
Sorting
|
|
|
Searching
|
|
|
All of the other four.
|
Detailed explanation-1: -Algorithms can be designed for any type of problem, i.e. mathematical, logical, or any complex problems. Example: Depth-first-search, traveling salesman, sorting algorithms, etc. But, after some steps, the algorithm would result in a finite solution before ending.
Detailed explanation-2: -There are four types of machine learning algorithms: supervised, semi-supervised, unsupervised and reinforcement.
Detailed explanation-3: -An algorithm must be general. This means that it must solve every instance of the problem. For example, a program that computes the area of a rectangle should work on all possible dimensions of the rectangle, within the limits of the programming language and the machine.
Detailed explanation-4: -The “Four-Step Problem Solving” plan helps elementary math students to employ sound reasoning and to develop mathematical language while they complete a four-step problem-solving process. This problem-solving plan consists of four steps: details, main idea, strategy, and how.