Telecommunications and Computer Engineering

Cristina Isabel Diogo

LG1. Understand the structure of the vector space IR^n and the concepts of vector subspaces, linear dependence of vectors, basis, and dimension.
LG2. Apply the Gram-Schmidt method to obtain an orthonormal basis.
LG3. Solve and classify systems of linear equations.
LG4. Understand the notion of a matrix and master matrix algebra.
LG5. Calculate, interpret, and apply determinants of square matrices.
LG6. Identify linear functions (and matrices of linear functions) between vector spaces.
LG7. Calculate and interpret eigenvalues and eigenvectors. Diagonalize matrices. Determine integer powers of diagonalizable matrices.
LG8. Apply the singular value decomposition of a matrix to image compression.
LG9. Classify quadratic forms.

PC1. Vectors and Systems of linear equations
1.1 The vector space R^n.
1.2 Inner product and norm.
1.3 Linear combination and independence.
1.4 Basis and dimension.
1.5 Coordinates of a vector.
1.6 Gram-Schmidt process.
1.7 Systems of linear equations.
1.8 Gaussian elimination. Classification.

PC2. Matrices
2.1 Elementary and permutation matrices.
2.2 Matrix operations.
2.3 Transpose and inverse of matrices. Properties.
2.4 LU factorization.

PC3. Determinants. Definition. Properties.

PC4. Linear maps
4.1 Matrix of a linear map.
4.2 Rotation, reflection and projection matrix.
4.3 Kernel and range.
4.4 Null and column space. The rank theorem.
4.5 Base change.

PC5. Eigenvalues and eigenvectors
5.1 Definition. Eigenspaces.
5.2 Diagonalization.
5.3 Quadratic forms.
5.4 Singular Value Decomposition.

Students may choose one of the following assessment schemes:
- Assessment throughout the semester:
- 6 written tests (25%): tests performed in a class, during the semester, lasting 15 minutes;
- final exam (75%): written exam in the first examination period; the minimum grade is 8.0 pts (out of 20).
The missing tests will be graded 0 pts.
Students must take the mini-tests in the class in which they are enrolled.
To calculate the final grade in this component, the 5 best grades will be considered.
The final grade is the best between Assessment throughout the semester and Exam Assessment.
- Exam assessment: a written exam (100%) in the 1st or 2nd examination period.
The minimum grade for this course is 10 points (out of 20).
Students may have to undertake an oral examination whenever the instructor seems it necessary.

Helena Soares

Juliana Marta de Souza

At the end of this course the student should be able to:
LG1. Understand and compute derivatives and interpret the corresponding result.
LG2. Understand and determine linear and higher order approximations.
LG3. Understand and explicitly compute the antiderivative of some elementary functions.
LG4. Understand and apply the fundamental theorem of differential calculus and the fundamental theorem of integral calculus.
LG5. Understand (and compute) integrals as well as their applications.
LG6. Understand and apply some simple numerical methods to obtain solutions of nonlinear equations and to compute approximate values of derivatives and integrals.
LG7. Understand numerical series and determine the power series representation of some functions.

PC 1) Differential calculus in R
1.1. Limits and continuity
1.2. Differentiation
1.3. Taylor's formula.
1.4. Error analysis
1.5. Numerical methods: bisection and Newton's methods
1.6. Numerical differentiation and numerical optimization
PC 2 ) Integral calculus in R
2.1. Antiderivatives
2.2. Integrals
2.3. Fundamental theorem of integral calculus.
2.4. Applications to geometry
2.5. Numerical integration
PC 3) Numerical series and power series
3.1. Sequences
3.2. Series
3.3. Convergence criteria
3.4. Power series and applications

There are two types of assessment:

1. Assessment throughout the semester, consisting of:
- Two Mini-Tests on MATLAB done in class (5% + 5%)
- Test 1 (45%): written test taken during the semester with a minimum grade of 7.5 values.
- Test 2 (45%): written test carried out in the 1st assessment period with a minimum grade of 7.5 values.

2. Assessment by exam: carrying out a final Exam (with a weight of 100%), in the 1st or 2nd period of the evaluation period.

The minimum passing grade for the curricular unit is 10. The lecturers reserve the right to require an oral exam to a student in order to verify the knowledge acquired.

Ricardo Fonseca

Alexandre Passos de Almeida

Catarina Brites

Filipa Rodrigues Prudêncio

Miguel Guedes Félix

Olga Silva

Upon successful completion of this course unit, the student should be able to:

+ LO1 - Understand how a modern computer works, recognizing its main components and respective functionalities;
+ LO2 - Understand the operation of arithmetic and logical digital circuits, and design circuits of this type based on the specification of a problem;
+ LO3 - Explain the operation of synchronous sequential circuits and design circuits of this type to control other elements in a digital system;
+ LO4 - Analyze the operation of register files and memories and their use in the context of a digital computer;
+ LO5 - Understand how the various components are combined to execute individual instructions and complete programs.

+ PC1. Computer architecture
+ Basic architecture: control, datapath, memory and I/O
+ Machine code, assembly language, and high-level languages
+ Representation of information
+ Numerical bases and binary numbering

+ PC2. Combinatorial Logic
+ Operations on bits
+ Boolean algebra
+ Truth tables
+ Logic Gates

+ PC3. Combinatorial Circuits
+ Normalized forms and Karnaugh maps
+ Design combinatorial circuits
+ Decoders and multiplexers
+ Logic and arithmetic circuits

+ PC4. Sequential Circuits
+ Latches and Flip-flops
+ Models of sequential circuits
+ Sequential circuit design

+ PC5. Registers and Memories
+ Registers and register files
+ Register transfer
+ Types of memories
+ Memory banks

+ PC6. Processor Architecture
+ Von-Neumann architecture
+ Instruction Set Architecture (ISA)
+ Datapath and control units
+ Modern CPUs

The curricular unit can be carried out through 2 types of assessment:

1. Assessment throughout the semester

Assessment throughout the semester consists of:

+ (70%) 2 tests: 1 test carried out in the middle of the semester, on a date to be defined, and a 2nd test carried out on the first date of the exam period;
+ (20%) Laboratory group work, carried out weekly during laboratory classes;
+ (10%) Online mini-tests, carried out weekly on the e-learning platform.

The final grade is calculated through a weighted average of these 3 aspects according to the weights presented, taking into account that:

+ Passing the test component requires obtaining a minimum grade of 7.5 in both tests;
+ Missing 2 or more laboratory sessions results in automatic failure in this component of the assessment;
+ Failure to deliver 4 or more online mini-tests results in automatic failure in this component of the assessment;
+ For the purposes of calculating grades, missing assignments are marked with 0 values;

Failure in any of the assessment components throughout the semester requires that the student is assessed by final exam.

2. Assessment by final exam

Assessment by final exam consists of 1 single exam carried out in any of the available exam periods, which will correspond to 100% of the final grade.

João Pedro Beato Antão

Lourenço Correia da Silva

Nuno Miguel de Figueiredo Garrido

Sancho Moura Oliveira

After obtaining approval for the course, students should be able to:

OA1. Develop functions/procedures that implement simple algorithms.

OA2. Develop code that manipulates arrays and objects.

OA3. Develop simple object classes.

OA4. Write and understand Java code.

CP1. Independent functions
CP2. Variables and control structures
CP3. Dependent functions
CP4. Arrays
CP5. Compound values
CP6. Procedures and references
CP7. Object classes
CP8. Matrices
CP9. Files and I/O
CP10. Recursion

Assessment is carried out throughout the semester. The evaluation components and their respective weights in the final grade are as follows:

a) Weekly submission of exercises (10%); minimum grade: 60%.

b) Intermediate mid-term test (25%); no minimum grade required.

c) Individual Project (25%); minimum grade: 20%.

d) Final Test to be carried out during the exam period (40%); minimum grade: 40%.

Notes:
1. The evaluation of weekly exercises is based only on the accounting of submissions duly completed (and not on the evaluation of the exercises themselves).

2. There will be two possibilities for taking the Final Test, in the first and second exam period.

3. There is no possibility of passing the course just by exam for 100% of the grade.

4. Evaluation through the special exam period involves delivering and discussing an Individual Project (25%) and taking a written exam (75%).

5. It is not possible to use evaluation component grades obtained in previous course editions.

Filipe Alexandre dos Santos

Afonso Manuel Barral Caniço

After the course, the student will be able to:
LO1. Understand sorting and search algorithms appropriate to computational solutions;
LO2. Identify, rewrite and review common ways of organizing data and associated algorithms (with and without dynamic memory management, with iterative or recursive algorithms);
LO3. Estimate and value the complexity of algorithms on alternative data structures,
LO4. Prototype new forms of organization of data and associated algorithms suited to solve new computational problems.

PC1. The problem Union-Find
PC2. Analysis of Algorithms
PC3. Stacks, Queues, Lists, Bags
PC4. Priority Queues
PC5. Mergesort Elementary Symbol Tables
PC6. Quicksort Balanced Search Trees
PC7. Hash Tables
PC8. Elementary Sorts: Selectionsort; Insertionsort; Shellsort
PC9. Advanced Sorts: Mergesort; Quicksort; Heapsort
PC10. Sorting Complexity

Assessment throughout the semester: 10 individual programming exercises (25%), without a minimum grade and delivered weekly and two written tests (75%), the first in the middle of the semester and the second coinciding with the 1st season exam. Each of the written tests has a minimum grade of 7.5 points. Attendance in classes is not mandatory.
or
Individual final exam (100%) – 1st season, 2nd season and Special Season

João Nuno Garcia Nobre Prata

LO1: Understand the concepts and techniques of differential calculus in Rn.
LO2: Apply differentiability in the study of optimization.
LO3: Understand the definitions and compute integrals in Rn.
LO4: Apply double and triple integrals in the calculation of areas, volumes, center of mass, and probability density.
LO5: Use numerical methods for integration.
LO6: Understand the definitions of vector calculus and apply the theorems of vector analysis to physics problems.

1) Differential calculus in Rn
1.1.Functions of several variables
1.2.Limits and continuity
1.3.Partial derivatives,directional derivatives,gradient
1.4.The chain rule and the backpropagation algorithm
1.5.Implicit and inverse function theorems
1.6.Higher order derivatives and Taylor?s formula
2)Optimization in several variables
2.1.Analytic optimization vs numeric optimization
2.2.Unconstrained optimization
2.3.Numerical methods:steepest descent and Newton?s method
3)Integral calculus in Rn
3.1.Riemann integral in Rn
3.2.Fubini?s theorem
3.3.Change of variable
3.4.Double and triple integrals
3.5.Applications of integration to compute areas, volumes centers of mass and probability density
3.6.Numerical methods:numerical integration(Monte Carlo method)
4)Vector analysis
4.1.Geometry of curves
4.2.Geometry of surfaces
4.3.Line integrals:fundamental theorem
4.4.Surface integrals
4.5.The theorems of Green,Stokes,divergence
4.6.Physical applications:Newton?s gravity,electricity, magnetism

Students can choose one of the following evaluation methods:

Assessment throughout the semester - mini-tests in class (30%) + Test (70%).
Assessment by Exam (100%), in any of the exam periods.

The responsible professors reserve the right to conduct oral exams whenever they deem it necessary.

Marco Alexandre Ribeiro

LG 1 - Understand the main types of motion in one and two dimensions, identifying its causes, and to be capable of solving problems involving one or more objects under the influence of gravity, tensile cords and contact forces.
LG 2 - Understand the concepts of work and energy and be able to solve problems involving conversion mechanisms between different forms of energy.
LG 3 - Analyze the motion of an object in circular orbit under the influence of a gravitational field.
LG 4 - Understand the concepts of periodic motion, oscillations, forced oscillations and waves.
LG 5 - Understand and analyse situations involving interference between multiple waves.

CP 1. Modelos, Unidades e Cálculo
CP 2. Movimento unidimensional
CP 3. Movimento bi-dimensional
CP 4. Leis de Newton
CP 5. Energia
CP 6. Energia Potencial
CP 7. Gravitação e Campos de Forças
CP 8. Movimento Circular Uniforme
CP 9. Forças Variáveis e Molas
CP 10. Movimento Periódico e Oscilações
CP 11. Ondas
CP 12. Ondas Sonoras
CP 13. Sobreposição e Ondas estacionárias

This course can be completed in two ways:
i) Written exam at the end of the semester. The final grade is the grade on this exam.
ii) 2 written tests + 10 online quizzes during the semester - 7 required. The 1st test is held during the semester. The 2nd is held in the day of the first exam. The minimum score on each test is 8 points and the final grade is calculated as 0.9 * (T1 + T2) / 2 + 0.1 * MT, where MT is the average of 8 quizzes, the top 4 of each half (4/5 + 4/5).

Carlos Eduardo Dias Coutinho

Alexandre Passos de Almeida

Catarina Brites

Nuno Miguel de Figueiredo Garrido

OA1: Distinguish Operating System (OS) types, functions and characteristics
OA2: Describe aspects of process managment and related algorithms
OA3: Describe mechanisms related with inter-process communication and syncronization
OA4: Describe memory management models in multiprogramming systems and compare related algorithms. Explain virtual memory management methods
OA5: Describe the I/O principles
OA6: Explain the most common file system implementation issues
OA7: Identify OS security mechanisms and describe types of security attacks, and protection methods
OA8: Use the command line to work on a remote linux server; program shell script; use processing text and administration related commands
OA9: Program at the system level, using the OS functionalities and considering both sequential and concorrent programming

CP1: Introduction to Operating Systems, Processes.
CP2: Processes and threads.
CP3: Process scheduling.
CP4: Process syncronization. Semaphores.
CP5: Interprocess comunication.
CP6: Memory management: models and algorithms.
CP7: Virtual Memory.
CP8: Input / Output.
CP9: File Systems.
CP10: Case study: Linux.
CP11: Shell commands and shell programming.
CP12: Communication and syncronization mechanisms.

The working method includes the following guidelines:
- emphasis on the understanding of the key OS concepts and on relating these concepts with student practice and work
- strong liaison between theory and practice / laboratory work
- practice and laboratory work as the driver to consolidation of student skills and knowledge

|

This course uses a periodical evaluation, not allowing a single final exam.

Evaluation components:
* TRAB (12.5% x 3): group work performed in 3 stages
* TPC (12.5%): 9 home questionaries, counting only the best 8
* PE (50%): Written exam performed during the evaluation periods

Requirements: Trab+TPC >= 9.5, PE >= 9.5

Further information in "Observações".

Filipe Alexandre Pedra Aguiar de Moura

OA1 Master the algebra of complex numbers; know how to deal with exponential and trigonometric functions and their inverses.
OA2 Explicitly solve initial value problems, in particular using the Laplace transform.
OA3 Represent periodic functions in Fourier series.
OA4 Determine the Laplace and Fourier transformations of simple functions.
OA5 Know and apply some basic properties of Laplace and Fourier transforms.
OA6 Use Fourier analysis methods and properties in the context of signal processing, image processing and data compression.
OA7 Identify holomorphic functions using Cauchy-Riemann conditions. Calculate integrals of functions in the complex plane.
OA8 Represent functions of complex variables in power series and identify singularities.
OA9 Calculate integrals using the residue theorem.
OA10 Implement computational applications of Fourier analysis and complex analysis using MATLAB.

0) Complex numbers. Euler's formula, polar representation and roots.
1) Ordinary differential equations
1.1 Separable and linear first-order equations.
1.2 Second order linear equations with constant coefficients. Applications: RLC circuits; forced oscillations and resonance.
1.3 Laplace transform and its properties. Application to solving initial value problems.
2) Fourier analysis and applications
2.1. Fourier series
2.2. Fourier transform and its properties.
2.3. Convolution of functions.
2.4. Application of the convolution theorem to time-invariant linear systems. Filters.
2.5. Computational applications of Fourier analysis using MATLAB.
3) Complex analysis
3.1 Complex variable functions. Analytical functions. Cauchy-Riemann conditions.
3.2 Integrals of complex functions in the complex plane. Cauchy's theorem.
3.3 Taylor and Laurent series. Singularities and poles.
3.4 Residue theorem. Applications: calculation of integrals.

A - Assessment throughout the semester: interim written test (weighting of 45%); group work in Matlab (10%); final written test (on the subject not assessed in the first test), carried out on the same day as the written assessment by 1st season exam (45% weighting). The minimum grade in any of the written tests is 8.0 and the weighted average of the two tests and the work has a minimum grade of 9.5.
B - Assessment by Exam (100%), at any of the Assessment Times. The exam is in person and has a minimum score of 9.5 points.
Students may have to undertake an oral examination whenever the instructor seems it necessary.

Bráulio Alexandre Alturas

António Pedro Galguinho

Joaquim Lourenço Esmerado

Nuno Geada

Valderi Reis Quietinho Leithardt

With this curricular unit the student should be able to:
LO1. Develop abstraction mechanisms;
LO2. Develop information structuring abilities;
LO3. Develop ability to effectively use information search languages;
LO4. Implement a solution applying the concepts learned.

The programmatic contents (PC) are as follows:
PC1 - UML Language, Class Diagram
PC2 - Relational model
1. Design of relational schemas
2. Relationships and primary keys
3. Foreign keys and integrity rules
4. Optimizations and indexes
5. Transposition of a conceptual model to a relational model
PC3 - SQL Language
1. Simple Querys;
2. Aggregation Functions
3. SubQuerys;
PC4 - SQL Automations
1. Triggers
2. Stored Procedures and Functions
PC5 - Transactions and concurrency
PC6 – Introduction to PHP/MySQL

Assessment throughout the semester:
- Group project, with a pondering of 40% in two phased deliveries;
- Individual written test, with a weight of 50% to be taken on the date of the first period; It is
- Four online midterm tests, with a weighting of 10% to be carried out throughout the semester.
Condition for approval: minimum grade of 8.00 points (out of 20), without rounding for the project and the test.
If the student fails or does not reach the minimum grade in the individual written test, they can use the date of the second period to repeat this assessment component. For project components and online interim tests, there will be no possibility of new deliveries or repetitions.
Students who wish to improve their grade will be able to take the exam, to be held on the date of the second period. None of the remaining components are capable of improvement.

Assessment by exam:
- Individual written test, without consultation, with all the material (100%).
Anyone who has not successfully completed the assessment throughout the semester, with an average grade greater than or equal to 10 (out of 20) takes a final exam – in the first period, second period or in the special period (according to the rules of the pedagogical council).

Sérgio Matos

With this curricular unit the student should be able to:
1. Apply fundamental concepts of electrostatic.
2. Apply fundamental concepts of magnetostatic and characterize magnetic field sources.
3. Analyze ideal magnetic circuits
4. Apply fundamental concepts of time varying electromagnetic fields.
5. Apply fundamental concepts of optics.

1. Electric field and Gauss's law (Coulomb's law, charge density, electrostatic equilibrium, movement in an electric uniform field)
2. Electric potential (electrostatic energy, potential)
3. Capacitors and dielectrics (electric displacement field, Displacement current)
4. Stationary currents and resistances (density of electric current, conductivity,Ohm's law,Kirchhoff's law,Joule's effect)
5. Magnetic field (magnetic force and flux density field, particle movement, Hall's effect)
6. Magnetic field source (force between wires with electrical currents,Ampere's law,magnetic flux)
7. Faraday's Law (electromotive force,Lenz's law,generators, Maxwell's equations)
8. Coils (magnetic permeability,inductances,magnetic energy)
9. Transformers (boundary conditions,ideal transformers)
10. Maxwell Equations, plane wave an optics
11. Geometric optics (reflections, Fermat principle)
12. Wave optics (Huygens principle, Fraunhofer Diffraction)

This course has only periodic assessment (according to point nº 3 of article 7 of RGSACC) composed by:

1) Practical component (40% weight with a minimum grade of 9.5):
1a) four laboratory experiences or;
1b) Individual project
2) Written (60% weight and 9.5 minimum grade or 8 if the student attends more than 75% of classes):
2a) two frequencies or
2b) Global written test during exams season (1st, 2nd and special exam sessions)

Luís Ducla Soares

LG1. Characterize and manipulate continuous signals, in the time domain;
LG2. Characterize and manipulate discrete signals, in the time domain;
LG3. Characterize and manipulate linear and time-invariant systems through their impulsive responses, for continuous time;
LG4. Characterize and manipulate linear and time-invariant systems through their impulsive responses, for discrete time;
LG5. Determine and manipulate the spectra of periodic and aperiodic continuous signals from their time domain expressions;
LG6. Determine and manipulate the spectra of periodic and aperiodic discrete signals from their time domain expressions;
LG7. Characterize and manipulate linear and time-invariant systems, in the frequency domain, through their transfer functions, for continuous time;
LG8. Characterize and manipulate linear and time-invariant systems, in the frequency domain, through their transfer functions, for discrete time.

1. Continuous-time and discrete-time signals - continuous time and discrete time, elementary signals, signal operations, signal classification, energy and power, symmetry properties.
2. Temporal analysis of continuous-time systems - linearity and time invariance, description with differential equations, block diagrams, impulsive response and convolution, causality, stability.
3. Temporal analysis of discrete-time systems - linearity and time invariance, description with difference equations, block diagrams, impulsive response and convolution, causality, stability.
4. Fourier analysis of signals and systems in continuous time - periodic and aperiodic signals in the frequency domain, transfer function, systems in the frequency domain.
5. Fourier analysis of signals and systems in discrete time - periodic and aperiodic signals in the frequency domain, transfer function, systems in the frequency domain.

Assessment can be done throughout the semester or through a written final exam:
A - Throughout the semester assessment: Assessment is done through 2 written tests, one taken during the teaching period and another one on the date of the 1st exam. Each test has a 50% weight on the final grade. Each test has a minimum passing grade of 8/20 (i.e., 7.5).
B - Exam only: Assessment is done through a final exam (1st or 2nd or special exam periods), weighting 100% in the final grade. Minimum passing grade: 9.5/20.

Luís Nunes

José Luís Silva

José Pereira dos Reis

Lourenço Correia da Silva

Maria Pinto Albuquerque

Pedro Sousa Romano

Tomás Brandão

At the end of the term the student should be able to:
OA1. Use an object oriented programming language to design, implement, test and debug small applications.
OA2. Understand and apply the concepts of encapsulation, abstraction, inheritance and polymorphism.
OA3. Know how to use the fundamental data structures of a standard library (stacks, queues, trees, hashtables).
OA4. Apply error-control mechanisms.
OA5. Explain the utility of design patterns and demonstrate their usage in simple cases.

CP1. Packages and encapsulation
CP2. Reading and writing files
CP3. Exceptions and error handling
CP4. Polymorphism and interfaces
CP5. Anonymous classes and lambdas
CP6. Inheritance
CP7. Collections and generic classes
CP8. Introduction to design patterns

As this is an eminently practical course, it is not assessed by 100% exams, but only during the semester. There are 2 types of assessment during the semester: A and B.

Mode A (you need to attend more than 2/3 of the practical classes and take Test 1):
- Class participation (25%, groups of 2 or individual)
- Written test (Test 1) in the middle of the semester (25%, individual, minimum mark of 8)
- Project (50%, groups of 2 or individual, submission and discussion in the last week of classes, minimum mark of 8)

Mode B:
- Written test in the middle of the semester (25%), (individual, minimum mark of 8)
- Written test on the date of the 1st term (25%, part of the subject or 50%, the whole subject - in this case it can replace test 1 if it has a mark <8), (individual, minimum mark of 8)
- Project (50%, groups of 2 or individual, submission and discussion in the last week of classes, minimum mark of 8)

Regardless of the modality followed, the grade for the “Project” component is limited by the performance demonstrated individually in an oral discussion, according to the following rule:
- Very good performance - no limit;
- Good performance - limit of 16 marks
- Sufficient performance - limit of 12 val.
- Poor performance in the discussion - failure of the course.

The special assessment period consists of a project and a test, each component worth 50%.
Grades can only be improved by repeating the assessment process the following year.

Nuno Souto

At the end of the course, each student should have acquired the following competences:
OA1: be able to identify the basic electrical quantities as well as the essential electrical elements used to implement a resistive circuit.
OA2: be able to apply the fundamental theorems and methods of circuit analysis to predict the behaviour of resistive circuits.
OA3: be able to calculate the time behaviour as well as the frequency response of reactive circuits made up of resistors, capacitors, coils and transformers.
OA4: be able to analyse and size circuits with AmpOps in view of the different types of functions required (circuits that implement mathematical operations, amplifiers, filters, etc.).
OA5: be able to apply circuit analysis techniques and simulation tools to design and implement electrical circuits experimentally, using basic electrical instruments to measure and test their behaviour.

CP1:Resistive Networks
CP1.1: Introduction to electrical networks
CP1.2: Electric Circuits Variables
CP1.3: Resistive Elements
CP1.4: Kirchhoff's Laws
CP1.5: Circuit Theorems (Superposition, theorem of Thévenin-Norton, Maximum-power transfer)

CP2:Reactive Networks
CP2.1: Reactive Elements (Capacitator, Inductor, series and parallel connections, transformer)
CP2.2: First order circuits
CP2.3: Second order circuits (parallel and serier RLC)
CP2.4: Sinusoidal Steady-state analysis (Impedance, complex representation, examples, AC power analysis, power factor compensation)
CP2.5: Network Functions (Laplace transform, frequency response, Bode diagrams)

CP3: Operational Amplifier
CP3.1: Ideal OpAmp
CP3.2: Basic OpAmp circuits (Noninverting amplifier, inverting amplifier, summing amplifier, integrator)
CP3.3: Nonlinear OpAmp Circuits (comparators)
CP3.4: Non ideal OpAmp characteristics

The knowledge assessment process for this course includes the following assessment methods:

1. Assessment throughout the semester. In this modality, assessment is made up of two compulsory components and one optional component:

a) Work (compulsory) - Three laboratory assignments carried out in groups with weights of 5%+10%+15%. Attendance at the laboratory sessions is compulsory, otherwise the student will score 0V in their work.

b) Final Written Test (compulsory) - Individual written test taken at the same time as the exam, with a minimum mark of 8V and a weight of 70%. The maximum possible final mark for students with a mark in the Written Test below 9.5v is 10v.

c) Participation in theoretical-practical classes (optional) - Participation in theoretical-practical classes throughout the semester, specifically considering the resolution of exercises in class, can contribute up to 20% of the final grade, with the Final Written Test having a weight of 50%.


2. Assessment by Exam (100%). This method includes a written test (weighting 70%) and a practical test (weighting 30%) which cover all the material taught in the course. Assessment by exam can be carried out in the 1st season, 2nd season and Special Season.

Attendance at theoretical/practical classes is not compulsory in any form (except laboratories in the case of assessment throughout the semester).