 |  | |  |
| INFO0006-1

 | Information Structure

| |
| 
| |
| Duration : | 30h Th, 30h Pr | |
|  | | |
| Credits/ECTS : |
| |
|  | | |
| Holder(s) : | Tri‑An Banh | |
|  | | |
|  | | |
| Course contents :
| Algorithms and Data Structures - Strings - Lists, Stacks and Queues - Vectors and Arrays - Trees and associated Structures - Graphs - Data Compression. | |
|  | | |
| Course objective :
| Presentation of Data Structures and Algorithms used in Computer science to model and solve problems. Clever choices usually lead to elegant and effective problem solving. | |
|  | | |
| Prerequisites :
| Knowledge of a high-level and a low-level programming languages | |
|  | | |
| Workshops :
| Implementation of an effective program in Pattern Matching. In-depth understanding of one (or several) subject(s) chosen by the student and summarizing in a report. | |
|  | | |
| Organization :
| 2nd semester - 30 h + 30 h | |
|  | | |
| Written notes :
|
- Reference books :
The Art of computer programming. KNUTH, Addison Wesley. Vol. 1, 1997; vol. 2, 1998; vol. 3, 1999.
Algorithms and Data Structures. Design Correctness, Analysis. Jeffrey H. Kinkston. Addison-Wesley, 1998
Data Compression, The complete Reference. D. Salomon. Springer 2000.
- Mandatory readings : Course slides + chosen paragraphs of reference books
- Useful reading : reference books.
| |
|  | | |
| Assessment :
| Oral exams in 1st and 2nd sessions (may-june and august-september) | |
|  | | |
| Contacts :
| Professor : Tri An BANH; tri-an.banh@ulg.ac.be Secretary : Claire MONTI; claire.monti@ulg.ac.be Assistants : Renaud DUMONT; renaud.dumont@ulg.ac.be + Hubert DEPIREUX; hdepireux@ulg.ac.be | |
|  | | |