wayground logo

Free Printable Worksheets

NEW

Font size

S
M
L
XL
Worksheets

DSA - Intro

Total questions: 10

Worksheet time: 6mins

Name
Class
Date
1.
It refers to collection of variables, possibly of several different data types connected in various ways.
a)
Data Structures
b)
Database
c)
Arrays
d)
Abstraction
2.
Finite set of instructions that specify a sequence of operations to be carried out 
a)
Algorithms
b)
Procedure
c)
Flowcharting
d)
Pseudocodes
3.
Are the data items presented to the outside world as the result of the execution of a program based on the algorithm.
a)
Input
b)
Output
c)
Procedure
d)
Raw Data
4.

Efficiency of an algorithm is measured by

a)

Time and Capacity complexity

b)

Time and Space complexity

c)

Speed and Space complexity

d)

Speed and Capacity complexity

5.

A container which can hold a fix number of items and these items should be of the same type. Most of the data structures make use of arrays to implement their algorithms.

a)

Element

b)

Array

c)

Index

6.

What is an algorithm?

a)

Patterns and trends used to solve a problem

b)

A set of step-by-step instructions to resolve a problem

c)

A programming language

7.

What are algorithms used for?

a)

To plan out the solution to a problem

b)

As a platform to program a solution

c)

To test a solution to a problem

8.

How can an algorithm be represented?

a)

As a flowchart only

b)

As pseudocode only

c)

As a flowchart or pseudocode

9.

If it is AFTER 7am, what do you need to do?

a)

Take the bus

b)

Take the subway

c)

Check the time

d)

Leave home

10.

What should be considered when designing an algorithm?

a)

If there is more than one way to solve the problem

b)

If the correct hardware is being used

c)

If the correct software is being used