Navigation

  • index
  • suivant |
  • Documentation LINFO1121 2024-2025 »
  • LINFO1121: Data Structures and Algorithms

LINFO1121: Data Structures and Algorithms¶

  • 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

Sujet suivant

Introduction

Recherche rapide

Navigation

  • index
  • suivant |
  • Documentation LINFO1121 2024-2025 »
  • LINFO1121: Data Structures and Algorithms
Created using Sphinx 3.3.1.
Creative Commons License
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.