Degree | Type | Year | Semester |
---|---|---|---|
2500149 Mathematics | FB | 1 | A |
None.
1. SAGE (3 credits).
Numeric and algebraic computations.
Graphs of functions.
Equation solving.
Vectors and matrices.
Funtions and programs.
Basic infinitesimal calculus.
Integers and congruencies.
Linera Algebra.
2. Typestting with LaTeX (1 credit).
LaTeX foundations.
Structure of the document.
Pictures. Definition of new commands.
Presentations with Beamer.
3. Programació en C (3 credits).
What is a program. Source code. Compilation.
Data and constant types. Operators.
Iterative, repetitive and conditional structures.
Functions, variables and pointers.
Vectors and matrices.
Character strings.
Dynamic memory management.
Input/Output. Formats and files.
Preprocessor and macros.
Parameters and output of the main() function.
4. Introduction to computer science (2 credits).
Algorithms.
Information coding.
Hardware.
Operating systems.
Languages and compilation.
Object Oriented Programming.
Title | Hours | ECTS | Learning Outcomes |
---|---|---|---|
Type: Directed | |||
Practical lectures | 44 | 1.76 | 7, 1, 3, 6, 5, 4, 8 |
Theoretical lectures | 20 | 0.8 | 1, 6, 5, 4 |
Type: Autonomous | |||
C programming | 60 | 2.4 | 7, 1, 6, 5, 4 |
Preparation LATEX document | 18 | 0.72 | 1, 6, 5, 8 |
Preparation exam Sage | 34 | 1.36 | 3, 6, 5 |
Preparation exams Introduction to Informatics | 25 | 1 | 6, 5, 4 |
Sage programming | 10 | 0.4 | 1, 3, 6, 5, 4 |
The note of the continuous assessment will be based on the weighted average of:
S: The note of the Sage exam.
L: The note of the work of LaTeX.
C: The note of the Programming exam in C.
T: The note of the work of Programming in C.
I: The note on the Introduction to Computing exam.
The final mark of the continuous evaluation will be obtained by doing (3S + L + C + 2T + 2I) / 9.
To pass the course, you must:
Obtain a global average of 5 out of 10. (The averages from 4.8 will be assessed on a case by case basis.)
Obtain a minimum of 3.5 out of 10 on each and every one of the notes S, L, C, T, I.
From each one of the examinations there will be a second call to recover / improve the note. The delivery of this second exam will automatically annul the note of the first call. The works are NOT recoverable.
The student who has submitted works or exams for a total of at least 50% of the subject will be considered evaluable, according to the weight that appears in the formula of the final grade. Otherwise, it will appear in the Minutes as Non-Valuable.
The notes of the second call will not be taken into account for the allocation of Honor Matriculations.
VERY IMPORTANT: The evaluable works are individual. Copy or leave to copy in whole or in part a work that can be evaluated or an exam will be penalized with a zero as the final mark of the subject.
Title | Weighting | Hours | ECTS | Learning Outcomes |
---|---|---|---|---|
C assignment | According to formula above | 0 | 0 | 7, 1, 6, 5, 4 |
Final exam | According to formula above | 4 | 0.16 | 2, 1, 6, 5, 4 |
Latex assignment | According to formula above | 0 | 0 | 1, 6, 5, 8 |
Partial exam of Sage | According to formula above | 4 | 0.16 | 2, 1, 3, 6, 5, 4 |
Partial exams of C | According to formula above | 2 | 0.08 | 2, 7, 1, 6, 5, 4 |
Partial exams of Introduction to Informatics | According to formula above | 4 | 0.16 | 2, 1, 6, 5, 4 |
During the course the essential material will be provided to follow it. As an additional material, we recommend:
SAGE. http://www.sagemath.org/help.html
Tobias Oetiker, Hubert Partl, Irene Hyna and Elisabeth Schlegl. The not so short introduction to LaTeX 2e. Tobi.oetiker.ch/lshort/lshort.pdf
CProgramming. http://www.cprogramming.com/tutorial/c-tutorial.html (The amount of tutorials on language C on the internet and in the form of a book is enormous, and in a variety of languages)
B.W. Kernighan, Ritchie, D.M., The C programming language. 2nd edition. 1988