Which of the following is a finite set of instructions to accomplish a particular task?

(a)

Flowchart

(b)

Functions

(c)

Algorithm

(d)

Abstraction

Which of the following is not a characteristic of an algorithm?

(a)

Definiteness

(b)

Correctness

(c)

Data structure

(d)

Effectivenes

Which of the following is not an example of data structures?

(a)

Control statement

(b)

Structure

(c)

List

(d)

Dictionary

Which of the following is an example of data structures?

(a)

List

(b)

Tuple

(c)

Dictionary

(d)

All of these.

Which of the following is not a searching technique?
(i) Linear
(ii) Binary
(iii) Selection
(iv) Merge

(a)

Only i

(b)

Only ii

(c)

Only iii

(d)

iii and iv

Which of the following is not a sorting technique?

(a)

Bubble

(b)

Binary

(c)

Insertion

(d)

Quick

The way of defining an algorithm is called

(a)

Pseudo strategy

(b)

Programmic strategy

(c)

Algorithmic strategy

(d)

Data structured strategy

Which characteristics of algorithm defined the operation involving division by zero?

(a)

Finiteness

(b)

Definiteness

(c)

Input

(d)

Correctness

Which characteristics of an algorithm should be generic, independent of any programming language?

(a)

Independent

(b)

Portable

(c)

Feasibility

(d)

Unambiguous

Which of the following could be designed to get a solution of a given problem?

(a)

Program

(b)

Algorithm

(c)

Flowchart

(d)

Input/Output

An algorithm that yields expected output for a valid input is called an

(a)

Algorithmic Solution

(b)

Algorithmic Structure

(c)

Algorithmic Strategy

(d)

Algorithmic Procedure

Performance measurement of an algorithm is called

(a)

Posteriori testing

(b)

Priori estimates

(c)

Efficiency testing

(d)

Algorithmic analysis

An estimation of the time and space complexities of an algorithm is called

(a)

Algorithmic solution

(b)

Algorithmic Strategy

(c)

Algorithmic performance

(d)

Algorithmic analysis

Efficiency of an algorithm decided by

(a)

Time, Space

(b)

Definiteness, portability

(c)

Priori, Postriori

(d)

Input/output

_______is a step-by-step procedure for solving a given problem

(a)

Algorithm

(b)

Program

(c)

Statements

(d)

Structure