Start learning →

An algorithm has a definite beginning, a definite end and consists of:

AFixed prices
BFinite steps
CFine steps
DFiled steps
Answer & Solution
Correct answer: B. Finite steps
1. An algorithm cannot run forever and still be an algorithm. 2. Its length is bounded as well as its ends. 3. An algorithm has a definite beginning and end and consists of a finite number of steps. 4. So the answer is finite steps. _Source: syllabus Computer Science, Ch 4 'Introduction to Problem Solving'_
Practise this question with Quill — BCA →

Keep practising Problem Solving and Algorithms

Browse all Problem Solving and Algorithms questions for BCA, or explore more Computer Science topics.

Start a Problem Solving and Algorithms lesson →
Related questions
Send each idea down its chuteStack the correct answersGroup the problem solving ideasComplete the algorithm factsTap the algorithm characteristicsPick the right errorFlip and match the termsOrder the problem solving steps