linked files is a linked list: in every block, it stores the location of the next block; we don’t store files contiguously. We simply store a part of the file in a block, and a pointer to wherever the next block where the file is located is.

this solves the contiguous allocation’s fragmentation problem.

problems

• massive seek time to get all the blocks for a given file: data scattered
• random access of files (“find the middle”) is hard: can’t easily jump to an arbitrary location; we had to read the file from the start

https://www.reddit.com/r/emacs/comments/c22ff1/gtk_4_support_for_key_themes_does_not_affect/

https://planet.kde.org/david-edmundson-2023-03-22-fixing-wayland-xwayland-screen-casting/

• Using P2P to trade stocks in a darkpool
• Sweep across LiquidNet and send normall if not needed

A list is an ordered collection of \(n\) elements.

requirements

• as list length cannot be negative
• list length cannot be \(\infty\)
• repetition matters
• order matters

additional info

• two lists are equal IFF they have
  • same \(n\)
  • same elements
  • same order
• they are different from sets because
  • order matters
  • (therefore, because in/out is no longer a binary) number of entries of the same object matters
  • length is finite