Navigation

  • index
  • suivant |
  • précédent |
  • Documentation LINFO1121 2024-2025 »
  • Part 1 | Abstract data types, Complexity, Java Collections; Stacks, queues and linked lists

Part 1 | Abstract data types, Complexity, Java Collections; Stacks, queues and linked lists¶

  • Objectives
  • To read
  • Exercises A
    • Exercise 1.1.1
    • Exercise 1.1.2
    • Exercise 1.1.3
    • Exercise 1.1.4 (Inginious)
    • Exercise 1.1.5
    • Exercise 1.1.6
    • Exercise 1.1.7
    • Exercise 1.1.8
    • Exercise 1.1.9
    • Exercise 1.1.10 (Inginious)
  • Exercises B
    • Exercise 1.2.1 (Inginious: Circular Linked List)
    • Exercise 1.2.2 (Inginious: Implement a stack with an Array)
    • Exercise 1.2.3
    • Exercise 1.2.4 (Inginious: Functional Lists)
    • Exercise 1.2.5
    • Exercice 1.2.6
  • Complexity
    • Notation Big-Oh (\(\mathcal{O}\))
    • Notation Big-Omega (\(\Omega\))
    • Notation Big-Theta (\(\Theta\))
    • Notation Tilde (\(\mathcal{\sim}\))
    • Best case, worst case, average case
    • Amortized Comlexity
    • Frequent complexities

Sujet précédent

Organization (UCLouvain Specific)

Sujet suivant

Objectives

Recherche rapide

Navigation

  • index
  • suivant |
  • précédent |
  • Documentation LINFO1121 2024-2025 »
  • Part 1 | Abstract data types, Complexity, Java Collections; Stacks, queues and linked lists
Created using Sphinx 3.3.1.
Creative Commons License
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.