My Notes

These are my notes. I write down all my ideas and knowledege into my notes. I am making my notes public because I want to share what I know, so that others may learn. If you want to learn more about my notes, see How I Take Notes

Hacker's Delight operating system process Report on Formalised Bit Vector Decision Procedures hardlink soft link buffer cache process control block context switch process lifecycle setuid inode Operating Systems Course Segmentation (Memory)page table paging internal fragmentation memory fragmentation memory compaction textbooks plans for the Fisher Society gsoc 2024 disk scheduling algorithms Vectored IO buffering Asynchronous IO Non-blocking IO Blocking IO network devices character devices block devices types of IO devices working set DMA polling thrashing (memory)Belady’s anomaly FIFO Page replacement Unix copy on write virtual memory demand paging Software Interrupt page fault opengl pipeline rasterization CPU scheduling criteria dispatcher dispatch latency CPU bound process CPU scheduler kernel (OS)process termination process creation access matrix Machine Learning Invariant Project List of Sayings of Holy Fathers History Card Game History of the Orthodox Church Category Theory For Beginners Book Category of Computable Functions list fuctor Examples of Functors Maybe functor endofunctor Functor Opposite Category List of Constructions on Categories Examples of Categories Category foundations of CS supervision 4 foundations of CS supervision 5 Foundations of CS Supervision 2 Questions -- Atticus Kuhn logical implication Introduction to Databases class imperative programming in ocaml digital electronics supervision 2 differentiation (mathematics)NST1A Mathematics I Notes (Course B)hyperbola Foundations of CS Supervision 3 solutions -- Atticus Kuhn transistor power (physics)state machine reduction breadth-first search queue (computer science)complex trig functions fundamental theorem of algebra databases supervision sheet 1 graph (discrete mathematics)depth-first search topological sort of a graph hyperbolic trigonometric functions one hot state encoding D-type flip-flop 5 state counter example lazy list shift register relational algebra SQL relational Database complex logarithm oscillation problems De Moivre's Theorem roots of unity complex number matrix multiplication curried function finite state machine moore machine synchroniser Meta-stability in Digital Electronics meta-stability Coin Changing Problem list map quicksort insertion sort NST1A Math Example Sheet 1 Solutions vector product polar representation of complex numbers complex conjugate Argand Diagram vector area serial data link clock skew hold time constraint time constrain limits clock speed synchronous counter modified state transition table binary search tree association list spherical coordinates units/dimension of vectors vector basis characteristic table Digital Electronics Hardware Labs tips for building a circuit Digital Electronics My Notes algebraic data types Exceptions (programming)Foundations of Computer Science Notes entity-relationship diagram introduction to databases notes cylindrical polar coordinates Coordinate System (Vector Space)orthonormal basis linearly independent Calculating the angle between 2 Vectors vector triple product scalar triple product shortest distance between 2 lines Vector Equation for a Line ripple counter synchronous circuit master-slave D flip-flop Transparent D Latch Sorting a List mergesort static hazard Digital Electronics Example Sheet I Solutions -- Atticus Kuhn shortest distance from line to a point equation of a cone tri-state buffer Programmable Logic Arrays Programmable Array Logic read only memory demultiplexer multiplexer timing diagram Hazard (Digital Logic)Ocaml Lists Foundations of CS Supervision 1 Questions -- Atticus Kuhn Dynamic Programming Rule of Sarrus Fast Carry Generation Ripple Carry Adder Quine-McClusky Method Product of Sums from Karnaugh Map Database Terms intersection of 2 planes vector projection Vector Scalar Product Orthonormal Essential Prime Implicant Prime Implicant Karnaugh Map Asymptotic Complexity of Computable Function Big O Notation Recursion vs Iteration in Programming Heap vs Stack Recursion Kinematics Vector Magnitude unit vector NST1A: Mathematics I (Course B)Boolean Simplification Boolean Algebra Logic Gate not gate Logic Variable digital electronics course Foundations of Computer Science Course Properties of Vectors Vectors Natural Transformation International Student Welcome Cambridge Freshers Fair 2023 TSCU Respect Workshops Cambridge Cake with the President International Freshers Week Punting Math A vs Math B at Cambridge My Concatenative Langauge Relationship between Cooking Recipes and Linear Logic Tasks for my website About My Notes zettelkasten Trinity College standard library of Agda Contacting Atticus Kuhn Joy (Programming Language)RSS Feed Blog Divine Lirturgy Path Induction Trinity Pre-Arrival Workshops Atticus Kuhn Computer Science Cambridge Jon M Sterling Agda make illegal states unrepresentable lisp emacs org-mode 2023 Michaelmas Term at Cambridge Cambridge Computer Science Pre-Course Work A Galilean revolution for computing: Unboundedly scalable reliability and efficiency Booleans Considered Harmful Blog injective function Kharkiv-Vienna Lectures 08/11. 6pm (EEST). Herbert Koch | «Dynamics of the quadratic family»08/13. 8pm (EEST). Mykhaylo Shkolnikov | «Shuffling Cards»08/14. 6pm (EEST). Vadim Kaloshin | «Markov partitions and coding the cat map»08/15. 10am (EEST). Lisa Sauermann | «The card game SET and some results in extremal combinatorics»08/16. 6pm (EEST). Yurii Malitsky | «Continuous optimization for machine learning»08/17. 6pm (EEST). Kostiantyn Drach | «Fractals, complex dynamics and finding roots of polynomials»08/18. 6pm (EEST). Svitlana Mayboroda | «Wave localization»08/19. 6pm (EEST). Pavel Etingof | «How to count colorings»08/21. 6pm (EEST). Gerald Teschl | «Lattice based cryptography»