|
|||||
Disciplina asociada:Tecnologías Computacionales |
|||||
Escuela:
Ingeniería y Ciencias
|
|||||
Departamento Académico:
Computación
|
|||||
Programas académicos: |
|||||
Requisitos:No tiene. |
|||||
Equivalencia:CS4003 ; CB99102 ; CB4003 |
|||||
Intención del curso en el contexto general del plan de estudios: |
|||||
|
Es un curso básico que tiene la intención de proporcionarle al alumno los fundamentos teoréticos de la ciencia de la computación, enfatizando teoría de autómatas y lenguajes formales, computación y complejidad y análisis de algoritmos. Como resultado del aprendizaje, el alumno podrá comprender, analizar y aplicar modelos básicos y restringidos de computación. |
|||||
Objetivo general de la Unidad de Formación: |
|||||
| Comprender, analizar y aplicar los modelos más básicos y restringidos de computación, comprender, analizar y aplicar un modelo de cómputo no-determinístico; analizar y aplicar técnicas que permitan caracterizar si un algoritmo es computable y analizar problemas fuera del alcance de cualquier solución algorítmica usando la máquina de Turing, categorizar algoritmos en términos de su complejidad computacional, comparar algoritmos de ordenamiento y estructuras y algoritmos para manipular datos e identificar problemas que pueden representarse y solucionarse empleando algoritmos para grafos. | |||||
Técnica didáctica sugerida: |
|||||
| No especificado | |||||
Bibliografía sugerida: |
|||||
|
LIBROS DE TEXTO: * Lewis, Harry R., Elements of the theory of computation, 2nd. Edition, Upper Saddle River, N. J.: Prentice-Hall, 1988, $70.00, 0132624788 : HRD * Baase, Sara, Computer algorithms: Introduction to design and analysis, 3rd. Edition, Sin información : Reading, MA.: Addison-Wesley, 2000, eng, 0201612445 * Thomas H. Cormen ... [et al.], Introduction to algorithms, México : Cambridge, Mass.: MIT Press, 2001, español, 0262531968 LIBROS DE CONSULTA: * Knuth, Donald Ervin, The art of computer programming, Upper Saddle River, N. J.: Addison-Wesley, 2005, 0201853922 (v. 1, fasc. 1), 0201853930 (v. 4, fasc. 2), 0201853949 (v. 4, fasc. 3), 0321335708 (v. 4, fasc. 4), 968162288X (tomo 3), 9681627822 (tomo 3, encuadernada), 9780201853933 (v. 4, fasc. 2), 9780201853940 (v. 4, fasc. 3), 9780321335708 (v. 4, fasc. 4), 9780321534965 (v. 4, fasc. 0) * Manber, Udi, Introduction to algorithms: A creative approach, Massachusetts : Reading, Mass.: Addison-Wesley, 1989, eng, 0201120372 * Aho, Alfred V., Data structures and algorithms, Massachusetts : Reading, Mass.: Addison-Wesley, 1983, eng, 8211596 * Aho, Alfred V., The design and analysis of computer algorithms, Reading, Mass.: Addison-Wesley, 1974, * Sedgewick, Robert, Algorithms, 2nd. Edition, Reading, Mass.: Addison-Wesley, 1988, $34.95, 0201066734 : * Brassard, Gilles, Algorithmics: Theory and practice, New Jersey : englewood Cliffs, N. J.: Prentice Hall, 1988, eng, 0130232432 * Purdom, Paul Walton, The analysis of algorithms, New York : New York, N. Y.: Holt, Rinehart and Winston, 1985, eng, 0030720443 |
|||||
Perfil del Profesor: |
|||||
|
(110101)Doctorado en Ciencias Computacionales/de Información ; (110701)Doctorado en Ciencias Computacionales ; (141001)Doctorado en Ingeniería Eléctrica/Electrónica y Comunicaciones ; (110102)Doctorado en Inteligencia Artificial /Robótica CIP: 110101, 110701, 141001, 110102 |
|||||
|
|||||
Discipline:Computer Technologies |
|||||
School:
Engineering and Sciences
|
|||||
Academic Department:
Computing
|
|||||
Programs: |
|||||
Prerequisites:None. |
|||||
Equivalences:CS4003 ; CB99102 ; CB4003 |
|||||
Course intention within the general study plan context: |
|||||
|
The aim of this basic course is to provide the student with the theoretical foundations of computer science, emphasizing automata theory, formal languages, computability and complexity, and algorithm analysis. Learning outcome: the student will be able to comprehend, analyze, and apply basic and restricted models of computation. |
|||||
Course objective: |
|||||
| Understand, analyze and apply the most basic and restricted computing models; understand, analyze and apply a non-deterministic computing model; analyze and apply techniques that allow one to determine if an algorithm is computable, and analyze problems outside the reach of algorithmic solutions, using Turing's machine; categorize algorithms in terms of their computing complexity; compare sort and data structure algorithms as well as algorithms for data manipulation, and identify problems that can be formulated and solved by using graph algorithms. | |||||
Teaching and learning tecniques: |
|||||
| Not Specified | |||||
Suggested Bibliography: |
|||||
|
TEXT BOOKS: * Lewis, Harry R., Elements of the theory of computation, 2nd. Edition, Upper Saddle River, N. J.: Prentice-Hall, 1988, $70.00, 0132624788 : HRD * Baase, Sara, Computer algorithms: Introduction to design and analysis, 3rd. Edition, Sin información : Reading, MA.: Addison-Wesley, 2000, eng, 0201612445 * Thomas H. Cormen ... [et al.], Introduction to algorithms, México : Cambridge, Mass.: MIT Press, 2001, español, 0262531968 BOOKS FOR CONSULTATION: * Knuth, Donald Ervin, The art of computer programming, Upper Saddle River, N. J.: Addison-Wesley, 2005, 0201853922 (v. 1, fasc. 1), 0201853930 (v. 4, fasc. 2), 0201853949 (v. 4, fasc. 3), 0321335708 (v. 4, fasc. 4), 968162288X (tomo 3), 9681627822 (tomo 3, encuadernada), 9780201853933 (v. 4, fasc. 2), 9780201853940 (v. 4, fasc. 3), 9780321335708 (v. 4, fasc. 4), 9780321534965 (v. 4, fasc. 0) * Manber, Udi, Introduction to algorithms: A creative approach, Massachusetts : Reading, Mass.: Addison-Wesley, 1989, eng, 0201120372 * Aho, Alfred V., Data structures and algorithms, Massachusetts : Reading, Mass.: Addison-Wesley, 1983, eng, 8211596 * Aho, Alfred V., The design and analysis of computer algorithms, Reading, Mass.: Addison-Wesley, 1974, * Sedgewick, Robert, Algorithms, 2nd. Edition, Reading, Mass.: Addison-Wesley, 1988, $34.95, 0201066734 : * Brassard, Gilles, Algorithmics: Theory and practice, New Jersey : englewood Cliffs, N. J.: Prentice Hall, 1988, eng, 0130232432 * Purdom, Paul Walton, The analysis of algorithms, New York : New York, N. Y.: Holt, Rinehart and Winston, 1985, eng, 0030720443 |
|||||
Academic credentials required to teach the course: |
|||||
|
(110101)Doctoral Degree in Computer/Information Sciences and (110701)Doctoral Degree in Computational Sciences and (141001)Doctoral Degree in Electrical Engineering/ Electronics and Communications and (110102)Doctoral Degree in Artificial Intelligence/Robotics CIP: 110101, 110701, 141001, 110102 |
|||||
