Introduction to Data Structures
|
|
Degree:
|
Computer Engineering
|
|
Syllabus:
|
1992 (modified 1998)
|
|
Subject´s web page:
|
http://www.ii.uam.es/~edi1/intro.htm
|
|
Stage/Year/Semester:
|
First Stage / First Year / Second Semester
|
|
Kind of subject:
|
Compulsory
|
|
Credits:
|
7,5
|
|
Subject´s code:
|
10887
|
|
Aim:
|
Theorical concepts to achieve:
Basic concepts on software development, abstract data types, and data structures, Stacks, Queues, Lists, Binary Trees and its applications. Recursion.
Practical knowledge to achieve:
Medium level in C programming.
|
|
Recommendations:
|
To make the most of the course, it is highly recommended to have passed MTP I.
It is essential to assist to every theorical and practical class.
See the subject´s web page for more details
|
|
Teaching Methodology:
|
- |
|
Program:
|
- Basic concepts on SW development
- Abstract Data Types
- Stacks
- Queues
- Lists
- Binary trees
- Recursion
|
|
Guiding Bibliography:
|
- Wirth Datos + Algoritmos = Programas, Ed. Del Castillo.
- Weiss, Data Structures and algorithm analysis in C, Benjamin--Cummings.
- Kernighan, Ritchie, The C programming language, Prentice hall.
- Bibliografía complementaria
- Cormen, Leiserson, Rivest, Introduction to algorithms, The MIT Press--Mc Graw Hill.
- Aho, Hopcroft, Ullman, Data Structures and Algorithms, Addison-Wesley.
- Kernighan, Pike, The practice of programming, Addison Wesley.
Library Catalogue - Recommended bibliography
|
| Theory coordinator: |
Rosa María Carro
|
| Practice work coordinator: |
Eduardo Serrano
|
| Teaching staff: |
Theory:
Practice work:
|
| Evaluation: |
|
|
|