Scribd
Upload
6 views7 pages

Introductory Course on Algorithms & Programming

The curricular unit Algorithmics and Programming introduces students to the basic concepts of algorithms and programming, with the aim of enabling them to solve problems through logical-mathematical algorithms using programming structures. The course lasts 12 weeks and covers topics such as algorithms, programs, variables, operators, problem analysis, and selective and repetitive control structures. The course seeks to help students develop skills to design algorithms that will serve as a foundation for the future.

Translated by

ScribdTranslations
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
6 views7 pages

Introductory Course on Algorithms & Programming

The curricular unit Algorithmics and Programming introduces students to the basic concepts of algorithms and programming, with the aim of enabling them to solve problems through logical-mathematical algorithms using programming structures. The course lasts 12 weeks and covers topics such as algorithms, programs, variables, operators, problem analysis, and selective and repetitive control structures. The course seeks to help students develop skills to design algorithms that will serve as a foundation for the future.

Translated by

ScribdTranslations
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

CURRICULAR UNIT ALGORITHMIC AND PROGRAMMING

course_identification

Algorithmics and Programming is an introductory course to programming, the


what is intended is for the student to acquire logical-mathematical knowledge and
programming techniques applicable to algorithms. At the end the
during the course, the student will carry out the analysis of real problems, designs, and execution of

algorithms in an algorithmic language, using the technical toolsy


adequate, for like this
solve these problems and reach the solution of the
same.
Similarly, the development of algorithms is a fundamental topic in design.
programs or solutions. Therefore, the student must have a good foundation that serves them
to be able to easily and quickly create your programs.
In this sense, the virtual course of the curricular unit Algorithmics and Programming will
will serve as support for facilitators or teachers in their daily teaching work and to
student, to facilitate the development of their analytical and creative capacity, so that from this
way to improve your skill in the creation of algorithms that serve as a basis for
the coding of the different programs that he will have to develop throughout his
course. The curricular unit has a duration of twelve (12) weeks, which the
the student must dedicate four (4) hours per week to virtual activities
independent study work with learning and interaction activities
synchronous and asynchronous.
In this sense, the curricular unit Algorithmics and Programming is located in the
area of knowledge Programming, located in the curriculum in Pathway I,
First quarter of the PNF in Computer Science at UPTP, this program is aimed at the
formation of a comprehensive professional, who performs with operational suitability and ethics
professional in the construction of technological projects in harmony with preservation
of the environment and the progress of their surroundings, being able to participate in the

management of IT projects under standards of quality and relevance


social, audit information systems, develop and implement software, prioritizing the
use of open platforms; as well as integrating and optimizing computer systems and
manage databases and computer networks.

COURSE CHARACTERISTICS

Curricular Unit: ALGORITHMS AND PROGRAMMING


Code: PIAP114 of the PNF in Computer Science
Type: Workshop
Route: 1
Trimester: 1
Number of credits: 4 Credit Units
In-person class hours: 6 per week
Independent Study Work Hours (HTEI): 4 Weekly
10 Weekly

General Objective:

Solving problems through Algorithms logical-mathematical using


logical structures of programming applicable to Algorithmic languages.

Course Goals
1. Induce the student to the knowledge of the basic concepts of Algorithm and
Program.
2. Understand the quality standards in Algorithm and Program design.
3. Inducing the student into the knowledge of variables and operators to
form expressions.
4. Analyze logical-mathematical problems through the methodology for the
analysis and problem statements.
5. Apply logical programming structures Selective and Repetitive in
the algorithms.
CONTENT

UNIT 1: ALGORITHM AND PROGRAMS

Terminal Objective: Understand the basic concepts of Algorithm and Program.

1.1 Concept of Algorithms and Programs.


1.2 Algorithmic and programming language.
1.3 Parts of an algorithm.
1.4 Characteristics and elements for building an algorithm.
1.5 Ways to represent an algorithm: Natural Language, pseudocode, and diagram
of flow.
1.6 Trace of an algorithm (cold run).

Learning and Assessment Activities:

Review Bibliography of Luis Joyanes Aguilar. Fundamentals of Programming.


Log into the EVA ([Link] and review the lesson of
Unit I.
Review video on basic concepts of Algorithm and Programming.
Interact with the colleagues the reflection questions placed by the
facilitator in the Electronic Forum.

UNIT 2: QUALITY STANDARDS IN DESIGN


ALGORITHMS AND PROGRAM CONSTRUCTION.

Terminal Objective: To know the quality standards for designing algorithms and
Programs.

2.1 Introduction to quality standards.


2.2 Method of tracing an algorithm.
2.3 Forms and techniques for documenting algorithms and programs.
2.4 Introduction to the development of the system, user, and program manual.
2.5 Writing techniques and testing algorithms and programs.

Learning and Assessment Activities:

Review the bibliography of Luis Joyanes Aguilar, Fundamentals of Programming.


Enter the EVA ([Link] review the lesson of
Unit II
Develop an Essay on Quality Standards for Algorithm Design
and Programming and send by email to the facilitator (anayanetha@[Link])

UNIT 3: DATA AND PRIMITIVE ENTITIES

Terminal Objective: Solve expressions by combining variables (numeric, logical and


alphanumeric and operators (arithmetic, logical and
relational).

3.1 Concept and difference between data and information, types of data.
3.2 The Operators: Concept and types of operators.
3.3 The Expression: concept, types, and evaluation of expressions, The Identifiers:
Concept, Writing rules, variables: classification of variables according to their
content (numeric, logical, and alphanumeric) and its use (work, counter and
accumulator), constants.

Learning and Evaluation Activities:

Review Bibliography of Juan Lázaro, Algorithms and Data Structures.


Log in to the EVA ([Link] review the lesson
Unit III.
Review Electronic Material and analyze solved exercises from unit III.
Solve the proposed exercise guide on Expressions and Operators
send by email to the facilitator (anayanetha@[Link]).
Advisory in the Chat planned by the facilitator

UNIT 4: METHODOLOGY FOR ANALYSIS AND PROPOSAL OF


PROBLEMS

Terminal Objective: Solve logical-mathematical problems through the


Methodology for Analysis and Problem Statements.

4.1 Identification of the Problem.


4.2 Identification of the necessary data (inputs).
4.3 Identification of the data to obtain (outputs).
4.4 Description of the operations to be used (calculations).
4.5 Description of the steps to reach the solution (processes).

Learning and Evaluation Activities:

Enter the EVA ([Link] download tutorial


on the Web[Link] the
topic developed in class of Unit IV
Review video, electronic material, and analyze the solved exercises.
Solve the proposed Exercise Guide and send it by email to the facilitator.
(anayanetha@[Link]).
Advisory in the chat planned by the facilitator.

UNIT 5: STRUCTURED PROGRAMMING

Terminal Objective: Develop logical-mathematical algorithms through the


selective and repetitive programming logical structures.
5.1 Theorems of structured programming.
5.2 Control structures:
5.2.1 Decision structures: concept, types and syntax: Conditional, simple,
doubles, multiples, nested and selective.
5.2.2 Iterative control structures: Concept and types, While loop and Repeat:
syntax and methods for exiting the loop. For Loop: Syntax. Nested loops.

Learning and Assessment Activities:

Enter the EVA ([Link] download tutorial at


the WebUnable to access external links or [Link] the themes
developed in the class of Unit V.
Review video, electronic material, and analyze solved exercises.
Solve the proposed exercise guide on selective and repetitive structures.
send by email to the facilitatoranayanetha@[Link]).
Discussion in the Forum and Evaluation in the Chat about Sequential structures.
Selective and Repetitive programming.

Facilitators Data

FACILITATOR EMAIL HEADQUARTERS

Prof. Ana Yaneth Álvarez anayanetha@[Link] Acarigua


Computer Engineering
Bibliography

Fundamentals of Programming 1. Department of Science of the


Computing and Artificial Intelligence University of Alicante.

Luis Joyanes. Fundamentals of Programming. McGraw-Hill, 1996, 2002.

Juan Lásaro. Fundamentals of Algorithmics. Ed. Prentice-Hall, 1998.

You might also like