|
|||||
Disciplina asociada:Ciencias Computacionales |
|||||
Escuela:
Ingeniería y Ciencias
|
|||||
Departamento Académico:
Computación
|
|||||
Programas académicos: |
|||||
Requisitos:No tiene. |
|||||
Equivalencia:No tiene. |
|||||
Intención del curso en el contexto general del plan de estudios: |
|||||
|
Es un curso básico en el área de ciencias computacionales que tiene la intención que el alumno conozca los principios de computación desde la perspectiva del diseño eficiente de algoritmos y su análisis de complejidad computacional para diferentes tipos de problemas. El curso integra diferentes conceptos y ejemplos que justifican el uso del análisis de complejidad para que el alumno integre esa perspectiva cuando desarrolla algoritmos o software para resolver diferentes problemáticas. El curso requiere conocimientos básicos de matemáticas discretas, cálculo integral y programación. Como resultado del aprendizaje el estudiante conocerá los elementos para realizar el análisis de complejidad, diferentes técnicas para diseñar algoritmos eficientes, y la aplicación de las metodologías para diferentes problemas como ordenamiento, grafos, multiplicación de matrices, problemas NP, y algoritmos paralelos. |
|||||
Objetivo general de la Unidad de Formación: |
|||||
|
Al finalizar el curso el alumno será capaz de:
- Realizar un análisis efectivo de la complejidad computacional de diferentes algoritmos. - Utilizar diferentes técnicas para el diseño de algoritmos eficientes. - Identificar diferentes tipos de problemas computacionales para determinar su dificultad al resolverlos. - Conocer las características de Problemas NP y diferentes algoritmos heurísticos para solucionarlos. - Diseñar algoritmos eficientes para resolver problemas computacionales en paralelo. |
|||||
Técnica didáctica sugerida: |
|||||
| No especificado | |||||
Bibliografía sugerida: |
|||||
|
LIBROS DE TEXTO: * , Introduction to algorithms / Thomas H. Cormen ... [et al.], 3rd ed., Cambridge, MA : The MIT Press, 2009., , 9780262033848 (encuadernado : papel alcalino), 9780262533058 (r©ðstica : papel alcalino) * Neapolitan, Richard E., Foundations of algorithms / Richard Neapoltian and Kumarss Naimipour., 4th ed., Sudbury, Mass. : Jones and Bartlett Publishers, c2011., , 0763782505 (casebound), 9780763782504 (casebound) * Baase, Sara., Computer algorithms : introduction to design and analysis., 3rd ed. /Sara Baase, Allen Van Gelder., Reading, Mass. : Addison-Wesley Longman, c2000., , 0201612445 LIBROS DE CONSULTA: * * A.V. Aho, H. E. Hopcroft and J. D. Ullman, The Design and Analysis of computer algorithms, Addison Wesley, * Garey, Michael R., Computers and intractability : a guide to the theory of NP-completeness / Michael R. Garey, David S. Johnson., , San Francisco : W.H. Freeman, c1979., , 0716710447., 0716710455, pbk * Papadimitriou, Christos H., Computational complexity / Christos H. Papadimitriou., , Reading, Mass. : Addison-Wesley, c1994., , 0020153082, 0201530821 (hard cover) * Levitin, Anany., Introduction to the design & analysis of algorithms / Anany Levitin., 2nd ed., Boston, MA : Pearson Addison-Wesley, c2007., , 0321358287 (papel alcalino) * Goodrich, Michael T., Algorithm design : foundations, analysis, and Internet examples / Michael T. Goodrich, Roberto Tamassia., , New York : Wiley, c2002., , 0471383651 (acid-free paper) |
|||||
Perfil del Profesor: |
|||||
|
(110701)Doctorado en Ciencias Computacionales CIP: 110701 |
|||||
|
|||||
Discipline:Computer Science |
|||||
School:
Engineering and Sciences
|
|||||
Academic Department:
Computing
|
|||||
Programs: |
|||||
Prerequisites:None. |
|||||
Equivalences:None. |
|||||
Course intention within the general study plan context: |
|||||
|
This is a basic course in the área of computer science which aims at teaching the student the fundamentals of computing from the perspective of the design of algorithms and their complexity analysis, when considering various computational problems. The course integrates different concepts and examples that justify the usage of computational complexity in order that the student includes his own view when developing algorithms or software for solving problems. The course requires basic background in discrete mathematics, integral calculus and programming skills. The course learning outcomes include tools to perform the computational complexity of algorithms, various techniques for designing efficient algorithms, and the application of those techniques for a variety of problems such as sorting, graph, matrix multiplication, NP problems, and parallel algorithms. |
|||||
Course objective: |
|||||
|
After completing the course, students will be able to:
- Perform an effective analysis of the computational complexity of a variety of algorithms. - Use various techniques for the design of efficient algorithms. - Identify different types of computational problems to establish their complexity. - Identify the features of NP problems and develop a set of heuristics to solve them. - Design efficient parallel algorithms to solve computational problems. |
|||||
Teaching and learning tecnique: |
|||||
| Not Specified | |||||
Suggested Bibliography: |
|||||
|
TEXT BOOKS: * , Introduction to algorithms / Thomas H. Cormen ... [et al.], 3rd ed., Cambridge, MA : The MIT Press, 2009., , 9780262033848 (encuadernado : papel alcalino), 9780262533058 (r©ðstica : papel alcalino) * Neapolitan, Richard E., Foundations of algorithms / Richard Neapoltian and Kumarss Naimipour., 4th ed., Sudbury, Mass. : Jones and Bartlett Publishers, c2011., , 0763782505 (casebound), 9780763782504 (casebound) * Baase, Sara., Computer algorithms : introduction to design and analysis., 3rd ed. /Sara Baase, Allen Van Gelder., Reading, Mass. : Addison-Wesley Longman, c2000., , 0201612445 BOOKS FOR CONSULTATION: * * A.V. Aho, H. E. Hopcroft and J. D. Ullman, The Design and Analysis of computer algorithms, Addison Wesley, * Garey, Michael R., Computers and intractability : a guide to the theory of NP-completeness / Michael R. Garey, David S. Johnson., , San Francisco : W.H. Freeman, c1979., , 0716710447., 0716710455, pbk * Papadimitriou, Christos H., Computational complexity / Christos H. Papadimitriou., , Reading, Mass. : Addison-Wesley, c1994., , 0020153082, 0201530821 (hard cover) * Levitin, Anany., Introduction to the design & analysis of algorithms / Anany Levitin., 2nd ed., Boston, MA : Pearson Addison-Wesley, c2007., , 0321358287 (papel alcalino) * Goodrich, Michael T., Algorithm design : foundations, analysis, and Internet examples / Michael T. Goodrich, Roberto Tamassia., , New York : Wiley, c2002., , 0471383651 (acid-free paper) |
|||||
Academic credentials required to teach the course: |
|||||
|
(110701)Doctoral Degree in Computational Sciences CIP: 110701 |
|||||
