![]() |
Computing 2 - COMP2091 |
|
||||||||||||||||||||||||||||||||||||
![]()
Description Abstract data types and data structures: sequential (lists, stacks, queues), dictionaries (binary trees, hashing), priority queues (heaps), graphs and networks. Implementation of associated algorithms in C. Informal analysis of efficiency. File structures: binary formats, direct access techniques, XML. Data compression, Huffman coding. Numeric represenation and limitations. Conditional compilation, storage classes, memory management, function parameters, using profilers and debuggers. Interfacing to libraries. Introduction to multi-threading.
|