Definitions

An ________ is a sequence of unambiguous instructions for solving a problem, i.e., for obtaining a required output for any legitimate input in a finite amount of time

instruction

algorithm

article

set

POINTS (1)

Correct Answer

Explanation

Algorithms designated to run on von Neumann machine are called

parallel algorithms

sequential algorithms

structured algorithms

slow algorithms

POINTS (1)

Correct Answer

Explanation

Algorithms that take advantage of computers that can execute instructions concurrently are called

parallel algorithms

sequential algorithms

speedy algorithms

complex algorithms

POINTS (1)

Correct Answer

Explanation

What is the difference between exact and approximation algorithms?

The first solves the problem exactly and the second solves it approximately

The first is 99% exact and the second is approximately up to 80% accuracy

No difference, there is no such names

POINTS (1)

Correct Answer

Explanation

An algorithm design ________ is a general approach to solving problems algorithmically that is applicable to a variety of problems from different areas of computing

technique

strategy

paradigm

Any of the above

POINTS (1)

Correct Answer

Explanation

______ is a mixture of a natural language and programming language

Missing

POINTS (1)

Correct Answer

Explanation

______ is a method of expressing an algorithm by a collection of connected geometric shapes containing descriptions of the algorithm’s steps

Missing

POINTS (1)

Correct Answer

Explanation

_______ efficiency is an indication of how fast an algorithm runs

Missing

POINTS (1)

Correct Answer

Explanation

______ efficiency is an indication of how much extra memory an algorithm uses

Missing

POINTS (1)