Degree | Type | Year |
---|---|---|
2500149 Mathematics | FB | 1 |
You can view this information at the end of this document.
None.
1. SAGE (3 credits).
Numeric and algebraic computations.
Graphs of functions.
Equation solving.
Lists, sets, tuples and dictionarys.
Funtions and programs.
Objects and classes.
Basic infinitesimal calculus.
Integers and congruencies. Polynomials.
Lineal Algebra. Vectors and matrices.
2. Typestting with LaTeX (1 credit).
LaTeX foundations. Mathematical formulas.
Structure of the document. Spaces and dimensions.
Tables and matrices. Pictures and floating matherial.
Definition of new commands.
3. Programació en C (3 credits).
What is a program. Source code. Compilation.
Iterative and alternative structures.
Data and constant types.
Types of variables and constants.
Structured programming: Functions.
Vectors and matrices. Pointers.
Dynamic memory management.
Input and Output: console interaction and files.
Data structures.
Libraries.
4. Introduction to computer science (2 credits).
Algorithms.
Information coding.
Complexity.
Computability.
Hardware.
Operating systems.
Languages and compilation.
Object Oriented Programming.
Functional programing.
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 |
Annotation: Within the schedule set by the centre or degree programme, 15 minutes of one class will be reserved for students to evaluate their lecturers and their courses or modules through questionnaires.
Title | Weighting | Hours | ECTS | Learning Outcomes |
---|---|---|---|---|
C assignment | According to formula above | 3 | 0.12 | 7, 1, 6, 5, 4 |
Latex assignment | According to formula above | 2 | 0.08 | 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 | 3 | 0.12 | 2, 1, 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.
E: 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 + E + 2T + 2I) / 9.
Using the grades E i T, a grade C is computed as C=(E+2T)/3.
To pass the course, you must verify the following:
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 corresponding to L and T are NOT recoverable.
The student who has submitted works or exams for a total of at least 50% of the subject will be considered assessable, according to the weight that appears in the formula of the final grade. Otherwise, it will appear as non-assessable.
The notes of the second calls will not be taken into account for the allocation of honor degrees.
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.
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
George Grätzer, More Math Into LaTeX, Springer, 2016
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
We will use SageMath, Pyhton, Latex and C. During the course we will give the necessary instructions to install the programs.
Name | Group | Language | Semester | Turn |
---|---|---|---|---|
(PLAB) Practical laboratories | 1 | Catalan | annual | morning-mixed |
(PLAB) Practical laboratories | 2 | Catalan | annual | morning-mixed |
(PLAB) Practical laboratories | 3 | Catalan | annual | morning-mixed |
(PLAB) Practical laboratories | 4 | Catalan | annual | morning-mixed |
(TE) Theory | 1 | Catalan | annual | morning-mixed |