wayground logo

Free Printable Worksheets

Font size

S
M
L
XL
Worksheets

DSA quiz

Total questions: 36

Worksheet time: 36mins

Name
Class
Date
1.

______________ is the process of identifying a problem, developing possible solution paths, and taking the appropriate course of action

a)

Problem solving

b)

Algorithm

c)

Flow Chart

d)

Pseudo code

2.

WHY IS PROBLEM SOLVING IMPORTANT?

a)

To help in decision making.

b)

To develop practical and creative solutions.

c)

Empowers you in your personal life and professional life

d)

All the Above

3.

Which of the following is not in PROBLEM SOLVING CYCLE

a)

EXPLORE

b)

ALTERNATIVES

c)

SOLVE

d)

IMPLEMENT

4.

___________ Solutions dealt with computers

a)

Algorithmic

b)

Heuristic

5.

Popular ways of representing logic

a)

Algorithms

b)

Flow charts

c)

Pseudocode

d)

All the above

6.

Characteristics of Algorithm

a)

Well Defined inputs / Outputs

b)

Ambiguous

c)

Finiteness

d)

Terminate Ultimately

7.

Criteria for Deciding Successful Algorithms

a)

Accuracy

b)

Consistency

c)

Efficiency

d)

All the above

8.

Which of the following keyword not in Input Stage

a)

accept

b)

read

c)

get

d)

in

9.

Which of the following keyword in Initialize Stage

a)

accept

b)

read

c)

get

d)

Set

10.

An algorithm is a

a)

set of instructions that create something different every time

b)

a set of instructions that work the same everytime

c)

A set of instructions that only work for those who followed the steps before

d)

a set of instructions for computer programming only

11.

What you have to work with is called

a)

outputs

b)

steps

c)

materials

d)

inputs

12.

An algorithm is a ---------- of solving math problems faster than counting one-by-one

a)

Sequential way

b)

Step by Step way

c)

Integrated way

d)

None of the above

13.

Select correct options for an algorithm.

a)

It has infinite number of Steps

b)

The action specified by the step cannot be interpreted in multiple ways

c)

The range of input may not be specified.

d)

Several algorithms for solving the same problem may exist.

e)

The instructions can be performed by using the given inputs in a finite amount of time

14.

Rearrange the following steps of algorithm.

a) Fry and cook the vegetable for 2 - 4 minutes

b) Add water in the bowl

c) Take a bowl filled with water

d) Cut the required vegetables

e) Add noodles and vegetables to the boiling water

f) Enjoy your dinner

g) Remove from flame and serve it

h) Boil the water for 2 - 4 minutes

a)

a, c, d, e, b, f, g, h

b)

c, d, a, b, h, e, g, f

c)

c, a, e, g, h, b, d, f

d)

c, h, a, g, c, e, d, f

15.

The purpose of using parallelogram in flowchart is

a)

To denote data storage

b)

To denote decision making

c)

To denote the process that cannot be solved

d)

To show input / output

16.

The following statements are examples of

i = 1

sum = sum + i

a = a-b

a)

Assignment statements

b)

Declaration statements

c)

Input statements

d)

Output statements

17.

To allow operations to be repeated for fixed number of time or until some condition is met. This is _______ structure

a)

Selection

b)

Loop

c)

Sequential

d)

Simple

18.

_______ representation of logic to solve a problem in natural English language

a)

Pseudocode

b)

Flowchart

c)

High level program

d)

Assembly language program

19.

A flowchart using symbols displays the ____ to be performed and the ____ in which they occur

a)

Sequence, program

b)

Decision, flow

c)

Operations, sequence

d)

Program, operations

20.

Statement 1: Flowcharts provide better communication because even the non-programmers can understand the logic of program

Statement 2: Flowcharts can be modified frequently as per the requirement if there is any change

a)

Only Statement 1 is true

b)

Only Statement 2 is true

c)

Both Statements are true

d)

Both Statements are False

21.

Statement 1: Flowcharts act as good documentation and can be used for various purposes

Statement 2: Flowchart acts as a reference during system analysis and program development

a)

Only Statement 1 is true

b)

Only Statement 2 is true

c)

Both Statements are true

d)

Both Statements are False

22.

While writing an algorithm, instructions are written from

a)

Left to Right

b)

Right to Left

c)

Top to bottom

d)

Depends on the one who is writing algorithm

23.

An algorithm is

a)

Collection of symbols used to design a flowchart

b)

Sequence of unambiguous instructions for solving a problem

c)

Sequence of instructions to be followed before choosing any language

d)

Written in natural language

24.

Find the missing statement:

Step 1: Read a and b

Step 2: a = a+ b

Step 3:

Step 4: a = a-b

Step 5: print a, b

a)

b=a+b

b)

b=a-b

c)

b=a*b

d)

b=a/b

25.

What is the output of the flowchart if v = 5

a)

120

b)

24

c)

0

d)

12

26.

__________ is a program that converts high level language program into machine language

a)

Compiler

b)

Assembler

c)

Interpreter

d)

Pascal

27.

What is the output of the flowchart if y=4

a)

6

b)

10

c)

8

d)

12

28.

______ uses only 1 s and 0 s

a)

Machine language

b)

Assembly language

c)

High level language

d)

system software

29.

Which is not an algorithmic Strategies?

a)

oBrute force

b)

oDivide and conquer

c)

oDynamic programming

d)

oGreedy approach

e)

oStatic programming

30.

The amount of time taken by algorithm to run is___________

a)

oTime complexity –

b)

ostatic complexity –

c)

oSpace complexity –

d)

None

31.

What order of complexity does this graph represent?

a)

Exponential

b)

Polynomial

c)

Linear

d)

Logarithmic

32.
What is meant by the time complexity of an algorithm?
a)
The amount of time required to solve a particular problem
b)
How difficult a problem is to solve
c)
How many lines of code are required to solve a problem
d)
How quickly a solution can be developed
33.
What two pieces of information allow you to analyse an algorithm?
a)
Time Complexity
b)
Space Complexity
c)
Size Complexity
d)
Complex Complexity
e)
Simplicity Complex
34.
What does the big-O notation show?
a)
The effectiveness of an algorithm
b)
The amount of time required to solve a particular problem
c)
How difficult a problem is to solve
d)
How many lines of code are required to solve a problem
e)
How quickly a solution can be developed
35.
How do you reduce the space complexity?
a)
Try to complete all of the operations on the same data set
b)
You reduce the amount of embedded for loops, and then reduce the amount of items you complete the operations on i.e. divide and conquer
36.

How do you reduce the time complexity of an algorithm?

a)

You reduce the amount of embedded for loops, and then reduce the amount of items you complete the operations.

b)

Try to complete all of the operations on the same data set