CS-A1140 DSA
  • Round 1: Recap and basic data structures
  • Round 2: Sorting
  • Round 3: Trees
  • Round 4: Binary Search Trees
  • Round 5: Hashing
  • Round 6: Dynamic programming and greedy algorithms
  • Round 7: Graphs, part I
  • Round 8: Graphs, part II
  • Round 9: Multithreaded algorithms
  • Round 10: Computationally more difficult problems
  • External links
    • Aalto courses
    • Scala
    • Some books on algorithms and related topics
CS-A1140 DSA
  • »
  • External links

External links¶

Aalto courses¶

  • ​ CS-A1120 Programming 2

  • ​ Programming Parallel Computers

  • ​ Principles of Algorithmic Techniques

  • ​ Competitive Programming

Scala¶

  • ​ Scala documentation

  • ​ Scala 2 API

  • ​ Scala 2 book

  • ​ Scala 3 API

  • ​ Scala 3 book

  • ​ Scala collections performance characteristics

Some books on algorithms and related topics¶

  • ​ Introduction to Algorithms, 3rd ed. (online via Aalto lib)

  • ​ Tietorakenteet ja algoritmit (in Finnish) by Antti Laaksonen is the Data Structures and Algorithms course book used at University of Helsinki

  • ​ Competitive Programmer’s Handbook by Antti Laaksonen

  • ​ Computational Complexity: A Modern Approach (internet draft) by Sanjeev Arora and Boaz Barak

  • ​ Mining of Massive Datasets by Jure Leskovec, Anand Rajaraman, and Jeff Ullman

Previous

© Copyright 2016-2021, Tommi Junttila.

Built with Sphinx using a theme provided by Read the Docs.