0% found this document useful (0 votes)
7 views4 pages

Computational Logic Course Syllabus

This document presents the subject of Computational Logic within the degree of Systems and Computer Engineering. It describes the justification, objectives, contents, competencies, methodology, and evaluation criteria of the course. The course aims to develop the logical thinking of students for the formulation of algorithmic solutions to engineering problems using concepts such as Boolean algebra, propositional logic, flowcharts, and pseudocode.
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
0% found this document useful (0 votes)
7 views4 pages

Computational Logic Course Syllabus

This document presents the subject of Computational Logic within the degree of Systems and Computer Engineering. It describes the justification, objectives, contents, competencies, methodology, and evaluation criteria of the course. The course aims to develop the logical thinking of students for the formulation of algorithmic solutions to engineering problems using concepts such as Boolean algebra, propositional logic, flowcharts, and pseudocode.
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

ACADEMIC VICE-RECTORATE

FACULTY OF SYSTEMS ENGINEERING


PROGRAMMATIC CONTENT

Identification data
Programa:INGENIERÍA DE SISTEMAS YAsignatura:
COMPUTING Computational logic
Code: 50493101 Curriculum: 1102

Number of Credits within the Plan of Update Date:


Studies:3 July 30, 2015

Justification of the subject


The development of computer programs is currently an inherent activity of the
majority of areas of knowledge, particularly all branches of engineering. This activity
requires a set of skills associated with logical reasoning and thinking
algorithmic that enable problem-solving.
In the field of computer science, logic refers to the ability to
structure the set of actions necessary to find a solution to a problem
concrete. This is based on mathematical logic and propositional calculus, restricted to
expressions derived from Boolean algebra, which enables the processing of data of type
digital.
This course will allow the development of the necessary competencies for formulation and implementation.
of algorithmic solutions in any branch of engineering.

Objetivo General
Develop logical thinking in the student to tackle real problems in different
areas and propose solutions through algorithms

Specific Objectives
Identify and apply Boolean Algebra to perform binary operations.
Analyze and synthesize logic circuits from operators and their truth tables.
Identify variables, constants, and predicates.
Identify, interpret, and apply the "for all" and "existential" operators in calculus.
predicates.
Classify, declare and manipulate the input and output data of a problem according to its
type.
Properly apply logical, arithmetic, relational, and referencing operators.
Propose and solve expressions of different types using different types of
data and operators.
Identify and formulate problems that have algorithmic solutions, following the process
defined.
Represent algorithms using data flow diagrams and pseudocodes.
Build algorithms to solve problems that use sequential structures.
and conditionals, using different representation schemes and implementing them
in C++.
Recognize and use the different structures appropriately according to the need
of the posed problem.
Build algorithms to solve problems that use repetitive structures and
nested, using different representation schemes and implementing them in C++.
Assume with responsibility each of the activities that are carried out in the
course of the subject, interacting with respect and responsibility.
Contents
Unit I. Introduction to Computers
Introduction: history of computers and programming.
Components of a computer and their function in the development and execution processes
a computer program.
Problem solving, identification of problems with algorithmic solutions.
Basic concepts of algorithms and their constituent parts.
Process of developing a computer program (phases in problem solving)
algorithmic problems: analysis, design, desk checking, coding, verification.
Unit II. Number systems
The concept of a number system and the different number systems used in
computing.
Conversion from one system to another.
Data representation, BCD code, Excess-3, Gray, ASCII.
Representation of integers, floating point numbers, negative numbers, and complement
a 1 and 2.
Unidad III. Algebra de Boole
Truth tables and basic operations of Boolean arithmetic: sum, product and
denial.
Subtraction in one's complement and two's complement.
Logical functions and expressions.
Unit IV. Propositional Logic and Predicate Calculus
Simple propositions and compound propositions.
Logical connectors and formalization of propositions.
First-order logic (operators 'for all' and 'exists').
Unit V. Fundamental concepts of algorithmics and algorithmic expressions
Flowchart.
Pseudocode.
Unit VI. Basic structures for algorithm design
Basic concepts of C++ programming: General structure of a program, Elements
from a program, Data types, Constants, Variables, Input and output
Operators and expressions: Operators and expressions, Assignment operators,
Arithmetic operators, Increment and decrement operators, Operators
relational, Logical operators
Estructuras de control: Estructuras selectivas y Estructuras repetitivas.
Skills that students develop
GENERAL COMPETENCIES

Instrumental competencies
Use oral, written, and graphic language as a learning tool in socialization.
of problems, solutions, and results.
Represents structures and transforms them mentally.
Interpersonal skills
Recognizes teamwork as an essential requirement in the development of
solutions to real problems in different areas.
Act ethically in your personal, academic, and professional performance.
Respect and value cultural diversity and individual characteristics as elements
enrichers of healthy coexistence.
Promotes equity, honesty, freedom, and fraternity as aspects of activity.
daily.
Know and apply the principles of democracy and civic coexistence to
guarantee the exercise of rights and duties.

Systematic competencies
Interpret and contextualize a problem, and identify its essential characteristics.
(inputs, outputs, constraints).
Understand and justify the approach and the proposed solution in relation to others.
solutions alternatives to a given problem.

Technological competencies
Develop algorithms as a strategy to solve proposed problems, making use of
appropriate to the knowledge and resources presented in the subject.

SPECIFIC COMPETENCIES
Develop critical-analytical thinking for the identification and creation of algorithms
that serve for problem solving.
Apply creativity in the analysis, design, and implementation of solutions to problems,
obtaining as products algorithms, diagrams, pseudocode, and codifications in
C++.
Develop logical-spatial thinking to characterize problems, classify them, and
obtain generic solutions for them.
Methodology
The classroom work will include the theoretical review of the fundamental concepts of the
subject and application examples. The concepts will be reviewed beforehand by the
student making use of the suggested bibliographic material and the development of exercises of
application related to the topic previously selected by the teacher.
For each unit of content, guidelines or workshops will be designed that the student will develop.
in the laboratory with the guidance of the teacher. For each of the cuts, a work will be done
unified workshop.
The students will prepare written reports of their work, which will be evidenced in the
formulation process, design (with the two representation schemes) and
Implementation (C++) of the solutions. As well as an analysis of the difficulties.
found in it, in order to encourage self-assessment and self-criticism.
The development of work in interdisciplinary groups will be promoted by taking advantage of the
diversity of branches of engineering that take the course. However, the evaluation
It will highlight the performance of each student in relation to the three branches of knowledge.
proposals: knowing-knowing, knowing-how, and knowing-being.
Class exercises will be developed where students will demonstrate in practice the
acquired knowledge.
The development of self-training and self-learning skills will be promoted.
continuous and permanent through assignments of presentations on related topics
with the subject, where students carry out the exercise of collection, analysis, and
presentation of the findings, including the review of sources in English.
The Moodle platform will be used as a repository for class material and for
quizzes throughout the academic period.
A final project will be developed (maximum of two people) in which the evidence of the
sequential learning of the subject.
Evaluation criteria
The distribution of the final course grade is distributed as follows:
First cut: 20% (Quiz, workshop, laboratory, midterm, among others)
Second cut: 20% (Quiz, workshop, laboratory, partial, among others)
Third cut: 30% (Quiz, workshop, lab, partial, among others)
Fourth cut: 30% (Quiz, workshop, laboratory, exam, among others)
Sources of information or references (print or digital)
Cairo, O, (2006), Programming Methodology: Algorithms, Flowcharts,
Programs (3rd ED.), Alfaomega Grupo Editor.
Joyanes, A, Fundamentals of Programming. Problem Book, McGraw-Hill
Bores M, Román R, (2010), Computing: methodology, computational logic and
programming, McGraw-Hill Interamericana.
Villalobos, J, Casallas, R, (2007), Foundations of Programming. Active Learning
based on cases, Pearson.
Vine, M, C, (2007), Programming for the Absolute Beginner (2nd Edition), Course
Technology / Cengage Learning.

You might also like