Eines personals
Esteu aquí: Inici Enginyeria i Arquitectura (17) Algorítmica i Complexitat

102011 - Algorítmica i Complexitat, 2016

Accions del document
  • RSS Feed
  • Imprimeix-ho
  • Content View
  • Bookmarks

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.

algorithm.jpeg

Algorítmica i Complexitat

Jordi Planes
Aitor Corchero
Dídac Sementé

Grau en Enginyeria Informàtica - Doble Titulació: Grau en Enginyeria Informàtica i Grau en ADE

Universitat de Lleida

Image by Jared Tarbell Attribution Noncommercial No Derivative Works

Course Description

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.

Copyright 2010, Autors i col·laboradors. Cite/attribute Resource. Jordi, P., Aitor, C., Dídac, S. (2016, September 06). Algorítmica i Complexitat. Retrieved September 25, 2017, from UdL OpenCourseWare Web site: http://ocw.udl.cat/enginyeria-i-arquitectura/algoritmica-i-complexitat. This work is licensed under a Creative Commons License Creative Commons License