<urlset xmlns="http://www.sitemaps.org/schemas/sitemap/0.9" xmlns:xhtml="http://www.w3.org/1999/xhtml"><url>
    <loc>https://obsidian-notes-a34915.is.horse/gpr/case-study</loc>
    <lastmod>2026-06-18T16:27:33.367Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/gpr/coursework-1</loc>
    <lastmod>2026-06-18T16:27:33.379Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/gpr/customer-profiles</loc>
    <lastmod>2026-06-18T16:27:33.383Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/gpr/doc-structure</loc>
    <lastmod>2026-06-18T16:27:33.387Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/gpr/group-contract</loc>
    <lastmod>2026-06-18T16:27:33.367Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/gpr/lgt/w4</loc>
    <lastmod>2026-06-18T16:27:33.391Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/gpr/lgt/w5</loc>
    <lastmod>2026-06-18T16:27:33.387Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/gpr/lit-review</loc>
    <lastmod>2026-06-18T16:27:33.383Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/gpr/meeting-notes/2024-10-14-14-30-meeting-notes</loc>
    <lastmod>2026-06-18T16:27:33.375Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/gpr/meeting-notes/2024-10-21-14-30-meeting-notes</loc>
    <lastmod>2026-06-18T16:27:33.375Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/gpr/meeting-notes/2024-11-11-15-00-meeting-notes</loc>
    <lastmod>2026-06-18T16:27:33.379Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/gpr/meeting-notes/2024-11-20-15-00-meeting-notes</loc>
    <lastmod>2026-06-18T16:27:33.371Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/gpr/meeting-notes/2024-11-22-12-00-meeting-notes-(faculty)</loc>
    <lastmod>2026-06-18T16:27:33.379Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/gpr/meeting-notes/2024-11-27-15-30-meeting-notes-(council)</loc>
    <lastmod>2026-06-18T16:27:33.375Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/gpr/meeting-notes/2024-12-04-14-30-meeting-notes-(council)</loc>
    <lastmod>2026-06-18T16:27:33.371Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/gpr/stuff-for-trello</loc>
    <lastmod>2026-06-18T16:27:33.383Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/lecture-notes/24-10-21-1200</loc>
    <lastmod>2026-06-18T16:27:33.391Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/(block-cipher)-mode-of-operation</loc>
    <lastmod>2026-06-18T16:27:35.207Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/(mix,-max)-notation-for-relationships</loc>
    <lastmod>2026-06-18T16:27:36.171Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/2nd-preimage-resistant</loc>
    <lastmod>2026-06-18T16:27:35.063Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/4-1-model</loc>
    <lastmod>2026-06-18T16:27:36.171Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/a-search</loc>
    <lastmod>2026-06-18T16:27:35.279Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/aaa-security-principle</loc>
    <lastmod>2026-06-18T16:27:36.171Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/acm-code-of-conduct</loc>
    <lastmod>2026-06-18T16:27:36.175Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/ai-agent</loc>
    <lastmod>2026-06-18T16:27:34.275Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/ai-planning</loc>
    <lastmod>2026-06-18T16:27:34.019Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/arp-spoofing</loc>
    <lastmod>2026-06-18T16:27:34.519Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/abstract-data-type</loc>
    <lastmod>2026-06-18T16:27:34.571Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/abstract-factory-(design-pattern)</loc>
    <lastmod>2026-06-18T16:27:36.175Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/abstract-syntax</loc>
    <lastmod>2026-06-18T16:27:36.175Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/abstraction</loc>
    <lastmod>2026-06-18T16:27:36.175Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/acceptability</loc>
    <lastmod>2026-06-18T16:27:34.059Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/acceptance-testing</loc>
    <lastmod>2026-06-18T16:27:36.175Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/acceptance-tests</loc>
    <lastmod>2026-06-18T16:27:36.175Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/access-control-list-(acl)</loc>
    <lastmod>2026-06-18T16:27:34.679Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/accessible-(environment)</loc>
    <lastmod>2026-06-18T16:27:33.879Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/accessor-methods</loc>
    <lastmod>2026-06-18T16:27:36.175Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/accountability</loc>
    <lastmod>2026-06-18T16:27:35.519Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/accumulator-(register)</loc>
    <lastmod>2026-06-18T16:27:36.175Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/accumulator-architecture</loc>
    <lastmod>2026-06-18T16:27:36.175Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/accuracy-(ai)</loc>
    <lastmod>2026-06-18T16:27:34.851Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/active-attacks</loc>
    <lastmod>2026-06-18T16:27:36.175Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/active-traffic-analysis</loc>
    <lastmod>2026-06-18T16:27:35.231Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/activity-diagram-(uml)</loc>
    <lastmod>2026-06-18T16:27:34.095Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/actor-(uml-use-case)</loc>
    <lastmod>2026-06-18T16:27:36.175Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/adapter-(design-pattern)</loc>
    <lastmod>2026-06-18T16:27:36.175Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/address-space</loc>
    <lastmod>2026-06-18T16:27:36.175Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/address-binding-problem</loc>
    <lastmod>2026-06-18T16:27:34.931Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/admissible-heuristic</loc>
    <lastmod>2026-06-18T16:27:35.255Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/advanced-encryption-standard-(aes)</loc>
    <lastmod>2026-06-18T16:27:36.175Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/agglomerative-clustering</loc>
    <lastmod>2026-06-18T16:27:36.175Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/aggregate-function-(relational-operation)</loc>
    <lastmod>2026-06-18T16:27:36.175Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/aggregate-functions-(sql)</loc>
    <lastmod>2026-06-18T16:27:36.175Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/aggregation-(uml-class)</loc>
    <lastmod>2026-06-18T16:27:36.175Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/agile-development--and--values</loc>
    <lastmod>2026-06-18T16:27:34.815Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/agile-planning</loc>
    <lastmod>2026-06-18T16:27:34.127Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/agile-principles</loc>
    <lastmod>2026-06-18T16:27:34.199Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/agile-development</loc>
    <lastmod>2026-06-18T16:27:36.175Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/agile-lifecycle</loc>
    <lastmod>2026-06-18T16:27:36.175Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/algorithm-(computability)</loc>
    <lastmod>2026-06-18T16:27:34.711Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/algorithm-to-prenex-normal-form</loc>
    <lastmod>2026-06-18T16:27:36.175Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/algorithm</loc>
    <lastmod>2026-06-18T16:27:36.175Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/alias-(sql)</loc>
    <lastmod>2026-06-18T16:27:36.175Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/all-comparison-operator-(sql)</loc>
    <lastmod>2026-06-18T16:27:36.175Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/alpha-beta-pruning</loc>
    <lastmod>2026-06-18T16:27:35.307Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/alphabet-(predicate-logic)</loc>
    <lastmod>2026-06-18T16:27:34.155Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/alphabet</loc>
    <lastmod>2026-06-18T16:27:34.859Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/alt-fragment-(uml-sequence)</loc>
    <lastmod>2026-06-18T16:27:36.175Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/alter-table-add-(sql)</loc>
    <lastmod>2026-06-18T16:27:36.175Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/alter-table-drop-(sql)</loc>
    <lastmod>2026-06-18T16:27:36.175Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/anonymity</loc>
    <lastmod>2026-06-18T16:27:35.231Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/antisymmetric-relation</loc>
    <lastmod>2026-06-18T16:27:36.175Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/approximate-policy-evaluation</loc>
    <lastmod>2026-06-18T16:27:34.023Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/approximation-ratio</loc>
    <lastmod>2026-06-18T16:27:34.215Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/arc-consistency</loc>
    <lastmod>2026-06-18T16:27:36.175Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/argument</loc>
    <lastmod>2026-06-18T16:27:36.175Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/arithmetic-logic-unit</loc>
    <lastmod>2026-06-18T16:27:36.175Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/arity</loc>
    <lastmod>2026-06-18T16:27:36.175Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/armstrong's-inference-rules</loc>
    <lastmod>2026-06-18T16:27:36.179Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/array-list-(adt)</loc>
    <lastmod>2026-06-18T16:27:36.179Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/array-based-stack-implementation</loc>
    <lastmod>2026-06-18T16:27:36.179Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/artificial-intelligence</loc>
    <lastmod>2026-06-18T16:27:34.623Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/assembler</loc>
    <lastmod>2026-06-18T16:27:36.179Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/association-(uml-class)</loc>
    <lastmod>2026-06-18T16:27:36.179Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/association-(uml-use-case)</loc>
    <lastmod>2026-06-18T16:27:36.179Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/association-class-(uml-class)</loc>
    <lastmod>2026-06-18T16:27:36.179Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/association-rules</loc>
    <lastmod>2026-06-18T16:27:34.715Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/associative-law-(sets)</loc>
    <lastmod>2026-06-18T16:27:36.179Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/asymmetric-algorithms</loc>
    <lastmod>2026-06-18T16:27:35.455Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/asymmetric-key-cryptography</loc>
    <lastmod>2026-06-18T16:27:35.483Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/asymptotic-algorithm-analysis</loc>
    <lastmod>2026-06-18T16:27:36.179Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/asynchronous-message-(uml-sequence)</loc>
    <lastmod>2026-06-18T16:27:36.179Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/atomic-formula</loc>
    <lastmod>2026-06-18T16:27:34.679Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/atomic</loc>
    <lastmod>2026-06-18T16:27:34.055Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/attribute-(uml-class)</loc>
    <lastmod>2026-06-18T16:27:33.915Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/attribute-data-types-(sql)</loc>
    <lastmod>2026-06-18T16:27:36.179Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/attribute-syntax-(uml-class)</loc>
    <lastmod>2026-06-18T16:27:36.179Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/attribute</loc>
    <lastmod>2026-06-18T16:27:36.179Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/authentication-(public-key-cryptosystem)</loc>
    <lastmod>2026-06-18T16:27:34.083Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/authentication</loc>
    <lastmod>2026-06-18T16:27:34.667Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/authenticity</loc>
    <lastmod>2026-06-18T16:27:35.619Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/automated-testing</loc>
    <lastmod>2026-06-18T16:27:34.879Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/autonomous-agent</loc>
    <lastmod>2026-06-18T16:27:35.559Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/availability</loc>
    <lastmod>2026-06-18T16:27:34.159Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/average-reward-(policies)</loc>
    <lastmod>2026-06-18T16:27:34.395Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/axiom</loc>
    <lastmod>2026-06-18T16:27:36.179Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/bcs-code-of-conduct</loc>
    <lastmod>2026-06-18T16:27:36.179Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/backdoor-attacks</loc>
    <lastmod>2026-06-18T16:27:36.179Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/backpropagation</loc>
    <lastmod>2026-06-18T16:27:36.179Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/backtracking-search</loc>
    <lastmod>2026-06-18T16:27:34.827Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/backus-naur-form</loc>
    <lastmod>2026-06-18T16:27:35.587Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/balanced-(tree)</loc>
    <lastmod>2026-06-18T16:27:36.179Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/base-case-(recursion)</loc>
    <lastmod>2026-06-18T16:27:34.215Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/baseline</loc>
    <lastmod>2026-06-18T16:27:34.999Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/batch-processing-systems</loc>
    <lastmod>2026-06-18T16:27:34.223Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/bayes'-rule</loc>
    <lastmod>2026-06-18T16:27:34.979Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/bayes'-theorem</loc>
    <lastmod>2026-06-18T16:27:34.303Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/bayesian-network</loc>
    <lastmod>2026-06-18T16:27:35.459Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/bayesian-spam-filters</loc>
    <lastmod>2026-06-18T16:27:36.179Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/behavioural-models</loc>
    <lastmod>2026-06-18T16:27:36.179Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/bellman-equation</loc>
    <lastmod>2026-06-18T16:27:35.591Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/benchmarking</loc>
    <lastmod>2026-06-18T16:27:36.179Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/biconditional-statement</loc>
    <lastmod>2026-06-18T16:27:36.179Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/big-o-notation</loc>
    <lastmod>2026-06-18T16:27:34.095Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/big-omega</loc>
    <lastmod>2026-06-18T16:27:34.295Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/big-step-semantics</loc>
    <lastmod>2026-06-18T16:27:33.931Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/big-theta</loc>
    <lastmod>2026-06-18T16:27:35.119Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/big-endian</loc>
    <lastmod>2026-06-18T16:27:36.179Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/bijection-(function)</loc>
    <lastmod>2026-06-18T16:27:36.179Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/bijection-f-between-graphs</loc>
    <lastmod>2026-06-18T16:27:36.179Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/binary-association-(uml-class)</loc>
    <lastmod>2026-06-18T16:27:36.179Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/binary-recursion</loc>
    <lastmod>2026-06-18T16:27:35.135Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/binary-search-tree-(adt)</loc>
    <lastmod>2026-06-18T16:27:36.179Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/binary-search-tree</loc>
    <lastmod>2026-06-18T16:27:36.179Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/binary-search</loc>
    <lastmod>2026-06-18T16:27:36.179Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/binary-tree-(adt)</loc>
    <lastmod>2026-06-18T16:27:36.179Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/binary-tree</loc>
    <lastmod>2026-06-18T16:27:36.179Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/binary-function</loc>
    <lastmod>2026-06-18T16:27:36.179Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/binary-relation</loc>
    <lastmod>2026-06-18T16:27:36.179Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/binary</loc>
    <lastmod>2026-06-18T16:27:36.179Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/binomial-coefficient</loc>
    <lastmod>2026-06-18T16:27:36.179Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/bit-lengths-for-ieee-754-format</loc>
    <lastmod>2026-06-18T16:27:36.179Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/black-box-testing</loc>
    <lastmod>2026-06-18T16:27:35.143Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/block-cipher</loc>
    <lastmod>2026-06-18T16:27:36.179Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/boolean-satisfiability-problem-(sat)</loc>
    <lastmod>2026-06-18T16:27:33.871Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/bound-variable-(quantifiers)</loc>
    <lastmod>2026-06-18T16:27:36.179Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/bounded-error-probabilistic-polynomial-time-(bpp)</loc>
    <lastmod>2026-06-18T16:27:34.675Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/branch-coverage</loc>
    <lastmod>2026-06-18T16:27:34.599Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/branch-prediction</loc>
    <lastmod>2026-06-18T16:27:36.179Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/branch-and-bound-(algorithm)</loc>
    <lastmod>2026-06-18T16:27:34.219Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/branching</loc>
    <lastmod>2026-06-18T16:27:34.971Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/breadth-first-search-(algorithm)</loc>
    <lastmod>2026-06-18T16:27:34.647Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/break-fragment-(uml-sequence)</loc>
    <lastmod>2026-06-18T16:27:36.179Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/bridge-(design-pattern)</loc>
    <lastmod>2026-06-18T16:27:36.179Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/brute-force-attacks</loc>
    <lastmod>2026-06-18T16:27:35.639Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/bucket-array</loc>
    <lastmod>2026-06-18T16:27:34.575Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/bucket-sort</loc>
    <lastmod>2026-06-18T16:27:36.183Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/builder-(design-pattern)</loc>
    <lastmod>2026-06-18T16:27:36.183Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/building-a-definition-of-security</loc>
    <lastmod>2026-06-18T16:27:34.111Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/business-and-social-change-(issue-affecting-software)</loc>
    <lastmod>2026-06-18T16:27:34.871Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/byoce-codd-normal-form</loc>
    <lastmod>2026-06-18T16:27:35.087Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/byte-ordering</loc>
    <lastmod>2026-06-18T16:27:36.183Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/byte-addressable-memory</loc>
    <lastmod>2026-06-18T16:27:36.183Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/byte</loc>
    <lastmod>2026-06-18T16:27:36.183Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/cartesian-product-(relational-operation)</loc>
    <lastmod>2026-06-18T16:27:36.183Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/cia-security-triad</loc>
    <lastmod>2026-06-18T16:27:36.183Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/cnf-rewrite-rules</loc>
    <lastmod>2026-06-18T16:27:36.183Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/cpu-scheduler</loc>
    <lastmod>2026-06-18T16:27:35.595Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/cache</loc>
    <lastmod>2026-06-18T16:27:36.183Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/caeser-cipher</loc>
    <lastmod>2026-06-18T16:27:35.331Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/candidate-key-(databases)</loc>
    <lastmod>2026-06-18T16:27:33.803Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/capabilities</loc>
    <lastmod>2026-06-18T16:27:35.547Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/cardinality-ratio</loc>
    <lastmod>2026-06-18T16:27:36.183Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/cardinality</loc>
    <lastmod>2026-06-18T16:27:36.183Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/cartesian-product-(sql)</loc>
    <lastmod>2026-06-18T16:27:36.183Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/cartesian-product-of-sets</loc>
    <lastmod>2026-06-18T16:27:34.011Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/ceiling-function</loc>
    <lastmod>2026-06-18T16:27:36.183Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/central-processing-unit</loc>
    <lastmod>2026-06-18T16:27:36.183Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/centralised-dbms</loc>
    <lastmod>2026-06-18T16:27:34.375Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/chain-rule-(probabilities)</loc>
    <lastmod>2026-06-18T16:27:34.479Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/chain-of-responsibility-(design-pattern)</loc>
    <lastmod>2026-06-18T16:27:36.183Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/change-management</loc>
    <lastmod>2026-06-18T16:27:34.363Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/characteristic-function</loc>
    <lastmod>2026-06-18T16:27:36.183Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/chomsky-hierarchy</loc>
    <lastmod>2026-06-18T16:27:35.487Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/church-turing-thesis</loc>
    <lastmod>2026-06-18T16:27:34.235Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/cipher-(short-definition)</loc>
    <lastmod>2026-06-18T16:27:34.767Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/cipher-block-chaining-(cbc)</loc>
    <lastmod>2026-06-18T16:27:36.183Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/cipher-feedback-(cfb)</loc>
    <lastmod>2026-06-18T16:27:36.183Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/cipher</loc>
    <lastmod>2026-06-18T16:27:34.739Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/ciphertext</loc>
    <lastmod>2026-06-18T16:27:35.651Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/class-(programming)</loc>
    <lastmod>2026-06-18T16:27:36.183Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/class-(uml-class)</loc>
    <lastmod>2026-06-18T16:27:36.183Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/class-attribute</loc>
    <lastmod>2026-06-18T16:27:36.183Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/class-diagram-refactoring</loc>
    <lastmod>2026-06-18T16:27:36.183Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/class-diagram-(uml)</loc>
    <lastmod>2026-06-18T16:27:36.183Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/classical-semantics</loc>
    <lastmod>2026-06-18T16:27:34.771Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/classification-problem-(ai)</loc>
    <lastmod>2026-06-18T16:27:35.355Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/clean-code</loc>
    <lastmod>2026-06-18T16:27:34.943Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/clique-problem-(clique)</loc>
    <lastmod>2026-06-18T16:27:34.835Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/clique</loc>
    <lastmod>2026-06-18T16:27:33.915Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/clock-frequency</loc>
    <lastmod>2026-06-18T16:27:36.183Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/closed-world-assumption</loc>
    <lastmod>2026-06-18T16:27:36.183Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/cloud-computing</loc>
    <lastmod>2026-06-18T16:27:35.331Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/clustering-problem-(ai)</loc>
    <lastmod>2026-06-18T16:27:35.543Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/clusters</loc>
    <lastmod>2026-06-18T16:27:35.427Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/code-coverage</loc>
    <lastmod>2026-06-18T16:27:35.643Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/codeline</loc>
    <lastmod>2026-06-18T16:27:34.451Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/codes</loc>
    <lastmod>2026-06-18T16:27:36.183Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/collaboration-diagram-(uml)</loc>
    <lastmod>2026-06-18T16:27:35.583Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/collision-resistant</loc>
    <lastmod>2026-06-18T16:27:34.419Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/columnar-transposition-cipher</loc>
    <lastmod>2026-06-18T16:27:36.183Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/combined-fragments-(uml-sequence)</loc>
    <lastmod>2026-06-18T16:27:36.183Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/command-query-separation-principle</loc>
    <lastmod>2026-06-18T16:27:34.135Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/comments-(clean-code)</loc>
    <lastmod>2026-06-18T16:27:33.947Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/common-payoff-game</loc>
    <lastmod>2026-06-18T16:27:36.183Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/common-sum-game</loc>
    <lastmod>2026-06-18T16:27:36.183Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/communication-syntax-(cryptography)</loc>
    <lastmod>2026-06-18T16:27:35.499Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/commutative-law-(sets)</loc>
    <lastmod>2026-06-18T16:27:36.183Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/compactness-of-bayes-network</loc>
    <lastmod>2026-06-18T16:27:34.327Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/compiler</loc>
    <lastmod>2026-06-18T16:27:35.319Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/complementary-event</loc>
    <lastmod>2026-06-18T16:27:36.183Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/complementation-laws-(sets)</loc>
    <lastmod>2026-06-18T16:27:36.183Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/complete-set-of-connectives</loc>
    <lastmod>2026-06-18T16:27:36.183Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/complete-cycle</loc>
    <lastmod>2026-06-18T16:27:36.183Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/complete-graph</loc>
    <lastmod>2026-06-18T16:27:36.183Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/complete-set-of-residues</loc>
    <lastmod>2026-06-18T16:27:34.467Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/completeness-of-a-proof-system</loc>
    <lastmod>2026-06-18T16:27:36.183Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/complex-instruction-set-computers</loc>
    <lastmod>2026-06-18T16:27:36.183Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/component-graph</loc>
    <lastmod>2026-06-18T16:27:35.079Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/component-values-(databases)</loc>
    <lastmod>2026-06-18T16:27:36.183Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/component-diagram-(uml)</loc>
    <lastmod>2026-06-18T16:27:35.547Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/composite-(design-pattern)</loc>
    <lastmod>2026-06-18T16:27:36.183Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/composite-state-(uml-state-machine)</loc>
    <lastmod>2026-06-18T16:27:36.183Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/composite-attribute</loc>
    <lastmod>2026-06-18T16:27:36.183Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/composition-(uml-class)</loc>
    <lastmod>2026-06-18T16:27:36.183Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/composition-of-functions</loc>
    <lastmod>2026-06-18T16:27:36.183Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/compression-function</loc>
    <lastmod>2026-06-18T16:27:36.183Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/compromise-of-network-nodes</loc>
    <lastmod>2026-06-18T16:27:35.443Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/computable-function</loc>
    <lastmod>2026-06-18T16:27:35.095Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/computer-memory</loc>
    <lastmod>2026-06-18T16:27:36.187Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/computer-misuse-act-1990</loc>
    <lastmod>2026-06-18T16:27:36.187Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/computer-security</loc>
    <lastmod>2026-06-18T16:27:34.887Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/computer-architecture</loc>
    <lastmod>2026-06-18T16:27:36.187Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/computer-organisation</loc>
    <lastmod>2026-06-18T16:27:36.187Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/concatenation</loc>
    <lastmod>2026-06-18T16:27:34.899Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/conceptual-data-models</loc>
    <lastmod>2026-06-18T16:27:36.187Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/concrete-syntax</loc>
    <lastmod>2026-06-18T16:27:34.875Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/concurrency</loc>
    <lastmod>2026-06-18T16:27:34.947Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/condition-coverage</loc>
    <lastmod>2026-06-18T16:27:34.931Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/conditional-independence</loc>
    <lastmod>2026-06-18T16:27:34.979Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/conditional-probability</loc>
    <lastmod>2026-06-18T16:27:34.527Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/conditional-security</loc>
    <lastmod>2026-06-18T16:27:34.635Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/conditional-statement-(programming)</loc>
    <lastmod>2026-06-18T16:27:36.187Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/conditional-statement</loc>
    <lastmod>2026-06-18T16:27:36.187Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/confidentiality</loc>
    <lastmod>2026-06-18T16:27:35.247Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/configuration-management</loc>
    <lastmod>2026-06-18T16:27:36.187Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/confusion-matrix</loc>
    <lastmod>2026-06-18T16:27:36.187Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/congruent-modulo</loc>
    <lastmod>2026-06-18T16:27:34.067Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/conjunction</loc>
    <lastmod>2026-06-18T16:27:36.187Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/conjunctive-normal-form</loc>
    <lastmod>2026-06-18T16:27:36.187Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/conjunctive-query</loc>
    <lastmod>2026-06-18T16:27:34.035Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/consequence-relation</loc>
    <lastmod>2026-06-18T16:27:36.187Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/consistency-rules-(uml-class)</loc>
    <lastmod>2026-06-18T16:27:36.187Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/consistent</loc>
    <lastmod>2026-06-18T16:27:36.187Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/constraint-auto_increment-(sql)</loc>
    <lastmod>2026-06-18T16:27:36.187Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/constraint-default-(sql)</loc>
    <lastmod>2026-06-18T16:27:36.187Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/constraint-foreign-key-(sql)</loc>
    <lastmod>2026-06-18T16:27:36.187Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/constraint-not-null-(sql)</loc>
    <lastmod>2026-06-18T16:27:36.187Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/constraint-primary-key-(sql)</loc>
    <lastmod>2026-06-18T16:27:36.187Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/constraint-propagation</loc>
    <lastmod>2026-06-18T16:27:34.279Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/constraint-satisfaction-problem</loc>
    <lastmod>2026-06-18T16:27:35.603Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/constraint-unique-(sql)</loc>
    <lastmod>2026-06-18T16:27:36.187Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/constraints-(databases)</loc>
    <lastmod>2026-06-18T16:27:36.187Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/context-switching</loc>
    <lastmod>2026-06-18T16:27:34.619Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/contingency</loc>
    <lastmod>2026-06-18T16:27:36.187Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/contract</loc>
    <lastmod>2026-06-18T16:27:36.187Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/contradiction</loc>
    <lastmod>2026-06-18T16:27:36.187Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/control-unit</loc>
    <lastmod>2026-06-18T16:27:36.187Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/convex-set</loc>
    <lastmod>2026-06-18T16:27:36.187Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/cook-levin-theorem</loc>
    <lastmod>2026-06-18T16:27:34.295Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/copy-on-write</loc>
    <lastmod>2026-06-18T16:27:35.635Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/coregion-(uml-sequence)</loc>
    <lastmod>2026-06-18T16:27:36.187Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/correlated-nested-query-(sql)</loc>
    <lastmod>2026-06-18T16:27:36.187Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/countable-set</loc>
    <lastmod>2026-06-18T16:27:36.187Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/create-assertion-(sql)</loc>
    <lastmod>2026-06-18T16:27:36.187Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/create-domain-(sql)</loc>
    <lastmod>2026-06-18T16:27:36.187Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/create-schema-(sql)</loc>
    <lastmod>2026-06-18T16:27:36.187Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/create-table-(sql)</loc>
    <lastmod>2026-06-18T16:27:36.187Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/create-view-(sql)</loc>
    <lastmod>2026-06-18T16:27:36.187Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/critical-section</loc>
    <lastmod>2026-06-18T16:27:33.867Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/cross-join-(sql)</loc>
    <lastmod>2026-06-18T16:27:36.187Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/cross-site-scripting</loc>
    <lastmod>2026-06-18T16:27:36.187Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/cryptanalysis</loc>
    <lastmod>2026-06-18T16:27:35.147Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/cryptographic-hashing</loc>
    <lastmod>2026-06-18T16:27:35.631Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/cryptographic-challenge-response-protocols</loc>
    <lastmod>2026-06-18T16:27:35.531Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/cryptographic-hash-function</loc>
    <lastmod>2026-06-18T16:27:34.483Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/cryptography</loc>
    <lastmod>2026-06-18T16:27:34.383Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/cryptology</loc>
    <lastmod>2026-06-18T16:27:35.351Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/cycle</loc>
    <lastmod>2026-06-18T16:27:36.187Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/cyclomatic-coverage</loc>
    <lastmod>2026-06-18T16:27:34.731Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/difference-(relational-operation)</loc>
    <lastmod>2026-06-18T16:27:36.187Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/division-(relational-operation)</loc>
    <lastmod>2026-06-18T16:27:36.187Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/dnf-rewrite-rules</loc>
    <lastmod>2026-06-18T16:27:36.187Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/dns-spoofing</loc>
    <lastmod>2026-06-18T16:27:36.187Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/dpll-algorithm</loc>
    <lastmod>2026-06-18T16:27:34.563Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/dry-code</loc>
    <lastmod>2026-06-18T16:27:33.907Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/daily-scrum</loc>
    <lastmod>2026-06-18T16:27:34.579Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/data-definition-language</loc>
    <lastmod>2026-06-18T16:27:36.187Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/data-encryption-standard</loc>
    <lastmod>2026-06-18T16:27:34.135Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/data-manipulation-language</loc>
    <lastmod>2026-06-18T16:27:36.187Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/data-model</loc>
    <lastmod>2026-06-18T16:27:34.855Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/data-collection-systems</loc>
    <lastmod>2026-06-18T16:27:35.539Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/data-structure</loc>
    <lastmod>2026-06-18T16:27:34.619Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/data-driven-ai-approach</loc>
    <lastmod>2026-06-18T16:27:35.087Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/data</loc>
    <lastmod>2026-06-18T16:27:34.699Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/database-management-system</loc>
    <lastmod>2026-06-18T16:27:36.187Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/database-schema</loc>
    <lastmod>2026-06-18T16:27:33.967Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/database-state</loc>
    <lastmod>2026-06-18T16:27:36.187Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/database-system</loc>
    <lastmod>2026-06-18T16:27:36.187Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/database</loc>
    <lastmod>2026-06-18T16:27:34.239Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/datapath</loc>
    <lastmod>2026-06-18T16:27:36.191Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/de-morgan's-law-(sets)</loc>
    <lastmod>2026-06-18T16:27:36.191Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/decidable-problem</loc>
    <lastmod>2026-06-18T16:27:35.167Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/decimal-system</loc>
    <lastmod>2026-06-18T16:27:36.191Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/decision-node-(uml-state-machine)</loc>
    <lastmod>2026-06-18T16:27:36.191Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/decision-trees</loc>
    <lastmod>2026-06-18T16:27:36.191Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/decorator-(design-pattern)</loc>
    <lastmod>2026-06-18T16:27:36.191Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/decryption</loc>
    <lastmod>2026-06-18T16:27:34.399Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/deduction-theorem</loc>
    <lastmod>2026-06-18T16:27:36.191Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/deep-neural-network</loc>
    <lastmod>2026-06-18T16:27:36.191Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/defect-testing</loc>
    <lastmod>2026-06-18T16:27:34.155Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/definite-clause</loc>
    <lastmod>2026-06-18T16:27:34.951Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/definite-rules</loc>
    <lastmod>2026-06-18T16:27:36.191Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/degree-(graphs)</loc>
    <lastmod>2026-06-18T16:27:36.191Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/degree-of-a-relationship-type</loc>
    <lastmod>2026-06-18T16:27:36.191Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/delayed-branching</loc>
    <lastmod>2026-06-18T16:27:36.191Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/delete-query-(sql)</loc>
    <lastmod>2026-06-18T16:27:36.191Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/deletion-(heap)</loc>
    <lastmod>2026-06-18T16:27:36.191Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/denial-of-service-attack</loc>
    <lastmod>2026-06-18T16:27:36.191Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/dependability-and-security</loc>
    <lastmod>2026-06-18T16:27:33.947Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/dependency-injection-principle</loc>
    <lastmod>2026-06-18T16:27:34.439Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/deployment-diagram-(uml)</loc>
    <lastmod>2026-06-18T16:27:34.451Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/depth-first-search-(algorithm)</loc>
    <lastmod>2026-06-18T16:27:34.091Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/depth-of-a-vertex-(tree)</loc>
    <lastmod>2026-06-18T16:27:36.191Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/descriptive-statement</loc>
    <lastmod>2026-06-18T16:27:34.615Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/design-method-(programming-language)</loc>
    <lastmod>2026-06-18T16:27:35.027Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/design-pattern</loc>
    <lastmod>2026-06-18T16:27:36.191Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/deterministic-(environment)</loc>
    <lastmod>2026-06-18T16:27:34.051Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/deterministic-finite-automata</loc>
    <lastmod>2026-06-18T16:27:36.191Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/deterministic-transition-system</loc>
    <lastmod>2026-06-18T16:27:34.079Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/development-phase</loc>
    <lastmod>2026-06-18T16:27:34.551Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/device-driver</loc>
    <lastmod>2026-06-18T16:27:34.583Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/dictionary-(adt)</loc>
    <lastmod>2026-06-18T16:27:36.191Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/dictionary-attacks</loc>
    <lastmod>2026-06-18T16:27:35.287Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/dictionary</loc>
    <lastmod>2026-06-18T16:27:36.191Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/diffie-hellman-key-exchange</loc>
    <lastmod>2026-06-18T16:27:34.115Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/digital-rights-management</loc>
    <lastmod>2026-06-18T16:27:35.263Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/digital-security</loc>
    <lastmod>2026-06-18T16:27:36.191Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/digital-signature</loc>
    <lastmod>2026-06-18T16:27:33.927Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/dimensionality-reduction-problem-(ai)</loc>
    <lastmod>2026-06-18T16:27:35.111Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/direct-memory-access-(dma)</loc>
    <lastmod>2026-06-18T16:27:34.935Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/direct-addressing</loc>
    <lastmod>2026-06-18T16:27:36.191Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/direct-proof</loc>
    <lastmod>2026-06-18T16:27:35.071Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/direct-mapped-cache</loc>
    <lastmod>2026-06-18T16:27:36.191Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/directed-acyclic-graph</loc>
    <lastmod>2026-06-18T16:27:35.623Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/directed-graph</loc>
    <lastmod>2026-06-18T16:27:36.191Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/discounted-rewards-(policies)</loc>
    <lastmod>2026-06-18T16:27:33.975Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/discrete-(environment)</loc>
    <lastmod>2026-06-18T16:27:34.183Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/discrete-logarithm</loc>
    <lastmod>2026-06-18T16:27:33.811Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/dishonest-agent</loc>
    <lastmod>2026-06-18T16:27:34.555Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/disjoint</loc>
    <lastmod>2026-06-18T16:27:36.191Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/disjunction</loc>
    <lastmod>2026-06-18T16:27:36.191Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/disjunctive-normal-form</loc>
    <lastmod>2026-06-18T16:27:36.191Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/disk-(os)</loc>
    <lastmod>2026-06-18T16:27:34.271Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/distinct-modifier-(sql)</loc>
    <lastmod>2026-06-18T16:27:36.191Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/distributed-attack</loc>
    <lastmod>2026-06-18T16:27:36.191Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/distribution-of-existential-quantification-over-disjunction</loc>
    <lastmod>2026-06-18T16:27:36.191Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/distribution-of-universal-quantification-over-conjunction</loc>
    <lastmod>2026-06-18T16:27:36.191Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/distributive-laws-(logic)</loc>
    <lastmod>2026-06-18T16:27:36.191Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/distributive-laws-(sets)</loc>
    <lastmod>2026-06-18T16:27:36.191Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/divide-and-conquer</loc>
    <lastmod>2026-06-18T16:27:36.191Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/divides-notation</loc>
    <lastmod>2026-06-18T16:27:33.855Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/divisive-clustering-algorithm</loc>
    <lastmod>2026-06-18T16:27:34.175Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/divisive-clustering</loc>
    <lastmod>2026-06-18T16:27:36.191Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/dolev-yao-attacker-model</loc>
    <lastmod>2026-06-18T16:27:34.907Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/domain-(databases)</loc>
    <lastmod>2026-06-18T16:27:36.191Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/domain-analysis</loc>
    <lastmod>2026-06-18T16:27:35.099Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/domain-constraint-(databases)</loc>
    <lastmod>2026-06-18T16:27:36.191Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/domain-constraints-(sql)</loc>
    <lastmod>2026-06-18T16:27:36.191Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/dominant-strategy</loc>
    <lastmod>2026-06-18T16:27:35.335Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/double-des</loc>
    <lastmod>2026-06-18T16:27:36.191Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/double-hashing</loc>
    <lastmod>2026-06-18T16:27:36.191Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/doubly-linked-list</loc>
    <lastmod>2026-06-18T16:27:36.191Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/down-heap-bubbling</loc>
    <lastmod>2026-06-18T16:27:36.191Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/drop-schema-(sql)</loc>
    <lastmod>2026-06-18T16:27:36.191Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/drop-table-(sql)</loc>
    <lastmod>2026-06-18T16:27:36.191Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/dumpster-diving-(security)</loc>
    <lastmod>2026-06-18T16:27:36.191Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/dynamic-(environment)</loc>
    <lastmod>2026-06-18T16:27:34.811Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/dynamic-scope</loc>
    <lastmod>2026-06-18T16:27:34.791Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/dynamic-semantics</loc>
    <lastmod>2026-06-18T16:27:33.879Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/elf-executable-format</loc>
    <lastmod>2026-06-18T16:27:36.191Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/equijoin-(relational-operation)</loc>
    <lastmod>2026-06-18T16:27:36.195Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/er-diagram-notation</loc>
    <lastmod>2026-06-18T16:27:36.195Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/edges</loc>
    <lastmod>2026-06-18T16:27:36.195Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/effective-access-time</loc>
    <lastmod>2026-06-18T16:27:36.195Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/effective-address</loc>
    <lastmod>2026-06-18T16:27:36.195Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/efficiency</loc>
    <lastmod>2026-06-18T16:27:35.475Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/eigenvalue</loc>
    <lastmod>2026-06-18T16:27:35.191Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/eigenvector</loc>
    <lastmod>2026-06-18T16:27:35.067Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/el-gamal-variant-of-diffie-hellman-key-exchange</loc>
    <lastmod>2026-06-18T16:27:33.839Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/elbow-method-(clustering)</loc>
    <lastmod>2026-06-18T16:27:36.195Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/electronic-codebook-(ecb)</loc>
    <lastmod>2026-06-18T16:27:36.195Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/email-hijacking</loc>
    <lastmod>2026-06-18T16:27:36.195Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/embedded-control-systems</loc>
    <lastmod>2026-06-18T16:27:35.235Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/empty-set</loc>
    <lastmod>2026-06-18T16:27:36.195Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/empty-word</loc>
    <lastmod>2026-06-18T16:27:36.195Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/encryption-scheme</loc>
    <lastmod>2026-06-18T16:27:34.827Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/encryption</loc>
    <lastmod>2026-06-18T16:27:35.003Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/entertainment-systems</loc>
    <lastmod>2026-06-18T16:27:34.915Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/entity-integrity</loc>
    <lastmod>2026-06-18T16:27:36.195Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/entity-set</loc>
    <lastmod>2026-06-18T16:27:34.759Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/entity-type</loc>
    <lastmod>2026-06-18T16:27:35.159Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/entity-relationship-model</loc>
    <lastmod>2026-06-18T16:27:36.195Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/entity</loc>
    <lastmod>2026-06-18T16:27:36.195Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/entropy-(probability-distribution)</loc>
    <lastmod>2026-06-18T16:27:35.091Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/environment-(ai)</loc>
    <lastmod>2026-06-18T16:27:34.343Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/episode-(ai)</loc>
    <lastmod>2026-06-18T16:27:34.367Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/episodic-(environment)</loc>
    <lastmod>2026-06-18T16:27:35.047Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/equality-(fol)</loc>
    <lastmod>2026-06-18T16:27:36.195Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/equivalence-relation</loc>
    <lastmod>2026-06-18T16:27:36.195Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/equivalences-with-restrictions</loc>
    <lastmod>2026-06-18T16:27:36.195Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/ethics</loc>
    <lastmod>2026-06-18T16:27:36.195Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/euclid's-algorithm</loc>
    <lastmod>2026-06-18T16:27:35.259Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/euler-totient-function</loc>
    <lastmod>2026-06-18T16:27:36.195Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/event-(uml-state-machine)</loc>
    <lastmod>2026-06-18T16:27:36.195Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/event</loc>
    <lastmod>2026-06-18T16:27:34.095Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/every-visit-monte-carlo</loc>
    <lastmod>2026-06-18T16:27:34.651Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/except-(sql)</loc>
    <lastmod>2026-06-18T16:27:36.195Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/existence-dependency-constraint</loc>
    <lastmod>2026-06-18T16:27:36.195Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/existential-generalisation</loc>
    <lastmod>2026-06-18T16:27:36.195Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/existential-instantiation</loc>
    <lastmod>2026-06-18T16:27:36.195Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/existential-quantifier</loc>
    <lastmod>2026-06-18T16:27:36.195Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/exists-function-(sql)</loc>
    <lastmod>2026-06-18T16:27:36.195Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/expectation-of-variable</loc>
    <lastmod>2026-06-18T16:27:34.779Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/expected-utility</loc>
    <lastmod>2026-06-18T16:27:34.631Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/experiment</loc>
    <lastmod>2026-06-18T16:27:36.195Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/explicit-heap-dynamic-lifetime</loc>
    <lastmod>2026-06-18T16:27:34.671Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/exploitation-(ai)</loc>
    <lastmod>2026-06-18T16:27:34.511Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/exploration-(ai)</loc>
    <lastmod>2026-06-18T16:27:34.003Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/exponent-bias</loc>
    <lastmod>2026-06-18T16:27:36.195Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/expression-(predicate-logic)</loc>
    <lastmod>2026-06-18T16:27:36.195Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/extend-relationship-(uml-use-case)</loc>
    <lastmod>2026-06-18T16:27:35.011Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/extended-euclid's-algorithm</loc>
    <lastmod>2026-06-18T16:27:34.691Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/extreme-programming</loc>
    <lastmod>2026-06-18T16:27:36.195Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/f1-score</loc>
    <lastmod>2026-06-18T16:27:34.431Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/fde-cycle</loc>
    <lastmod>2026-06-18T16:27:36.195Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/fact</loc>
    <lastmod>2026-06-18T16:27:34.623Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/factorial-function</loc>
    <lastmod>2026-06-18T16:27:36.195Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/factorial</loc>
    <lastmod>2026-06-18T16:27:36.195Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/factory-method-(design-pattern)</loc>
    <lastmod>2026-06-18T16:27:36.195Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/fallacy</loc>
    <lastmod>2026-06-18T16:27:35.255Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/feedforward-nn</loc>
    <lastmod>2026-06-18T16:27:34.711Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/fiat-shamir-identification-protocol</loc>
    <lastmod>2026-06-18T16:27:33.883Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/fibonacci-function</loc>
    <lastmod>2026-06-18T16:27:36.195Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/file-descriptor</loc>
    <lastmod>2026-06-18T16:27:35.135Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/final-state-(uml-state-machine)</loc>
    <lastmod>2026-06-18T16:27:36.195Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/finite-automata</loc>
    <lastmod>2026-06-18T16:27:35.199Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/finite-control-device</loc>
    <lastmod>2026-06-18T16:27:36.195Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/finite-set</loc>
    <lastmod>2026-06-18T16:27:36.195Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/first-normal-form-(databases)</loc>
    <lastmod>2026-06-18T16:27:35.023Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/first-order-horn-clause</loc>
    <lastmod>2026-06-18T16:27:36.195Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/first-order-conjunctive-query</loc>
    <lastmod>2026-06-18T16:27:36.195Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/first-order-definite-clause-program</loc>
    <lastmod>2026-06-18T16:27:35.187Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/first-order-definite-clause</loc>
    <lastmod>2026-06-18T16:27:36.195Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/first-order-definite-rule</loc>
    <lastmod>2026-06-18T16:27:36.195Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/first-visit-monte-carlo</loc>
    <lastmod>2026-06-18T16:27:35.047Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/first-order-language</loc>
    <lastmod>2026-06-18T16:27:34.307Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/fixed-point-number</loc>
    <lastmod>2026-06-18T16:27:35.283Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/floor-function</loc>
    <lastmod>2026-06-18T16:27:36.195Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/flow-network</loc>
    <lastmod>2026-06-18T16:27:35.347Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/flow</loc>
    <lastmod>2026-06-18T16:27:36.199Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/foreign-key-(databases)</loc>
    <lastmod>2026-06-18T16:27:36.199Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/formal-semantics</loc>
    <lastmod>2026-06-18T16:27:34.803Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/formal-definition-of-optimisation-problems</loc>
    <lastmod>2026-06-18T16:27:34.271Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/formulas-(predicate-logic)</loc>
    <lastmod>2026-06-18T16:27:36.199Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/forward-checking-(search)</loc>
    <lastmod>2026-06-18T16:27:36.199Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/found-message-(uml-sequence)</loc>
    <lastmod>2026-06-18T16:27:36.199Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/frame-(paging)</loc>
    <lastmod>2026-06-18T16:27:34.263Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/free-variable-(quantifiers)</loc>
    <lastmod>2026-06-18T16:27:35.107Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/full-functional-dependency-(databases)</loc>
    <lastmod>2026-06-18T16:27:36.199Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/full-joint-distribution-(bayesian-network)</loc>
    <lastmod>2026-06-18T16:27:34.691Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/full-outer-join-(sql)</loc>
    <lastmod>2026-06-18T16:27:36.199Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/fully-associative-cache</loc>
    <lastmod>2026-06-18T16:27:36.199Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/function-(fol)</loc>
    <lastmod>2026-06-18T16:27:36.199Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/function-notation</loc>
    <lastmod>2026-06-18T16:27:34.975Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/function</loc>
    <lastmod>2026-06-18T16:27:36.199Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/functional-dependency</loc>
    <lastmod>2026-06-18T16:27:36.199Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/functional-programming</loc>
    <lastmod>2026-06-18T16:27:34.707Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/functional-requirement</loc>
    <lastmod>2026-06-18T16:27:35.307Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/functions-(clean-code)</loc>
    <lastmod>2026-06-18T16:27:35.503Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/gain-ratio</loc>
    <lastmod>2026-06-18T16:27:35.239Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/game-theory</loc>
    <lastmod>2026-06-18T16:27:34.843Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/game-tree</loc>
    <lastmod>2026-06-18T16:27:34.543Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/gangs-of-four-design-patterns</loc>
    <lastmod>2026-06-18T16:27:36.199Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/gantt-chart</loc>
    <lastmod>2026-06-18T16:27:36.199Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/gate-(uml-sequence)</loc>
    <lastmod>2026-06-18T16:27:36.199Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/general-constraints-(sql)</loc>
    <lastmod>2026-06-18T16:27:36.199Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/general-travelling-salesman-problem</loc>
    <lastmod>2026-06-18T16:27:35.595Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/general-cryptographic-schema</loc>
    <lastmod>2026-06-18T16:27:36.199Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/general-model-for-(network)-security</loc>
    <lastmod>2026-06-18T16:27:35.619Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/general-purpose-register-architecture</loc>
    <lastmod>2026-06-18T16:27:36.199Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/generalisation-(uml-class)</loc>
    <lastmod>2026-06-18T16:27:36.199Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/generalisation-(uml-use-case)</loc>
    <lastmod>2026-06-18T16:27:36.199Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/generalisation-error</loc>
    <lastmod>2026-06-18T16:27:33.963Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/generalised-pigeonhole-principle</loc>
    <lastmod>2026-06-18T16:27:36.199Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/geometric-mean</loc>
    <lastmod>2026-06-18T16:27:36.199Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/gibbs-sampling</loc>
    <lastmod>2026-06-18T16:27:34.159Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/gini-ratio</loc>
    <lastmod>2026-06-18T16:27:34.043Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/grammar</loc>
    <lastmod>2026-06-18T16:27:34.839Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/graph</loc>
    <lastmod>2026-06-18T16:27:36.199Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/greedy-best-first-search</loc>
    <lastmod>2026-06-18T16:27:36.199Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/grille</loc>
    <lastmod>2026-06-18T16:27:34.059Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/grouping-(sql)</loc>
    <lastmod>2026-06-18T16:27:36.199Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/guideline-based-testing</loc>
    <lastmod>2026-06-18T16:27:34.387Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/http-flood</loc>
    <lastmod>2026-06-18T16:27:36.199Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/https-spoofing</loc>
    <lastmod>2026-06-18T16:27:36.199Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/hamiltonian-cycle-problem-(hamiltonian)</loc>
    <lastmod>2026-06-18T16:27:35.155Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/hamiltonian-cycle</loc>
    <lastmod>2026-06-18T16:27:36.199Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/hamiltonian-path</loc>
    <lastmod>2026-06-18T16:27:34.167Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/handle</loc>
    <lastmod>2026-06-18T16:27:34.119Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/handshaking-theorem</loc>
    <lastmod>2026-06-18T16:27:36.199Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/hash-code</loc>
    <lastmod>2026-06-18T16:27:36.199Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/hash-function</loc>
    <lastmod>2026-06-18T16:27:34.951Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/hash-table</loc>
    <lastmod>2026-06-18T16:27:36.199Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/having-clause-(sql)</loc>
    <lastmod>2026-06-18T16:27:36.199Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/heap-(data-structure)</loc>
    <lastmod>2026-06-18T16:27:35.079Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/heap-(memory)</loc>
    <lastmod>2026-06-18T16:27:35.383Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/height-(heap)</loc>
    <lastmod>2026-06-18T16:27:36.199Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/height-(tree)</loc>
    <lastmod>2026-06-18T16:27:36.199Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/herbrand-semantics</loc>
    <lastmod>2026-06-18T16:27:34.883Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/heterogeneity-(issue-affecting-software)</loc>
    <lastmod>2026-06-18T16:27:35.255Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/heuristic</loc>
    <lastmod>2026-06-18T16:27:35.591Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/hexadecimal</loc>
    <lastmod>2026-06-18T16:27:36.199Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/hierarchical-clustering</loc>
    <lastmod>2026-06-18T16:27:36.199Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/high-cohesion</loc>
    <lastmod>2026-06-18T16:27:34.703Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/hit-ratio</loc>
    <lastmod>2026-06-18T16:27:34.155Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/homophonic-substitution-cipher</loc>
    <lastmod>2026-06-18T16:27:34.287Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/honest-agent</loc>
    <lastmod>2026-06-18T16:27:35.187Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/horn-clause</loc>
    <lastmod>2026-06-18T16:27:35.259Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/hybrid-compiler-and-interpreter</loc>
    <lastmod>2026-06-18T16:27:34.531Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/hypervisor</loc>
    <lastmod>2026-06-18T16:27:34.991Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/icmp-flood</loc>
    <lastmod>2026-06-18T16:27:36.199Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/ieee-754-format</loc>
    <lastmod>2026-06-18T16:27:35.571Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/in-clause-(sql)</loc>
    <lastmod>2026-06-18T16:27:36.199Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/intersection-(relational-operation)</loc>
    <lastmod>2026-06-18T16:27:36.199Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/invest</loc>
    <lastmod>2026-06-18T16:27:35.463Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/io-subsystem</loc>
    <lastmod>2026-06-18T16:27:36.199Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/ip-spoofing</loc>
    <lastmod>2026-06-18T16:27:36.199Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/idempotent-law-(sets)</loc>
    <lastmod>2026-06-18T16:27:36.199Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/identify-strongly-component-components-(algorithm)</loc>
    <lastmod>2026-06-18T16:27:35.507Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/identity-elimination-1</loc>
    <lastmod>2026-06-18T16:27:36.199Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/identity-function</loc>
    <lastmod>2026-06-18T16:27:36.199Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/identity-introduction</loc>
    <lastmod>2026-06-18T16:27:36.199Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/identity-law-(sets)</loc>
    <lastmod>2026-06-18T16:27:36.199Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/image-(functions)</loc>
    <lastmod>2026-06-18T16:27:36.203Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/imperative-language</loc>
    <lastmod>2026-06-18T16:27:35.451Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/impersonation</loc>
    <lastmod>2026-06-18T16:27:36.203Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/implementation-data-models</loc>
    <lastmod>2026-06-18T16:27:36.203Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/implicit-heap-dynamic-lifetime</loc>
    <lastmod>2026-06-18T16:27:34.855Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/in-order-traversal</loc>
    <lastmod>2026-06-18T16:27:36.203Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/include-relationship-(uml-use-case)</loc>
    <lastmod>2026-06-18T16:27:34.511Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/inclusion-exclusion-principle</loc>
    <lastmod>2026-06-18T16:27:36.203Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/incremental-model</loc>
    <lastmod>2026-06-18T16:27:36.203Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/incremental-development-approach</loc>
    <lastmod>2026-06-18T16:27:36.203Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/independence</loc>
    <lastmod>2026-06-18T16:27:34.631Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/indirect-addressing</loc>
    <lastmod>2026-06-18T16:27:36.203Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/inductive-definition-of-regular-expression</loc>
    <lastmod>2026-06-18T16:27:34.807Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/inductive-definition</loc>
    <lastmod>2026-06-18T16:27:36.203Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/inference-by-enumeration</loc>
    <lastmod>2026-06-18T16:27:33.807Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/inference-rule</loc>
    <lastmod>2026-06-18T16:27:36.203Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/infinite-set</loc>
    <lastmod>2026-06-18T16:27:36.203Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/informal-semantics</loc>
    <lastmod>2026-06-18T16:27:34.395Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/information-gain-(entropy)</loc>
    <lastmod>2026-06-18T16:27:34.851Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/information-security</loc>
    <lastmod>2026-06-18T16:27:34.763Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/initial-database-state</loc>
    <lastmod>2026-06-18T16:27:34.731Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/initial-state-(uml-state-machine)</loc>
    <lastmod>2026-06-18T16:27:36.203Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/injective-function</loc>
    <lastmod>2026-06-18T16:27:36.203Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/inner-join-(sql)</loc>
    <lastmod>2026-06-18T16:27:35.527Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/insert-query-(sql)</loc>
    <lastmod>2026-06-18T16:27:36.203Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/inserting-multiple-values-from-a-create-query-(sql)</loc>
    <lastmod>2026-06-18T16:27:36.203Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/insertion-(heap)</loc>
    <lastmod>2026-06-18T16:27:36.203Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/insider-attack</loc>
    <lastmod>2026-06-18T16:27:36.203Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/instance</loc>
    <lastmod>2026-06-18T16:27:34.535Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/instruction-register</loc>
    <lastmod>2026-06-18T16:27:36.203Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/instruction-set-architecture</loc>
    <lastmod>2026-06-18T16:27:36.203Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/instruction-level-pipelining</loc>
    <lastmod>2026-06-18T16:27:36.203Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/integration-tests</loc>
    <lastmod>2026-06-18T16:27:34.987Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/integrity</loc>
    <lastmod>2026-06-18T16:27:34.247Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/intellectual-property</loc>
    <lastmod>2026-06-18T16:27:36.203Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/interaction-(uml-sequence)</loc>
    <lastmod>2026-06-18T16:27:34.923Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/interaction-diagram</loc>
    <lastmod>2026-06-18T16:27:36.203Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/interaction-partners-(uml-sequence)</loc>
    <lastmod>2026-06-18T16:27:36.203Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/interaction-reference-(uml-sequence)</loc>
    <lastmod>2026-06-18T16:27:36.203Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/interactive-transaction-based-applications</loc>
    <lastmod>2026-06-18T16:27:35.299Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/interface-segregation-principle</loc>
    <lastmod>2026-06-18T16:27:34.039Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/interface-testing</loc>
    <lastmod>2026-06-18T16:27:33.891Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/interpretation-(predicate-logic)</loc>
    <lastmod>2026-06-18T16:27:35.175Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/interpretation</loc>
    <lastmod>2026-06-18T16:27:36.203Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/interpreter</loc>
    <lastmod>2026-06-18T16:27:35.639Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/interrupt</loc>
    <lastmod>2026-06-18T16:27:36.203Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/invalid-argument</loc>
    <lastmod>2026-06-18T16:27:36.203Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/invariant</loc>
    <lastmod>2026-06-18T16:27:36.203Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/inverse-(function)</loc>
    <lastmod>2026-06-18T16:27:36.203Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/inverse-image-(functions)</loc>
    <lastmod>2026-06-18T16:27:34.135Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/irreflexive-relation</loc>
    <lastmod>2026-06-18T16:27:33.847Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/isolated-vertex</loc>
    <lastmod>2026-06-18T16:27:36.203Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/isomorphic</loc>
    <lastmod>2026-06-18T16:27:36.203Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/iterative-model</loc>
    <lastmod>2026-06-18T16:27:36.203Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/join-(relational-operation)</loc>
    <lastmod>2026-06-18T16:27:36.203Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/join-condition-(sql)</loc>
    <lastmod>2026-06-18T16:27:36.203Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/joined-relations-(sql)</loc>
    <lastmod>2026-06-18T16:27:36.203Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/joint-probability-distribution-using-conditional-probability</loc>
    <lastmod>2026-06-18T16:27:35.387Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/joint-probability-distribution</loc>
    <lastmod>2026-06-18T16:27:35.527Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/k-fold-cross-validation</loc>
    <lastmod>2026-06-18T16:27:36.203Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/kiss</loc>
    <lastmod>2026-06-18T16:27:35.495Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/kanban-board</loc>
    <lastmod>2026-06-18T16:27:34.303Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/kanban-lifecycle</loc>
    <lastmod>2026-06-18T16:27:35.007Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/kerberos-(v4)-architecture</loc>
    <lastmod>2026-06-18T16:27:36.203Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/kerberos-(v4)-limitations</loc>
    <lastmod>2026-06-18T16:27:35.531Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/kerberos-(v4)-operation</loc>
    <lastmod>2026-06-18T16:27:36.203Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/kerberos-(v4)-protocol</loc>
    <lastmod>2026-06-18T16:27:36.203Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/kerberos-protocol</loc>
    <lastmod>2026-06-18T16:27:33.839Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/kerberos-protocol-requirements</loc>
    <lastmod>2026-06-18T16:27:34.823Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/kernel-thread</loc>
    <lastmod>2026-06-18T16:27:34.499Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/key-(databases)</loc>
    <lastmod>2026-06-18T16:27:33.863Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/key-constraint-(databases)</loc>
    <lastmod>2026-06-18T16:27:34.519Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/key-attribute</loc>
    <lastmod>2026-06-18T16:27:36.203Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/key-distribution-problem</loc>
    <lastmod>2026-06-18T16:27:34.587Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/key-distribution-with-rsa</loc>
    <lastmod>2026-06-18T16:27:35.535Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/kruskal's-spanning-tree-algorithm</loc>
    <lastmod>2026-06-18T16:27:34.755Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/language-of-a-dfa</loc>
    <lastmod>2026-06-18T16:27:36.203Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/language</loc>
    <lastmod>2026-06-18T16:27:35.543Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/lazy-allocation</loc>
    <lastmod>2026-06-18T16:27:35.171Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/lean-development--and--values</loc>
    <lastmod>2026-06-18T16:27:36.203Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/lean-principles</loc>
    <lastmod>2026-06-18T16:27:33.887Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/learning-curve</loc>
    <lastmod>2026-06-18T16:27:36.203Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/left-outer-join-(sql)</loc>
    <lastmod>2026-06-18T16:27:36.203Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/length-(cycle)</loc>
    <lastmod>2026-06-18T16:27:36.203Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/length-(path)</loc>
    <lastmod>2026-06-18T16:27:36.203Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/length-(word)</loc>
    <lastmod>2026-06-18T16:27:36.207Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/likelihood-weighting</loc>
    <lastmod>2026-06-18T16:27:35.627Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/limited-direct-exceution</loc>
    <lastmod>2026-06-18T16:27:35.463Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/linear-assumption</loc>
    <lastmod>2026-06-18T16:27:34.879Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/linear-probing</loc>
    <lastmod>2026-06-18T16:27:36.207Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/linear-recursion</loc>
    <lastmod>2026-06-18T16:27:36.207Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/linear-order</loc>
    <lastmod>2026-06-18T16:27:36.207Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/linearly-ordered-list</loc>
    <lastmod>2026-06-18T16:27:36.207Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/linked-list</loc>
    <lastmod>2026-06-18T16:27:34.791Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/liskov-substitution-principle</loc>
    <lastmod>2026-06-18T16:27:34.227Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/list</loc>
    <lastmod>2026-06-18T16:27:36.207Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/literal</loc>
    <lastmod>2026-06-18T16:27:36.207Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/little-endian</loc>
    <lastmod>2026-06-18T16:27:36.207Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/load-factor-(hashing)</loc>
    <lastmod>2026-06-18T16:27:36.207Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/local-semantics-of-conditional-independence</loc>
    <lastmod>2026-06-18T16:27:36.207Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/local-variable</loc>
    <lastmod>2026-06-18T16:27:36.207Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/lock</loc>
    <lastmod>2026-06-18T16:27:34.939Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/logic-programming</loc>
    <lastmod>2026-06-18T16:27:34.827Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/logical-connective</loc>
    <lastmod>2026-06-18T16:27:36.207Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/logical-consequence</loc>
    <lastmod>2026-06-18T16:27:36.207Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/logical-matrix</loc>
    <lastmod>2026-06-18T16:27:36.207Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/logically-correct</loc>
    <lastmod>2026-06-18T16:27:36.207Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/logically-equivalent</loc>
    <lastmod>2026-06-18T16:27:36.207Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/loop-fragment-(uml-sequence)</loc>
    <lastmod>2026-06-18T16:27:36.207Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/loop-coverage</loc>
    <lastmod>2026-06-18T16:27:34.107Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/loose-coupling</loc>
    <lastmod>2026-06-18T16:27:34.027Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/lost-message-(uml-sequence)</loc>
    <lastmod>2026-06-18T16:27:36.207Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/mac-algorithm</loc>
    <lastmod>2026-06-18T16:27:34.363Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/marie-isa</loc>
    <lastmod>2026-06-18T16:27:36.207Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/mcts-with-memorisation</loc>
    <lastmod>2026-06-18T16:27:34.667Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/machine-learning</loc>
    <lastmod>2026-06-18T16:27:35.495Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/machine-phenomena</loc>
    <lastmod>2026-06-18T16:27:34.507Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/mainline</loc>
    <lastmod>2026-06-18T16:27:34.547Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/maintainability</loc>
    <lastmod>2026-06-18T16:27:35.607Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/man-in-the-middle-attacks</loc>
    <lastmod>2026-06-18T16:27:36.207Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/map-(adt)</loc>
    <lastmod>2026-06-18T16:27:36.207Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/map</loc>
    <lastmod>2026-06-18T16:27:36.207Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/markov-blanket</loc>
    <lastmod>2026-06-18T16:27:36.207Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/markov-chain</loc>
    <lastmod>2026-06-18T16:27:36.207Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/markov-decision-process</loc>
    <lastmod>2026-06-18T16:27:36.207Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/markov-property</loc>
    <lastmod>2026-06-18T16:27:35.611Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/markov's-inequality</loc>
    <lastmod>2026-06-18T16:27:35.651Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/masey-omura-scheme</loc>
    <lastmod>2026-06-18T16:27:34.523Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/maskable-interrupt</loc>
    <lastmod>2026-06-18T16:27:36.207Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/mathematical-definition-of-vigen%C3%A8re-cipher</loc>
    <lastmod>2026-06-18T16:27:34.331Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/mathematical-definition-of-homophonic-substitution-ciphers</loc>
    <lastmod>2026-06-18T16:27:33.855Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/mathematical-definition-of-mono-alphabetic-substitution-ciphers</loc>
    <lastmod>2026-06-18T16:27:34.475Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/mathematical-formalisation-of-encryption--and--decryption</loc>
    <lastmod>2026-06-18T16:27:36.207Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/mathematical-formalisation-of-transposition-ciphers</loc>
    <lastmod>2026-06-18T16:27:34.947Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/matrix-multiplication</loc>
    <lastmod>2026-06-18T16:27:36.207Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/matrix-rotation-transformation</loc>
    <lastmod>2026-06-18T16:27:36.207Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/matrix-shear-mapping-transformation</loc>
    <lastmod>2026-06-18T16:27:36.207Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/matrix-stretch-transformation</loc>
    <lastmod>2026-06-18T16:27:36.207Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/matrix-transpose</loc>
    <lastmod>2026-06-18T16:27:34.371Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/maximax</loc>
    <lastmod>2026-06-18T16:27:35.303Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/maximin</loc>
    <lastmod>2026-06-18T16:27:35.043Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/maximum-flow-problem</loc>
    <lastmod>2026-06-18T16:27:34.515Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/mean-absolute-error</loc>
    <lastmod>2026-06-18T16:27:34.679Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/mean-squared-error</loc>
    <lastmod>2026-06-18T16:27:34.187Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/memory-address-register</loc>
    <lastmod>2026-06-18T16:27:36.207Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/memory-allocator</loc>
    <lastmod>2026-06-18T16:27:36.207Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/memory-buffer-register</loc>
    <lastmod>2026-06-18T16:27:36.207Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/merge-sort</loc>
    <lastmod>2026-06-18T16:27:36.207Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/merge-classes-refactoring</loc>
    <lastmod>2026-06-18T16:27:36.207Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/merging</loc>
    <lastmod>2026-06-18T16:27:35.355Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/message-(uml-sequence)</loc>
    <lastmod>2026-06-18T16:27:36.207Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/message-authentication</loc>
    <lastmod>2026-06-18T16:27:35.607Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/message-digest</loc>
    <lastmod>2026-06-18T16:27:34.071Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/message-integrity</loc>
    <lastmod>2026-06-18T16:27:34.895Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/message-syntax-(cryptography)</loc>
    <lastmod>2026-06-18T16:27:34.919Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/method-signature</loc>
    <lastmod>2026-06-18T16:27:36.207Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/method</loc>
    <lastmod>2026-06-18T16:27:36.207Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/microkernel</loc>
    <lastmod>2026-06-18T16:27:36.207Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/milestone-(project-planning)</loc>
    <lastmod>2026-06-18T16:27:34.407Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/mini-world</loc>
    <lastmod>2026-06-18T16:27:34.815Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/minimax</loc>
    <lastmod>2026-06-18T16:27:35.571Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/minimum-spanning-tree</loc>
    <lastmod>2026-06-18T16:27:36.207Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/minimum-cost-flow-problem</loc>
    <lastmod>2026-06-18T16:27:35.291Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/misanthropes'-(un)coordination-game</loc>
    <lastmod>2026-06-18T16:27:36.207Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/miss-ratio</loc>
    <lastmod>2026-06-18T16:27:34.471Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/mixed-strategy</loc>
    <lastmod>2026-06-18T16:27:34.071Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/moscow-style</loc>
    <lastmod>2026-06-18T16:27:34.759Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/model-(ai)</loc>
    <lastmod>2026-06-18T16:27:35.655Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/model-(predicate-logic)</loc>
    <lastmod>2026-06-18T16:27:36.207Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/model-free-prediction</loc>
    <lastmod>2026-06-18T16:27:35.015Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/model-based-ai-approach</loc>
    <lastmod>2026-06-18T16:27:34.375Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/model</loc>
    <lastmod>2026-06-18T16:27:36.211Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/modelling-attacks</loc>
    <lastmod>2026-06-18T16:27:34.355Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/modelling</loc>
    <lastmod>2026-06-18T16:27:34.459Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/modularisation</loc>
    <lastmod>2026-06-18T16:27:36.211Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/modulo-operator-properties</loc>
    <lastmod>2026-06-18T16:27:34.367Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/modus-ponens</loc>
    <lastmod>2026-06-18T16:27:36.211Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/monadic-predicate</loc>
    <lastmod>2026-06-18T16:27:36.211Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/mono-alphabetic-substitution-cipher</loc>
    <lastmod>2026-06-18T16:27:34.511Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/monte-carlo-reinforcement-learning</loc>
    <lastmod>2026-06-18T16:27:35.475Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/monte-carlo-tree-search</loc>
    <lastmod>2026-06-18T16:27:36.211Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/most-constrained-variable</loc>
    <lastmod>2026-06-18T16:27:34.483Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/most-constraining-variable</loc>
    <lastmod>2026-06-18T16:27:35.091Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/most-general-unifier-(semantics)</loc>
    <lastmod>2026-06-18T16:27:35.039Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/most-general-unifier</loc>
    <lastmod>2026-06-18T16:27:35.039Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/most-significant-bit</loc>
    <lastmod>2026-06-18T16:27:36.211Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/move-operation-refactoring</loc>
    <lastmod>2026-06-18T16:27:36.211Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/multi-factor-authentication</loc>
    <lastmod>2026-06-18T16:27:35.411Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/multi-valued-attribute</loc>
    <lastmod>2026-06-18T16:27:36.211Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/multi-version-systems</loc>
    <lastmod>2026-06-18T16:27:34.483Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/multiple-recursion</loc>
    <lastmod>2026-06-18T16:27:33.971Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/multiple-stage-columnar-transposition-cipher</loc>
    <lastmod>2026-06-18T16:27:34.051Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/multiplicity-(uml)</loc>
    <lastmod>2026-06-18T16:27:36.211Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/multitasking</loc>
    <lastmod>2026-06-18T16:27:36.211Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/mutator-methods</loc>
    <lastmod>2026-06-18T16:27:36.211Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/natural-join-(relational-operation)</loc>
    <lastmod>2026-06-18T16:27:36.211Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/np-complete</loc>
    <lastmod>2026-06-18T16:27:33.823Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/np-hard</loc>
    <lastmod>2026-06-18T16:27:34.007Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/naive-bayes-assumption</loc>
    <lastmod>2026-06-18T16:27:34.147Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/naming-things-(clean-code)</loc>
    <lastmod>2026-06-18T16:27:35.155Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/nash-equilibrium-in-mixed-strategies</loc>
    <lastmod>2026-06-18T16:27:35.363Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/nash-equilibrium-solution</loc>
    <lastmod>2026-06-18T16:27:34.099Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/nash-equilibrium</loc>
    <lastmod>2026-06-18T16:27:35.415Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/natural-deduction-elimination-of-disjunction</loc>
    <lastmod>2026-06-18T16:27:36.211Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/natural-deduction-introduction-of-disjunction</loc>
    <lastmod>2026-06-18T16:27:36.211Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/natural-deduction-introduction-of-implication</loc>
    <lastmod>2026-06-18T16:27:36.211Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/natural-deduction-rules-for-biconditional</loc>
    <lastmod>2026-06-18T16:27:36.211Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/natural-deduction-rules-for-conjunction</loc>
    <lastmod>2026-06-18T16:27:36.211Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/natural-deduction-rules-for-negation</loc>
    <lastmod>2026-06-18T16:27:36.211Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/natural-deduction</loc>
    <lastmod>2026-06-18T16:27:36.211Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/natural-join-(sql)</loc>
    <lastmod>2026-06-18T16:27:35.555Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/needham-schroeder-public-key-(nspk)-protocol</loc>
    <lastmod>2026-06-18T16:27:33.807Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/negation</loc>
    <lastmod>2026-06-18T16:27:36.211Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/nested-queries-(sql)</loc>
    <lastmod>2026-06-18T16:27:36.211Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/network-data-model</loc>
    <lastmod>2026-06-18T16:27:36.211Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/network-security</loc>
    <lastmod>2026-06-18T16:27:35.203Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/neural-network-layers</loc>
    <lastmod>2026-06-18T16:27:34.819Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/neural-network</loc>
    <lastmod>2026-06-18T16:27:36.211Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/neuron</loc>
    <lastmod>2026-06-18T16:27:36.211Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/nibble</loc>
    <lastmod>2026-06-18T16:27:36.211Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/node-list-(adt)</loc>
    <lastmod>2026-06-18T16:27:36.211Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/non-deterministic-polynomial-time-(np)</loc>
    <lastmod>2026-06-18T16:27:35.027Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/non-deterministic-turing-machine</loc>
    <lastmod>2026-06-18T16:27:36.211Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/non-deterministic-finite-automata</loc>
    <lastmod>2026-06-18T16:27:34.139Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/non-episodic-(environment)</loc>
    <lastmod>2026-06-18T16:27:34.031Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/non-functional-requirement</loc>
    <lastmod>2026-06-18T16:27:36.211Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/non-maskable-interrupts</loc>
    <lastmod>2026-06-18T16:27:36.211Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/non-preemptive-multitasking</loc>
    <lastmod>2026-06-18T16:27:34.851Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/non-repudiation</loc>
    <lastmod>2026-06-18T16:27:34.403Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/non-terminals</loc>
    <lastmod>2026-06-18T16:27:35.459Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/nonce</loc>
    <lastmod>2026-06-18T16:27:34.479Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/nonprime-attribute-(databases)</loc>
    <lastmod>2026-06-18T16:27:34.887Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/normal-form-(databases)</loc>
    <lastmod>2026-06-18T16:27:34.659Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/normal-form-games</loc>
    <lastmod>2026-06-18T16:27:34.575Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/normalisation-(databases)</loc>
    <lastmod>2026-06-18T16:27:34.335Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/normalisation-(probabilities)</loc>
    <lastmod>2026-06-18T16:27:35.599Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/normalisation</loc>
    <lastmod>2026-06-18T16:27:36.211Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/not-divides-notation</loc>
    <lastmod>2026-06-18T16:27:34.787Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/novation</loc>
    <lastmod>2026-06-18T16:27:36.211Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/null-(databases)</loc>
    <lastmod>2026-06-18T16:27:35.111Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/null-(sql)</loc>
    <lastmod>2026-06-18T16:27:36.211Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/outer-join-(relational-operation)</loc>
    <lastmod>2026-06-18T16:27:36.211Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/outer-union-(relational-algebra)</loc>
    <lastmod>2026-06-18T16:27:36.211Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/object-(programming)</loc>
    <lastmod>2026-06-18T16:27:36.211Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/object-(uml-class)</loc>
    <lastmod>2026-06-18T16:27:36.211Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/object-creation-(uml-sequence)</loc>
    <lastmod>2026-06-18T16:27:36.211Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/object-destruction-(uml-sequence)</loc>
    <lastmod>2026-06-18T16:27:36.211Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/object-recursion-(design-pattern)</loc>
    <lastmod>2026-06-18T16:27:36.211Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/object-schizophrenia</loc>
    <lastmod>2026-06-18T16:27:36.211Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/object-diagram-(uml)</loc>
    <lastmod>2026-06-18T16:27:34.087Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/one's-complement</loc>
    <lastmod>2026-06-18T16:27:36.211Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/one-time-pad</loc>
    <lastmod>2026-06-18T16:27:36.211Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/one-time-password</loc>
    <lastmod>2026-06-18T16:27:34.547Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/one-way-function</loc>
    <lastmod>2026-06-18T16:27:35.383Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/online-transaction-processing</loc>
    <lastmod>2026-06-18T16:27:34.463Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/open-addressing</loc>
    <lastmod>2026-06-18T16:27:36.211Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/open-closed-principle</loc>
    <lastmod>2026-06-18T16:27:35.103Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/operation-(uml-class)</loc>
    <lastmod>2026-06-18T16:27:34.983Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/operation-syntax-(uml-class)</loc>
    <lastmod>2026-06-18T16:27:36.211Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/opt-fragment-(uml-sequence)</loc>
    <lastmod>2026-06-18T16:27:36.211Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/order-(heap)</loc>
    <lastmod>2026-06-18T16:27:35.347Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/order-of-quantifiers</loc>
    <lastmod>2026-06-18T16:27:36.211Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/ordered-tree</loc>
    <lastmod>2026-06-18T16:27:36.215Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/ordered-pair</loc>
    <lastmod>2026-06-18T16:27:36.215Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/outcome-(game-theory)</loc>
    <lastmod>2026-06-18T16:27:34.247Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/outer-join-(sql)</loc>
    <lastmod>2026-06-18T16:27:36.215Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/output-feedback-(ofb)</loc>
    <lastmod>2026-06-18T16:27:36.215Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/overfitting</loc>
    <lastmod>2026-06-18T16:27:36.215Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/overlapped-access</loc>
    <lastmod>2026-06-18T16:27:36.215Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/pca-algorithm</loc>
    <lastmod>2026-06-18T16:27:36.215Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/project-(relational-algebra)</loc>
    <lastmod>2026-06-18T16:27:36.215Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/page-(paging)</loc>
    <lastmod>2026-06-18T16:27:35.115Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/page-fault</loc>
    <lastmod>2026-06-18T16:27:34.279Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/pair-programming</loc>
    <lastmod>2026-06-18T16:27:36.215Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/parallelisation-node-(uml-state-machine)</loc>
    <lastmod>2026-06-18T16:27:36.215Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/pareto-optimal</loc>
    <lastmod>2026-06-18T16:27:34.115Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/partial-function</loc>
    <lastmod>2026-06-18T16:27:34.919Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/partial-key</loc>
    <lastmod>2026-06-18T16:27:34.103Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/partial-order</loc>
    <lastmod>2026-06-18T16:27:36.215Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/partition-testing</loc>
    <lastmod>2026-06-18T16:27:36.215Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/parwise</loc>
    <lastmod>2026-06-18T16:27:36.215Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/pascal's-triangle</loc>
    <lastmod>2026-06-18T16:27:36.215Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/passive-attacks</loc>
    <lastmod>2026-06-18T16:27:36.215Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/passive-traffic-analysis</loc>
    <lastmod>2026-06-18T16:27:34.147Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/passphrases</loc>
    <lastmod>2026-06-18T16:27:35.407Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/password-ageing</loc>
    <lastmod>2026-06-18T16:27:33.971Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/path-coverage</loc>
    <lastmod>2026-06-18T16:27:35.051Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/path</loc>
    <lastmod>2026-06-18T16:27:34.011Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/pattern-matching-(sql)</loc>
    <lastmod>2026-06-18T16:27:36.215Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/pendant-vertex</loc>
    <lastmod>2026-06-18T16:27:36.215Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/personal-identification-number</loc>
    <lastmod>2026-06-18T16:27:34.843Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/phishing</loc>
    <lastmod>2026-06-18T16:27:36.215Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/physical-data-models</loc>
    <lastmod>2026-06-18T16:27:36.215Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/pigeonhole-principle</loc>
    <lastmod>2026-06-18T16:27:34.443Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/ping-of-death</loc>
    <lastmod>2026-06-18T16:27:36.215Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/plaintext</loc>
    <lastmod>2026-06-18T16:27:34.535Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/plan-driven-development</loc>
    <lastmod>2026-06-18T16:27:36.215Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/planning-poker</loc>
    <lastmod>2026-06-18T16:27:36.215Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/plausible-deniability</loc>
    <lastmod>2026-06-18T16:27:34.055Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/playfair-cipher</loc>
    <lastmod>2026-06-18T16:27:36.215Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/playoff-matrix</loc>
    <lastmod>2026-06-18T16:27:34.919Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/policy-(ai)</loc>
    <lastmod>2026-06-18T16:27:34.023Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/policy-iteration-(using-approximate-evaluation)</loc>
    <lastmod>2026-06-18T16:27:33.811Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/policy-iteration</loc>
    <lastmod>2026-06-18T16:27:33.939Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/polyadic-predicate</loc>
    <lastmod>2026-06-18T16:27:36.215Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/polyalphabetic-substitution-cipher</loc>
    <lastmod>2026-06-18T16:27:34.227Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/polynomial-reduction</loc>
    <lastmod>2026-06-18T16:27:35.359Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/polynomial-time-(p)</loc>
    <lastmod>2026-06-18T16:27:34.327Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/position</loc>
    <lastmod>2026-06-18T16:27:36.215Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/posterior-marginal</loc>
    <lastmod>2026-06-18T16:27:35.499Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/postfix-notation</loc>
    <lastmod>2026-06-18T16:27:36.215Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/postorder-traversal</loc>
    <lastmod>2026-06-18T16:27:36.215Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/power-set</loc>
    <lastmod>2026-06-18T16:27:36.215Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/pre-fetching</loc>
    <lastmod>2026-06-18T16:27:34.379Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/precision</loc>
    <lastmod>2026-06-18T16:27:35.115Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/predicate</loc>
    <lastmod>2026-06-18T16:27:34.347Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/preemptive-multitasking</loc>
    <lastmod>2026-06-18T16:27:33.923Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/prefix-notation</loc>
    <lastmod>2026-06-18T16:27:36.215Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/prefix</loc>
    <lastmod>2026-06-18T16:27:36.215Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/premise</loc>
    <lastmod>2026-06-18T16:27:36.215Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/prenex-normal-form</loc>
    <lastmod>2026-06-18T16:27:36.215Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/preorder-traversal</loc>
    <lastmod>2026-06-18T16:27:36.215Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/prescriptive-statement</loc>
    <lastmod>2026-06-18T16:27:35.487Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/prim's-spanning-tree-algorithm</loc>
    <lastmod>2026-06-18T16:27:33.995Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/primary-key-(databases)</loc>
    <lastmod>2026-06-18T16:27:34.443Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/prime-factorisation</loc>
    <lastmod>2026-06-18T16:27:34.495Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/prime-attribute-(databases)</loc>
    <lastmod>2026-06-18T16:27:35.215Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/primitive-operations</loc>
    <lastmod>2026-06-18T16:27:34.695Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/primitive-root</loc>
    <lastmod>2026-06-18T16:27:33.827Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/principal-component-analysis</loc>
    <lastmod>2026-06-18T16:27:34.847Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/principle-of-equivalence-of-hardware-and-software</loc>
    <lastmod>2026-06-18T16:27:36.215Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/prior-sampling</loc>
    <lastmod>2026-06-18T16:27:36.215Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/priority-queue-(adt)</loc>
    <lastmod>2026-06-18T16:27:36.215Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/priority-queue</loc>
    <lastmod>2026-06-18T16:27:34.911Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/privacy</loc>
    <lastmod>2026-06-18T16:27:34.891Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/privity-of-contract</loc>
    <lastmod>2026-06-18T16:27:36.215Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/probability-mass-function</loc>
    <lastmod>2026-06-18T16:27:34.243Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/probability-measure</loc>
    <lastmod>2026-06-18T16:27:35.627Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/probability-distribution</loc>
    <lastmod>2026-06-18T16:27:34.175Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/probability-of-an-event</loc>
    <lastmod>2026-06-18T16:27:36.215Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/probability-space</loc>
    <lastmod>2026-06-18T16:27:34.655Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/process-(cpu)</loc>
    <lastmod>2026-06-18T16:27:34.379Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/process-(software-engineering)</loc>
    <lastmod>2026-06-18T16:27:35.575Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/process-control-block-(data-structure)</loc>
    <lastmod>2026-06-18T16:27:34.167Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/product-cipher</loc>
    <lastmod>2026-06-18T16:27:33.875Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/product-based-product-development</loc>
    <lastmod>2026-06-18T16:27:36.215Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/professional</loc>
    <lastmod>2026-06-18T16:27:36.215Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/program-counter-(register)</loc>
    <lastmod>2026-06-18T16:27:36.215Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/program-data-independence</loc>
    <lastmod>2026-06-18T16:27:35.015Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/programming-languages</loc>
    <lastmod>2026-06-18T16:27:34.003Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/programming-paradigm</loc>
    <lastmod>2026-06-18T16:27:33.927Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/project-manager</loc>
    <lastmod>2026-06-18T16:27:34.943Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/project-planning</loc>
    <lastmod>2026-06-18T16:27:36.215Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/project-based-software-development</loc>
    <lastmod>2026-06-18T16:27:36.215Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/project</loc>
    <lastmod>2026-06-18T16:27:36.215Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/prolog</loc>
    <lastmod>2026-06-18T16:27:34.395Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/proof-by-induction</loc>
    <lastmod>2026-06-18T16:27:34.919Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/proof-by-strong-induction</loc>
    <lastmod>2026-06-18T16:27:34.471Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/proof-by-cases</loc>
    <lastmod>2026-06-18T16:27:34.551Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/proof-by-contradiction</loc>
    <lastmod>2026-06-18T16:27:34.695Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/proof-by-contraposition</loc>
    <lastmod>2026-06-18T16:27:35.367Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/proof-sequence</loc>
    <lastmod>2026-06-18T16:27:36.219Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/proof</loc>
    <lastmod>2026-06-18T16:27:36.219Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/proper-policy</loc>
    <lastmod>2026-06-18T16:27:34.819Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/proper-subset</loc>
    <lastmod>2026-06-18T16:27:36.219Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/properties-of-euler-totient-function</loc>
    <lastmod>2026-06-18T16:27:34.203Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/proposition</loc>
    <lastmod>2026-06-18T16:27:35.371Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/propositional-logic</loc>
    <lastmod>2026-06-18T16:27:36.219Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/propositional-definite-clause-program</loc>
    <lastmod>2026-06-18T16:27:34.207Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/protective-mutator</loc>
    <lastmod>2026-06-18T16:27:36.219Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/protocol-syntax-(cryptography)</loc>
    <lastmod>2026-06-18T16:27:34.547Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/protocol</loc>
    <lastmod>2026-06-18T16:27:35.055Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/pseudo-code</loc>
    <lastmod>2026-06-18T16:27:34.311Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/pull-up-attribute-refactoring</loc>
    <lastmod>2026-06-18T16:27:36.219Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/pushdown-automata</loc>
    <lastmod>2026-06-18T16:27:34.343Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/qualification-of-relation-names-(sql)</loc>
    <lastmod>2026-06-18T16:27:36.219Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/quantification</loc>
    <lastmod>2026-06-18T16:27:33.903Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/quantifier-replacement-rules</loc>
    <lastmod>2026-06-18T16:27:36.219Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/query-steps-(sql)</loc>
    <lastmod>2026-06-18T16:27:36.219Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/queue-(adt)</loc>
    <lastmod>2026-06-18T16:27:36.219Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/r-approximable-problem</loc>
    <lastmod>2026-06-18T16:27:34.219Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/rename-(relational-algebra)</loc>
    <lastmod>2026-06-18T16:27:36.219Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/roc-curve</loc>
    <lastmod>2026-06-18T16:27:36.219Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/rot13</loc>
    <lastmod>2026-06-18T16:27:33.923Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/rsa-algorithm</loc>
    <lastmod>2026-06-18T16:27:33.935Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/radix-notation</loc>
    <lastmod>2026-06-18T16:27:36.219Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/rail-fence-cipher</loc>
    <lastmod>2026-06-18T16:27:36.219Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/random-access-machine-model</loc>
    <lastmod>2026-06-18T16:27:36.219Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/random-access-memory</loc>
    <lastmod>2026-06-18T16:27:35.171Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/random-variable</loc>
    <lastmod>2026-06-18T16:27:34.775Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/range-of-a-function</loc>
    <lastmod>2026-06-18T16:27:36.219Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/rapid-software-development</loc>
    <lastmod>2026-06-18T16:27:36.219Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/rational-agent</loc>
    <lastmod>2026-06-18T16:27:34.519Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/realm-(kerberos)</loc>
    <lastmod>2026-06-18T16:27:36.219Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/recurrent-nn</loc>
    <lastmod>2026-06-18T16:27:34.183Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/recursion-trace</loc>
    <lastmod>2026-06-18T16:27:36.219Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/recursion</loc>
    <lastmod>2026-06-18T16:27:36.219Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/recursive-calls</loc>
    <lastmod>2026-06-18T16:27:34.611Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/recursive-relationship-type</loc>
    <lastmod>2026-06-18T16:27:35.123Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/recursive-set-description</loc>
    <lastmod>2026-06-18T16:27:36.219Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/reduced-instruction-set-computer</loc>
    <lastmod>2026-06-18T16:27:36.219Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/reduced-set-of-residues</loc>
    <lastmod>2026-06-18T16:27:34.771Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/refactoring</loc>
    <lastmod>2026-06-18T16:27:33.859Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/referential-integrity-options-(sql)</loc>
    <lastmod>2026-06-18T16:27:36.219Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/referential-integrity</loc>
    <lastmod>2026-06-18T16:27:36.219Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/reflexive-relation</loc>
    <lastmod>2026-06-18T16:27:34.479Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/register-transfer-language</loc>
    <lastmod>2026-06-18T16:27:36.219Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/register</loc>
    <lastmod>2026-06-18T16:27:36.219Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/regression-problem-(ai)</loc>
    <lastmod>2026-06-18T16:27:34.791Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/regression-testing</loc>
    <lastmod>2026-06-18T16:27:34.603Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/regression</loc>
    <lastmod>2026-06-18T16:27:35.243Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/regular-language</loc>
    <lastmod>2026-06-18T16:27:35.211Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/regular-expression</loc>
    <lastmod>2026-06-18T16:27:35.635Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/rehashing-(hashing)</loc>
    <lastmod>2026-06-18T16:27:36.219Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/reinforcement-learning</loc>
    <lastmod>2026-06-18T16:27:33.799Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/rejection-sampling</loc>
    <lastmod>2026-06-18T16:27:35.559Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/relation-(databases)</loc>
    <lastmod>2026-06-18T16:27:35.007Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/relation-on-a-set</loc>
    <lastmod>2026-06-18T16:27:36.219Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/relational-algebra-expression</loc>
    <lastmod>2026-06-18T16:27:36.219Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/relational-algebra-operations</loc>
    <lastmod>2026-06-18T16:27:36.219Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/relational-algebra</loc>
    <lastmod>2026-06-18T16:27:36.219Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/relational-data-model</loc>
    <lastmod>2026-06-18T16:27:36.219Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/relational-database-schema</loc>
    <lastmod>2026-06-18T16:27:36.219Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/relational-database-state</loc>
    <lastmod>2026-06-18T16:27:35.407Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/relationship-set</loc>
    <lastmod>2026-06-18T16:27:34.823Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/relationship-type</loc>
    <lastmod>2026-06-18T16:27:36.219Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/relationship</loc>
    <lastmod>2026-06-18T16:27:36.219Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/relationships-between-quantifiers</loc>
    <lastmod>2026-06-18T16:27:36.219Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/relatively-prime-numbers</loc>
    <lastmod>2026-06-18T16:27:35.167Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/release-management</loc>
    <lastmod>2026-06-18T16:27:34.803Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/release-phase</loc>
    <lastmod>2026-06-18T16:27:34.431Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/release</loc>
    <lastmod>2026-06-18T16:27:34.103Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/remainder-(modular-arithmetic-notation)</loc>
    <lastmod>2026-06-18T16:27:35.243Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/renaming-quantified-variables</loc>
    <lastmod>2026-06-18T16:27:36.219Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/repetition</loc>
    <lastmod>2026-06-18T16:27:36.219Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/replacement-policy</loc>
    <lastmod>2026-06-18T16:27:34.163Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/repository</loc>
    <lastmod>2026-06-18T16:27:34.911Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/requirement</loc>
    <lastmod>2026-06-18T16:27:34.927Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/requirements-engineering</loc>
    <lastmod>2026-06-18T16:27:34.871Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/reserved-keywords-(sql)</loc>
    <lastmod>2026-06-18T16:27:36.219Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/reserved-keyword</loc>
    <lastmod>2026-06-18T16:27:36.219Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/residual-capacity-of-a-reverse-edge</loc>
    <lastmod>2026-06-18T16:27:36.219Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/residual-capacity-of-an-edge</loc>
    <lastmod>2026-06-18T16:27:36.219Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/residual-edge</loc>
    <lastmod>2026-06-18T16:27:35.271Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/residual-network</loc>
    <lastmod>2026-06-18T16:27:34.471Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/resolution-algorithm</loc>
    <lastmod>2026-06-18T16:27:36.219Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/response-message-(uml-sequence)</loc>
    <lastmod>2026-06-18T16:27:36.219Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/retrospective</loc>
    <lastmod>2026-06-18T16:27:34.391Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/reward-(ai)</loc>
    <lastmod>2026-06-18T16:27:34.731Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/right-outer-join-(sql)</loc>
    <lastmod>2026-06-18T16:27:36.219Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/risk-management</loc>
    <lastmod>2026-06-18T16:27:34.359Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/rivest-shamir-aldeman-block-cipher</loc>
    <lastmod>2026-06-18T16:27:34.351Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/rivest-shamir-adleman-(rsa)-cryptosystem</loc>
    <lastmod>2026-06-18T16:27:34.523Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/role-(uml-class)</loc>
    <lastmod>2026-06-18T16:27:36.223Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/root-mean-squared-error</loc>
    <lastmod>2026-06-18T16:27:34.843Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/rooted-tree</loc>
    <lastmod>2026-06-18T16:27:36.223Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/rule</loc>
    <lastmod>2026-06-18T16:27:34.055Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/run-(environment)</loc>
    <lastmod>2026-06-18T16:27:34.063Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/select-(relational-algebra)</loc>
    <lastmod>2026-06-18T16:27:36.223Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/smart</loc>
    <lastmod>2026-06-18T16:27:35.419Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/solid</loc>
    <lastmod>2026-06-18T16:27:33.959Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/sql-injection</loc>
    <lastmod>2026-06-18T16:27:36.223Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/sql</loc>
    <lastmod>2026-06-18T16:27:35.299Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/ssl-hijacking</loc>
    <lastmod>2026-06-18T16:27:36.223Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/sale-contract</loc>
    <lastmod>2026-06-18T16:27:36.223Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/sample-space</loc>
    <lastmod>2026-06-18T16:27:35.671Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/satisfaction-of-a-formula</loc>
    <lastmod>2026-06-18T16:27:36.223Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/satisfiable-(predicate-logic)</loc>
    <lastmod>2026-06-18T16:27:35.403Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/satisfiable</loc>
    <lastmod>2026-06-18T16:27:34.375Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/saturated-edge</loc>
    <lastmod>2026-06-18T16:27:34.595Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/scale-(issue-affecting-software)</loc>
    <lastmod>2026-06-18T16:27:33.847Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/schema-construct</loc>
    <lastmod>2026-06-18T16:27:34.963Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/schema-diagram</loc>
    <lastmod>2026-06-18T16:27:34.743Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/schema</loc>
    <lastmod>2026-06-18T16:27:36.223Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/scientific-notation</loc>
    <lastmod>2026-06-18T16:27:36.223Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/scope-(quantifiers)</loc>
    <lastmod>2026-06-18T16:27:35.427Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/scopeboxing</loc>
    <lastmod>2026-06-18T16:27:36.223Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/scrum</loc>
    <lastmod>2026-06-18T16:27:36.223Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/second-normal-form-(databases)</loc>
    <lastmod>2026-06-18T16:27:34.063Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/secrecy-(digital-signatures)</loc>
    <lastmod>2026-06-18T16:27:33.859Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/secrecy-(public-key-cryptosystem)</loc>
    <lastmod>2026-06-18T16:27:33.835Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/security-and-trust-(issue-affecting-software)</loc>
    <lastmod>2026-06-18T16:27:35.187Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/security-protocol</loc>
    <lastmod>2026-06-18T16:27:34.747Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/select-query-(sql)</loc>
    <lastmod>2026-06-18T16:27:36.223Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/semantic-integrity-constraint-(databases)</loc>
    <lastmod>2026-06-18T16:27:36.223Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/semantic-of-fol</loc>
    <lastmod>2026-06-18T16:27:34.071Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/semantics</loc>
    <lastmod>2026-06-18T16:27:35.355Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/sensitivity</loc>
    <lastmod>2026-06-18T16:27:34.963Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/sentence-(quantifiers)</loc>
    <lastmod>2026-06-18T16:27:34.519Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/separate-chaining</loc>
    <lastmod>2026-06-18T16:27:36.223Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/sequence-diagram-(uml)</loc>
    <lastmod>2026-06-18T16:27:36.223Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/sequence</loc>
    <lastmod>2026-06-18T16:27:36.223Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/sequential-locality</loc>
    <lastmod>2026-06-18T16:27:36.223Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/session-hijacking</loc>
    <lastmod>2026-06-18T16:27:36.223Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/set-operations-(sql)</loc>
    <lastmod>2026-06-18T16:27:36.223Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/set-member</loc>
    <lastmod>2026-06-18T16:27:35.183Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/set-of-all-integers</loc>
    <lastmod>2026-06-18T16:27:36.223Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/set-of-all-models</loc>
    <lastmod>2026-06-18T16:27:36.223Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/set-of-natural-numbers</loc>
    <lastmod>2026-06-18T16:27:36.223Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/set-of-positive-natural-numbers</loc>
    <lastmod>2026-06-18T16:27:36.223Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/set-of-positive-real-numbers</loc>
    <lastmod>2026-06-18T16:27:36.223Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/set-of-rational-numbers</loc>
    <lastmod>2026-06-18T16:27:36.223Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/set-of-real-numbers</loc>
    <lastmod>2026-06-18T16:27:36.223Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/set-operation-(absolute-complement)</loc>
    <lastmod>2026-06-18T16:27:36.223Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/set-operation-(difference)</loc>
    <lastmod>2026-06-18T16:27:36.223Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/set-operation-(intersection)</loc>
    <lastmod>2026-06-18T16:27:36.223Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/set-operation-(union)</loc>
    <lastmod>2026-06-18T16:27:36.223Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/set-associative-cache</loc>
    <lastmod>2026-06-18T16:27:36.223Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/set</loc>
    <lastmod>2026-06-18T16:27:36.223Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/seven-sins-of-the-specifier</loc>
    <lastmod>2026-06-18T16:27:34.799Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/shared-aggregation-(uml-class)</loc>
    <lastmod>2026-06-18T16:27:36.223Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/shared-phenomena</loc>
    <lastmod>2026-06-18T16:27:34.495Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/shortest-path</loc>
    <lastmod>2026-06-18T16:27:34.719Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/shortest-path-weight</loc>
    <lastmod>2026-06-18T16:27:34.167Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/shoulder-surfing</loc>
    <lastmod>2026-06-18T16:27:36.223Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/signed-magnitude-binary</loc>
    <lastmod>2026-06-18T16:27:36.223Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/signing-procedure-(digital-signatures)</loc>
    <lastmod>2026-06-18T16:27:35.147Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/similarity-(agglomerative-clustering)</loc>
    <lastmod>2026-06-18T16:27:36.223Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/simple-linear-regression</loc>
    <lastmod>2026-06-18T16:27:34.915Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/simple-attribute</loc>
    <lastmod>2026-06-18T16:27:36.223Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/simple-cycle</loc>
    <lastmod>2026-06-18T16:27:36.223Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/simple-path</loc>
    <lastmod>2026-06-18T16:27:36.223Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/single-responsibility-principle</loc>
    <lastmod>2026-06-18T16:27:33.843Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/single-tasking</loc>
    <lastmod>2026-06-18T16:27:34.103Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/single-valued-attribute</loc>
    <lastmod>2026-06-18T16:27:36.223Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/singleton</loc>
    <lastmod>2026-06-18T16:27:36.223Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/singly-linked-list</loc>
    <lastmod>2026-06-18T16:27:36.227Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/situation</loc>
    <lastmod>2026-06-18T16:27:36.227Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/six-fundamental-principles-for-military-ciphers</loc>
    <lastmod>2026-06-18T16:27:34.087Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/slow-loris</loc>
    <lastmod>2026-06-18T16:27:36.227Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/small-step-semantics</loc>
    <lastmod>2026-06-18T16:27:35.287Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/social-welfare-(rational-behaviour)</loc>
    <lastmod>2026-06-18T16:27:35.399Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/social-engineering</loc>
    <lastmod>2026-06-18T16:27:34.015Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/software-design</loc>
    <lastmod>2026-06-18T16:27:35.043Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/software-engineering</loc>
    <lastmod>2026-06-18T16:27:33.979Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/software-process</loc>
    <lastmod>2026-06-18T16:27:33.851Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/software-configuration-item</loc>
    <lastmod>2026-06-18T16:27:34.123Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/software-vulnerabilities</loc>
    <lastmod>2026-06-18T16:27:36.227Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/sorting-(sql)</loc>
    <lastmod>2026-06-18T16:27:36.227Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/soundness-of-a-proof-system</loc>
    <lastmod>2026-06-18T16:27:36.227Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/spacial-locality</loc>
    <lastmod>2026-06-18T16:27:36.227Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/spam-email</loc>
    <lastmod>2026-06-18T16:27:36.227Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/spanning-tree</loc>
    <lastmod>2026-06-18T16:27:36.227Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/sparsest-cut</loc>
    <lastmod>2026-06-18T16:27:35.491Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/sparsity-of-a-cut</loc>
    <lastmod>2026-06-18T16:27:34.739Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/stack-(adt)</loc>
    <lastmod>2026-06-18T16:27:36.227Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/stack-(memory)</loc>
    <lastmod>2026-06-18T16:27:34.907Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/stack-dynamic-lifetime</loc>
    <lastmod>2026-06-18T16:27:34.259Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/stack-frame</loc>
    <lastmod>2026-06-18T16:27:36.227Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/stack-architecture</loc>
    <lastmod>2026-06-18T16:27:36.227Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/stack</loc>
    <lastmod>2026-06-18T16:27:34.415Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/stages-in-requirements-analysis</loc>
    <lastmod>2026-06-18T16:27:36.227Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/stand-alone-applications</loc>
    <lastmod>2026-06-18T16:27:34.267Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/standard-deviation</loc>
    <lastmod>2026-06-18T16:27:34.419Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/standard-definition-of-conventional-encryption</loc>
    <lastmod>2026-06-18T16:27:35.435Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/state-(databases)</loc>
    <lastmod>2026-06-18T16:27:36.227Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/state-(uml-state-machine)</loc>
    <lastmod>2026-06-18T16:27:36.227Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/state-diagram-refactoring</loc>
    <lastmod>2026-06-18T16:27:36.227Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/state-machine-diagram-(uml)</loc>
    <lastmod>2026-06-18T16:27:36.227Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/state-machine-models</loc>
    <lastmod>2026-06-18T16:27:34.027Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/state-value-function</loc>
    <lastmod>2026-06-18T16:27:33.883Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/state-diagram-(uml)</loc>
    <lastmod>2026-06-18T16:27:34.255Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/state-transition-diagram</loc>
    <lastmod>2026-06-18T16:27:36.227Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/state-action-value-function</loc>
    <lastmod>2026-06-18T16:27:33.999Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/state</loc>
    <lastmod>2026-06-18T16:27:36.227Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/statement-coverage</loc>
    <lastmod>2026-06-18T16:27:35.287Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/static-(environment)</loc>
    <lastmod>2026-06-18T16:27:34.799Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/static-lifetime</loc>
    <lastmod>2026-06-18T16:27:35.323Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/static-scope</loc>
    <lastmod>2026-06-18T16:27:34.995Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/static-semantics</loc>
    <lastmod>2026-06-18T16:27:34.639Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/status-(register)</loc>
    <lastmod>2026-06-18T16:27:36.227Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/steganography</loc>
    <lastmod>2026-06-18T16:27:33.987Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/stepdown-rule</loc>
    <lastmod>2026-06-18T16:27:35.067Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/stochastic-(environment)</loc>
    <lastmod>2026-06-18T16:27:34.191Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/strategy-(design-pattern)</loc>
    <lastmod>2026-06-18T16:27:36.227Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/stream-cipher</loc>
    <lastmod>2026-06-18T16:27:36.227Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/strength-of-des-(and-triple-des)</loc>
    <lastmod>2026-06-18T16:27:35.339Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/strength-of-double-des</loc>
    <lastmod>2026-06-18T16:27:34.531Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/strength-of-homophonic-substitution-ciphers</loc>
    <lastmod>2026-06-18T16:27:35.579Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/strength-of-mono-alphabetic-substitution-ciphers</loc>
    <lastmod>2026-06-18T16:27:36.227Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/strength-of-one-time-pad</loc>
    <lastmod>2026-06-18T16:27:34.339Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/strength-of-polyalphabetic-substitution-ciphers</loc>
    <lastmod>2026-06-18T16:27:35.075Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/stress-testing</loc>
    <lastmod>2026-06-18T16:27:34.575Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/strict-fragment-(uml-sequence)</loc>
    <lastmod>2026-06-18T16:27:36.227Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/strong-domination-(strategy)</loc>
    <lastmod>2026-06-18T16:27:35.667Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/strongly-connected-component</loc>
    <lastmod>2026-06-18T16:27:34.099Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/sub-tuple-(databases)</loc>
    <lastmod>2026-06-18T16:27:34.491Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/subcomputation-box</loc>
    <lastmod>2026-06-18T16:27:36.227Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/subset</loc>
    <lastmod>2026-06-18T16:27:36.227Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/substitution-(cipher)</loc>
    <lastmod>2026-06-18T16:27:35.603Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/substitution</loc>
    <lastmod>2026-06-18T16:27:36.227Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/suffix</loc>
    <lastmod>2026-06-18T16:27:36.227Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/superkey-(databases)</loc>
    <lastmod>2026-06-18T16:27:36.227Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/supervised-learning</loc>
    <lastmod>2026-06-18T16:27:34.847Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/surjective-function</loc>
    <lastmod>2026-06-18T16:27:36.227Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/symmetric-cipher</loc>
    <lastmod>2026-06-18T16:27:34.603Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/symmetric-cryptosystem-model</loc>
    <lastmod>2026-06-18T16:27:36.227Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/symmetric-algorithms</loc>
    <lastmod>2026-06-18T16:27:34.699Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/symmetric-relation</loc>
    <lastmod>2026-06-18T16:27:36.227Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/symmetric-key-cryptography</loc>
    <lastmod>2026-06-18T16:27:36.227Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/synchronisation-node-(uml-state-machine)</loc>
    <lastmod>2026-06-18T16:27:36.227Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/synchronous-message-(uml-sequence)</loc>
    <lastmod>2026-06-18T16:27:36.227Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/syntax</loc>
    <lastmod>2026-06-18T16:27:34.263Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/synthetic-benchmark</loc>
    <lastmod>2026-06-18T16:27:36.227Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/system-(uml-use-case)</loc>
    <lastmod>2026-06-18T16:27:36.227Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/system-(end-to-end)-testing</loc>
    <lastmod>2026-06-18T16:27:35.563Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/system-bus</loc>
    <lastmod>2026-06-18T16:27:36.227Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/system-call</loc>
    <lastmod>2026-06-18T16:27:35.259Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/system-requirements</loc>
    <lastmod>2026-06-18T16:27:34.955Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/system-building</loc>
    <lastmod>2026-06-18T16:27:34.911Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/system-clock</loc>
    <lastmod>2026-06-18T16:27:36.227Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/system-testing-phase</loc>
    <lastmod>2026-06-18T16:27:34.587Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/systems-of-systems</loc>
    <lastmod>2026-06-18T16:27:34.119Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/tcp-syn-flood</loc>
    <lastmod>2026-06-18T16:27:36.231Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/tail-recursion</loc>
    <lastmod>2026-06-18T16:27:34.447Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/tailgating-(security)</loc>
    <lastmod>2026-06-18T16:27:36.231Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/task-(cpu)</loc>
    <lastmod>2026-06-18T16:27:34.515Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/task-(project-planning)</loc>
    <lastmod>2026-06-18T16:27:33.975Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/tautology</loc>
    <lastmod>2026-06-18T16:27:36.231Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/template-method-(design-pattern)</loc>
    <lastmod>2026-06-18T16:27:36.231Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/temporal-locality</loc>
    <lastmod>2026-06-18T16:27:36.231Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/terminals</loc>
    <lastmod>2026-06-18T16:27:33.859Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/terminate-node-(uml-state-machine)</loc>
    <lastmod>2026-06-18T16:27:36.231Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/terms-(predicate-logic)</loc>
    <lastmod>2026-06-18T16:27:36.231Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/test-case</loc>
    <lastmod>2026-06-18T16:27:34.539Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/test-set</loc>
    <lastmod>2026-06-18T16:27:33.963Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/test-suite</loc>
    <lastmod>2026-06-18T16:27:35.079Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/test-driven-development</loc>
    <lastmod>2026-06-18T16:27:36.231Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/testing-in-a-software-process</loc>
    <lastmod>2026-06-18T16:27:36.231Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/testing</loc>
    <lastmod>2026-06-18T16:27:35.083Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/the-entscheidungsproblem</loc>
    <lastmod>2026-06-18T16:27:34.231Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/the-halting-problem</loc>
    <lastmod>2026-06-18T16:27:35.131Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/the-law-of-demeter</loc>
    <lastmod>2026-06-18T16:27:36.231Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/the-master-theorem</loc>
    <lastmod>2026-06-18T16:27:34.319Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/the-pumping-lemma-(theorem)</loc>
    <lastmod>2026-06-18T16:27:34.291Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/the-product-rule</loc>
    <lastmod>2026-06-18T16:27:36.231Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/the-sum-rule</loc>
    <lastmod>2026-06-18T16:27:36.231Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/theorem</loc>
    <lastmod>2026-06-18T16:27:36.231Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/theta-join-(relational-operation)</loc>
    <lastmod>2026-06-18T16:27:36.231Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/third-normal-form-(databases))</loc>
    <lastmod>2026-06-18T16:27:36.231Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/thread-(os)</loc>
    <lastmod>2026-06-18T16:27:36.231Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/three-tier-client-server-architecture</loc>
    <lastmod>2026-06-18T16:27:36.231Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/time-constraints-(uml-sequence)</loc>
    <lastmod>2026-06-18T16:27:36.231Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/time-consuming-message-(uml-sequence)</loc>
    <lastmod>2026-06-18T16:27:36.231Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/timeboxing</loc>
    <lastmod>2026-06-18T16:27:36.231Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/timer-interrupt</loc>
    <lastmod>2026-06-18T16:27:33.875Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/timestep-(ai)</loc>
    <lastmod>2026-06-18T16:27:33.827Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/topological-sort-(algorithm)</loc>
    <lastmod>2026-06-18T16:27:35.571Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/topological-sort</loc>
    <lastmod>2026-06-18T16:27:36.231Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/total-order-relation</loc>
    <lastmod>2026-06-18T16:27:34.415Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/total-function</loc>
    <lastmod>2026-06-18T16:27:34.363Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/training-set</loc>
    <lastmod>2026-06-18T16:27:33.839Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/transition-(uml-state-machine)</loc>
    <lastmod>2026-06-18T16:27:36.231Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/transition-model</loc>
    <lastmod>2026-06-18T16:27:34.391Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/transition-system</loc>
    <lastmod>2026-06-18T16:27:33.911Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/transitive-functional-dependency-(databases)</loc>
    <lastmod>2026-06-18T16:27:36.231Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/transitive-closure</loc>
    <lastmod>2026-06-18T16:27:36.231Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/transitive-relation</loc>
    <lastmod>2026-06-18T16:27:36.231Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/transpose-graph</loc>
    <lastmod>2026-06-18T16:27:34.571Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/transposition-(cipher)</loc>
    <lastmod>2026-06-18T16:27:33.979Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/trapdoor-one-way-function</loc>
    <lastmod>2026-06-18T16:27:35.043Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/travelling-salesman-(decision)-problem</loc>
    <lastmod>2026-06-18T16:27:35.467Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/travelling-salesman-problem-(algorithm)</loc>
    <lastmod>2026-06-18T16:27:34.143Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/traversal-of-a-tree</loc>
    <lastmod>2026-06-18T16:27:36.231Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/tree-(adt)</loc>
    <lastmod>2026-06-18T16:27:36.231Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/tree</loc>
    <lastmod>2026-06-18T16:27:36.231Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/triangle-inequality</loc>
    <lastmod>2026-06-18T16:27:36.231Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/triple-des</loc>
    <lastmod>2026-06-18T16:27:36.231Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/trusted-third-party-(security)</loc>
    <lastmod>2026-06-18T16:27:36.231Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/trusted-agent</loc>
    <lastmod>2026-06-18T16:27:34.279Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/truth-function</loc>
    <lastmod>2026-06-18T16:27:36.231Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/tuple-(databases)</loc>
    <lastmod>2026-06-18T16:27:36.231Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/tuple</loc>
    <lastmod>2026-06-18T16:27:36.231Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/turing-machine</loc>
    <lastmod>2026-06-18T16:27:34.535Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/turing-test</loc>
    <lastmod>2026-06-18T16:27:34.431Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/turing-computable</loc>
    <lastmod>2026-06-18T16:27:35.419Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/turing-complete</loc>
    <lastmod>2026-06-18T16:27:35.535Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/two's-complement</loc>
    <lastmod>2026-06-18T16:27:36.231Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/type-1-virtual-machine</loc>
    <lastmod>2026-06-18T16:27:34.503Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/type-inference</loc>
    <lastmod>2026-06-18T16:27:34.267Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/uct-algorithm</loc>
    <lastmod>2026-06-18T16:27:35.035Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/udp-flood</loc>
    <lastmod>2026-06-18T16:27:36.231Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/uml-2.0</loc>
    <lastmod>2026-06-18T16:27:36.231Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/union-(relational-operation)</loc>
    <lastmod>2026-06-18T16:27:36.231Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/unapproximable-problem</loc>
    <lastmod>2026-06-18T16:27:34.671Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/unary-association-(uml-class)</loc>
    <lastmod>2026-06-18T16:27:36.235Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/unary-relational-operations</loc>
    <lastmod>2026-06-18T16:27:36.235Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/unconditional-security</loc>
    <lastmod>2026-06-18T16:27:35.175Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/underfitting</loc>
    <lastmod>2026-06-18T16:27:35.563Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/unicity-of-normal-forms</loc>
    <lastmod>2026-06-18T16:27:35.523Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/unification-problem</loc>
    <lastmod>2026-06-18T16:27:34.487Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/unifier</loc>
    <lastmod>2026-06-18T16:27:36.235Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/uniform-cost-search</loc>
    <lastmod>2026-06-18T16:27:36.235Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/uniform-distribution</loc>
    <lastmod>2026-06-18T16:27:36.235Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/uniform-substitution-of-formulae</loc>
    <lastmod>2026-06-18T16:27:36.235Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/union-(sql)</loc>
    <lastmod>2026-06-18T16:27:36.235Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/union-of-events</loc>
    <lastmod>2026-06-18T16:27:36.235Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/unit-tests</loc>
    <lastmod>2026-06-18T16:27:34.427Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/universal-generalisation</loc>
    <lastmod>2026-06-18T16:27:36.235Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/universal-instantiation</loc>
    <lastmod>2026-06-18T16:27:36.235Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/universal-quantifier</loc>
    <lastmod>2026-06-18T16:27:36.235Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/universal-set</loc>
    <lastmod>2026-06-18T16:27:36.235Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/unlinkability-(anonymity)</loc>
    <lastmod>2026-06-18T16:27:34.979Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/unobservability-(anonymity)</loc>
    <lastmod>2026-06-18T16:27:33.871Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/unsatisfiable-(predicate-logic)</loc>
    <lastmod>2026-06-18T16:27:34.171Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/unsupervised-learning</loc>
    <lastmod>2026-06-18T16:27:34.995Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/up-heap-bubbling</loc>
    <lastmod>2026-06-18T16:27:36.235Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/update-query-(sql)</loc>
    <lastmod>2026-06-18T16:27:36.235Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/update-violations-for-delete</loc>
    <lastmod>2026-06-18T16:27:36.235Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/update-violations-for-insert</loc>
    <lastmod>2026-06-18T16:27:36.235Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/update-violations-for-update-1</loc>
    <lastmod>2026-06-18T16:27:36.235Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/update-violations-for-update</loc>
    <lastmod>2026-06-18T16:27:36.235Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/use-cases-(uml-use-case)</loc>
    <lastmod>2026-06-18T16:27:36.235Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/use-case-description-structure</loc>
    <lastmod>2026-06-18T16:27:36.235Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/use-case-diagram-(uml)</loc>
    <lastmod>2026-06-18T16:27:36.235Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/user-story</loc>
    <lastmod>2026-06-18T16:27:33.847Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/user-testing</loc>
    <lastmod>2026-06-18T16:27:34.915Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/user-thread</loc>
    <lastmod>2026-06-18T16:27:35.387Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/user-requirement</loc>
    <lastmod>2026-06-18T16:27:34.963Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/utility</loc>
    <lastmod>2026-06-18T16:27:36.235Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/v-model</loc>
    <lastmod>2026-06-18T16:27:36.235Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/vacuous-quantification</loc>
    <lastmod>2026-06-18T16:27:36.235Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/valid-(predicate-logic)</loc>
    <lastmod>2026-06-18T16:27:33.891Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/valid-state-(database)</loc>
    <lastmod>2026-06-18T16:27:34.663Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/validation-testing</loc>
    <lastmod>2026-06-18T16:27:34.339Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/variable-(predicate-logic)</loc>
    <lastmod>2026-06-18T16:27:36.235Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/variable-scope</loc>
    <lastmod>2026-06-18T16:27:35.403Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/variable-types</loc>
    <lastmod>2026-06-18T16:27:34.695Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/variables</loc>
    <lastmod>2026-06-18T16:27:36.235Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/variance</loc>
    <lastmod>2026-06-18T16:27:35.195Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/variant-disjunction-elimination-rules</loc>
    <lastmod>2026-06-18T16:27:36.235Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/variant-implication-elimination-rules</loc>
    <lastmod>2026-06-18T16:27:36.235Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/variant-implication-introduction-rules</loc>
    <lastmod>2026-06-18T16:27:36.235Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/variant-negation-elimination-rules</loc>
    <lastmod>2026-06-18T16:27:36.235Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/velocity-tracking</loc>
    <lastmod>2026-06-18T16:27:33.951Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/verification-procedure-(digital-signatures)</loc>
    <lastmod>2026-06-18T16:27:34.735Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/vernam-cipher</loc>
    <lastmod>2026-06-18T16:27:36.235Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/version-management</loc>
    <lastmod>2026-06-18T16:27:35.227Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/version</loc>
    <lastmod>2026-06-18T16:27:35.179Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/vertex-cover</loc>
    <lastmod>2026-06-18T16:27:36.235Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/vertices</loc>
    <lastmod>2026-06-18T16:27:36.235Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/views-(sql)</loc>
    <lastmod>2026-06-18T16:27:36.235Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/vigen%C3%A8re-cipher</loc>
    <lastmod>2026-06-18T16:27:35.551Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/virtual-memory-(os)</loc>
    <lastmod>2026-06-18T16:27:34.499Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/virtual-memory</loc>
    <lastmod>2026-06-18T16:27:36.235Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/visitor-(design-pattern)</loc>
    <lastmod>2026-06-18T16:27:36.235Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/vocabulary-(predicate-logic)</loc>
    <lastmod>2026-06-18T16:27:36.235Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/voter-model</loc>
    <lastmod>2026-06-18T16:27:36.235Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/warshall's-algorithm</loc>
    <lastmod>2026-06-18T16:27:34.863Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/waterfall-model</loc>
    <lastmod>2026-06-18T16:27:36.235Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/watermarking</loc>
    <lastmod>2026-06-18T16:27:35.203Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/weak-authentication</loc>
    <lastmod>2026-06-18T16:27:33.855Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/weak-domination-(strategy)</loc>
    <lastmod>2026-06-18T16:27:35.567Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/weak-entity-type</loc>
    <lastmod>2026-06-18T16:27:36.235Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/weight-(path)</loc>
    <lastmod>2026-06-18T16:27:35.443Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/well-formed-formulae</loc>
    <lastmod>2026-06-18T16:27:36.235Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/white-box-testing</loc>
    <lastmod>2026-06-18T16:27:35.331Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/wi-fi-eavesdropping</loc>
    <lastmod>2026-06-18T16:27:36.239Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/wildcard-operator-(sql)</loc>
    <lastmod>2026-06-18T16:27:36.239Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/word-(memory)</loc>
    <lastmod>2026-06-18T16:27:34.899Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/word-(finite-automata)</loc>
    <lastmod>2026-06-18T16:27:36.239Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/word-addressable-memory</loc>
    <lastmod>2026-06-18T16:27:36.239Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/workspace</loc>
    <lastmod>2026-06-18T16:27:34.891Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/world-phenomena</loc>
    <lastmod>2026-06-18T16:27:34.939Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/write-back-cache</loc>
    <lastmod>2026-06-18T16:27:35.003Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/write-through-cache</loc>
    <lastmod>2026-06-18T16:27:34.299Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/zero-day-exploit</loc>
    <lastmod>2026-06-18T16:27:36.239Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/zero-error-probabilistic-polynomial-time-(zpp)</loc>
    <lastmod>2026-06-18T16:27:34.427Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/zero-knowledge-proof</loc>
    <lastmod>2026-06-18T16:27:34.463Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/zero-sum-game</loc>
    <lastmod>2026-06-18T16:27:36.239Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/acyclic</loc>
    <lastmod>2026-06-18T16:27:35.395Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/effective-relax-operation</loc>
    <lastmod>2026-06-18T16:27:34.447Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/entropy</loc>
    <lastmod>2026-06-18T16:27:35.223Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/k-means-(algorithm)</loc>
    <lastmod>2026-06-18T16:27:36.239Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/k-means-clustering---conflict</loc>
    <lastmod>2026-06-18T16:27:34.867Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/k-means-clustering</loc>
    <lastmod>2026-06-18T16:27:35.323Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/k-means++-algorithm</loc>
    <lastmod>2026-06-18T16:27:34.639Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/k-median-clustering</loc>
    <lastmod>2026-06-18T16:27:33.991Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/k-tuple</loc>
    <lastmod>2026-06-18T16:27:36.239Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/log2</loc>
    <lastmod>2026-06-18T16:27:35.427Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/pseudo-state</loc>
    <lastmod>2026-06-18T16:27:33.927Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/pure-literal</loc>
    <lastmod>2026-06-18T16:27:35.307Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/unit-clause</loc>
    <lastmod>2026-06-18T16:27:35.151Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/von-neumann-bottleneck</loc>
    <lastmod>2026-06-18T16:27:36.239Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/von-neumann-model</loc>
    <lastmod>2026-06-18T16:27:36.239Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1--and--2/4ccs1ela-elementary-logic-with-applications/202111151005</loc>
    <lastmod>2026-06-18T16:27:36.259Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1--and--2/4ccs1ela-elementary-logic-with-applications/</loc>
    <lastmod>2026-06-18T16:27:36.259Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1--and--2/4ccs1ela-elementary-logic-with-applications/supplemental-exercises/supplemental-exercise-list-1</loc>
    <lastmod>2026-06-18T16:27:36.259Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1--and--2/4ccs1ela-elementary-logic-with-applications/tutorials/confusion-matrix</loc>
    <lastmod>2026-06-18T16:27:36.259Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1--and--2/4ccs1ela-elementary-logic-with-applications/tutorials/tutorial-7</loc>
    <lastmod>2026-06-18T16:27:36.259Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1--and--2/4ccs1ela-elementary-logic-with-applications/tutorials/tutorial-8</loc>
    <lastmod>2026-06-18T16:27:36.259Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1--and--2/4ccs1ela-elementary-logic-with-applications/tutorials/tutorial-9</loc>
    <lastmod>2026-06-18T16:27:36.259Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1--and--2/4ccs1ela-elementary-logic-with-applications/week-3.-introduction-to-propositional-logic/1.-getting-started-with-propositional-logic</loc>
    <lastmod>2026-06-18T16:27:36.259Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1--and--2/4ccs1ela-elementary-logic-with-applications/week-3.-introduction-to-propositional-logic/2.-reading-and-evaluating-formulae</loc>
    <lastmod>2026-06-18T16:27:36.259Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1--and--2/4ccs1ela-elementary-logic-with-applications/week-3.-introduction-to-propositional-logic/202110211114-lgt</loc>
    <lastmod>2026-06-18T16:27:36.259Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1--and--2/4ccs1ela-elementary-logic-with-applications/week-3.-introduction-to-propositional-logic/3.-types-of-formula-and-logical-equivalence</loc>
    <lastmod>2026-06-18T16:27:36.259Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1--and--2/4ccs1ela-elementary-logic-with-applications/week-3.-introduction-to-propositional-logic/tutorial-list-1</loc>
    <lastmod>2026-06-18T16:27:36.259Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1--and--2/4ccs1ela-elementary-logic-with-applications/week-3.-introduction-to-propositional-logic/</loc>
    <lastmod>2026-06-18T16:27:36.263Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1--and--2/4ccs1ela-elementary-logic-with-applications/week-4.-syntactical-transformations/1.-transformations-using-logical-equivalence</loc>
    <lastmod>2026-06-18T16:27:36.263Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1--and--2/4ccs1ela-elementary-logic-with-applications/week-4.-syntactical-transformations/2.-disjunctive-normal-form</loc>
    <lastmod>2026-06-18T16:27:36.263Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1--and--2/4ccs1ela-elementary-logic-with-applications/week-4.-syntactical-transformations/202110181002-sgt</loc>
    <lastmod>2026-06-18T16:27:36.263Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1--and--2/4ccs1ela-elementary-logic-with-applications/week-4.-syntactical-transformations/3.-conjunctive-normal-form</loc>
    <lastmod>2026-06-18T16:27:36.263Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1--and--2/4ccs1ela-elementary-logic-with-applications/week-4.-syntactical-transformations/tutorial-list-2</loc>
    <lastmod>2026-06-18T16:27:36.263Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1--and--2/4ccs1ela-elementary-logic-with-applications/week-4.-syntactical-transformations/</loc>
    <lastmod>2026-06-18T16:27:36.263Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1--and--2/4ccs1ela-elementary-logic-with-applications/week-5.-important-semantical-notions/1.-complete-sets-of-connectives,-truth-functions-and-substitutions</loc>
    <lastmod>2026-06-18T16:27:36.263Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1--and--2/4ccs1ela-elementary-logic-with-applications/week-5.-important-semantical-notions/2.-quine's-method-and-satisfiability</loc>
    <lastmod>2026-06-18T16:27:36.263Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1--and--2/4ccs1ela-elementary-logic-with-applications/week-5.-important-semantical-notions/3.-logical-consequence</loc>
    <lastmod>2026-06-18T16:27:36.263Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1--and--2/4ccs1ela-elementary-logic-with-applications/week-5.-important-semantical-notions/tutorial-list-3</loc>
    <lastmod>2026-06-18T16:27:36.263Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1--and--2/4ccs1ela-elementary-logic-with-applications/week-5.-important-semantical-notions/</loc>
    <lastmod>2026-06-18T16:27:36.263Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1--and--2/4ccs1ela-elementary-logic-with-applications/week-6.-checking-the-validity-of-arguments/1.-introduction-to-informal-proofs</loc>
    <lastmod>2026-06-18T16:27:36.263Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1--and--2/4ccs1ela-elementary-logic-with-applications/week-6.-checking-the-validity-of-arguments/2.-forward-reasoning-systems</loc>
    <lastmod>2026-06-18T16:27:36.263Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1--and--2/4ccs1ela-elementary-logic-with-applications/week-6.-checking-the-validity-of-arguments/tutorial-list-4</loc>
    <lastmod>2026-06-18T16:27:36.263Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1--and--2/4ccs1ela-elementary-logic-with-applications/week-6.-checking-the-validity-of-arguments/</loc>
    <lastmod>2026-06-18T16:27:36.263Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1--and--2/4ccs1ela-elementary-logic-with-applications/week-7.-natural-deduction/1.-natural-deduction-rules</loc>
    <lastmod>2026-06-18T16:27:36.263Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1--and--2/4ccs1ela-elementary-logic-with-applications/week-7.-natural-deduction/2.-examples-using-the-basic-rules</loc>
    <lastmod>2026-06-18T16:27:36.263Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1--and--2/4ccs1ela-elementary-logic-with-applications/week-7.-natural-deduction/3.-introducing-variant-rules</loc>
    <lastmod>2026-06-18T16:27:36.263Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1--and--2/4ccs1ela-elementary-logic-with-applications/week-7.-natural-deduction/tutorial-list-5</loc>
    <lastmod>2026-06-18T16:27:36.263Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1--and--2/4ccs1ela-elementary-logic-with-applications/week-7.-natural-deduction/</loc>
    <lastmod>2026-06-18T16:27:36.263Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1--and--2/4ccs1ela-elementary-logic-with-applications/week-s2.1.-intro-to-predicate-logic</loc>
    <lastmod>2026-06-18T16:27:36.263Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1--and--2/4ccs1ela-elementary-logic-with-applications/week-s2.2.-logical-equivalence-and-syntactic-re-writing</loc>
    <lastmod>2026-06-18T16:27:36.263Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1--and--2/4ccs1ela-elementary-logic-with-applications/week-s2.3.-horn-clauses-and-logic-programming</loc>
    <lastmod>2026-06-18T16:27:36.263Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1--and--2/4ccs1ela-elementary-logic-with-applications/week-s2.4.-prenex-normal-form-and-unification</loc>
    <lastmod>2026-06-18T16:27:36.263Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1--and--2/4ccs1ela-elementary-logic-with-applications/week-s2.5.-recursion-and-negation-as-failure</loc>
    <lastmod>2026-06-18T16:27:36.263Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1--and--2/4ccs1ppa-programming-practice-and-applications/</loc>
    <lastmod>2026-06-18T16:27:36.263Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1--and--2/4ccs1ppa-programming-practice-and-applications/coursework/interactions</loc>
    <lastmod>2026-06-18T16:27:36.263Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1--and--2/4ccs1ppa-programming-practice-and-applications/coursework/story-draft</loc>
    <lastmod>2026-06-18T16:27:36.263Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1--and--2/4ccs1ppa-programming-practice-and-applications/week-1.-classes-and-objects/</loc>
    <lastmod>2026-06-18T16:27:36.263Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1--and--2/4ccs1ppa-programming-practice-and-applications/week-10.-functional-processing-of-collections/</loc>
    <lastmod>2026-06-18T16:27:36.263Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1--and--2/4ccs1ppa-programming-practice-and-applications/week-2.-understanding-class-definitions/</loc>
    <lastmod>2026-06-18T16:27:36.263Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1--and--2/4ccs1ppa-programming-practice-and-applications/week-3.-object-interaction/</loc>
    <lastmod>2026-06-18T16:27:36.263Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1--and--2/4ccs1ppa-programming-practice-and-applications/week-4.-grouping-objects/</loc>
    <lastmod>2026-06-18T16:27:36.263Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1--and--2/4ccs1ppa-programming-practice-and-applications/week-5.-iterating-over-collections/</loc>
    <lastmod>2026-06-18T16:27:36.263Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1cs1-computer-systems-1/202110290859</loc>
    <lastmod>2026-06-18T16:27:36.239Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1cs1-computer-systems-1/</loc>
    <lastmod>2026-06-18T16:27:36.239Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1cs1-computer-systems-1/past-paper/question-paper</loc>
    <lastmod>2026-06-18T16:27:36.239Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1cs1-computer-systems-1/week-1.-course-introduction/1.-what-is-a-computer-system</loc>
    <lastmod>2026-06-18T16:27:36.239Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1cs1-computer-systems-1/week-1.-course-introduction/2.-the-computer-hierarchy</loc>
    <lastmod>2026-06-18T16:27:36.239Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1cs1-computer-systems-1/week-1.-course-introduction/3.-how-to-measure-a-computer-system</loc>
    <lastmod>2026-06-18T16:27:36.239Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1cs1-computer-systems-1/week-1.-course-introduction/4.-the-von-neumann-model</loc>
    <lastmod>2026-06-18T16:27:36.239Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1cs1-computer-systems-1/week-1.-course-introduction/</loc>
    <lastmod>2026-06-18T16:27:36.239Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1cs1-computer-systems-1/week-10.-memory-hierarchy,-virtual-memory/1.-virtual-memory</loc>
    <lastmod>2026-06-18T16:27:36.239Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1cs1-computer-systems-1/week-10.-memory-hierarchy,-virtual-memory/2.-segmentation</loc>
    <lastmod>2026-06-18T16:27:36.239Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1cs1-computer-systems-1/week-10.-memory-hierarchy,-virtual-memory/3.-external-fragmentation</loc>
    <lastmod>2026-06-18T16:27:36.239Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1cs1-computer-systems-1/week-10.-memory-hierarchy,-virtual-memory/4.-paging</loc>
    <lastmod>2026-06-18T16:27:36.239Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1cs1-computer-systems-1/week-10.-memory-hierarchy,-virtual-memory/5.-internal-fragmentation</loc>
    <lastmod>2026-06-18T16:27:36.239Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1cs1-computer-systems-1/week-10.-memory-hierarchy,-virtual-memory/6.-eat-and-tlb</loc>
    <lastmod>2026-06-18T16:27:36.239Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1cs1-computer-systems-1/week-10.-memory-hierarchy,-virtual-memory/tutorial-work</loc>
    <lastmod>2026-06-18T16:27:36.239Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1cs1-computer-systems-1/week-10.-memory-hierarchy,-virtual-memory/</loc>
    <lastmod>2026-06-18T16:27:36.239Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1cs1-computer-systems-1/week-2.-binary-1/1.-overview</loc>
    <lastmod>2026-06-18T16:27:36.239Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1cs1-computer-systems-1/week-2.-binary-1/2.-positional-number-systems</loc>
    <lastmod>2026-06-18T16:27:36.239Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1cs1-computer-systems-1/week-2.-binary-1/3.-base-conversions</loc>
    <lastmod>2026-06-18T16:27:36.239Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1cs1-computer-systems-1/week-2.-binary-1/4.-fractional-components</loc>
    <lastmod>2026-06-18T16:27:36.239Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1cs1-computer-systems-1/week-2.-binary-1/5.-signed-magnitude-binary</loc>
    <lastmod>2026-06-18T16:27:36.239Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1cs1-computer-systems-1/week-2.-binary-1/6.-one's-complement-binary</loc>
    <lastmod>2026-06-18T16:27:36.239Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1cs1-computer-systems-1/week-2.-binary-1/7.-two's-complement-binary</loc>
    <lastmod>2026-06-18T16:27:36.239Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1cs1-computer-systems-1/week-2.-binary-1/8.-hexadecimal</loc>
    <lastmod>2026-06-18T16:27:36.239Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1cs1-computer-systems-1/week-2.-binary-1/9.-why-binary</loc>
    <lastmod>2026-06-18T16:27:36.239Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1cs1-computer-systems-1/week-2.-binary-1/</loc>
    <lastmod>2026-06-18T16:27:36.239Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1cs1-computer-systems-1/week-3.-binary-2/1.-unsigned-arithmetic</loc>
    <lastmod>2026-06-18T16:27:36.239Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1cs1-computer-systems-1/week-3.-binary-2/2.-signed-magnitude-arithmetic</loc>
    <lastmod>2026-06-18T16:27:36.243Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1cs1-computer-systems-1/week-3.-binary-2/3.-complement-arithmetic</loc>
    <lastmod>2026-06-18T16:27:36.243Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1cs1-computer-systems-1/week-3.-binary-2/tutorial-work</loc>
    <lastmod>2026-06-18T16:27:36.051Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1cs1-computer-systems-1/week-3.-binary-2/</loc>
    <lastmod>2026-06-18T16:27:36.243Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1cs1-computer-systems-1/week-4.-binary-3/1.-fixed-point-or-floating-point</loc>
    <lastmod>2026-06-18T16:27:36.243Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1cs1-computer-systems-1/week-4.-binary-3/2.-ieee-754-format</loc>
    <lastmod>2026-06-18T16:27:36.243Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1cs1-computer-systems-1/week-4.-binary-3/202110201103</loc>
    <lastmod>2026-06-18T16:27:36.243Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1cs1-computer-systems-1/week-4.-binary-3/3.-arithmetic-with-ieee-754-format</loc>
    <lastmod>2026-06-18T16:27:36.243Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1cs1-computer-systems-1/week-4.-binary-3/4.-range-and-precision</loc>
    <lastmod>2026-06-18T16:27:36.243Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1cs1-computer-systems-1/week-4.-binary-3/5.-accuracy</loc>
    <lastmod>2026-06-18T16:27:36.243Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1cs1-computer-systems-1/week-4.-binary-3/tutorial-work</loc>
    <lastmod>2026-06-18T16:27:35.967Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1cs1-computer-systems-1/week-4.-binary-3/</loc>
    <lastmod>2026-06-18T16:27:36.243Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1cs1-computer-systems-1/week-5.-assembly-1/1-2.-computer-components</loc>
    <lastmod>2026-06-18T16:27:36.243Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1cs1-computer-systems-1/week-5.-assembly-1/3-4.-marie</loc>
    <lastmod>2026-06-18T16:27:36.243Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1cs1-computer-systems-1/week-5.-assembly-1/tutorial-work</loc>
    <lastmod>2026-06-18T16:27:36.243Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1cs1-computer-systems-1/week-5.-assembly-1/</loc>
    <lastmod>2026-06-18T16:27:36.243Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1cs1-computer-systems-1/week-6.-assembly-2/1.-instruction-processing-and-interrupts</loc>
    <lastmod>2026-06-18T16:27:36.243Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1cs1-computer-systems-1/week-6.-assembly-2/2.-tracing-a-simple-marie-program</loc>
    <lastmod>2026-06-18T16:27:36.243Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1cs1-computer-systems-1/week-6.-assembly-2/3.-assemblers</loc>
    <lastmod>2026-06-18T16:27:36.243Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1cs1-computer-systems-1/week-6.-assembly-2/4.-extending-the-marie-instruction-set</loc>
    <lastmod>2026-06-18T16:27:36.243Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1cs1-computer-systems-1/week-6.-assembly-2/5.-sample-programming-constructs</loc>
    <lastmod>2026-06-18T16:27:36.243Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1cs1-computer-systems-1/week-6.-assembly-2/tutorial-work</loc>
    <lastmod>2026-06-18T16:27:36.243Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1cs1-computer-systems-1/week-6.-assembly-2/</loc>
    <lastmod>2026-06-18T16:27:36.243Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1cs1-computer-systems-1/week-7.-isas-and-pipelining/1.-designing-isas</loc>
    <lastmod>2026-06-18T16:27:36.243Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1cs1-computer-systems-1/week-7.-isas-and-pipelining/2.-endianness</loc>
    <lastmod>2026-06-18T16:27:36.243Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1cs1-computer-systems-1/week-7.-isas-and-pipelining/3.-register-architectures</loc>
    <lastmod>2026-06-18T16:27:36.243Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1cs1-computer-systems-1/week-7.-isas-and-pipelining/4.-instruction-types</loc>
    <lastmod>2026-06-18T16:27:36.243Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1cs1-computer-systems-1/week-7.-isas-and-pipelining/5.-addressing</loc>
    <lastmod>2026-06-18T16:27:36.243Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1cs1-computer-systems-1/week-7.-isas-and-pipelining/6.-pipelining</loc>
    <lastmod>2026-06-18T16:27:36.243Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1cs1-computer-systems-1/week-7.-isas-and-pipelining/tutorial-work</loc>
    <lastmod>2026-06-18T16:27:36.243Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1cs1-computer-systems-1/week-7.-isas-and-pipelining/</loc>
    <lastmod>2026-06-18T16:27:36.243Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1cs1-computer-systems-1/week-8.-performance-measurement-and-analysis/1.-what-is-benchmarking</loc>
    <lastmod>2026-06-18T16:27:36.243Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1cs1-computer-systems-1/week-8.-performance-measurement-and-analysis/2.-benchmark-examples</loc>
    <lastmod>2026-06-18T16:27:36.243Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1cs1-computer-systems-1/week-8.-performance-measurement-and-analysis/3.-risc-vs-cisc</loc>
    <lastmod>2026-06-18T16:27:36.243Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1cs1-computer-systems-1/week-8.-performance-measurement-and-analysis/4.-branch-optimisations-and-code-optimisations</loc>
    <lastmod>2026-06-18T16:27:36.243Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1cs1-computer-systems-1/week-8.-performance-measurement-and-analysis/5.-caching</loc>
    <lastmod>2026-06-18T16:27:36.243Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1cs1-computer-systems-1/week-8.-performance-measurement-and-analysis/tutorial-work</loc>
    <lastmod>2026-06-18T16:27:36.243Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1cs1-computer-systems-1/week-8.-performance-measurement-and-analysis/</loc>
    <lastmod>2026-06-18T16:27:36.243Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1cs1-computer-systems-1/week-9.-memory-hierarchy-and-cache-systems/1.-memory-addresses</loc>
    <lastmod>2026-06-18T16:27:36.243Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1cs1-computer-systems-1/week-9.-memory-hierarchy-and-cache-systems/2.-memory-hierarchy</loc>
    <lastmod>2026-06-18T16:27:36.243Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1cs1-computer-systems-1/week-9.-memory-hierarchy-and-cache-systems/3.-effective-access-time</loc>
    <lastmod>2026-06-18T16:27:36.243Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1cs1-computer-systems-1/week-9.-memory-hierarchy-and-cache-systems/4.-direct-mapped-cache</loc>
    <lastmod>2026-06-18T16:27:36.243Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1cs1-computer-systems-1/week-9.-memory-hierarchy-and-cache-systems/5.-fully-associative-cache</loc>
    <lastmod>2026-06-18T16:27:36.243Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1cs1-computer-systems-1/week-9.-memory-hierarchy-and-cache-systems/6.-set-associative-cache</loc>
    <lastmod>2026-06-18T16:27:36.243Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1cs1-computer-systems-1/week-9.-memory-hierarchy-and-cache-systems/7.-replacement-policies</loc>
    <lastmod>2026-06-18T16:27:36.247Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1cs1-computer-systems-1/week-9.-memory-hierarchy-and-cache-systems/tutorial-work</loc>
    <lastmod>2026-06-18T16:27:36.247Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1cs1-computer-systems-1/week-9.-memory-hierarchy-and-cache-systems/</loc>
    <lastmod>2026-06-18T16:27:36.247Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1fc1-foundations-of-computing-1/</loc>
    <lastmod>2026-06-18T16:27:36.247Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1fc1-foundations-of-computing-1/diagrams/graph-of-greater-than-or-equal-to-on-integer-numbers</loc>
    <lastmod>2026-06-18T16:27:36.247Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1fc1-foundations-of-computing-1/diagrams/graph-of-less-than-or-equal-to-on-natural-numbers</loc>
    <lastmod>2026-06-18T16:27:36.247Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1fc1-foundations-of-computing-1/week-1.-intro-to-propositional-logic-and-proofs/1.-why-logic</loc>
    <lastmod>2026-06-18T16:27:35.947Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1fc1-foundations-of-computing-1/week-1.-intro-to-propositional-logic-and-proofs/10.-mistakes-in-proofs</loc>
    <lastmod>2026-06-18T16:27:36.247Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1fc1-foundations-of-computing-1/week-1.-intro-to-propositional-logic-and-proofs/11.-proofs-by-induction</loc>
    <lastmod>2026-06-18T16:27:36.247Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1fc1-foundations-of-computing-1/week-1.-intro-to-propositional-logic-and-proofs/12.-the-simple-two-colour-theorem</loc>
    <lastmod>2026-06-18T16:27:36.247Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1fc1-foundations-of-computing-1/week-1.-intro-to-propositional-logic-and-proofs/13.-all-horses-have-the-same-colour</loc>
    <lastmod>2026-06-18T16:27:36.247Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1fc1-foundations-of-computing-1/week-1.-intro-to-propositional-logic-and-proofs/2.-logical-connectives</loc>
    <lastmod>2026-06-18T16:27:36.247Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1fc1-foundations-of-computing-1/week-1.-intro-to-propositional-logic-and-proofs/3.-tautologies,-satisfiability-and-consistency</loc>
    <lastmod>2026-06-18T16:27:36.247Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1fc1-foundations-of-computing-1/week-1.-intro-to-propositional-logic-and-proofs/4.-logical-equivalence</loc>
    <lastmod>2026-06-18T16:27:36.247Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1fc1-foundations-of-computing-1/week-1.-intro-to-propositional-logic-and-proofs/5.-logically-correct-arguments</loc>
    <lastmod>2026-06-18T16:27:36.247Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1fc1-foundations-of-computing-1/week-1.-intro-to-propositional-logic-and-proofs/6.-predicate-logic-basics</loc>
    <lastmod>2026-06-18T16:27:36.247Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1fc1-foundations-of-computing-1/week-1.-intro-to-propositional-logic-and-proofs/7.-quantifiers</loc>
    <lastmod>2026-06-18T16:27:36.247Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1fc1-foundations-of-computing-1/week-1.-intro-to-propositional-logic-and-proofs/8.-theorems-and-proofs</loc>
    <lastmod>2026-06-18T16:27:36.247Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1fc1-foundations-of-computing-1/week-1.-intro-to-propositional-logic-and-proofs/9.-direct-and-indirect-proofs</loc>
    <lastmod>2026-06-18T16:27:35.927Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1fc1-foundations-of-computing-1/week-1.-intro-to-propositional-logic-and-proofs/practice-work</loc>
    <lastmod>2026-06-18T16:27:36.247Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1fc1-foundations-of-computing-1/week-1.-intro-to-propositional-logic-and-proofs/tutorial-exercises</loc>
    <lastmod>2026-06-18T16:27:36.247Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1fc1-foundations-of-computing-1/week-1.-intro-to-propositional-logic-and-proofs/</loc>
    <lastmod>2026-06-18T16:27:36.247Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1fc1-foundations-of-computing-1/week-10.-regular-languages/1.-why-regular-expressions</loc>
    <lastmod>2026-06-18T16:27:36.247Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1fc1-foundations-of-computing-1/week-10.-regular-languages/2.-examples-of-regular-expressions</loc>
    <lastmod>2026-06-18T16:27:36.247Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1fc1-foundations-of-computing-1/week-10.-regular-languages/3.-describing-regular-expressions-by-recursion</loc>
    <lastmod>2026-06-18T16:27:36.247Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1fc1-foundations-of-computing-1/week-10.-regular-languages/4.-regular-languages</loc>
    <lastmod>2026-06-18T16:27:35.867Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1fc1-foundations-of-computing-1/week-10.-regular-languages/5-6.-turning-regular-expressions-to-nfas</loc>
    <lastmod>2026-06-18T16:27:36.247Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1fc1-foundations-of-computing-1/week-10.-regular-languages/7.-regex-to-nfa-example-1</loc>
    <lastmod>2026-06-18T16:27:36.247Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1fc1-foundations-of-computing-1/week-10.-regular-languages/8.-regex-to-nfa-example-2</loc>
    <lastmod>2026-06-18T16:27:36.247Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1fc1-foundations-of-computing-1/week-10.-regular-languages/9.-example-of-nonregular-language</loc>
    <lastmod>2026-06-18T16:27:36.247Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1fc1-foundations-of-computing-1/week-10.-regular-languages/practice-work</loc>
    <lastmod>2026-06-18T16:27:36.247Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1fc1-foundations-of-computing-1/week-10.-regular-languages/tutorial-exercises</loc>
    <lastmod>2026-06-18T16:27:36.247Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1fc1-foundations-of-computing-1/week-10.-regular-languages/</loc>
    <lastmod>2026-06-18T16:27:36.247Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1fc1-foundations-of-computing-1/week-11.-revision/fc1-week-11-sgt</loc>
    <lastmod>2026-06-18T16:27:36.247Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1fc1-foundations-of-computing-1/week-2.-sets-and-relations/1.-what-is-a-set</loc>
    <lastmod>2026-06-18T16:27:36.247Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1fc1-foundations-of-computing-1/week-2.-sets-and-relations/10.-relations</loc>
    <lastmod>2026-06-18T16:27:36.247Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1fc1-foundations-of-computing-1/week-2.-sets-and-relations/11.-representing-relations</loc>
    <lastmod>2026-06-18T16:27:36.247Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1fc1-foundations-of-computing-1/week-2.-sets-and-relations/12-15,17.-properties-of-relations</loc>
    <lastmod>2026-06-18T16:27:36.247Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1fc1-foundations-of-computing-1/week-2.-sets-and-relations/16.-hasse-diagrams</loc>
    <lastmod>2026-06-18T16:27:36.247Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1fc1-foundations-of-computing-1/week-2.-sets-and-relations/2.-describing-sets-by-properties</loc>
    <lastmod>2026-06-18T16:27:36.247Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1fc1-foundations-of-computing-1/week-2.-sets-and-relations/3.-russell's-paradox</loc>
    <lastmod>2026-06-18T16:27:36.247Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1fc1-foundations-of-computing-1/week-2.-sets-and-relations/4.-describing-sets-by-recursion</loc>
    <lastmod>2026-06-18T16:27:36.247Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1fc1-foundations-of-computing-1/week-2.-sets-and-relations/5.-subsets</loc>
    <lastmod>2026-06-18T16:27:36.247Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1fc1-foundations-of-computing-1/week-2.-sets-and-relations/6.-equality-of-sets,-powersets</loc>
    <lastmod>2026-06-18T16:27:36.247Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1fc1-foundations-of-computing-1/week-2.-sets-and-relations/7.-set-operations</loc>
    <lastmod>2026-06-18T16:27:36.247Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1fc1-foundations-of-computing-1/week-2.-sets-and-relations/8.-two-exercises-about-sets</loc>
    <lastmod>2026-06-18T16:27:36.247Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1fc1-foundations-of-computing-1/week-2.-sets-and-relations/9.-sequences,-cartesian-product-of-sets</loc>
    <lastmod>2026-06-18T16:27:36.251Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1fc1-foundations-of-computing-1/week-2.-sets-and-relations/practice-work</loc>
    <lastmod>2026-06-18T16:27:36.251Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1fc1-foundations-of-computing-1/week-2.-sets-and-relations/tutorial-exercises</loc>
    <lastmod>2026-06-18T16:27:36.251Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1fc1-foundations-of-computing-1/week-2.-sets-and-relations/</loc>
    <lastmod>2026-06-18T16:27:36.251Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1fc1-foundations-of-computing-1/week-3.-functions/1.-what-is-a-function</loc>
    <lastmod>2026-06-18T16:27:36.251Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1fc1-foundations-of-computing-1/week-3.-functions/10.-not-all-sets-are-countable</loc>
    <lastmod>2026-06-18T16:27:36.251Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1fc1-foundations-of-computing-1/week-3.-functions/2.-different-ways-of-describing-functions</loc>
    <lastmod>2026-06-18T16:27:36.251Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1fc1-foundations-of-computing-1/week-3.-functions/3.-some-useful-functions</loc>
    <lastmod>2026-06-18T16:27:36.251Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1fc1-foundations-of-computing-1/week-3.-functions/4.-functions-and-relations</loc>
    <lastmod>2026-06-18T16:27:36.251Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1fc1-foundations-of-computing-1/week-3.-functions/5-6.-properties-of-functions</loc>
    <lastmod>2026-06-18T16:27:36.251Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1fc1-foundations-of-computing-1/week-3.-functions/7.-describing-functions-by-recursion</loc>
    <lastmod>2026-06-18T16:27:36.251Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1fc1-foundations-of-computing-1/week-3.-functions/8.-function-composition</loc>
    <lastmod>2026-06-18T16:27:36.251Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1fc1-foundations-of-computing-1/week-3.-functions/9.-countable-sets</loc>
    <lastmod>2026-06-18T16:27:36.251Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1fc1-foundations-of-computing-1/week-3.-functions/fc1-week-3-sgt</loc>
    <lastmod>2026-06-18T16:27:36.251Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1fc1-foundations-of-computing-1/week-3.-functions/practice-work</loc>
    <lastmod>2026-06-18T16:27:36.251Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1fc1-foundations-of-computing-1/week-3.-functions/tutorial-exercises</loc>
    <lastmod>2026-06-18T16:27:36.251Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1fc1-foundations-of-computing-1/week-3.-functions/</loc>
    <lastmod>2026-06-18T16:27:36.251Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1fc1-foundations-of-computing-1/week-4.-basic-combinatorial-principles/1.-the-sum-and-the-inclusion-exclusion-principle</loc>
    <lastmod>2026-06-18T16:27:36.251Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1fc1-foundations-of-computing-1/week-4.-basic-combinatorial-principles/2.-the-product-rule</loc>
    <lastmod>2026-06-18T16:27:36.251Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1fc1-foundations-of-computing-1/week-4.-basic-combinatorial-principles/3.-the-pigeonhole-principle</loc>
    <lastmod>2026-06-18T16:27:36.251Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1fc1-foundations-of-computing-1/week-4.-basic-combinatorial-principles/4-7.-four-ways-of-selecting-items</loc>
    <lastmod>2026-06-18T16:27:35.799Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1fc1-foundations-of-computing-1/week-4.-basic-combinatorial-principles/order-does-not-matter,-repetition-allowed</loc>
    <lastmod>2026-06-18T16:27:36.251Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1fc1-foundations-of-computing-1/week-4.-basic-combinatorial-principles/order-does-not-matter,-repetition-not-allowed</loc>
    <lastmod>2026-06-18T16:27:36.251Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1fc1-foundations-of-computing-1/week-4.-basic-combinatorial-principles/order-matters,-repetition-allowed</loc>
    <lastmod>2026-06-18T16:27:36.251Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1fc1-foundations-of-computing-1/week-4.-basic-combinatorial-principles/order-matters,-repetition-not-allowed</loc>
    <lastmod>2026-06-18T16:27:36.251Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1fc1-foundations-of-computing-1/week-4.-basic-combinatorial-principles/practice-work</loc>
    <lastmod>2026-06-18T16:27:36.251Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1fc1-foundations-of-computing-1/week-4.-basic-combinatorial-principles/tutorial-exercises</loc>
    <lastmod>2026-06-18T16:27:36.251Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1fc1-foundations-of-computing-1/week-4.-basic-combinatorial-principles/</loc>
    <lastmod>2026-06-18T16:27:36.251Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1fc1-foundations-of-computing-1/week-5.-discrete-probability/1,10-11.-the-monty-hall-3-door-puzzle</loc>
    <lastmod>2026-06-18T16:27:36.251Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1fc1-foundations-of-computing-1/week-5.-discrete-probability/2.-probability-distributions</loc>
    <lastmod>2026-06-18T16:27:36.251Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1fc1-foundations-of-computing-1/week-5.-discrete-probability/3.-probability-of-events</loc>
    <lastmod>2026-06-18T16:27:36.251Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1fc1-foundations-of-computing-1/week-5.-discrete-probability/4.-complement-and-union-of-events</loc>
    <lastmod>2026-06-18T16:27:36.251Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1fc1-foundations-of-computing-1/week-5.-discrete-probability/5.-conditional-probability-and-independence</loc>
    <lastmod>2026-06-18T16:27:36.251Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1fc1-foundations-of-computing-1/week-5.-discrete-probability/6-9.-bayes'-theorem</loc>
    <lastmod>2026-06-18T16:27:36.251Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1fc1-foundations-of-computing-1/week-5.-discrete-probability/fc1-week-5-sgt</loc>
    <lastmod>2026-06-18T16:27:36.251Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1fc1-foundations-of-computing-1/week-5.-discrete-probability/practice-work</loc>
    <lastmod>2026-06-18T16:27:36.251Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1fc1-foundations-of-computing-1/week-5.-discrete-probability/tutorial-exercises</loc>
    <lastmod>2026-06-18T16:27:36.251Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1fc1-foundations-of-computing-1/week-5.-discrete-probability/</loc>
    <lastmod>2026-06-18T16:27:36.251Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1fc1-foundations-of-computing-1/week-6.-graphs/1.-different-kinds-of-graphs</loc>
    <lastmod>2026-06-18T16:27:35.899Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1fc1-foundations-of-computing-1/week-6.-graphs/2.-basic-terminology</loc>
    <lastmod>2026-06-18T16:27:36.251Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1fc1-foundations-of-computing-1/week-6.-graphs/3.-adjacency-matrix</loc>
    <lastmod>2026-06-18T16:27:36.251Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1fc1-foundations-of-computing-1/week-6.-graphs/4.-paths-in-simple-graphs</loc>
    <lastmod>2026-06-18T16:27:36.251Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1fc1-foundations-of-computing-1/week-6.-graphs/5.-cycles-in-simple-graphs</loc>
    <lastmod>2026-06-18T16:27:36.251Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1fc1-foundations-of-computing-1/week-6.-graphs/6.-special-graphs,-subgraphs,-connectedness</loc>
    <lastmod>2026-06-18T16:27:36.251Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1fc1-foundations-of-computing-1/week-6.-graphs/7-10.-graph-isomorphism</loc>
    <lastmod>2026-06-18T16:27:36.251Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1fc1-foundations-of-computing-1/week-6.-graphs/diagrams/edges-to-edges-(1)</loc>
    <lastmod>2026-06-18T16:27:36.251Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1fc1-foundations-of-computing-1/week-6.-graphs/diagrams/edges-to-edges-(2)</loc>
    <lastmod>2026-06-18T16:27:36.251Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1fc1-foundations-of-computing-1/week-6.-graphs/diagrams/non-edges-to-non-edges-(1)</loc>
    <lastmod>2026-06-18T16:27:36.255Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1fc1-foundations-of-computing-1/week-6.-graphs/diagrams/non-edges-to-non-edges-(2)</loc>
    <lastmod>2026-06-18T16:27:36.255Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1fc1-foundations-of-computing-1/week-6.-graphs/practice-work</loc>
    <lastmod>2026-06-18T16:27:36.255Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1fc1-foundations-of-computing-1/week-6.-graphs/tutorial-exercises</loc>
    <lastmod>2026-06-18T16:27:36.255Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1fc1-foundations-of-computing-1/week-6.-graphs/</loc>
    <lastmod>2026-06-18T16:27:36.255Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1fc1-foundations-of-computing-1/week-7.-trees/1.-what-is-a-tree</loc>
    <lastmod>2026-06-18T16:27:35.915Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1fc1-foundations-of-computing-1/week-7.-trees/10.-tree-traversal-algorithms</loc>
    <lastmod>2026-06-18T16:27:36.255Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1fc1-foundations-of-computing-1/week-7.-trees/2.-rooted-trees;-basic-terminology</loc>
    <lastmod>2026-06-18T16:27:35.915Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1fc1-foundations-of-computing-1/week-7.-trees/3.-applications-of-trees</loc>
    <lastmod>2026-06-18T16:27:35.923Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1fc1-foundations-of-computing-1/week-7.-trees/4.-rooted-trees;-more-notions</loc>
    <lastmod>2026-06-18T16:27:35.907Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1fc1-foundations-of-computing-1/week-7.-trees/5.-special-trees</loc>
    <lastmod>2026-06-18T16:27:35.911Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1fc1-foundations-of-computing-1/week-7.-trees/6.-a-'proof-by-induction'-exercise</loc>
    <lastmod>2026-06-18T16:27:35.907Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1fc1-foundations-of-computing-1/week-7.-trees/7.-decomposition-trees</loc>
    <lastmod>2026-06-18T16:27:35.923Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1fc1-foundations-of-computing-1/week-7.-trees/8.-linearly-ordered-lists</loc>
    <lastmod>2026-06-18T16:27:35.919Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1fc1-foundations-of-computing-1/week-7.-trees/9.-binary-search-trees</loc>
    <lastmod>2026-06-18T16:27:35.919Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1fc1-foundations-of-computing-1/week-7.-trees/fc1-week-7-sgt</loc>
    <lastmod>2026-06-18T16:27:36.255Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1fc1-foundations-of-computing-1/week-7.-trees/practice-work</loc>
    <lastmod>2026-06-18T16:27:36.255Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1fc1-foundations-of-computing-1/week-7.-trees/tutorial-exercises</loc>
    <lastmod>2026-06-18T16:27:36.255Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1fc1-foundations-of-computing-1/week-7.-trees/</loc>
    <lastmod>2026-06-18T16:27:36.255Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1fc1-foundations-of-computing-1/week-8.-finite-automata/1.-applications-of-finite-automata</loc>
    <lastmod>2026-06-18T16:27:36.255Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1fc1-foundations-of-computing-1/week-8.-finite-automata/2.-alphabets,-words,-languages</loc>
    <lastmod>2026-06-18T16:27:36.255Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1fc1-foundations-of-computing-1/week-8.-finite-automata/3.-finite-automata-basics</loc>
    <lastmod>2026-06-18T16:27:36.255Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1fc1-foundations-of-computing-1/week-8.-finite-automata/4.-state-transition-diagrams</loc>
    <lastmod>2026-06-18T16:27:36.255Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1fc1-foundations-of-computing-1/week-8.-finite-automata/5.-deterministic-finite-automata</loc>
    <lastmod>2026-06-18T16:27:36.255Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1fc1-foundations-of-computing-1/week-8.-finite-automata/6.-vending-machine-example</loc>
    <lastmod>2026-06-18T16:27:36.255Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1fc1-foundations-of-computing-1/week-8.-finite-automata/7.-language-of-a-dfa</loc>
    <lastmod>2026-06-18T16:27:36.255Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1fc1-foundations-of-computing-1/week-8.-finite-automata/8.-more-examples</loc>
    <lastmod>2026-06-18T16:27:36.255Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1fc1-foundations-of-computing-1/week-8.-finite-automata/practice-work</loc>
    <lastmod>2026-06-18T16:27:36.255Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1fc1-foundations-of-computing-1/week-8.-finite-automata/tutorial-exercises</loc>
    <lastmod>2026-06-18T16:27:36.255Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1fc1-foundations-of-computing-1/week-8.-finite-automata/</loc>
    <lastmod>2026-06-18T16:27:36.255Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1fc1-foundations-of-computing-1/week-9.-finite-automata-ii/1-3.-designing-dfas</loc>
    <lastmod>2026-06-18T16:27:36.255Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1fc1-foundations-of-computing-1/week-9.-finite-automata-ii/10.-state-minimisation</loc>
    <lastmod>2026-06-18T16:27:36.255Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1fc1-foundations-of-computing-1/week-9.-finite-automata-ii/4.-nondeterminism</loc>
    <lastmod>2026-06-18T16:27:35.795Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1fc1-foundations-of-computing-1/week-9.-finite-automata-ii/5.-nfas-transition-table,-acceptance</loc>
    <lastmod>2026-06-18T16:27:36.255Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1fc1-foundations-of-computing-1/week-9.-finite-automata-ii/6.-nfa-example-1</loc>
    <lastmod>2026-06-18T16:27:36.255Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1fc1-foundations-of-computing-1/week-9.-finite-automata-ii/7.-nfa-example-2</loc>
    <lastmod>2026-06-18T16:27:36.255Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1fc1-foundations-of-computing-1/week-9.-finite-automata-ii/8.-designing-nfas</loc>
    <lastmod>2026-06-18T16:27:36.255Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1fc1-foundations-of-computing-1/week-9.-finite-automata-ii/9.-the-subset-construction</loc>
    <lastmod>2026-06-18T16:27:36.255Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1fc1-foundations-of-computing-1/week-9.-finite-automata-ii/fc1-week-9-sgt</loc>
    <lastmod>2026-06-18T16:27:36.255Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1fc1-foundations-of-computing-1/week-9.-finite-automata-ii/practice-work</loc>
    <lastmod>2026-06-18T16:27:36.255Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1fc1-foundations-of-computing-1/week-9.-finite-automata-ii/tutorial-exercises</loc>
    <lastmod>2026-06-18T16:27:36.255Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1fc1-foundations-of-computing-1/week-9.-finite-automata-ii/</loc>
    <lastmod>2026-06-18T16:27:36.255Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1ipp-introduction-to-professional-practice/</loc>
    <lastmod>2026-06-18T16:27:36.255Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1ipp-introduction-to-professional-practice/week-1.-professional,-legal,-social-and-ethical-issues/1.-professionalism</loc>
    <lastmod>2026-06-18T16:27:36.255Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1ipp-introduction-to-professional-practice/week-1.-professional,-legal,-social-and-ethical-issues/2.-ethical-theories-and-computer-ethics</loc>
    <lastmod>2026-06-18T16:27:36.255Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1ipp-introduction-to-professional-practice/week-1.-professional,-legal,-social-and-ethical-issues/3.-ipr-and-internet-censorship</loc>
    <lastmod>2026-06-18T16:27:36.255Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1ipp-introduction-to-professional-practice/week-1.-professional,-legal,-social-and-ethical-issues/4.-computer-misuse-act-1990</loc>
    <lastmod>2026-06-18T16:27:36.259Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1ipp-introduction-to-professional-practice/week-1.-professional,-legal,-social-and-ethical-issues/5.-introduction-to-contract-law</loc>
    <lastmod>2026-06-18T16:27:36.259Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1ipp-introduction-to-professional-practice/week-1.-professional,-legal,-social-and-ethical-issues/6.-software-contracts</loc>
    <lastmod>2026-06-18T16:27:36.259Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1ipp-introduction-to-professional-practice/week-1.-professional,-legal,-social-and-ethical-issues/</loc>
    <lastmod>2026-06-18T16:27:36.259Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1ipp-introduction-to-professional-practice/week-2.-cyber-security/1.-digital-security</loc>
    <lastmod>2026-06-18T16:27:36.259Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1ipp-introduction-to-professional-practice/week-2.-cyber-security/2.-security-threats-and-attacks</loc>
    <lastmod>2026-06-18T16:27:36.259Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1ipp-introduction-to-professional-practice/week-2.-cyber-security/3.-software-faults-and-hazards</loc>
    <lastmod>2026-06-18T16:27:36.259Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1ipp-introduction-to-professional-practice/week-2.-cyber-security/4.-cyber-security</loc>
    <lastmod>2026-06-18T16:27:36.259Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1ipp-introduction-to-professional-practice/week-2.-cyber-security/</loc>
    <lastmod>2026-06-18T16:27:36.259Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1ipp-introduction-to-professional-practice/week-3.-project-management-and-group-work/1.-introduction-and-project-management</loc>
    <lastmod>2026-06-18T16:27:36.259Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1ipp-introduction-to-professional-practice/week-3.-project-management-and-group-work/2.-initiating-a-project</loc>
    <lastmod>2026-06-18T16:27:36.259Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1ipp-introduction-to-professional-practice/week-3.-project-management-and-group-work/3.-planning</loc>
    <lastmod>2026-06-18T16:27:36.259Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1ipp-introduction-to-professional-practice/week-3.-project-management-and-group-work/4.-risk-assessment</loc>
    <lastmod>2026-06-18T16:27:36.259Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1ipp-introduction-to-professional-practice/week-3.-project-management-and-group-work/5.-execution-and-group-work</loc>
    <lastmod>2026-06-18T16:27:36.259Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1ipp-introduction-to-professional-practice/week-3.-project-management-and-group-work/</loc>
    <lastmod>2026-06-18T16:27:36.259Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1ipp-introduction-to-professional-practice/week-4.-professional-skills,-gdpr-and-intellectual-property/1.-introduction-to-psgw,-gdpr-and-ip</loc>
    <lastmod>2026-06-18T16:27:36.259Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1ipp-introduction-to-professional-practice/week-4.-professional-skills,-gdpr-and-intellectual-property/2.-professional-skills-for-a-globalised-world</loc>
    <lastmod>2026-06-18T16:27:36.259Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1ipp-introduction-to-professional-practice/week-4.-professional-skills,-gdpr-and-intellectual-property/3.-gdpr</loc>
    <lastmod>2026-06-18T16:27:36.259Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1ipp-introduction-to-professional-practice/week-4.-professional-skills,-gdpr-and-intellectual-property/4.-intellectual-property-and-copyright</loc>
    <lastmod>2026-06-18T16:27:36.259Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1ipp-introduction-to-professional-practice/week-4.-professional-skills,-gdpr-and-intellectual-property/5.-ip,-patents-and-trademarks</loc>
    <lastmod>2026-06-18T16:27:36.259Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1ipp-introduction-to-professional-practice/week-4.-professional-skills,-gdpr-and-intellectual-property/</loc>
    <lastmod>2026-06-18T16:27:36.259Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-2/4ccs1dbs-database-systems/</loc>
    <lastmod>2026-06-18T16:27:36.267Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-2/4ccs1dbs-database-systems/week-1.-introduction-to-databases</loc>
    <lastmod>2026-06-18T16:27:36.267Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-2/4ccs1dbs-database-systems/week-2.-er-data-model</loc>
    <lastmod>2026-06-18T16:27:36.267Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-2/4ccs1dbs-database-systems/week-3.-relational-data-model</loc>
    <lastmod>2026-06-18T16:27:36.267Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-2/4ccs1dbs-database-systems/week-4.-sql</loc>
    <lastmod>2026-06-18T16:27:36.267Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-2/4ccs1dbs-database-systems/week-5.-sql-2</loc>
    <lastmod>2026-06-18T16:27:36.267Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-2/4ccs1dbs-database-systems/week-6-7.-relational-algebra</loc>
    <lastmod>2026-06-18T16:27:36.267Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-2/4ccs1dbs-database-systems/week-8.-functional-dependencies-and-normalisation-1</loc>
    <lastmod>2026-06-18T16:27:36.267Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-2/4ccs1dbs-database-systems/week-9.-functional-dependencies-and-normalisation-2</loc>
    <lastmod>2026-06-18T16:27:36.267Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-2/4ccs1dst-data-structures/</loc>
    <lastmod>2026-06-18T16:27:36.267Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-2/4ccs1dst-data-structures/assignments/readme</loc>
    <lastmod>2026-06-18T16:27:36.267Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-2/4ccs1dst-data-structures/sgt/sgt1/readme</loc>
    <lastmod>2026-06-18T16:27:36.267Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-2/4ccs1dst-data-structures/week-1.-recursion</loc>
    <lastmod>2026-06-18T16:27:36.267Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-2/4ccs1dst-data-structures/week-10.-sorting-algorithms</loc>
    <lastmod>2026-06-18T16:27:36.267Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-2/4ccs1dst-data-structures/week-2.-linked-lists</loc>
    <lastmod>2026-06-18T16:27:36.267Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-2/4ccs1dst-data-structures/week-3.-analysis-of-algorithms</loc>
    <lastmod>2026-06-18T16:27:36.267Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-2/4ccs1dst-data-structures/week-4.-stacks-and-queues</loc>
    <lastmod>2026-06-18T16:27:36.267Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-2/4ccs1dst-data-structures/week-5.-lists</loc>
    <lastmod>2026-06-18T16:27:36.267Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-2/4ccs1dst-data-structures/week-6.-trees</loc>
    <lastmod>2026-06-18T16:27:36.267Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-2/4ccs1dst-data-structures/week-7.-priority-queues-and-heaps</loc>
    <lastmod>2026-06-18T16:27:36.267Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-2/4ccs1dst-data-structures/week-8.-maps-and-dictionaries</loc>
    <lastmod>2026-06-18T16:27:36.267Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-2/4ccs1dst-data-structures/week-9.-search-tree-structures</loc>
    <lastmod>2026-06-18T16:27:36.267Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-2/4ccs1ise-introduction-to-software-engineering/</loc>
    <lastmod>2026-06-18T16:27:36.267Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-2/4ccs1ise-introduction-to-software-engineering/week-1.-software-engineering-and-software-lifecycles</loc>
    <lastmod>2026-06-18T16:27:36.267Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-2/4ccs1ise-introduction-to-software-engineering/week-2.-requirements-analysis,-uml-and-use-case-diagrams</loc>
    <lastmod>2026-06-18T16:27:36.267Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-2/4ccs1ise-introduction-to-software-engineering/week-3.-uml-class-diagram-and-configuration-management</loc>
    <lastmod>2026-06-18T16:27:36.267Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-2/4ccs1ise-introduction-to-software-engineering/week-4.-design-patterns</loc>
    <lastmod>2026-06-18T16:27:36.267Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-2/4ccs1ise-introduction-to-software-engineering/week-5.-behavioural-design-and-state-machine-diagrams</loc>
    <lastmod>2026-06-18T16:27:36.267Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-2/4ccs1ise-introduction-to-software-engineering/week-6.-uml-sequence-diagrams-and-refactoring</loc>
    <lastmod>2026-06-18T16:27:36.267Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-2/4ccs1ise-introduction-to-software-engineering/week-7.-software-quality-assurance</loc>
    <lastmod>2026-06-18T16:27:36.267Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-2/4ccs1ise-introduction-to-software-engineering/week-8.-agile-software-development</loc>
    <lastmod>2026-06-18T16:27:36.267Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-2/4ccs1ise-introduction-to-software-engineering/week-9.-making-the-most-of-models</loc>
    <lastmod>2026-06-18T16:27:36.267Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/</loc>
    <lastmod>2026-06-18T16:27:36.267Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-1--and--2/5ccs2seg-software-engineering-group-project/week-1.-python</loc>
    <lastmod>2026-06-18T16:27:33.655Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-1--and--2/5ccs2seg-software-engineering-group-project/week-10.-requirements-engineering</loc>
    <lastmod>2026-06-18T16:27:33.655Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-1--and--2/5ccs2seg-software-engineering-group-project/week-2.-software-processes</loc>
    <lastmod>2026-06-18T16:27:33.647Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-1--and--2/5ccs2seg-software-engineering-group-project/week-3.-project-management</loc>
    <lastmod>2026-06-18T16:27:33.655Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-1--and--2/5ccs2seg-software-engineering-group-project/week-4.-agile--and--lean-development</loc>
    <lastmod>2026-06-18T16:27:33.647Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-1--and--2/5ccs2seg-software-engineering-group-project/week-5.-testing</loc>
    <lastmod>2026-06-18T16:27:33.647Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-1--and--2/5ccs2seg-software-engineering-group-project/week-7.-clean-code</loc>
    <lastmod>2026-06-18T16:27:36.275Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-1--and--2/5ccs2seg-software-engineering-group-project/week-8.-software-design</loc>
    <lastmod>2026-06-18T16:27:33.647Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-1--and--2/5ccs2seg-software-engineering-group-project/week-9.-solid</loc>
    <lastmod>2026-06-18T16:27:33.651Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-1/5ccs2fc2-foundations-of-computing-2/coursework/question-1-old</loc>
    <lastmod>2026-06-18T16:27:33.575Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-1/5ccs2fc2-foundations-of-computing-2/coursework/question-1-redone</loc>
    <lastmod>2026-06-18T16:27:33.571Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-1/5ccs2fc2-foundations-of-computing-2/coursework/question-2</loc>
    <lastmod>2026-06-18T16:27:33.575Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-1/5ccs2fc2-foundations-of-computing-2/coursework/question-3-redone</loc>
    <lastmod>2026-06-18T16:27:33.571Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-1/5ccs2fc2-foundations-of-computing-2/coursework/question-3</loc>
    <lastmod>2026-06-18T16:27:33.571Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-1/5ccs2fc2-foundations-of-computing-2/week-1.-automata-and-turing-machines/1.-recap-of-finite-automata</loc>
    <lastmod>2026-06-18T16:27:33.643Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-1/5ccs2fc2-foundations-of-computing-2/week-1.-automata-and-turing-machines/2.-non-regular-languages--and--pumping-lemma</loc>
    <lastmod>2026-06-18T16:27:33.643Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-1/5ccs2fc2-foundations-of-computing-2/week-1.-automata-and-turing-machines/3.-turing-machines</loc>
    <lastmod>2026-06-18T16:27:36.267Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-1/5ccs2fc2-foundations-of-computing-2/week-1.-automata-and-turing-machines/lgt-sheet</loc>
    <lastmod>2026-06-18T16:27:33.639Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-1/5ccs2fc2-foundations-of-computing-2/week-1.-automata-and-turing-machines/sgt-sheet</loc>
    <lastmod>2026-06-18T16:27:33.639Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-1/5ccs2fc2-foundations-of-computing-2/week-10.-limits-of-computation/1.-undecidable-problems</loc>
    <lastmod>2026-06-18T16:27:33.579Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-1/5ccs2fc2-foundations-of-computing-2/week-10.-limits-of-computation/2.-the-halting-problem</loc>
    <lastmod>2026-06-18T16:27:33.583Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-1/5ccs2fc2-foundations-of-computing-2/week-10.-limits-of-computation/3.-the-entscheidungsproblem</loc>
    <lastmod>2026-06-18T16:27:33.579Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-1/5ccs2fc2-foundations-of-computing-2/week-10.-limits-of-computation/sgt-sheet</loc>
    <lastmod>2026-06-18T16:27:36.271Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-1/5ccs2fc2-foundations-of-computing-2/week-11.-limits-of-computations-(cont.)/1.-undecidability-via-mapping-reductions</loc>
    <lastmod>2026-06-18T16:27:36.271Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-1/5ccs2fc2-foundations-of-computing-2/week-11.-limits-of-computations-(cont.)/2.-computable-enumerability</loc>
    <lastmod>2026-06-18T16:27:36.271Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-1/5ccs2fc2-foundations-of-computing-2/week-2.-p-vs-np/1.-asymptotic-notation--and--complexity-classes</loc>
    <lastmod>2026-06-18T16:27:33.595Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-1/5ccs2fc2-foundations-of-computing-2/week-2.-p-vs-np/2.-computable-functions--and--np-completeness</loc>
    <lastmod>2026-06-18T16:27:33.591Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-1/5ccs2fc2-foundations-of-computing-2/week-2.-p-vs-np/3.-boolean-satisfiability-problem</loc>
    <lastmod>2026-06-18T16:27:33.599Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-1/5ccs2fc2-foundations-of-computing-2/week-2.-p-vs-np/4.-clique-problem</loc>
    <lastmod>2026-06-18T16:27:36.271Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-1/5ccs2fc2-foundations-of-computing-2/week-2.-p-vs-np/5.-hamiltonian-cycle-problem</loc>
    <lastmod>2026-06-18T16:27:36.271Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-1/5ccs2fc2-foundations-of-computing-2/week-2.-p-vs-np/lgt-sheet</loc>
    <lastmod>2026-06-18T16:27:33.591Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-1/5ccs2fc2-foundations-of-computing-2/week-2.-p-vs-np/sgt-sheet</loc>
    <lastmod>2026-06-18T16:27:33.595Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-1/5ccs2fc2-foundations-of-computing-2/week-3.-the-cook-levin-theorem--and--divide-and-conquer/1.-the-cook-levin-theorem</loc>
    <lastmod>2026-06-18T16:27:33.635Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-1/5ccs2fc2-foundations-of-computing-2/week-3.-the-cook-levin-theorem--and--divide-and-conquer/2.--divide-and-conquer-and-induction-proofs</loc>
    <lastmod>2026-06-18T16:27:33.635Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-1/5ccs2fc2-foundations-of-computing-2/week-3.-the-cook-levin-theorem--and--divide-and-conquer/3.-the-master-theorem</loc>
    <lastmod>2026-06-18T16:27:33.635Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-1/5ccs2fc2-foundations-of-computing-2/week-3.-the-cook-levin-theorem--and--divide-and-conquer/lgt-sheet</loc>
    <lastmod>2026-06-18T16:27:33.631Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-1/5ccs2fc2-foundations-of-computing-2/week-3.-the-cook-levin-theorem--and--divide-and-conquer/sgt-sheet</loc>
    <lastmod>2026-06-18T16:27:33.631Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-1/5ccs2fc2-foundations-of-computing-2/week-4.-graph-algorithms/1.-introduction-to-graph-algorithms</loc>
    <lastmod>2026-06-18T16:27:36.271Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-1/5ccs2fc2-foundations-of-computing-2/week-4.-graph-algorithms/2.-toplogical-sorting--and--strongly-connected-components</loc>
    <lastmod>2026-06-18T16:27:36.271Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-1/5ccs2fc2-foundations-of-computing-2/week-4.-graph-algorithms/3.-minimum-spanning-trees</loc>
    <lastmod>2026-06-18T16:27:33.627Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-1/5ccs2fc2-foundations-of-computing-2/week-4.-graph-algorithms/lgt-sheet</loc>
    <lastmod>2026-06-18T16:27:33.623Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-1/5ccs2fc2-foundations-of-computing-2/week-4.-graph-algorithms/sgt-sheet</loc>
    <lastmod>2026-06-18T16:27:33.627Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-1/5ccs2fc2-foundations-of-computing-2/week-5.-sat-solving/1.-introduction-to-sat-solving</loc>
    <lastmod>2026-06-18T16:27:36.271Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-1/5ccs2fc2-foundations-of-computing-2/week-5.-sat-solving/2.-the-dpll-algorithm</loc>
    <lastmod>2026-06-18T16:27:36.271Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-1/5ccs2fc2-foundations-of-computing-2/week-5.-sat-solving/3.-3sat-vs-2sat</loc>
    <lastmod>2026-06-18T16:27:36.271Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-1/5ccs2fc2-foundations-of-computing-2/week-5.-sat-solving/lgt-sheet</loc>
    <lastmod>2026-06-18T16:27:33.599Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-1/5ccs2fc2-foundations-of-computing-2/week-5.-sat-solving/sgt-sheet</loc>
    <lastmod>2026-06-18T16:27:36.271Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-1/5ccs2fc2-foundations-of-computing-2/week-7.-approximation-and-the-travelling-salesman/1.-optimisation-and-approximation</loc>
    <lastmod>2026-06-18T16:27:33.611Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-1/5ccs2fc2-foundations-of-computing-2/week-7.-approximation-and-the-travelling-salesman/2.-the-2-opt-algorithm-for-tsp</loc>
    <lastmod>2026-06-18T16:27:36.271Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-1/5ccs2fc2-foundations-of-computing-2/week-7.-approximation-and-the-travelling-salesman/3.-unapproximable-instances-of-tsp</loc>
    <lastmod>2026-06-18T16:27:36.271Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-1/5ccs2fc2-foundations-of-computing-2/week-7.-approximation-and-the-travelling-salesman/lgt-sheet</loc>
    <lastmod>2026-06-18T16:27:33.607Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-1/5ccs2fc2-foundations-of-computing-2/week-7.-approximation-and-the-travelling-salesman/sgt-sheet</loc>
    <lastmod>2026-06-18T16:27:36.271Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-1/5ccs2fc2-foundations-of-computing-2/week-8.-linear-programming/1.-introduction-to-linear-programming</loc>
    <lastmod>2026-06-18T16:27:36.271Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-1/5ccs2fc2-foundations-of-computing-2/week-8.-linear-programming/2.-the-simplex-method</loc>
    <lastmod>2026-06-18T16:27:36.271Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-1/5ccs2fc2-foundations-of-computing-2/week-8.-linear-programming/3.-integer-programming</loc>
    <lastmod>2026-06-18T16:27:36.271Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-1/5ccs2fc2-foundations-of-computing-2/week-8.-linear-programming/lgt-sheet</loc>
    <lastmod>2026-06-18T16:27:36.271Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-1/5ccs2fc2-foundations-of-computing-2/week-8.-linear-programming/sgt-sheet</loc>
    <lastmod>2026-06-18T16:27:36.271Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-1/5ccs2fc2-foundations-of-computing-2/week-9.-probabilistic-algorithms/1.-probability-and-random-variables</loc>
    <lastmod>2026-06-18T16:27:33.619Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-1/5ccs2fc2-foundations-of-computing-2/week-9.-probabilistic-algorithms/2.-probabilistic-turing-machines</loc>
    <lastmod>2026-06-18T16:27:33.623Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-1/5ccs2fc2-foundations-of-computing-2/week-9.-probabilistic-algorithms/3.-monte-carlo--and--las-vegas-algorithms</loc>
    <lastmod>2026-06-18T16:27:36.271Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-1/5ccs2fc2-foundations-of-computing-2/week-9.-probabilistic-algorithms/lgt-sheet</loc>
    <lastmod>2026-06-18T16:27:33.615Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-1/5ccs2fc2-foundations-of-computing-2/week-9.-probabilistic-algorithms/sgt-sheet</loc>
    <lastmod>2026-06-18T16:27:36.271Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-1/5ccs2itr-introduction-to-robotics/extra/tiago-simulator</loc>
    <lastmod>2026-06-18T16:27:33.559Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-1/5ccs2itr-introduction-to-robotics/ultimate-ros-1+2-setup-guide-for-arch</loc>
    <lastmod>2026-06-18T16:27:33.563Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-1/5ccs2itr-introduction-to-robotics/week-1.-fundamental-concepts</loc>
    <lastmod>2026-06-18T16:27:36.271Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-1/5ccs2itr-introduction-to-robotics/week-10.-human-robot-interaction</loc>
    <lastmod>2026-06-18T16:27:33.555Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-1/5ccs2itr-introduction-to-robotics/week-2.-containers,-jobs,-and-ros-packages</loc>
    <lastmod>2026-06-18T16:27:36.271Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-1/5ccs2itr-introduction-to-robotics/week-3.-working-with-ros</loc>
    <lastmod>2026-06-18T16:27:36.271Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-1/5ccs2itr-introduction-to-robotics/week-4.-navigation-stack</loc>
    <lastmod>2026-06-18T16:27:36.271Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-1/5ccs2itr-introduction-to-robotics/week-5.-more-navigation</loc>
    <lastmod>2026-06-18T16:27:36.271Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-1/5ccs2itr-introduction-to-robotics/week-7.-localisation</loc>
    <lastmod>2026-06-18T16:27:36.275Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-1/5ccs2itr-introduction-to-robotics/week-8.-perception</loc>
    <lastmod>2026-06-18T16:27:33.551Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-1/5ccs2itr-introduction-to-robotics/week-9.-state-machines</loc>
    <lastmod>2026-06-18T16:27:36.275Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-1/5ccs2pep-practical-experiences-of-programming/c++</loc>
    <lastmod>2026-06-18T16:27:33.567Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-2/5ccs2int-introduction-to-artificial-intelligence/week-1.-intro-to-ai-and-search/1.-introduction-to-ai</loc>
    <lastmod>2026-06-18T16:27:33.539Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-2/5ccs2int-introduction-to-artificial-intelligence/week-1.-intro-to-ai-and-search/2.-structuring-search-problems</loc>
    <lastmod>2026-06-18T16:27:33.543Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-2/5ccs2int-introduction-to-artificial-intelligence/week-1.-intro-to-ai-and-search/3.-uninformed-search</loc>
    <lastmod>2026-06-18T16:27:33.539Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-2/5ccs2int-introduction-to-artificial-intelligence/week-1.-intro-to-ai-and-search/4.-goal-and-heuristic-search</loc>
    <lastmod>2026-06-18T16:27:33.539Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-2/5ccs2int-introduction-to-artificial-intelligence/week-1.-intro-to-ai-and-search/5.-a-search-algorithm--and--heuristics</loc>
    <lastmod>2026-06-18T16:27:36.275Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-2/5ccs2int-introduction-to-artificial-intelligence/week-2.-adversarial-search--and--constraint-satisfaction/1.-adversarial-search,-minimax,-and-alpha-beta-pruning</loc>
    <lastmod>2026-06-18T16:27:36.275Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-2/5ccs2int-introduction-to-artificial-intelligence/week-2.-adversarial-search--and--constraint-satisfaction/2.-constraint-satisfaction-problems</loc>
    <lastmod>2026-06-18T16:27:36.275Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-2/5ccs2int-introduction-to-artificial-intelligence/week-2.-adversarial-search--and--constraint-satisfaction/3.-solving-csps</loc>
    <lastmod>2026-06-18T16:27:33.531Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-2/5ccs2int-introduction-to-artificial-intelligence/week-3.-automated-planning/1.-introduction-to-planning</loc>
    <lastmod>2026-06-18T16:27:33.519Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-2/5ccs2int-introduction-to-artificial-intelligence/week-3.-automated-planning/2.-planning-in-pddl</loc>
    <lastmod>2026-06-18T16:27:33.519Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-2/5ccs2int-introduction-to-artificial-intelligence/week-3.-automated-planning/3.-heuristics</loc>
    <lastmod>2026-06-18T16:27:36.275Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-2/5ccs2int-introduction-to-artificial-intelligence/week-4.-uncertainty/1.-handling-uncertainty</loc>
    <lastmod>2026-06-18T16:27:36.275Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-2/5ccs2int-introduction-to-artificial-intelligence/week-4.-uncertainty/2.-markov-chains</loc>
    <lastmod>2026-06-18T16:27:36.275Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-2/5ccs2int-introduction-to-artificial-intelligence/week-4.-uncertainty/3.-value-iteration</loc>
    <lastmod>2026-06-18T16:27:36.275Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-2/5ccs2int-introduction-to-artificial-intelligence/week-5.-introduction-to-machine-learning/1.-overview</loc>
    <lastmod>2026-06-18T16:27:33.535Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-2/5ccs2int-introduction-to-artificial-intelligence/week-5.-introduction-to-machine-learning/2.-analysing-quality-of-supervised-algorithms</loc>
    <lastmod>2026-06-18T16:27:33.535Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-2/5ccs2int-introduction-to-artificial-intelligence/week-5.-introduction-to-machine-learning/3.-underfitting-and-overfitting</loc>
    <lastmod>2026-06-18T16:27:36.275Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-2/5ccs2int-introduction-to-artificial-intelligence/week-6.-unsupervised-machine-learning/1.-overview-of-unsupervised-learning</loc>
    <lastmod>2026-06-18T16:27:33.543Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-2/5ccs2int-introduction-to-artificial-intelligence/week-6.-unsupervised-machine-learning/2.-k-means-clustering</loc>
    <lastmod>2026-06-18T16:27:36.275Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-2/5ccs2int-introduction-to-artificial-intelligence/week-6.-unsupervised-machine-learning/3.-hierarchical-clustering</loc>
    <lastmod>2026-06-18T16:27:36.275Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-2/5ccs2int-introduction-to-artificial-intelligence/week-6.-unsupervised-machine-learning/4.-association-rules</loc>
    <lastmod>2026-06-18T16:27:36.275Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-2/5ccs2int-introduction-to-artificial-intelligence/week-7.-supervised-machine-learning/1.-supervised-learning</loc>
    <lastmod>2026-06-18T16:27:36.275Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-2/5ccs2int-introduction-to-artificial-intelligence/week-7.-supervised-machine-learning/2.-classification---decision-trees</loc>
    <lastmod>2026-06-18T16:27:36.275Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-2/5ccs2int-introduction-to-artificial-intelligence/week-7.-supervised-machine-learning/3.-regression---linear</loc>
    <lastmod>2026-06-18T16:27:36.275Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-2/5ccs2int-introduction-to-artificial-intelligence/week-7.-supervised-machine-learning/4.-neural-network-examples</loc>
    <lastmod>2026-06-18T16:27:36.275Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-2/5ccs2int-introduction-to-artificial-intelligence/week-7.-supervised-machine-learning/gini-split</loc>
    <lastmod>2026-06-18T16:27:33.511Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-2/5ccs2int-introduction-to-artificial-intelligence/week-7.-supervised-machine-learning/lgt</loc>
    <lastmod>2026-06-18T16:27:36.275Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-2/5ccs2int-introduction-to-artificial-intelligence/week-8.-reinforcement-learning/1.-reinforcement-learning</loc>
    <lastmod>2026-06-18T16:27:36.275Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-2/5ccs2int-introduction-to-artificial-intelligence/week-8.-reinforcement-learning/2.-monte-carlo-algorithms</loc>
    <lastmod>2026-06-18T16:27:36.275Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-2/5ccs2int-introduction-to-artificial-intelligence/week-8.-reinforcement-learning/3.-monte-carlo-tree-search</loc>
    <lastmod>2026-06-18T16:27:33.507Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-2/5ccs2int-introduction-to-artificial-intelligence/week-8.-reinforcement-learning/lgt</loc>
    <lastmod>2026-06-18T16:27:33.507Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-2/5ccs2int-introduction-to-artificial-intelligence/week-9.-ethics/1.-application-and-access-of-ai</loc>
    <lastmod>2026-06-18T16:27:33.527Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-2/5ccs2int-introduction-to-artificial-intelligence/week-9.-ethics/2.-harms-and-ethical-considerations-of-ai</loc>
    <lastmod>2026-06-18T16:27:33.523Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-2/5ccs2int-introduction-to-artificial-intelligence/week-9.-ethics/3.-discrimination-and-bias-in-ai</loc>
    <lastmod>2026-06-18T16:27:33.527Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-2/5ccs2int-introduction-to-artificial-intelligence/week-9.-ethics/4.-responsibility-and-minimising-harms-of-ai</loc>
    <lastmod>2026-06-18T16:27:33.523Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-2/5ccs2osc-operating-systems-and-concurrency/1.-concurrency/week-1.-introduction-to-processes,-scheduling-and-threads/1.-processes</loc>
    <lastmod>2026-06-18T16:27:36.275Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-2/5ccs2osc-operating-systems-and-concurrency/1.-concurrency/week-1.-introduction-to-processes,-scheduling-and-threads/2.-cpu-scheduling</loc>
    <lastmod>2026-06-18T16:27:36.275Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-2/5ccs2osc-operating-systems-and-concurrency/1.-concurrency/week-1.-introduction-to-processes,-scheduling-and-threads/3.-threads</loc>
    <lastmod>2026-06-18T16:27:33.495Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-2/5ccs2osc-operating-systems-and-concurrency/1.-concurrency/week-1.-introduction-to-processes,-scheduling-and-threads/exercises</loc>
    <lastmod>2026-06-18T16:27:33.491Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-2/5ccs2osc-operating-systems-and-concurrency/1.-concurrency/week-2.-intro-to-multi-threading-in-java/1.-threads-in-java</loc>
    <lastmod>2026-06-18T16:27:33.479Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-2/5ccs2osc-operating-systems-and-concurrency/1.-concurrency/week-2.-intro-to-multi-threading-in-java/2.-managing-threads</loc>
    <lastmod>2026-06-18T16:27:33.479Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-2/5ccs2osc-operating-systems-and-concurrency/1.-concurrency/week-2.-intro-to-multi-threading-in-java/3.-java-memory-model</loc>
    <lastmod>2026-06-18T16:27:33.483Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-2/5ccs2osc-operating-systems-and-concurrency/1.-concurrency/week-3.-java-synchronisation/1.-introduction-to-java-synchronisation</loc>
    <lastmod>2026-06-18T16:27:33.499Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-2/5ccs2osc-operating-systems-and-concurrency/1.-concurrency/week-3.-java-synchronisation/2.-memory--and--java</loc>
    <lastmod>2026-06-18T16:27:36.275Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-2/5ccs2osc-operating-systems-and-concurrency/1.-concurrency/week-4.-more-concurrency-and-issues-with-conurrency/1.-explicit-locks</loc>
    <lastmod>2026-06-18T16:27:33.483Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-2/5ccs2osc-operating-systems-and-concurrency/1.-concurrency/week-4.-more-concurrency-and-issues-with-conurrency/2.-deadlock</loc>
    <lastmod>2026-06-18T16:27:36.275Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-2/5ccs2osc-operating-systems-and-concurrency/1.-concurrency/week-4.-more-concurrency-and-issues-with-conurrency/3.-semaphores</loc>
    <lastmod>2026-06-18T16:27:33.487Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-2/5ccs2osc-operating-systems-and-concurrency/1.-concurrency/week-4.-more-concurrency-and-issues-with-conurrency/counting-semaphore</loc>
    <lastmod>2026-06-18T16:27:33.491Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-2/5ccs2osc-operating-systems-and-concurrency/1.-concurrency/week-4.-more-concurrency-and-issues-with-conurrency/deadlock</loc>
    <lastmod>2026-06-18T16:27:33.487Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-2/5ccs2osc-operating-systems-and-concurrency/1.-concurrency/week-4.-more-concurrency-and-issues-with-conurrency/reentrant</loc>
    <lastmod>2026-06-18T16:27:33.487Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-2/5ccs2osc-operating-systems-and-concurrency/2.-operating-systems/week-10.-access-control/1.-introduction-to-access-control</loc>
    <lastmod>2026-06-18T16:27:33.475Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-2/5ccs2osc-operating-systems-and-concurrency/2.-operating-systems/week-10.-access-control/2.-definitions,-least-privilege,-confused-deputies</loc>
    <lastmod>2026-06-18T16:27:36.279Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-2/5ccs2osc-operating-systems-and-concurrency/2.-operating-systems/week-10.-access-control/3.-authentication</loc>
    <lastmod>2026-06-18T16:27:33.475Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-2/5ccs2osc-operating-systems-and-concurrency/2.-operating-systems/week-10.-access-control/4.-cryptography-primer</loc>
    <lastmod>2026-06-18T16:27:33.475Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-2/5ccs2osc-operating-systems-and-concurrency/2.-operating-systems/week-11.-advanced-topics/1.-unix</loc>
    <lastmod>2026-06-18T16:27:36.279Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-2/5ccs2osc-operating-systems-and-concurrency/2.-operating-systems/week-11.-advanced-topics/2.-evolution-and-non-evolution-of-operating-systems</loc>
    <lastmod>2026-06-18T16:27:36.279Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-2/5ccs2osc-operating-systems-and-concurrency/2.-operating-systems/week-11.-advanced-topics/3.-key-questions-revisited</loc>
    <lastmod>2026-06-18T16:27:36.279Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-2/5ccs2osc-operating-systems-and-concurrency/2.-operating-systems/week-5.-introduction-to-oses/1.-introduction-to-oses</loc>
    <lastmod>2026-06-18T16:27:36.279Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-2/5ccs2osc-operating-systems-and-concurrency/2.-operating-systems/week-7.-segmentation-and-page-tables/1.-address-binding-problem</loc>
    <lastmod>2026-06-18T16:27:33.471Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-2/5ccs2osc-operating-systems-and-concurrency/2.-operating-systems/week-7.-segmentation-and-page-tables/2.-segmentation</loc>
    <lastmod>2026-06-18T16:27:36.279Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-2/5ccs2osc-operating-systems-and-concurrency/2.-operating-systems/week-7.-segmentation-and-page-tables/3.-paged--address-translation</loc>
    <lastmod>2026-06-18T16:27:36.279Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-2/5ccs2osc-operating-systems-and-concurrency/2.-operating-systems/week-7.-segmentation-and-page-tables/4.-multi-level-page-tables</loc>
    <lastmod>2026-06-18T16:27:36.279Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-2/5ccs2osc-operating-systems-and-concurrency/2.-operating-systems/week-8.-further-virtualisation-of-memory/1.-page-fault-handling</loc>
    <lastmod>2026-06-18T16:27:36.279Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-2/5ccs2osc-operating-systems-and-concurrency/2.-operating-systems/week-8.-further-virtualisation-of-memory/2.-virtual-memory-by-demand-paging</loc>
    <lastmod>2026-06-18T16:27:36.279Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-2/5ccs2osc-operating-systems-and-concurrency/2.-operating-systems/week-8.-further-virtualisation-of-memory/3.-page-replacement-and-frame-allocation</loc>
    <lastmod>2026-06-18T16:27:36.279Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-2/5ccs2osc-operating-systems-and-concurrency/2.-operating-systems/week-9.-user-space-topics--and--io/1.-malloc--and--heap-allocation</loc>
    <lastmod>2026-06-18T16:27:36.279Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-2/5ccs2osc-operating-systems-and-concurrency/2.-operating-systems/week-9.-user-space-topics--and--io/2.-stack,-frame-pointers--and--stack-smashing</loc>
    <lastmod>2026-06-18T16:27:33.455Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-2/5ccs2osc-operating-systems-and-concurrency/2.-operating-systems/week-9.-user-space-topics--and--io/3.-files,-handles--and--ipc</loc>
    <lastmod>2026-06-18T16:27:36.279Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-2/5ccs2pld-programming-language-design-paradigms/week-1.-introduction-to-paradigms/1.-introduction</loc>
    <lastmod>2026-06-18T16:27:33.439Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-2/5ccs2pld-programming-language-design-paradigms/week-1.-introduction-to-paradigms/2.-implementation-techniques</loc>
    <lastmod>2026-06-18T16:27:33.447Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-2/5ccs2pld-programming-language-design-paradigms/week-1.-introduction-to-paradigms/3.-syntax</loc>
    <lastmod>2026-06-18T16:27:36.279Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-2/5ccs2pld-programming-language-design-paradigms/week-1.-introduction-to-paradigms/4.-semantics</loc>
    <lastmod>2026-06-18T16:27:33.443Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-2/5ccs2pld-programming-language-design-paradigms/week-1.-introduction-to-paradigms/tutorial-1</loc>
    <lastmod>2026-06-18T16:27:33.443Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-2/5ccs2pld-programming-language-design-paradigms/week-10.-semantics-of-logic-programs/1.-unification</loc>
    <lastmod>2026-06-18T16:27:33.399Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-2/5ccs2pld-programming-language-design-paradigms/week-10.-semantics-of-logic-programs/2.-sld-resolution-and-back-tracking</loc>
    <lastmod>2026-06-18T16:27:36.279Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-2/5ccs2pld-programming-language-design-paradigms/week-10.-semantics-of-logic-programs/3.-loops-and-constructing-sld-resolution-trees</loc>
    <lastmod>2026-06-18T16:27:36.279Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-2/5ccs2pld-programming-language-design-paradigms/week-10.-semantics-of-logic-programs/principle-of-resolution</loc>
    <lastmod>2026-06-18T16:27:33.395Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-2/5ccs2pld-programming-language-design-paradigms/week-10.-semantics-of-logic-programs/sld-resolution</loc>
    <lastmod>2026-06-18T16:27:33.399Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-2/5ccs2pld-programming-language-design-paradigms/week-10.-semantics-of-logic-programs/tutorial-10</loc>
    <lastmod>2026-06-18T16:27:33.399Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-2/5ccs2pld-programming-language-design-paradigms/week-11.-revision/exercises</loc>
    <lastmod>2026-06-18T16:27:33.427Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-2/5ccs2pld-programming-language-design-paradigms/week-11.-revision/tutorial-11</loc>
    <lastmod>2026-06-18T16:27:33.427Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-2/5ccs2pld-programming-language-design-paradigms/week-2.-imperative-languages/1.-imperative-languages</loc>
    <lastmod>2026-06-18T16:27:33.419Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-2/5ccs2pld-programming-language-design-paradigms/week-2.-imperative-languages/2.-variables</loc>
    <lastmod>2026-06-18T16:27:33.419Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-2/5ccs2pld-programming-language-design-paradigms/week-2.-imperative-languages/3.-flow-of-control</loc>
    <lastmod>2026-06-18T16:27:33.415Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-2/5ccs2pld-programming-language-design-paradigms/week-2.-imperative-languages/tutorial-2</loc>
    <lastmod>2026-06-18T16:27:33.419Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-2/5ccs2pld-programming-language-design-paradigms/week-3.-simp/1.-simp---syntax</loc>
    <lastmod>2026-06-18T16:27:36.279Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-2/5ccs2pld-programming-language-design-paradigms/week-3.-simp/2.-simp---abstract-machine</loc>
    <lastmod>2026-06-18T16:27:33.427Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-2/5ccs2pld-programming-language-design-paradigms/week-3.-simp/tutorial-3</loc>
    <lastmod>2026-06-18T16:27:33.431Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-2/5ccs2pld-programming-language-design-paradigms/week-4.-induction-and-structural-operational-semantics/1.-induction</loc>
    <lastmod>2026-06-18T16:27:36.279Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-2/5ccs2pld-programming-language-design-paradigms/week-4.-induction-and-structural-operational-semantics/2.-small-step-semantics</loc>
    <lastmod>2026-06-18T16:27:36.279Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-2/5ccs2pld-programming-language-design-paradigms/week-4.-induction-and-structural-operational-semantics/3.-big-step-semantics</loc>
    <lastmod>2026-06-18T16:27:36.279Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-2/5ccs2pld-programming-language-design-paradigms/week-4.-induction-and-structural-operational-semantics/coursework-1</loc>
    <lastmod>2026-06-18T16:27:33.439Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-2/5ccs2pld-programming-language-design-paradigms/week-4.-induction-and-structural-operational-semantics/tutorial-4</loc>
    <lastmod>2026-06-18T16:27:33.439Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-2/5ccs2pld-programming-language-design-paradigms/week-7.-intro-to-functional-programming/1.-general-concepts</loc>
    <lastmod>2026-06-18T16:27:33.423Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-2/5ccs2pld-programming-language-design-paradigms/week-7.-intro-to-functional-programming/2.-function-definitions-and-composition</loc>
    <lastmod>2026-06-18T16:27:33.423Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-2/5ccs2pld-programming-language-design-paradigms/week-7.-intro-to-functional-programming/3.-curryification</loc>
    <lastmod>2026-06-18T16:27:33.423Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-2/5ccs2pld-programming-language-design-paradigms/week-8.-functional-prog.-types-and-semantics/1.-introduction-to-types</loc>
    <lastmod>2026-06-18T16:27:33.403Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-2/5ccs2pld-programming-language-design-paradigms/week-8.-functional-prog.-types-and-semantics/2.-lists-and-user-defined-types</loc>
    <lastmod>2026-06-18T16:27:33.407Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-2/5ccs2pld-programming-language-design-paradigms/week-8.-functional-prog.-types-and-semantics/3.-introduction-to-functional-semantics</loc>
    <lastmod>2026-06-18T16:27:36.279Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-2/5ccs2pld-programming-language-design-paradigms/week-8.-functional-prog.-types-and-semantics/4.-call-by-name-evaluation,-types,-and-typing</loc>
    <lastmod>2026-06-18T16:27:36.279Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-2/5ccs2pld-programming-language-design-paradigms/week-8.-functional-prog.-types-and-semantics/tutorial-8</loc>
    <lastmod>2026-06-18T16:27:33.403Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-2/5ccs2pld-programming-language-design-paradigms/week-8.-functional-prog.-types-and-semantics/tutorial</loc>
    <lastmod>2026-06-18T16:27:33.407Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-2/5ccs2pld-programming-language-design-paradigms/week-9.-intro-to-logic-programming/1.-general-concepts</loc>
    <lastmod>2026-06-18T16:27:33.415Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-2/5ccs2pld-programming-language-design-paradigms/week-9.-intro-to-logic-programming/2.-clauses-and-substitutions</loc>
    <lastmod>2026-06-18T16:27:33.411Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-2/5ccs2pld-programming-language-design-paradigms/week-9.-intro-to-logic-programming/3.-built-in-predicates,-lists,-and-language-limitations</loc>
    <lastmod>2026-06-18T16:27:33.415Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/</loc>
    <lastmod>2026-06-18T16:27:33.659Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-3/semester-1/6ccs3ain-ai-reasoning/1.-introduction-to-ai/</loc>
    <lastmod>2026-06-18T16:27:36.279Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-3/semester-1/6ccs3ain-ai-reasoning/1.-introduction-to-ai/tutorial</loc>
    <lastmod>2026-06-18T16:27:33.747Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-3/semester-1/6ccs3ain-ai-reasoning/10.-ethics/</loc>
    <lastmod>2026-06-18T16:27:33.739Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-3/semester-1/6ccs3ain-ai-reasoning/2.-probabilities/</loc>
    <lastmod>2026-06-18T16:27:33.751Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-3/semester-1/6ccs3ain-ai-reasoning/2.-probabilities/lgt</loc>
    <lastmod>2026-06-18T16:27:33.751Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-3/semester-1/6ccs3ain-ai-reasoning/3.-bayesian-networks/</loc>
    <lastmod>2026-06-18T16:27:36.283Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-3/semester-1/6ccs3ain-ai-reasoning/4.-sequential-decision-making/</loc>
    <lastmod>2026-06-18T16:27:36.283Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-3/semester-1/6ccs3ain-ai-reasoning/5.-pca/</loc>
    <lastmod>2026-06-18T16:27:36.283Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-3/semester-1/6ccs3ain-ai-reasoning/6.-clustering/</loc>
    <lastmod>2026-06-18T16:27:36.283Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-3/semester-1/6ccs3ain-ai-reasoning/7.-game-theory/</loc>
    <lastmod>2026-06-18T16:27:36.283Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-3/semester-1/6ccs3ain-ai-reasoning/8.-argumentation--and--dialog---machine-languages/</loc>
    <lastmod>2026-06-18T16:27:36.283Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-3/semester-1/6ccs3ain-ai-reasoning/9.-consensus-mechanisms/</loc>
    <lastmod>2026-06-18T16:27:33.747Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-3/semester-1/6ccs3cfl-compilers-and-formal-languages/1.-introduction/</loc>
    <lastmod>2026-06-18T16:27:33.775Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-3/semester-1/6ccs3cfl-compilers-and-formal-languages/10.-llvm/</loc>
    <lastmod>2026-06-18T16:27:36.283Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-3/semester-1/6ccs3cfl-compilers-and-formal-languages/2.-regular-expressions,-derivatives/</loc>
    <lastmod>2026-06-18T16:27:33.787Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-3/semester-1/6ccs3cfl-compilers-and-formal-languages/3.-automata,-regular-languages/</loc>
    <lastmod>2026-06-18T16:27:36.283Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-3/semester-1/6ccs3cfl-compilers-and-formal-languages/3.-automata,-regular-languages/sgt</loc>
    <lastmod>2026-06-18T16:27:36.283Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-3/semester-1/6ccs3cfl-compilers-and-formal-languages/4.-lexing,-tokenising/</loc>
    <lastmod>2026-06-18T16:27:36.283Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-3/semester-1/6ccs3cfl-compilers-and-formal-languages/4.-lexing,-tokenising/sgt</loc>
    <lastmod>2026-06-18T16:27:33.791Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-3/semester-1/6ccs3cfl-compilers-and-formal-languages/5.-grammars,-parsing/</loc>
    <lastmod>2026-06-18T16:27:36.283Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-3/semester-1/6ccs3cfl-compilers-and-formal-languages/6.-parser-combinators,-while-language/</loc>
    <lastmod>2026-06-18T16:27:33.783Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-3/semester-1/6ccs3cfl-compilers-and-formal-languages/7.-compilation,-jvm/</loc>
    <lastmod>2026-06-18T16:27:36.283Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-3/semester-1/6ccs3cfl-compilers-and-formal-languages/7.-compilation,-jvm/sgt</loc>
    <lastmod>2026-06-18T16:27:33.779Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-3/semester-1/6ccs3cfl-compilers-and-formal-languages/8.-compiling-functional-languages/</loc>
    <lastmod>2026-06-18T16:27:36.283Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-3/semester-1/6ccs3cfl-compilers-and-formal-languages/9.-optimisations/</loc>
    <lastmod>2026-06-18T16:27:36.283Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-3/semester-1/6ccs3cfl-compilers-and-formal-languages/9.-optimisations/sgt</loc>
    <lastmod>2026-06-18T16:27:33.783Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-3/semester-1/6ccs3cis-cryptography/1.-information-security/</loc>
    <lastmod>2026-06-18T16:27:36.283Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-3/semester-1/6ccs3cis-cryptography/10.-authentication,-zero-knowledge,-and-social-engineering/</loc>
    <lastmod>2026-06-18T16:27:36.283Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-3/semester-1/6ccs3cis-cryptography/2.-cryptographic-overview/</loc>
    <lastmod>2026-06-18T16:27:36.283Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-3/semester-1/6ccs3cis-cryptography/3.-ciphers/</loc>
    <lastmod>2026-06-18T16:27:36.283Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-3/semester-1/6ccs3cis-cryptography/3.-ciphers/sgt</loc>
    <lastmod>2026-06-18T16:27:33.763Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-3/semester-1/6ccs3cis-cryptography/4.-steganography-and-feistel-cipher/</loc>
    <lastmod>2026-06-18T16:27:36.283Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-3/semester-1/6ccs3cis-cryptography/4.-steganography-and-feistel-cipher/sgt</loc>
    <lastmod>2026-06-18T16:27:36.283Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-3/semester-1/6ccs3cis-cryptography/5.-des-and-aes/</loc>
    <lastmod>2026-06-18T16:27:36.283Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-3/semester-1/6ccs3cis-cryptography/5.-des-and-aes/sgt</loc>
    <lastmod>2026-06-18T16:27:33.755Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-3/semester-1/6ccs3cis-cryptography/6.-block-cipher-modes-of-operation-and-public-key-cryptography/</loc>
    <lastmod>2026-06-18T16:27:36.283Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-3/semester-1/6ccs3cis-cryptography/6.-block-cipher-modes-of-operation-and-public-key-cryptography/sgt</loc>
    <lastmod>2026-06-18T16:27:33.771Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-3/semester-1/6ccs3cis-cryptography/7.-number-theory-and-rsa-algorithm/</loc>
    <lastmod>2026-06-18T16:27:36.283Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-3/semester-1/6ccs3cis-cryptography/8.-asymmetric-algorithms-for-secret-key-distribution,-message-integrity-and-authentication/</loc>
    <lastmod>2026-06-18T16:27:36.283Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-3/semester-1/6ccs3cis-cryptography/9.-security-protocols-and-kerberos-protocol/</loc>
    <lastmod>2026-06-18T16:27:36.287Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-3/semester-2/6ccs3com-computational-models/1.-computability/</loc>
    <lastmod>2026-06-18T16:27:36.287Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-3/semester-2/6ccs3com-computational-models/2.-automata/</loc>
    <lastmod>2026-06-18T16:27:36.287Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-3/semester-2/6ccs3com-computational-models/3.-turing-machines/</loc>
    <lastmod>2026-06-18T16:27:36.287Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-3/semester-2/6ccs3com-computational-models/4.-applications-of-automata;-compiler-construction/</loc>
    <lastmod>2026-06-18T16:27:36.287Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-3/semester-2/6ccs3com-computational-models/6.-lambda-calculus-(part-1)/</loc>
    <lastmod>2026-06-18T16:27:36.287Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-3/semester-2/6ccs3com-computational-models/7.-lambda-calculus-(part-2)/</loc>
    <lastmod>2026-06-18T16:27:36.287Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-3/semester-2/6ccs3com-computational-models/8.-interaction-nets/</loc>
    <lastmod>2026-06-18T16:27:36.287Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-3/semester-2/6ccs3com-computational-models/9.-calculus-of-communicating-systems-(ccs)/</loc>
    <lastmod>2026-06-18T16:27:33.671Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-3/semester-2/6ccs3ml1-machine-learning/1.-introduction/</loc>
    <lastmod>2026-06-18T16:27:36.287Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-3/semester-2/6ccs3ml1-machine-learning/1.-introduction/sgt</loc>
    <lastmod>2026-06-18T16:27:33.675Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-3/semester-2/6ccs3ml1-machine-learning/2.-inductive-learning/</loc>
    <lastmod>2026-06-18T16:27:36.287Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-3/semester-2/6ccs3ml1-machine-learning/3.-probabilistic-models-1/</loc>
    <lastmod>2026-06-18T16:27:36.287Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-3/semester-2/6ccs3ml1-machine-learning/4.-probabilistic-models-2/</loc>
    <lastmod>2026-06-18T16:27:36.287Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-3/semester-2/6ccs3ml1-machine-learning/5.-kernel-machines/</loc>
    <lastmod>2026-06-18T16:27:33.679Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-3/semester-2/6ccs3ml1-machine-learning/7.-reinforcement-learning-1/</loc>
    <lastmod>2026-06-18T16:27:33.679Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-3/semester-2/6ccs3ml1-machine-learning/8.-reinforcement-learning-2/</loc>
    <lastmod>2026-06-18T16:27:33.683Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-3/semester-2/6ccs3ome-optimisation-methods/1.-single-source-shortest-paths-problem,-relaxation-technique,-bellman-ford-algorithm/</loc>
    <lastmod>2026-06-18T16:27:36.287Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-3/semester-2/6ccs3ome-optimisation-methods/10.-constrained-optimisation/</loc>
    <lastmod>2026-06-18T16:27:33.719Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-3/semester-2/6ccs3ome-optimisation-methods/10.-constrained-optimisation/sgt</loc>
    <lastmod>2026-06-18T16:27:33.723Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-3/semester-2/6ccs3ome-optimisation-methods/2.-dijkstra's-shortest-paths-algorithm,-shortest-paths-algorithms-for-dags/</loc>
    <lastmod>2026-06-18T16:27:36.287Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-3/semester-2/6ccs3ome-optimisation-methods/2.-dijkstra's-shortest-paths-algorithm,-shortest-paths-algorithms-for-dags/sgt</loc>
    <lastmod>2026-06-18T16:27:33.695Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-3/semester-2/6ccs3ome-optimisation-methods/3.-all-pairs-shortest-paths,-point-to-point-shortest-paths-in-geographical-networks/</loc>
    <lastmod>2026-06-18T16:27:36.287Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-3/semester-2/6ccs3ome-optimisation-methods/3.-all-pairs-shortest-paths,-point-to-point-shortest-paths-in-geographical-networks/sgt</loc>
    <lastmod>2026-06-18T16:27:36.287Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-3/semester-2/6ccs3ome-optimisation-methods/4.-network-flow-problems,-maximum-flow-problem,-ford-fulkerson-method/</loc>
    <lastmod>2026-06-18T16:27:36.287Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-3/semester-2/6ccs3ome-optimisation-methods/4.-network-flow-problems,-maximum-flow-problem,-ford-fulkerson-method/sgt</loc>
    <lastmod>2026-06-18T16:27:33.699Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-3/semester-2/6ccs3ome-optimisation-methods/5.-edmonds-karp-maximum-flow-algorithm,-maximum-bi-partite-matching,-minimum-flow/</loc>
    <lastmod>2026-06-18T16:27:36.287Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-3/semester-2/6ccs3ome-optimisation-methods/6.-minimum-cost-flow-problem,-multi-commodity-flow-problems/</loc>
    <lastmod>2026-06-18T16:27:36.287Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-3/semester-2/6ccs3ome-optimisation-methods/6.-minimum-cost-flow-problem,-multi-commodity-flow-problems/sgt</loc>
    <lastmod>2026-06-18T16:27:36.287Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-3/semester-2/6ccs3ome-optimisation-methods/7.-linear-programming,-introduction-to-numeric-optimisation/</loc>
    <lastmod>2026-06-18T16:27:36.287Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-3/semester-2/6ccs3ome-optimisation-methods/7.-linear-programming,-introduction-to-numeric-optimisation/sgt</loc>
    <lastmod>2026-06-18T16:27:36.287Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-3/semester-2/6ccs3ome-optimisation-methods/8.-basic-concepts-in-convexity,-convex-sets,-convex-functions,-convex-optimisation/</loc>
    <lastmod>2026-06-18T16:27:36.287Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-3/semester-2/6ccs3ome-optimisation-methods/8.-basic-concepts-in-convexity,-convex-sets,-convex-functions,-convex-optimisation/sgt</loc>
    <lastmod>2026-06-18T16:27:33.687Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-3/semester-2/6ccs3ome-optimisation-methods/9.-gradient-methods,-stochastic-optimisation/</loc>
    <lastmod>2026-06-18T16:27:36.287Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-3/semester-2/6ccs3ome-optimisation-methods/9.-gradient-methods,-stochastic-optimisation/sgt</loc>
    <lastmod>2026-06-18T16:27:33.731Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-3/</loc>
    <lastmod>2026-06-18T16:27:33.731Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-4/gpr-notes</loc>
    <lastmod>2026-06-18T16:27:35.671Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-4/</loc>
    <lastmod>2026-06-18T16:27:35.671Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/</loc>
    <lastmod>2026-06-18T16:27:36.123Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/gpr/</loc>
    <lastmod>2026-06-18T16:27:59.502Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/gpr/lgt/</loc>
    <lastmod>2026-06-18T16:27:59.502Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/gpr/meeting-notes/</loc>
    <lastmod>2026-06-18T16:27:59.502Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/lecture-notes/</loc>
    <lastmod>2026-06-18T16:27:59.502Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/1.-glossary/</loc>
    <lastmod>2026-06-18T16:27:59.502Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/</loc>
    <lastmod>2026-06-18T16:27:59.502Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1--and--2/</loc>
    <lastmod>2026-06-18T16:27:59.502Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1--and--2/4ccs1ela-elementary-logic-with-applications/supplemental-exercises/</loc>
    <lastmod>2026-06-18T16:27:59.502Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1--and--2/4ccs1ela-elementary-logic-with-applications/tutorials/</loc>
    <lastmod>2026-06-18T16:27:59.502Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1--and--2/4ccs1ppa-programming-practice-and-applications/coursework/</loc>
    <lastmod>2026-06-18T16:27:59.502Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/</loc>
    <lastmod>2026-06-18T16:27:59.502Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1cs1-computer-systems-1/past-paper/</loc>
    <lastmod>2026-06-18T16:27:59.502Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1fc1-foundations-of-computing-1/diagrams/</loc>
    <lastmod>2026-06-18T16:27:59.502Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1fc1-foundations-of-computing-1/week-11.-revision/</loc>
    <lastmod>2026-06-18T16:27:59.502Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-1/4ccs1fc1-foundations-of-computing-1/week-6.-graphs/diagrams/</loc>
    <lastmod>2026-06-18T16:27:59.502Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-2/</loc>
    <lastmod>2026-06-18T16:27:59.502Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-2/4ccs1dst-data-structures/assignments/</loc>
    <lastmod>2026-06-18T16:27:59.502Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-2/4ccs1dst-data-structures/sgt/sgt1/</loc>
    <lastmod>2026-06-18T16:27:59.502Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-1/semester-2/4ccs1dst-data-structures/sgt/</loc>
    <lastmod>2026-06-18T16:27:59.502Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-1--and--2/5ccs2seg-software-engineering-group-project/</loc>
    <lastmod>2026-06-18T16:27:59.502Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-1--and--2/</loc>
    <lastmod>2026-06-18T16:27:59.502Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-1/5ccs2fc2-foundations-of-computing-2/coursework/</loc>
    <lastmod>2026-06-18T16:27:59.502Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-1/5ccs2fc2-foundations-of-computing-2/</loc>
    <lastmod>2026-06-18T16:27:59.502Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-1/</loc>
    <lastmod>2026-06-18T16:27:59.502Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-1/5ccs2fc2-foundations-of-computing-2/week-1.-automata-and-turing-machines/</loc>
    <lastmod>2026-06-18T16:27:59.502Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-1/5ccs2fc2-foundations-of-computing-2/week-10.-limits-of-computation/</loc>
    <lastmod>2026-06-18T16:27:59.502Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-1/5ccs2fc2-foundations-of-computing-2/week-11.-limits-of-computations-(cont.)/</loc>
    <lastmod>2026-06-18T16:27:59.502Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-1/5ccs2fc2-foundations-of-computing-2/week-2.-p-vs-np/</loc>
    <lastmod>2026-06-18T16:27:59.502Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-1/5ccs2fc2-foundations-of-computing-2/week-3.-the-cook-levin-theorem--and--divide-and-conquer/</loc>
    <lastmod>2026-06-18T16:27:59.502Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-1/5ccs2fc2-foundations-of-computing-2/week-4.-graph-algorithms/</loc>
    <lastmod>2026-06-18T16:27:59.502Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-1/5ccs2fc2-foundations-of-computing-2/week-5.-sat-solving/</loc>
    <lastmod>2026-06-18T16:27:59.502Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-1/5ccs2fc2-foundations-of-computing-2/week-7.-approximation-and-the-travelling-salesman/</loc>
    <lastmod>2026-06-18T16:27:59.502Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-1/5ccs2fc2-foundations-of-computing-2/week-8.-linear-programming/</loc>
    <lastmod>2026-06-18T16:27:59.502Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-1/5ccs2fc2-foundations-of-computing-2/week-9.-probabilistic-algorithms/</loc>
    <lastmod>2026-06-18T16:27:59.502Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-1/5ccs2itr-introduction-to-robotics/extra/</loc>
    <lastmod>2026-06-18T16:27:59.502Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-1/5ccs2itr-introduction-to-robotics/</loc>
    <lastmod>2026-06-18T16:27:59.502Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-1/5ccs2pep-practical-experiences-of-programming/</loc>
    <lastmod>2026-06-18T16:27:59.502Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-2/5ccs2int-introduction-to-artificial-intelligence/week-1.-intro-to-ai-and-search/</loc>
    <lastmod>2026-06-18T16:27:59.502Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-2/5ccs2int-introduction-to-artificial-intelligence/</loc>
    <lastmod>2026-06-18T16:27:59.502Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-2/</loc>
    <lastmod>2026-06-18T16:27:59.502Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-2/5ccs2int-introduction-to-artificial-intelligence/week-2.-adversarial-search--and--constraint-satisfaction/</loc>
    <lastmod>2026-06-18T16:27:59.502Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-2/5ccs2int-introduction-to-artificial-intelligence/week-3.-automated-planning/</loc>
    <lastmod>2026-06-18T16:27:59.502Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-2/5ccs2int-introduction-to-artificial-intelligence/week-4.-uncertainty/</loc>
    <lastmod>2026-06-18T16:27:59.502Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-2/5ccs2int-introduction-to-artificial-intelligence/week-5.-introduction-to-machine-learning/</loc>
    <lastmod>2026-06-18T16:27:59.502Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-2/5ccs2int-introduction-to-artificial-intelligence/week-6.-unsupervised-machine-learning/</loc>
    <lastmod>2026-06-18T16:27:59.502Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-2/5ccs2int-introduction-to-artificial-intelligence/week-7.-supervised-machine-learning/</loc>
    <lastmod>2026-06-18T16:27:59.502Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-2/5ccs2int-introduction-to-artificial-intelligence/week-8.-reinforcement-learning/</loc>
    <lastmod>2026-06-18T16:27:59.502Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-2/5ccs2int-introduction-to-artificial-intelligence/week-9.-ethics/</loc>
    <lastmod>2026-06-18T16:27:59.502Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-2/5ccs2osc-operating-systems-and-concurrency/1.-concurrency/week-1.-introduction-to-processes,-scheduling-and-threads/</loc>
    <lastmod>2026-06-18T16:27:59.502Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-2/5ccs2osc-operating-systems-and-concurrency/1.-concurrency/</loc>
    <lastmod>2026-06-18T16:27:59.502Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-2/5ccs2osc-operating-systems-and-concurrency/</loc>
    <lastmod>2026-06-18T16:27:59.502Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-2/5ccs2osc-operating-systems-and-concurrency/1.-concurrency/week-2.-intro-to-multi-threading-in-java/</loc>
    <lastmod>2026-06-18T16:27:59.502Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-2/5ccs2osc-operating-systems-and-concurrency/1.-concurrency/week-3.-java-synchronisation/</loc>
    <lastmod>2026-06-18T16:27:59.502Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-2/5ccs2osc-operating-systems-and-concurrency/1.-concurrency/week-4.-more-concurrency-and-issues-with-conurrency/</loc>
    <lastmod>2026-06-18T16:27:59.502Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-2/5ccs2osc-operating-systems-and-concurrency/2.-operating-systems/week-10.-access-control/</loc>
    <lastmod>2026-06-18T16:27:59.502Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-2/5ccs2osc-operating-systems-and-concurrency/2.-operating-systems/</loc>
    <lastmod>2026-06-18T16:27:59.502Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-2/5ccs2osc-operating-systems-and-concurrency/2.-operating-systems/week-11.-advanced-topics/</loc>
    <lastmod>2026-06-18T16:27:59.502Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-2/5ccs2osc-operating-systems-and-concurrency/2.-operating-systems/week-5.-introduction-to-oses/</loc>
    <lastmod>2026-06-18T16:27:59.502Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-2/5ccs2osc-operating-systems-and-concurrency/2.-operating-systems/week-7.-segmentation-and-page-tables/</loc>
    <lastmod>2026-06-18T16:27:59.502Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-2/5ccs2osc-operating-systems-and-concurrency/2.-operating-systems/week-8.-further-virtualisation-of-memory/</loc>
    <lastmod>2026-06-18T16:27:59.502Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-2/5ccs2osc-operating-systems-and-concurrency/2.-operating-systems/week-9.-user-space-topics--and--io/</loc>
    <lastmod>2026-06-18T16:27:59.502Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-2/5ccs2pld-programming-language-design-paradigms/week-1.-introduction-to-paradigms/</loc>
    <lastmod>2026-06-18T16:27:59.502Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-2/5ccs2pld-programming-language-design-paradigms/</loc>
    <lastmod>2026-06-18T16:27:59.502Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-2/5ccs2pld-programming-language-design-paradigms/week-10.-semantics-of-logic-programs/</loc>
    <lastmod>2026-06-18T16:27:59.502Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-2/5ccs2pld-programming-language-design-paradigms/week-11.-revision/</loc>
    <lastmod>2026-06-18T16:27:59.502Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-2/5ccs2pld-programming-language-design-paradigms/week-2.-imperative-languages/</loc>
    <lastmod>2026-06-18T16:27:59.502Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-2/5ccs2pld-programming-language-design-paradigms/week-3.-simp/</loc>
    <lastmod>2026-06-18T16:27:59.502Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-2/5ccs2pld-programming-language-design-paradigms/week-4.-induction-and-structural-operational-semantics/</loc>
    <lastmod>2026-06-18T16:27:59.502Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-2/5ccs2pld-programming-language-design-paradigms/week-7.-intro-to-functional-programming/</loc>
    <lastmod>2026-06-18T16:27:59.502Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-2/5ccs2pld-programming-language-design-paradigms/week-8.-functional-prog.-types-and-semantics/</loc>
    <lastmod>2026-06-18T16:27:59.502Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-2/semester-2/5ccs2pld-programming-language-design-paradigms/week-9.-intro-to-logic-programming/</loc>
    <lastmod>2026-06-18T16:27:59.502Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-3/semester-1/6ccs3ain-ai-reasoning/</loc>
    <lastmod>2026-06-18T16:27:59.502Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-3/semester-1/</loc>
    <lastmod>2026-06-18T16:27:59.502Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-3/semester-1/6ccs3cfl-compilers-and-formal-languages/</loc>
    <lastmod>2026-06-18T16:27:59.502Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-3/semester-1/6ccs3cis-cryptography/</loc>
    <lastmod>2026-06-18T16:27:59.502Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-3/semester-2/6ccs3com-computational-models/</loc>
    <lastmod>2026-06-18T16:27:59.502Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-3/semester-2/</loc>
    <lastmod>2026-06-18T16:27:59.502Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-3/semester-2/6ccs3ml1-machine-learning/</loc>
    <lastmod>2026-06-18T16:27:59.502Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/university/year-3/semester-2/6ccs3ome-optimisation-methods/</loc>
    <lastmod>2026-06-18T16:27:59.502Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/tags/topicethics</loc>
    <lastmod>2026-06-18T16:27:59.502Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/tags/markerdonotlearn</loc>
    <lastmod>2026-06-18T16:27:59.502Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/tags/module4ccs1ipp</loc>
    <lastmod>2026-06-18T16:27:59.502Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/tags/typedefinition</loc>
    <lastmod>2026-06-18T16:27:59.502Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/tags/module4ccs1ppa</loc>
    <lastmod>2026-06-18T16:27:59.502Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/tags/topicjava</loc>
    <lastmod>2026-06-18T16:27:59.502Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/tags/topiclowlevelarchitecture</loc>
    <lastmod>2026-06-18T16:27:59.502Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/tags/module4ccs1cs1</loc>
    <lastmod>2026-06-18T16:27:59.502Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/tags/topicsets</loc>
    <lastmod>2026-06-18T16:27:59.502Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/tags/topicrelations</loc>
    <lastmod>2026-06-18T16:27:59.502Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/tags/module4ccs1fc1</loc>
    <lastmod>2026-06-18T16:27:59.502Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/tags/module4ccs1ela</loc>
    <lastmod>2026-06-18T16:27:59.502Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/tags/topicpropositionallogic</loc>
    <lastmod>2026-06-18T16:27:59.502Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/tags/topicproof</loc>
    <lastmod>2026-06-18T16:27:59.502Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/tags/topicpredicatelogic</loc>
    <lastmod>2026-06-18T16:27:59.502Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/tags/topicfunctions</loc>
    <lastmod>2026-06-18T16:27:59.502Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/tags/topicbinary</loc>
    <lastmod>2026-06-18T16:27:59.502Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/tags/topiccombinatorials</loc>
    <lastmod>2026-06-18T16:27:59.502Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/tags/todo</loc>
    <lastmod>2026-06-18T16:27:59.502Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/tags/topic</loc>
    <lastmod>2026-06-18T16:27:59.502Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/tags/typesummary</loc>
    <lastmod>2026-06-18T16:27:59.502Z</lastmod>
  </url><url>
    <loc>https://obsidian-notes-a34915.is.horse/tags/</loc>
    <lastmod>2026-06-18T16:27:59.502Z</lastmod>
  </url></urlset>