LINFO1121: Data Structures and Algorithms

Welcome to the course website for LINFO1121: Data Structures and Algorithms, taught by Prof. Pierre Schaus at UCLouvain.

Official Reference Book 4th Edition Sedgewick & Wayne

Algorithms (4th Edition)

By Robert Sedgewick & Kevin Wayne — Addison-Wesley

The foundational textbook for LINFO1121. Reading the designated chapters is essential for the flipped classroom format and lab exercises.

🏛️ BST Library Rental: ~20 copies available for student rental in Louvain-la-Neuve.

🌐 Book Companion Website 📑 Online Cheatsheet

• Introduction
  • Java Resources
  • Open-Source Course Material
  • Authors
• Organization (UCLouvain Specific)
  • Pedagogy
  • Agenda
  • Grading
  • Contact and Communication
• Part 1 | Abstract data types, Complexity, Java Collections; Stacks, queues and linked lists
  • Objectives
  • To read
  • Exercises A
  • Exercises B
  • Complexity
• Part 2 | Sorting and Properties of Sorted Sets
  • Objectives
  • To read
  • Exercises A
  • Exercises B
• Part 3 | Search Trees
  • Objectives
  • To read
  • Exercises A
  • Exercises B
• Part 4 | Maps: hash tables and other implementations, Strings: Trie and sub-string search algo
  • Objectives
  • To read
  • Exercises A
  • Exercises B
• Part 5 | Priority queues, union-find and data compression
  • Objectives
  • To read
  • Exercises A
  • Exercises B
• Part 6 | Graphs: paths, spanning trees, and shortest paths
  • Objectives
  • To read
  • Exercises A
  • Exercises B
• Exam Training
  • Practice Exam
  • Competitions
  • Review Session & QCM