Algorítmica i Complexitat, 2016

 

The objectives of the course are: Knowing and applying the basic algorithmic techniques of Computer Science to solve combinatorial problems, analyzing the suitability and complexity of the proposed algorithms. Knowing, designing and efficiently utilizing the types and data structures more suitable to solve a problem. The programming language used is python with the aim of showing the basic fundamentals for the design and implementation of an efficient algorithm. Grau en Enginyeria Informàtica. Doble Titulació: Grau en Enginyeria Informàtica i Grau en ADE. Professors: Jordi Planes, Aitor Corchero, Dídac Sementé.

Recent Submissions

  • Mòdul 1. Contents 

    Planes Cid, Jordi; Corchero Rodríguez, Aitor; Alsinet, Teresa (2016)

  • Mòdul 2. Problems 

    Planes Cid, Jordi; Corchero Rodríguez, Aitor; Sementé Fernández, Dídac (2016)
    We present a series of problems with increasing difficulty.

  • Mòdul 3. Questionnaires 

    Planes Cid, Jordi; Corchero Rodríguez, Aitor; Sementé Fernández, Dídac (2016)
    This section contains a series of questionnaires with questions about the subject.

  • Presentation Algorítmica i Complexitat 

    Planes Cid, Jordi; Corchero Rodríguez, Aitor; Sementé Fernández, Dídac (2016)
    The course contents are divided into four teaching units: 1. The first aims to study the formal characterization of algorithms. We study how to formally specify with postconditions and preconditions and analyze the ...