Scribd
Upload
17 views2 pages

Understanding Algorithms and Their Characteristics

An algorithm is a step-by-step procedure to solve a problem with well-defined inputs and outputs. It must be unambiguous, terminate after a finite number of steps, and have clear instructions. The time complexity of an algorithm measures the number of operations needed and depends on the size of the input data, while space complexity measures the storage required and has fixed and variable components.

Uploaded by

Sornalakshmi
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
17 views2 pages

Understanding Algorithms and Their Characteristics

An algorithm is a step-by-step procedure to solve a problem with well-defined inputs and outputs. It must be unambiguous, terminate after a finite number of steps, and have clear instructions. The time complexity of an algorithm measures the number of operations needed and depends on the size of the input data, while space complexity measures the storage required and has fixed and variable components.

Uploaded by

Sornalakshmi
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

1.

___________ is a step-by-step procedure, which defines a set of


instructions to be executed in a certain order to get the desired output.
A. Code
B. Algorithm
C. Program
D. All of the above

2. Which of the following are characteristics of an algorithm?


A. Algorithm should be clear
B. Algorithm should be unambiguous
C. Algorithms must terminate after a finite number of steps
D. All of the above

3. Not all procedures can be called an algorithm


A. TRUE
B. FALSE
C. Can be true or false
D. Can not say

4. An algorithm should have _______ well-defined inputs.


A. 0
B. 1
C. 0 or more
D. 1 or more

5. An algorithm should have __________ well-defined outputs


A. 0
B. 1
C. 0 or more
D. 1 or more
View Answer
6. Which of the following is a theoretical analysis of an algorithm?
A. Posterior Analysis
B. Priori Analysis
C. Simple Analysis
D. Preori Analysis

7. _________ is measured by counting the number of key operations such as


comparisons in the sorting algorithm.
A. Space
B. Lines
C. Time
D. None of the above

8. The complexity of an algorithm f(n) gives the running time and/or the
storage space required by the algorithm in terms of n as the size of input
data.
A. Yes
B. No
C. Can be yes or no
D. Can not say

9. The space required by an algorithm is equal to the sum of ________


components.
A. 1
B. 2
C. 3
D. 4

10. Space complexity S(P) of any algorithm P is S(P) = C + SP(I), where C


is the?
A. fixed part
B. variable part
C. space complexity
D. None of the above

You might also like