Start learning →

Per the lecture, an algorithm is best described as

Aa finite, unambiguous sequence of steps for a defined problem
Bany program written in a high-level language
Ca benchmark suite for comparing CPU speeds
Da snippet of pseudo-code that compiles to assembly
Answer & Solution
Correct answer: A. a finite, unambiguous sequence of steps for a defined problem
An algorithm is language-agnostic and machine-agnostic: a finite, unambiguous sequence of steps for a defined problem. A program is one specific implementation a benchmark suite is a measurement harness pseudo-code is a writing notation. The algorithm itself is the abstract recipe.
Practise this question with Quill — GATE CSE →

Keep practising Algorithms

Browse all Algorithms questions for GATE CSE, or explore more Computer Science topics.

Start a Algorithms lesson →
Related questions
Sorting and searching bingoKnock out the true statementsWhich ones belongSpot the false statementDoes it need sorting firstWhich one does not belongSelection or insertionOne word is wrong