PROGRAM

NAME OF THE SUBJECT : Computation

KEY: MLP 103
LEVEL : I Semester
CAREERS : Bachelor in Mathematics
HOURS OF LECTURE : 4.5 Hrs
HOURS OF TEACHING ASSISTANTSHIP : 1.5 Hrs
__________________________________________________________________________________________

General Objetives

Introduce students to the terminology of the computer and provide an overview of the major areas of study that
involves that science and its interaction with other disciplines.
Students must learn to create algorithms and should be able to carry out the first computer programs. They must
operate in an operating system widely used in the area of mathematics (Linux).

Specific objectives

At the end of the course, students will be able to :

1. Answer your questions about the basic concepts of this science.

2. Use the Linux operating system with their respective applications.
3. Given a specific problem, modeling, and schedule a solution in the C programming language.

Contents

Unit I: Introduction to Computer Science

1. History of computing.
2. Generation of computers.
3. Classification of computers:
a. Supercomputers.
b. Computers
c. Minicomputers
d. Microcomputers
4. Hardware
(i) Hardware Scheme
(ii) Central Processing Unit
(iii) Input Unit
(iv) Auxiliary or secondary memory
(v) Output Unit
5. Software
6. Numerical systems (Dec, Bin, Oct, Hex)
a. Fundamental theorem of numbering
b. Conversions
c. Operations (addition, subtraction, multiplication, division)
7. Representation of Information in computers
a. Representation of integers
b. Representation of characters (Cod. ASCII).
Unit II: Operating System Practice Part.
1. Linux Operating System commands.
2. Applications: Vi, Staroffice, Kwrite (or any available editor)

Unit III: Algorithms and Programming

1. Computer Programming
2. Introduction
3. Algorithms:
a. Data, constants, variables, expressions, functions.
b. Rules for the construction of identifiers
c. Flow diagrams
d. Diagram of Nassi - Schneiderman
e. Pseudocode
4. Introduction To Structured Programming:
a. Sequential structures
b. Selection structures
c. repetition structures.
5. Nest structures.
6. Programming in C.

Bibliography

1. G.M. Schneider & Gersting J.L. "An Invitation to Computer Science", Editorial West Publishing Company, St.
Paul, USA, 1995.
2. M.D. Albarracin and others. "Introduction to Computing", Editorial McGraw Hill, Santiago, 1996.
3. L. Joyanes, "Fundamentals of programming", Editorial McGraw Hill 1996, Madrid, Spain.
4. L. Urea and others, "Foundations", Editorial Alfaomega, Mexico, 1999.
5. P. Norton, "Introduction to Computing", Editorial McGraw Hill, Mexico, 1998.
6. J. Oros, "Design of Interactive Web Pages with javascript", Editorial Alfaomega, Mexico.
Bachelor's Degree in Mathematics

Programs