1. Introduction a. Abstract Data Type and Data Structure b. ADT Specification and Implementation 2. Linear Abstract Data Types a. Definition Linear ADT b. Stacks c. Queues.. d. Lists. 3. Algorithms I: recursion. 4. Algorithms II: Complexity a. Analysis of Algorithms b. Types of complexity c. Function Time. d. Notation Big-O. e. Worst and best cases. 5. Hierarchic Abstract Data types: Trees a. General Trees b. Binary Trees c. Tree Trasverse: preorder, inorder, postorder d. Search Binary Trees. e. Balanced BST. 6. Graphs a. Definition Graph ADT. Applications b. Implementation based on adjacency matrix. c. Implementation based on adjacency list. d. Graph trasversal: Depth-first search and breadth-first search. 7. Algorithms III: a. Divide and Conquer b. BackTracking