_____________________________________________________________________________________




1 week
Subjects Suggested Learning Time Class Material and BIbliographic References
 Learning Activities
 Homeworks
Unit 1

Algorithm basic notions.

Complexity Measurement

 1 week

LN1. Complexity (PDF)

Required Readings

 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

LN1. Complexity (PDF)

Required Readings

 Review the concepts on best, worst and average cases First Worksheet : do homeworks on asymptotic complexity
Unit  2
Recursion		 1 week

LN2. Recursivity (PDF)

Required Readings

 When to use the recursion. Examples. Recursion vs. Iteration. First Worksheet : Exercises on recursion
Unit  3

Linear Abstract Data Types

 4 week

LN3. Lists, Stacks and Queues (PDF)

Required Readings

 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 LN4. General Trees (PDF)
Required Readings
 Basic Concepts Second worksheet : Exercises on basic concepts of trees
Unit  4

Bynary Trees

 1 week LN5. Binary Trees (PDF)
Required Readings
 Variants of binary trees

Second worksheet : Exercises on binary trees
Unit  4

Bynary Search Trees

 1 week LN6. Binary Search Trees (PDF)
Required Readings
 Introduction to the binary search trees

Second worksheet : Exercises on binary search trees
 Unit  4

AVL Trees

 1 week LN7. AVL Trees (PDF)
Required Readings
  Introduction to the AVL trees Second worksheet : Exercises on AVL trees
Last modified: Tuesday, 14 December 2021, 2:18 PM