|
Learning outcomes |
Planning, definition and implementation of dynamic data structures. Study of algorithms to assess and search over dynamic structures, both sequential, binary and n-ary.
- Identification of requisites in terms of data structures, for a computational system.
- Planning of composed data structures
- Implementation of algorithms to assess, search and sort dynamic data structures.
- Optimization of structures and respective algorithms, in terms of the temporal and spatial computational cost.
|
|
Syllabus |
Introduction. Dynamic allocation of resources. Pointers. Sequential data structures: lists, stacks and queues, jump lists. non-sequential data-structures: hash tables, trees, avulse, n-ary trees, graphs.
|
|
Main Bibliography |
main
"Introduction to Algorithms (2nd edition)", Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein, The MIT Press, 2001.
"Algorithms in C, Parts 1-5 (Bundle): Fundamentals, Data Structures, Sorting, Searching, and Graph Algorithms", R. Sedgewick, Addison-Wesley Professional, 3rd Edition, 2001.
Secundary
"Data Structures in ANSI C", S. Sengupta, Academic, 1991.
"Mastering algorithms in C", Kyle Loudon, O'Reilly, 1999.
"Programs and Data Structures in C", 2nd edition, L. Ammeraal, John Wiley & Sons, 1996.
"Estruturas de Dados e Algoritmos", Bruno R. Preiss, Elsevier, 2001.
"Data Structures and Algorithm Analysis in C++", 2nd ed., Mark Allen Weiss, Addison-Wesley, 1999.
|