Scribd
Upload
7 views3 pages

Digital Citizenship Guide

Digital

Uploaded by

myrinda2000
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
7 views3 pages

Digital Citizenship Guide

Digital

Uploaded by

myrinda2000
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
You are on page 1/ 3

Digital citizenship study guide

What is a problem?

Set of facts or circumstances that hinder the achievement of some end.

A problem is something that has a short term solution. A situation we need to solve. If a
situation doesn’t have a solution it can’t be considered a problem.

What is an algorithm?

Is a finite set of achievable, unambiguous instructions whose execution leads to a resolution


of a problem.

The series of steps to solve a problem is an algorithm.

The most common methods to present algorithms are:

1. Narrated description: It consist pf making an explanation of the solution in a natural


lenguaje. It is the simplest way of describing or expressing an algorithm
2. Flowchart: It is the graphical representation of an algorithm. The arrows used to join
the arrows are called “flow lines”
3. Pseudocode: Pseudocode is an algorithm specification language that uses reserved
words and requires indentation

What are programs?

Programs are algorithms encoded with an unambiguous language whose syntax and
semantics are “UNDERSTOOD” by the computer

Characteristics of a program:

● It must be precise
● It must be defined. If an algorithm is followed twice, the same result must be obtained
each time it’s carried out.
● Being finite. If an algorithm is followed, it must end at some point, in other words it
must have a finite number of steps.

The structure of an algorithm:


● Input: the information we have before solving the problem. (Only the data)
● Process: It is the follow-up that it carried out to solve the problem.
● Output: Were we are going to show the results obtained.

Recommendations for the writing of algorithms

1. Use star and end


2. Numbered
3. Short and concrete sentences
4. Si not star instructions with articles. The A, AN, OR pronouns.
5. Begin with a verb.
6. When a problem is very complex it is recommended to divide it into modelos or
sub-algorithms

Problem-solving methodology

Method: The set of ordered operations which are intended to obtain a result. The method is
more general.

Methodology: Is the science.

The resolution of the problem consists of 5 steps:

1. Identification of the problem.


2. Selecting an alternative solution.
3. The implement of the solution.
4. The evaluation of the solution.

What is a flowchart?

Is the graphical representation of an algorithm. They are based on the use of varios symbols
to represent specific operations

They are called flowcharts because the symbols used are connected by arrows to indicate
de sequence of the operation.

Main symbols

● Data flow: indicates the sequence of the operation.


● Start and stop: it is used to indicate beginning and end
● Processing: most commonly used. It is used to represent a certain event or process.
● Decision making: it is used to represent an operation that has at least two posible
answers.
● Connector: it represent a connection point between processes. It is used when it’s
necessary to divide a flowchart into several parts or processes.
● Data entry: it represent an input/ output operation, this symbol indicates the initial
values to be recurved by the process.
● Display of results: this symbol is used to show a result.

Characteristics of a flowchart

~ There is always a path that allows getting a solution

~ There is only one start on the process

~ There is only one end of the process

Conditional or selective structures

Thus structures compare a variable a gains a value.

● sequential: this consists of placing each instruction one after the other without any
type of skips in the sequence.
● conditional: This carries out certain instructions when a condition is met.

Simple: if structure

Double conditional: if-then- else.

Multiple conditional: this carries out instructions.

You might also like