N202 CC102 Programming Languages
N202 CC102 Programming Languages
N202 CC102 Programming Languages
COLLEGE OF SCIENCES
MATHEMATICS PROGRAM
I. GENERAL INFORMATION
1. PROGRAMMING FUNDAMENTALS
Introduction / Definition of problems and casuistries / Concept of program and instructions /Programming
languages and source code / programming steps / Concepts and characteristics of algorithms / Decision,
repetition and control algorithms / Flow diagrams and their symbols / Diagramming and pseudocodes /
Diagrams with decisions and repetitions.
2. INPUT/OUTPUT INSTRUCTIONS AND OPERATIONS
Structure of a program, types and methods / Programming rules and its libraries / data, constant and
variables concept / Types of data / variable declaration: int, float, char, long, double/ Input instructions
Console()/ output instructions Console.Write()/ Arithmetic operators and their rules / mathematical
operations, priorities and use of parenthesis / Assignment statement and its rules / Type conversions /
Math functions: / Multiple assignments and include operator / Operators: ++.
3. REPETITION AND DECISION INSTRUCTIONS
Logic operators: ==, !=, >, <, >=, <= / Logic operators: !, &&. || / Rules / Logics. Algorithms and diagrams
with decisions. / Logics / Instruction “if-else”, syntax and rules / Instruction “only If”, “if-else” with bocks, “If
within if” / Algorithms and programs with “if-else” / Instruction “while”, syntax and rules / Instructions “while”
with an instruction and with a block of instructions / Instructions do-while, syntax and rules / Algorithms and
programs with do-while.
4. SELECTION AND CONTROL INSTRUCTIONS
Instruction “for”, start expression. Assessment and preparation / Control, syntax and rules / Instruction “for”
with one instruction and with a block of instructions / “For” nested instructions, “internal” for and “external”
for / Algorithms and programs with “for” and “nested for”, “nesting” / Until instruction “for” / Switch-case
instruction, syntax and rules / Break instruction, syntax and rules / Use of “break” within switch-case /
“Continue” instructions.
5. ARRAYS
Concept of array, declaration, subscript. Syntax and rules / reading and writing of arrays of one dimension /
Sorting and deleting of the elements of an array / Operations with one-dimensional arrays / String arrays,
string reading and writing / Comparisons and initializations of strings / String internal functions / Two-
dimensional arrays, syntax and rules / Subscripts, addresses and declarations of two-dimensional arrays /
Reading, writing and operations with two-dimensional arrays / Multidimensional arrays, syntax, rules and
uses / Matrix operations.
6. FUNCTIONS
Concept of function, syntax and rules / Definition of a function, arguments and parameters / Local and
global variables / Call of a function and transfer values / Typical variables of a function, repeated execution
of a function / Return instruction / One-function algorithms and programs / Programs with several function
and their iterative function / Concept of recursion / programs with function recursion / Functions with scripts
/ Reading and writing functions.
7. POINTERS
Concept of pointer and pointer assignment / Values exchange among arguments and parameters /
Declaration, rules, syntax and pointers / Pointers to arrays / Pointers to scripts / Algorithms and programs
with pointers / Concept of pointer array, syntax and rules / Pointer array addressing / Algorithms and
programs with pointer array / Algorithms and programs with pointer’s pointer.
V. LABORATORY EXPERIENCES
Lab 1: Decision instructions.
Lab 2: repetitive instructions.
Lab 3: Array and selection sentences.
Lab 4: Functions and pointers.
VI. METHODOLOGY
Sessions will be carried out stimulating students’ active participation, through practical cases programming.
Students will form groups for researching and exchanging learning and work experiences. The instructor’s
expositions will guide every programming work and they will also advised be individually and in groups
using real applications. Lab practical sessions will complement knowledge and develop students’ skills and
abilities in problem solving through programming language techniques. Papers’ originality and creativity will
be motivated encouraging a constant research.
VIII. BIBLIOGRAPHY
1. JOYANES, LUIS
C# Programming
Mc Graw – Hill, 2001
2. SCHILDT, Herbert
Turbo C Programming
Osborne/McGraw-Hill, 2010