Scribd
Upload
3 views2 pages

Chapter 4

Uploaded by

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

Chapter 4

Uploaded by

khanzurain01
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

1.

Sequence of instructions is called:

a. Algorithms

b. Simple problem

c. Both a and c

d. None of them

2. Which of the following is not a problem-solving strategy?

a. Act it out

b. Ask for help

c. Draw a diagram

d. Leaving it unsolved

3. Sequence of an algorithm is best depicted by which of the following?

a. Flow diagram

b. Flowcharts

c. Circuit diagram

d. Both a and b

4. _____________________ instruct the computer to carry out actions based on certain conditions:

a. Syntax

b. If-Else

c. IF

d. Both b and c

5. _____________________ is used to describe distinct steps in algorithms which is easier to


understand.

a. Pseudocode

b. Instruction

c. Block of code

d. Flowchart

Fill in the blanks:

1. ____________________ represents the decision box in a flowchart.

2. Problems solved through simple series of steps are called ______________________.


3. Complex problems can be best solved by __________________________.

4. Problem-solving strategy in which one looks for the patterns involved is called
_____________________.

5. The word algorithm comes from ___________________.

Short questions and answers:

1. What do you understand by the word efficient algorithm?

2. Draw the following elements of a flowchart:

a. Starting or ending stage

b. Representation of data input or output

c. Representation of process flow

d. Representation of process stage

3. Draw the flowchart for the following code:

x=30

z=25

if z<x:

print(“z is less than x”)

else

print(“z is greater than b)

end if

4. Write the syntax for the if statement and if-else statement.

5. How would you differentiate between if statement and if-else? Which one in your opinion is more

beneficial? Give at least one reason.

6. What are some limitations of algorithms?

7. What do you understand by nesting in algorithmic thinking?

Higher-order questions:

1. What are some benefits of representing the algorithms graphically?

2. You have studied nesting in algorithmic thinking. Why do you think it’s useful? Can we nest
conditional statements? If yes, how? Give an example.

You might also like