2nd Bachelor in Computing and Systems : Network and Telecommunications
Applied Mathematics and Statistics
< Back
ECTS Credits | 2 |
---|---|
Number of Hours (h/year) | 30 |
Teaching staff | BARSICS, Joseph |
Course Unit | Compulsory |
Term | Quad. 1 |
Code | TECH-INS00019/2 |
Prerequisite | TECH-INS00023/1, TECH-INS00019/1, TECH-INS00002/1, TECH-INS00017/1, TECH-INS00006/1. |
---|---|
Aims and Objectives | Binary trees polyvalence – Up-to-date Indexing structures – Graphs and operational research. |
Description | Binary Trees: equivalence with any tree; isomorphism between definitions and algorithms; height rebalancing;functionnal programming, introduction to compiling : evaluating boolean, arithmetic and mixed expressions. B-Trees: complete management algorithms. Graphs: matrix and dynamic representations; path existence; Warshall algorithm, adjacency lists of successors and predecessors; topological levels and Bellman algorithm; connex components; graphs exploring (detecting circuits; optimisation; Eulerian and Hamiltonian paths); Sedgewick-Vitter, Floyd-Warshall, and Dijkstra algorithms. Elementary statistics. Histograms use into image processing. |
Bibliography | Méthodes de Programmation ; B. Meyer et C. Baudoin ; Éditions Eyrolles, Paris, 1984 ; ISBN 0399-4198. Compilers : Principles, Techniques and Tools ; A.V. Aho, R. Sethi et J.D. Ullman ; Addison-Wesley 1986 ; ISBN 0-201-10194-7. Algorithmes de Graphes ; C. Prins ; Éditions Eyrolles, 1994 ; ISBN 2-212-09020-X. Remote Sensing Digital Image Analysis ; J.A. Richards ; Springer-Verlag 1994 ; ISBN 3-540-16007-8 |
Teaching and Learning Methods | Lectures Lectures in amphitheatres. Exercises regularly proposed to students for homework. |
Assessment Methods | Written examinations In written examination at the end of the first semester (January). |
Notes | In part |
Language | French English |
The information contained herein is intended for informational purposes only. The Higher Education Institution disclaims any responsibility with regard to its content.