wayground logo

Free Printable Worksheets

Font size

S
M
L
XL
Worksheets

System Analysis and Design(FINAL_EXAM)

Total questions: 20

Worksheet time: 23mins

Name
Class
Date
1.

What should be considered when designing an algorithm?

a)

If there is more than one way of solving the problem

b)

If the correct hardware is being used

c)

If the correct software is being used

2.

What are the two main ways that algorithms can be designed?

a)

Images or videos

b)

In pseudocode or as a flowchart

c)

By hardware or software

3.

What is pseudocode?

a)

A way of describing a set of instructions in text form

b)

A specific programming language that all computers use

c)

A diagrammatic representation of a set of instructions

4.

What is a flowchart?

a)

A flowchart is a text-based way of designing an algorithm

b)

A flowchart is a specific programming language

c)

A flowchart is a diagram that represents a set of instructions

5.

What is the symbol for a decision in a flowchart?

a)

A parallelogram

b)

A diamond

c)

A circle

6.

Which of these is the correct symbol for a process in a flowchart?

a)

A diamond

b)

A rectangle

c)

A parallelogram

7.

How are symbols connected together in a flowchart?

a)

Symbols do not get connected together in a flowchart

b)

With lines and an arrow to show the direction of flow

c)

By numbers

8.

Which symbol is used for input and output in a flowchart?

a)

A parallelogram

b)

A diamond

c)

A circle

9.

How would a condition loop be created when writing pseudocode?

a)

With a FOR loop

b)

With a WHILE loop

c)

With a WHILE loop or a REPEAT-UNTIL loop

10.

When can algorithms be used?

a)

Only with computers

b)

To design a solution to any problem

c)

For programming

11.

it is used in an algorithm and must come from a specified set of elements, where the amount and type of ___________ are specified.

a)

OUTPUT

b)

FINITENESS

c)

INPUT

d)

EFFECTIVENESS

12.

The algorithm must specify the ____________ and how it is related to the input.

a)

INPUT

b)

DEFINITENESS

c)

OUTPUT

d)

EFFECTIVENESS

13.

The steps in the algorithm must be clearly defined and detailed.

a)

INPUT

b)

OUTPUT

c)

DEFINITENESS

d)

FINITENESS

14.

The steps in the algorithm must be doable and ____________.

a)

FINITENESS

b)

INPUT

c)

EFFECTIVE

d)

OUPUT

15.

The algorithm must come to an end after a specific number of steps.

a)

FINITENESS

b)

DEFINITENESS

c)

EFFECTIVENESS

d)

OUTPUT

16.

What are the 8 steps in developing an Algorithm?

4 lines
17.

WHAT ARE THE 7 ALGORITHM DESIGN TECHNIQUES?

4 lines
18.

What are the 8 most commonly Data Structures?

4 lines
19.

in your opinion as a computer science student how important is it for you to study ALGORITHMS?

4 lines
20.

in your opinion what is the difference between an Algorithm Design and Data Structure?

4 lines