This site uses only proprietary and third party technical cookies. By continuing to browse the site you are agreeing to our use of cookies. I agree I want to find out more
Browse the Department site:
Browse the Teaching site:

Programme of Course "Matematica Discreta I"



Type of course unit:

Bachelor Degree in Computer Science curriculum General: Compulsory

Level of course unit:

Undergraduate Degrees


2nd semester

Number of credits:

Bachelor Degree in Computer Science: 6 (workload 150 hours)


1. Course Objectives

The goal of this course is to expose the main concrete techniques in linear algebra (matrices, systems, determinants, vector spaces and linear maps) and to show the first strategies in abstract algebra.

2. Course Contents and learning outcomes (Dublin Descriptors)

Topics of the course include:

  • Sets: functions, equivalence relations, products, elementary combinatorics.
  • Permutations.
  • Groups: subgroups, quotients, isomporphism theorems, factor groups, permutation groups, cyclic groups.
  • Arithmetic: divisibility theory in the ring of integers and of polinomials over a field.
  • Congruences. Chinese remainder theorem.
  • Rings: subrings, ideals, quotients, isomorphism theorem, ring of polynomials, domains, euclidean rings, PID, UFD.
  • Fields: simple field extensions, finite fields.
  • Matrices and systems of linear equations: Gauss reduction, determinants.
  • Vectors, vector spaces, independence, bases.
  • inner product, cross product.
  • Eigenvalues, eigenvectors. Diagonalization and canonical forms of matrices.
  • Application: systems of differential equations.

On successful completion of this course, the student should

  • being aware of the main structures in Linear Algebra and Abstract Algebra.

  • demonstrate skill in mathematical reasoning, manipulation and calculation, demonstrate capacity for finding rigorous proofs of small problems; demonstrate skill in mathematical reasoning, manipulation and calculation by synthesizing geometric concepts into algebraic, functional, and problem-solving activities; demonstrate capacity to deduce properties of, and relationships between, figures from given assumptions and from using transformations.

3. Course Prerequisites

Set Theory (language of set theory, the notion of function, graphs of fundamental functions, concept of sufficient and necessary condition), Numerical Structures (natural numbers, prime numbers, numerical fractions, rational numbers, basics of real numbers, inequalities, absolute value, powers and roots); Elementary algebra ( polynomials and operations on polynomials, identity, first- and second-degree equations).

4. Teaching methods and language

Lectures and exercises


Reference textbooks

  • W.K. Nicholson, Algebra lineare. McGraw Hill.
  • B. Scimemi, Algebretta.

5. Assessment Methods

Written exam and oral discussion of the written exam.

Course information last updated on: 09 aprile 2017, 12:27