 | |
| INFO0902-1 | Data structures and algorithms
 |
|
| Duration : | 30h Th, 30h Pr |
|
| Credits/ECTS : |
| Bachelor in engineering sciences, civil engineer orientation (Bachelor in engineering sciences, civil engineer orientation), 2nd year | | Second semester | | 5 |
|
| Bachelor in computer sciences, 1st year | | Toute l'année | | 6 |
|
| Master in Computer Engineering, in-depth approach, 1st year | | Toute l'année | | 5 |
|
| Master in Computer Engineering, specialized approach, 1st year | | Toute l'année | | 5 |
|
| Master in Bio-informatics and Modelling, Research focus, 1st year | | Second semester | | 6 |
|
| Master in Bio-informatics and Modelling, Research focus, 1st year | | Toute l'année | | 6 |
|
| Master in Mathematical Sciences, in-depth approach, 1st year | | Toute l'année | | 8 |
|
| Master in Mathematical Sciences, didactic approach, 1st year | | Toute l'année | | 8 |
|
| Master in Mathematical Sciences, professional focus in management, 1st year | | Toute l'année | | 8 |
|
| Master in Mathematical Sciences, professional focus in computer science, 1st year | | Toute l'année | | 8 |
|
| Master in Mathematical Sciences, professional focus in computer science, 2nd year | | Toute l'année | | 6 |
|
| Master in Mathematical Sciences, specialized approach, 1st year | | Toute l'année | | 8 |
|
| Master in Mathematical Sciences | | Toute l'année | | 8 |
|
|
|
| Holder(s) : | N... |
|
| Substitute(s) : | Sébastien Collette |
|
| Language : | French language |
|
| Course contents : | Solving complex problems involves their decomposition into standard subproblems for which efficient and well-studied algorithms and data structures exist. This course is an introduction to the most important data structures and associated algorithms. |
|
| Course objective : | The goal of this class is to learn the basics of algorithmics. In particular, we will study the use of problem-solving paradigms (divide-and-conquer, greedy, dynamic programming, exhaustive search) and the most used datastructures (binary search trees, hash tables, heaps, ...). Our approach will be theoretical: for each problem, we will systematically determine upper and lower bounds on the running times, and show the asymptotic behavior of our algorithms. |
|
| Prerequisites : | Basic knowledge of algorithms and programming, in particular with the C programming language. |
|
| Workshops : | The theoretical class will be complemented by assignments, which will consist in analysing a problem, finding the best algorithm and datastructures to solve it, and to implement the solution in C. |
|
| Organization : | 2nd quadrimester, Thursdays 9-13h. 3 assignments. |
|
| Written notes : | on the instructor's web page. Slides, solutions to problems, Java applets to describe the most complicated algorithms and data structures. |
|
| Assessment : | Written exam, 3 assignments. |
|
| Contacts : | Instructor : S. Collette
Teaching assistant : Gérard Dethier, tél. 04/366.27.74, e-mail G.Dethier@ulg.ac.be(Renaud.Detry@student.ulg.ac.be)(Renaud.Detry@student.ulg.ac.be) |
|
|
|
| Items online : |
|
| Online notes |
| Available on the instructor's web page. |
|
|
|
| |
