# Course guide

 Units SuggestedLearning Time Basic Learning Materials and Readings Assesment Activities and Practical Assignments Lab Assesments Unit 1Abstract Data Types (ADTs) 4 hours for the theoretical contents + 6 hours personal working LN-F-001.1. Guideline (PDF) LN-F-001.2. Unit slides (PDF) EP-F-001.1. Problems (PDF) EP-F-001.2. Solutions (PDF) LB-F-001. Lab Case (PDF) LB-FS-001. Solution (ZIP) Unit 2Linear ADTs: queues and stacks, simply linked lists, doubly linked lists 12 hours for the theoretical contents + 18 hours for personal working LN-F-002.1. Guideline (PDF) LN-F-002.2. Unit slides (PDF) EP-F-002.1. Problems (PDF) EP-F-002.2. Solutions (PDF) Unit 3Analysis of Algorithms 3 hours for the theoretical contents + 4 hours for personal working LN-F-003.1. Guideline (PDF) LN-F-003.2. Unit slides (PDF) EP-F-003.1. Problems (PDF) EP-F-003.2. Solutions (PDF) Unit 4Recursion 4 hours for the theoretical contents + 6 hours for the personal working LN-F-004.1. Guideline (PDF) LN-F-004.2. Unit slides (PDF) EP-F-004.1. Problems (PDF) EP-F-004.2. Solutions (PDF) Unit 5Binary search trees 12 hours for the theoretical contents + 18 hours for personal working LN-F-005.1. Guideline (PDF) LN-F-005.2. Unit slides (PDF) EP-F-005.1. Problems (PDF) EP-F-005.2. Solutions (PDF) Unit 6Graphs 8 hours for the theoretical contents + 6 hours for personal workin LN-F-006.1. Guideline (PDF) LN-F-006.2. Unit slides (PDF) EP-F-006.1. Problems (PDF) EP-F-006.2. Solutions (PDF) Unit 7Divide and conquer 3 hours for the theoretical contents + 4 hours for personal working LN-F-007.1. Guideline (PDF) LN-F-007.2. Unit slides (PDF) EP-F-007.1. Problems (PDF) EP-F-007.2. Solutions (PDF) Evaluation ET-F-001. Mid Course Exam ( PDF ). ET-FS-001 Solution ( PDF ) ET-F-002. Final Exam 1 ( PDF ). ET-FS-002 Solution ( PDF ) ET-F-003. Final Exam 2 ( PDF ). ET-FS-002 Solution ( PDF )
Citation: Bedmar, I. S. (2007, October 29). Course guide. Retrieved February 24, 2020, from OCW - UC3M Web site: http://ocw.uc3m.es/ingenieria-informatica/data-structures-and-algorithms/course-guide.