##### Secciones
Usted está aquí: Course Guide

# Course Guide

##### Acciones de Documento
Autores: Isabel Segura Bedmar, Harith Aljumaily, Julián Moreno Schneider, Juan Perea, Nathan D. Ryan

 Subjects Suggested Learning Time Class Material and BIbliographic References Learning Activities Homeworks Unit 1: Algorithm basic notions Complexity Measurement 1 week LN-F-001. ( pdf ) RD-B-001 RD-B-002 Review introductory concepts and examples of pseudocode presented during the session. First Worksheet : do homeworks on pseudocode and review the concepts on asymptotic complexity. Unit 1: Case Analysis: best, worst and average cases 1 week LN-F-001. ( pdf ) RD-B-001 RD-B-002 Review the concepts on best, worst and average cases First Worksheet : do homeworks on asymptotic complexity. Unit 2: Recursion 1 week LN-F-002. ( pdf ) RD-B-001 RD-B-002 When to use the recursion. Examples. Recursion vs. Iteration. First Worksheet : Exercises on recursion Unit 3: Linear Abstract Data Types 4 weeks LN-F-003. ( pdf ) RD-B-001 RD-B-002 Introduction to the Abstract Data Types, Concepts, Data types, abstract data types and data structure.. Examples of TAD. Statics vs Dinamics. Simpled lists, stacks, queues, First Worksheet : Exercises on Simpled lists, stacks, queues. Do practical case study. Unit 4: Hierarchic Abstract Data types 1 week LN-F-004. ( pdf ) RD-B-001 RD-B-002 Basic Concepts Second worksheet : Exercises on basic concepts of trees. Unit 4: Binary Trees 1 week LN-F-005. ( pdf ) RD-B-001 RD-B-002 Variants of binary trees. Second worksheet : Exercises on binary trees. Unit 4: Binary Search Trees. 1 week LN-F-006. ( pdf ) RD-B-001 RD-B-002 Introduction to the binary search trees Second worksheet : Exercises on binary search trees. Unit 4: AVL Trees 1 week LN-F-007. ( pdf ) RD-B-001 RD-B-002 Introduction to the AVL trees Second worksheet : Exercises on AVL trees.
Reutilizar Curso
Descargar este curso