| Educational guide School of Engineering |
english |
| Bachelor's Degree in Computer engineering (2010) |
 Subjects |
| PROGRAMMING METHODOLOGIES |
| Learning outcomes |
| IDENTIFYING DATA | 2023_24 |
| Subject | PROGRAMMING METHODOLOGIES | Code | 17234116 | |||||
| Study programme |
|
Cycle | 1st | |||||
| Descriptors | Credits | Type | Year | Period | ||||
| 6 | Compulsory | Second | 1Q |
|||||
| Competences | Learning outcomes | Contents |
| Planning | Methodologies | Personalized attention |
| Assessment | Sources of information | Recommendations |
| Type A | Code | Learning outcomes |
| CM6 |
Know the theoretical fundamentals of programming, in order to demonstrate a code is correct and know how to estimate its algorithmic complexity. Understand the concept and the recursive design of algorithms. Link the concepts of mathematical induction proof to the logic problems of the execution of parameterised programs. Know the classic algorithms based on recursive routes and/or parallelism. Make practical use of these concepts in the design and the construction of programs. | |
| CM7 |
Know the theoretical fundamentals of programming, in order to demonstrate a code is correct and know how to estimate its algorithmic complexity. Understand the concept and the recursive design of algorithms. | |
| CM8 |
Make practical use of these concepts in the design and the construction of programs. | |
| Type B | Code | Learning outcomes |
| Type C | Code | Learning outcomes |
