MCQ IN COMPUTER SCIENCE & ENGINEERING

Detailed explanation-1: -Yes it is necessary the algorithm must solve the problem in finite number of steps. Because finite steps solve the problem efficiently and effectively.

Detailed explanation-2: -An algorithm is a method or a process followed to solve a problem. If the problem is viewed as a function, then an algorithm is an implementation for the function that transforms an input to the corresponding output. A problem can be solved by many different algorithms.

Detailed explanation-3: -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-4: -Every problem can be solved with an algorithm for all possible inputs, in a reasonable amount of time, using a modern computer. A Every problem can be solved with an algorithm for all possible inputs, but some will take more than 100 years, even with the fastest possible computer.