| Study programme competencies |
| Code | Study programme competences |
| A4 | Coñecementos básicos sobre o uso e a programación dos ordenadores, sistemas operativos, bases de datos e programas informáticos con aplicación na enxeñaría. |
| A5 | Coñecemento da estrutura, organización, funcionamento e interconexión dos sistemas informáticos, os fundamentos da súa programación e a súa aplicación para a resolución de problemas propios da enxeñaría. |
| B1 | Capacidade de resolución de problemas |
| B3 | Capacidade de análise e síntese |
| B4 | Capacidade para organizar e planificar |
| C3 | Utilizar as ferramentas básicas das tecnoloxías da información e as comunicacións (TIC) necesarias para o exercicio da súa profesión e para a aprendizaxe ao longo da súa vida. |
| C6 | Valorar criticamente o coñecemento, a tecnoloxía e a información dispoñible para resolver os problemas cos que deben enfrontarse. |
| C7 | Asumir como profesional e cidadán a importancia da aprendizaxe ao longo da vida. |
| Learning aims | |||
| Learning outcomes | Study programme competences | ||
| Knowing and understanding the importance of the programming objectives. Knowing the general aspects of programming languages and paradigms. Knowing the pseudocode and syntax of Pascal language (ISO 10206 standard) in order to be able to describe algorithms and programs. Knowing the steps to follow for building an application and its main components. Knowing the basic data types using Pascal ISO 10206. Knowing the control structures for structured programming and the differences between them. Knowing all aspects related to the implementation of functions and procedures. | A4 A5 |
B1 B3 B4 |
|
| Knowing and understanding the importance of the programming objectives. Knowing the general aspects of programming languages and paradigms. Knowing the pseudocode and syntax of Pascal language (ISO 10206 standard) in order to be able to describe algorithms and programs. Knowing the steps to follow for building an application and its main components. Knowing the basic data types using Pascal ISO 10206. Knowing the control structures for structured programming and the differences between them. Knowing all aspects related to the implementation of functions and procedures. | A4 A5 |
B1 B3 B4 |
|
| Being able to track an algorithm (in pseudocode) or program (Pascal ISO 10206), explaining what it is generating and finding possible errors. Being able to solve small algorithms and programs. Solving small algorithms and programs starting from low- to moderate-difficulty problems: given the objectives of the program, to choose and use the best data types and structures, the control structures, to decompose and implement the functions and procedures. Using an appropriate programming style. Learning to make good use of identifiers, appropriate comments, the establishment of preconditions and postconditions, and the good design of procedure and function interfaces. | A4 A5 |
B1 B3 B4 |
C3 C6 C7 |
| Being able to track an algorithm (in pseudocode) or program (Pascal ISO 10206), explaining what it is generating and finding possible errors. Being able to solve small algorithms and programs. Solving small algorithms and programs starting from low- to moderate-difficulty problems: given the objectives of the program, to choose and use the best data types and structures, the control structures, to decompose and implement the functions and procedures. Using an appropriate programming style. Learning to make good use of identifiers, appropriate comments, the establishment of preconditions and postconditions, and the good design of procedure and function interfaces. | B1 B3 B4 |
C3 C6 C7 |
|
| Independent learning, planning activities to develop, capacity for abstraction, decision making, initiative and participation. | B3 B4 |
C3 C6 C7 |
|
| Independent learning, planning activities to develop, capacity for abstraction, decision making, initiative and participation. | B3 B4 |
C3 C6 C7 |
|
| Contents |
| Topic | Sub-topic |
| 1 BASIC CONCEPTS | 1.1 Algorithms 1.1.1 Representation of algorithms 1.2 Programs (applications) 1.2.1 Types of programs 1.3 Programming languages 1.3.1 A historical overview 1.3.2 Classification of languages 1.3.3 Most important language instructions 1.3.4 Properties of languages 1.4 Code compilers 1.5 Description of languages 1.5.1 Backus–Naur Form notation 1.5.2 Conway diagrams 1.6 The structure of a program 1.7 Elements of a program 1.7.1 Predefined symbols 1.7.2 Special symbols 1.7.3 Identifiers 1.7.4 Tags 1.7.5 Comments 1.7.6 Directives 1.7.7 Constants 1.7.8 Numbers 1.7.9 Strings 1.7.10 Variables: declaration and initiation 1.8 Output and input 1.8.1 Output sentences 1.8.2 Input sentences 1.9 Data types and operators 1.9.1 Data types 1.9.2 Operators 1.9.3 Expressions |
| 2 Control statements | 2.1 Sequential flow 2.2 Alternative syntax 2.2.1 IF statement 2.2.2 CASE statement 2.3 Repetitive statement 2.3.1 Introduction 2.3.2 Variables associated with loops 2.3.3 WHILE loop 2.3.4 Examples to perform in class 2.3.5 FOR loop 2.3.6 REPEAT loop 2.3.7 Equivalence between loops 2.3.8 Errors with loops 2.3.9 Loop design |
| 3 Program structure | 3.1 Procedures 3.1.1 Description 3.1.2 Types of procedures 3.1.3 Value and reference parameters 3.1.4 Protected parameters 3.1.5 Memory management for procedures 3.1.6 Global and local variables 3.1.7 Side Effects 3.2 Functions 3.2.1 Description 3.2.2 Predefined functions 3.2.3 User-defined functions 3.3 Recursion 3.3.1 Why recursion 3.3.2 Direct and indirect recursion. FORWARD directive. 3.3.3 Infinite recursion |
| 4 Simple data structures | 4.1 Arrays 4.1.1 ARRAY data type 4.1.2 Declaring an Array 4.1.3 Arrays of more than one dimension 4.1.4 Operations with Arrays 4.1.5 Arrays as parameters 4.1.6 Array-type functions 4.1.7 Constants array type 4.2 Records 4.2.1 RECORD data type 4.2.2 WITH statement 4.2.3 Record operations 4.2.4 Variant records 4.2.5 Records as parameters 4.2.6 Record type functions 4.2.7 Record type constants 4.3 Strings 4.3.1 Fixed-length strings 4.3.2 Variable-length strings 4.4 Sets 4.4.1 Operations and relationships between sets 4.4.2 Processing sets 4.5 Basic Operations on Arrays |
| 5 Input / Output | 5.1 Files 5.2 Types 5.3 Operations and access modes 5.4 Specific predefined functions and procedures |
| Planning | ||||
| Methodologies / tests | Competencies | Ordinary class hours | Student’s personal work hours | Total hours |
| Guest lecture / keynote speech | A4 A5 B1 B3 C6 C7 | 30 | 30 | 60 |
| Seminar | B4 C3 C6 | 8 | 10 | 18 |
| Laboratory practice | A5 A4 B1 B3 B4 C3 C6 C7 | 20 | 50 | 70 |
| Personalized attention | 2 | 0 | 2 | |
| (*)The information in the planning table is for guidance only and does not take into account the heterogeneity of the students. | ||||
| Methodologies |
| Methodologies | Description |
| Guest lecture / keynote speech | In the theory sessions, the teacher describes the objectives and contents of the course as a personal point of view on programming. The teacher will present the available programming methods and tools. In the case of special issues, the students should deepen their self-learning. The goal is that students learn to create algorithms for real problems, to use the basic data structures and to apply programming techniques for simple problems. The course programming language is represented by Extended Pascal, ISO 10206 standard. The course slides will be available on UDC Moodle before each course lecture. |
| Seminar | In the seminar sessions practical exercises will be conducted in order to detect and address the students knowledge gaps. |
| Laboratory practice | In the practice sessions, students will write program pseudocodes and they will encode them with Extended Pascal ISO 10206 Standard, they will compile, run and check the codes. The goal of the teacher is to supervise the code generated by the student, to resolve doubts, to correct bad programming styles and logical errors (Pascal errors will be detected by the compiler). The problems will be available on the UDC Moodle before each laboratory class. The Moodle forum will be used to respond to any related question about any aspect of the course. This way, all the students are able to have the same information in the same time. |
| Personalized attention |
|
|
| Assessment | |||
| Methodologies | Competencies | Description | Qualification |
| Laboratory practice | A5 A4 B1 B3 B4 C3 C6 C7 | All the tests will be held on computer (programming code, writing pseudocodes, short questions). There is no Pascal code programming on paper. The students will randomly choose the exam tasks. Any attempt to cheat during an exam will be punished with grade 0. |
30 |
| Guest lecture / keynote speech | A4 A5 B1 B3 C6 C7 | Course grade = continuous assessment grade + final exam grade Continuous assessment grade is divided into two parts: 1. First test in the middle of the course (2 points): pseudocode and code programming with each code line explained for one random exercise. 2. Second test in the last week of the course (3 points): code programming only for two random exercises. The final exam will consist of three exercises where the student must develop code (5 points). The July extraordinary exam will consist of three problems to develop code (5 points). This grade will be added to that one obtained in the continuous evaluation. The evaluation in December consists into a single test with three problems (10 points). |
70 |
| Assessment comments | |||
|
<p>The final grades will be determined by the continuous assessment grades and the one obtained in the final exam. The final exam will consist of three programming exercises in the language used in the practice sessions.</p>
|
|||
| Sources of information |
| Basic |
ISO (1990). Extended Pascal ISO 10206. ISO
Carmen Bóveda, Esteban García, Alejandra Martínez (2016). Problemas en Pascal Estándar ISO-10206. La Coruña , Reprografia del Noroeste
Carmen Bóveda, Esteban García, Alejandra Martínez (2014). Programación estructurada en un lenguaje didáctico y estándar. La Coruña , Reprografia del Noroeste |
|
|
|
| Complementary |
Leestma, S e Nyhoff, L.. (1993). Pascal Programming and Problem Solving. Prentice Hall
Grogono, P (). Programación en Pascal. Addison-Wesley I
Leestma, S e Nyhoff, L.. (1999). Programación en Pascal. Madrid Prentice Hall
Valls, J. e Camacho, D. (2004). Programación estructurado y algoritmos en Pascal. Madrid Prentice Hall |
|
|
| Recommendations | |
| Subjects that it is recommended to have taken before |
| Subjects that are recommended to be taken simultaneously | |
|
| Subjects that continue the syllabus | |
|
| Other comments | |
|
<p>The student must keep in mind that you must perform a very important self-taught work by following the flow: reading, attending, understanding, asking, studying and practicing.</p><p><ul> |