Algoritmos y Programación de Computadoras

Prontuario

Normas

Material

Pruebas Cortas

Asignaciones

Profesor

Bienvenido al fabuloso mundo de las computadoras

DEPARTMENT OF GENERAL ENGINEERING

UNIVERSITY OF PUERTO RICO

MAYAGÜEZ CAMPUS

COURSE SYLLABUS

Course No.......: INGE 3016

Title...........: Algorithms and Computer Programming

Credits.........: 3

Open to.........: Second Year Students

Prerequisite....: MATE 3031

Textbook........: C How To Program, by: Harvey M. Deitel &

Paul J. Deitel , Second Edition, 1994, Prentice Hall.

COURSE DESCRIPTION:

Development of algorithms and their implementation in a structured high

level language. Programming techniques applied to the solution of engineering and mathematical problems.

REFERENCE BOOKS:

1.Applications Programming in ANSI C, by: R. Johnsonbaugh and M.

Kalin , Second Edition, MacMillan.

2.The C Programming Language, by: B. W. Kernighan and B. M.

Ritchie, Second Edition, Prentice Hall.

3.C Programming A Modern Approach, by: K. N. King, 1996, Norton.

4.C A Reference Manual, by: S. P. Harbison and G. L. Steele,

Third Edition, Prentice Hall.

GRADE DISTRIBUTION:

At least three (3) partials and a final examination will be administered throughout the semester and the final grade will depend on these and other appropriate elements the instructor may see proper to consider. Examination dates should be given to the students at the beginning of the semester.

COURSE SCHEDULE

Topics

I. Introduction to Computer Systems

a. Basic Components and Definitions

b. Binary Numeric System

c. Internal Representation of Information

d. Basic Characteristics of Machine Language

e. Programming Languages and Compilers

f. Basic Characteristics of an Operating System

II. Problem Analysis and Design of Algorithms

a. Problem Analysis and Specification

b. Algorithms

1. Definition

2. Flowcharts

3. Pseudo-code

4. Examples

c. Structured Constructs

1. Sequential Structure

2. Selection Structure

3. Repetition Structure

d. Fundamental Programming Principles

III. A High Level Language

a. Constituents of a Program

b. Variables and Constants

c. Arithmetic Operators

d. Assignment Statement

e. Input/Output

IV. Control Structures

a. Logical Expressions

b. Selection Structure

c. Multi alternative Selection Structure

d. Repetition Structure

1. Iteration Techniques

2. Concept of a Counter and an Accumulator

3. Nested Loops

V. Subprogram

a. Functions and Function Prototypes

VI. Formatted Input/Output

a. Formatted Output

b. Formatted Input

VII. Arrays

a. Declaration of Arrays

b. Manipulation of Arrays

c. I/O of Arrays

VIII. File Processing

a. Sequential Files

b. Random-Access Files

c. I/O of Files

Approved by: Submitted by:

Dr. Anand D. Sharma Prof. Hiram Cabassa

Director Coordinator

Computer Science Committee

Revised : July 22, 1996.