Zettel Index
- Wipe your glasses
- WIP blogpost tracker
- Understanding linear types in Haskell [WIP]
- Building a computer from scratch (diary)
- Beautiful moon review / diary
- How discrimination can help us accomplish linear time sorting for a multitude of data types [IDEA]
- The y combinator
- Unplugged book (diary)
- Technical analysis of blockchains [WIP]
- How not to study in NUS CS [IDEA]
- Category theory log
- Observing the effects of instruction pipelining [IDEA]
- Comparisons of different containerization technologies [WIP]
- Observing the effects of IO bottleneck [IDEA]
- How does Git actually work
- How trains (MRT) forecast arrival times [WIP]
- Haskell singletons [WIP]
- High-level overview of my ray-tracer
- How react performs reloading of webpages [WIP]
- Purely functional data structures and algorithms (log)
- Science of high rise building foundations [WIP]
- Song discoveries
- AI powered recommendation feed
- My favourite blogs / feeds
- WIP blogpost tracker
- cs2106 week 7
- What are the types of fragmentation, and how do they occur?
- How do we allocate memory?
- Disjoint memory schemes
- What are dynamic allocation algorithms?
- What interface does memory access use?
- What are OS responsibilities for memory management?
- How do we manage chunks of memory?
- How do we use secondary storage (virtual mmemory)?
- CS4215 week 6
- What is a mental model for heap memory?
- How did memory management evolve?
- Will a given program run out of memory?
- Can we design a virtual machine that makes effective use of the available memory?
- What are general ways to manage memory?
- Once a data structure is created, will it have to be stored until the end of the program execution?
- CS2106 - Operating systems
- Operating systems overview
- Operating systems threads
- Operating systems processes management
- Operating systems synchronization / synchronizing threads
- Operating Process Communication
- Operating systems concepts - Chapter 1
- memory management
- CS3211
- ostep log
- stack and heap memory
- Using Reference counted pointers in Rust
- Resolving concurrency in mutable systems
- Project ideas
- December 2021 plans
- cs2105
- cs2105 week 3
- What can UDP be used for?
- UDP checksum
- What is reliable data transfer protocol (rdt)?
- Sample UDP client
- Sample TCP server
- How do you design a reliable data transfer protocol (rdt)?
- network socket
- transport service properties
- Sample UDP server
- url vs ip address
- Why is UDP unreliable?
- What is selective repeat?
- How can we manage (relatively) reliable transmission over UDP?
- How do we make rdt3.0 better?
- transport service protocols
- Why rdt3.0 perf is shitty?
- Sample TCP client
- cs2105 week 1
- cs2105 week 5
- What are properties of TCP?
- What is the TCP sequence number?
- How to terminate connection?
- What is TCP sequence number for?
- What is TCP?
- When to retransmit TCP?
- How to setup connection?
- How do you connect in TCP?
- How do you setup send and receive buffers (TCP)?
- What is acknowledgement number for?
- How do we structure a TCP segment?
- cs2105 week 10
- cs2105 week 2
- cs2105 week 4
- cs2105 week 3
- YSC4230
- YSC4230 Lecture 1
- What are properties of assembly code?
- What are desirable properties of translation?
- Compiler
- How is assembly code translated into machine code?
- How to view machine code?
- What makes languages different?
- What is Metalanguage?
- What is the difference between a compiler and interpreter?
- How are programs end up being executed?
- How do we decide if compilation is correct?
- What is an Object language?
- Design principles of languages
- How to express programs as data structures in ocaml?
- What is difference between concrete and abstract syntax?
- What is Grammer used for a simple language?
- YSC4230 Lecture 4
- YSC4230 Lecture 5
- YSC4230 Lecture 2 x86Lite
- YSC4230 Lecture 7
- YSC4230 Lecture 6
- YSC4230 Lecture 3
- YSC4230 Lecture 8
- YSC4230 Lecture 1
- Daily routine
- Scheduling
- learning to learn
- Work readings
- Work
- Algorithm practice
- simulation
- Learning about things I’m curious about
- Computer Science fundamentals
- zk-SNARKs Zero-Knowledge Succinct Non-Interactive Argument of Knowledge
- Interesting cs problems
- OS from scratch tutorial
- Great Evil - Roguelike Boss fights against demon kings, urban setting.
- Getting better as a developer
- Creating an interactive and visualized a full network trace from start to finish
- Scheduling
- Learning linux
- Network Log
- libp2p
- network protocols
- Casper
- What is difference between block proposer selection, consensus algorithm?
- What are useful features of smart contracts on Casper?
- What is the architecture of Casper Network?
- How does runtime support economics of Casper?
- What problems is Casper / highway solving?
- What consensus protocol does Casper use?
- How to implement tokens on Casper?
- What instruction set does Casper use?
- How instructions get executed in Casper?
- What is Casper macroeconomy?
- How to do inter contract communication?
- Casper runtime
- How is global state managed in Casper?
- What consensus algorithm does Casper use?
- How does sharding work?
- How to serialize in Casper?
- How blocks are structured in Casper?
- How does consensus algorithm of Casper promote economic activity?
- What are unforgeable references in Casper?
- How communication happens in Casper network?
- How accounts are managed in Casper?
- What exists in the Casper ecosystem?
- MiniKanren
- MiniKanren cdro
- MiniKanren pairo
- MiniKanren pmembero
- MiniKanren core walk
- MiniKanren First Commandment
- MiniKanren conso
- MiniKanren conde
- MiniKanren fresh
- MiniKanren Second Commandment
- MiniKanren twinso
- MiniKanren core reify-s
- MiniKanren listofo
- MiniKanren nullo
- MiniKanren core ext-s
- MiniKanren goals
- MiniKanren memberrevo
- MiniKanren first-value
- MiniKanren listo
- MiniKanren run
- MiniKanren caro
- MiniKanren eqo
- MiniKanren eq-caro
- MiniKanren memo
- MiniKanren core reify-name
- MiniKanren loto
- MiniKanren core unify
- MiniKanren membero
- Implication
- Defining variables
- MiniKanren lolo
- MiniKanren reverse-list
- MiniKanren core substitution
- cs3230
- Analysis of algorithm
- Proving lower bounds
- How to check an algorithm's space complexity?
- Proving asymptotics using limits
- asymptotic lower bounds
- How to check an algorithm for correctness?
- asymptotic upper bounds
- Integer multiplication analysis
- Masters Theorem
- Common asymptotic growth functions
- Pitfalls of using asymptotic notation over a limited domain
- Quickselect analysis
- Solving recurrence relations
- Quicksort analysis
- How to tell if an algorithm terminates?
- Recursion trees
- Analysis conventions
- How to check an algorithm's time complexity?
- Using range transformations to solve recurrence relations
- Solving fibonacci by induction
- Greedy algorithms
- dynamic programming vs memoization
- Analysis of algorithm
- cs4215
- cs4215 week 4
- CS4215 week 5
- CS4215 week 3
- CS4215 week 2
- CS4215 Week 1
- lsm1303
- What are the types of animal social groups?
- What are Sampling methods?
- what’s the point of play
- How do you perform associative learning?
- What is an ethogram?
- What are the costs and benefits of interactive aggregation?
- How do animals learn?
- How are animals named now?
- What influences behaviour?
- What are some ecological concepts?
- What categorizations of social groups exist?
- How do you gauge the association of a species?
- What do the classifications: Kingdom, phylum, class, order, family, genus, species mean?
- What is Ethology?
- What are the types of learning
- What are action patterns?
- How do you prevent bias when studying animals?
- What are the benefits of group living?
- What is fitness of an individual?
- How were animals named?
- What are the Tree of life classification of organisms?
- How do you observe animal behaviour?
- When does natural selection favour group living?
- What are animal social groups?
- What does ecology mean?
- How many organisms described by man so far?
- What problems plague innate behaviour?
- What are the costs of group living?
- What’s the point though with all these fancy names?
- What is musth?
- Glow development log
- How to target plutus core?
- Glow internals
- Nanopass compilers
- Scaling
- How do we do continuations in state machine? How can we do this in stateless way but consensually?
- Plutus lecture summary
- Gerbil scheme
- How to compile with continuations?
- How can we encode state in lambda calculus?
- Is Plutus Core pure? It can throw exceptions
- How to compile to Lambda calculus
- What does a Plutus Contract spit out as Plutus Core?
- Learning Plutus
- PlutusTx.Redeemer
- What is a Value / token bundle in Plutus?
- validation scripts
- What is EUTXO model?
- Plutus Address
- How does Plutus persist state across transactions?
- When is spending allowed?
- How is Plutus Compiled to Plutus Core?
- How to implement Uniswap in Plutus?
- minting policies in Plutus
- Plutus components
- What are Oracles?
- What is PlutusTx.Validator?
- What is definition of EUTXO?
- How do we store state of the state machine?
- How do we mint / burn tokens in Plutus?
- Why do we need these Plutus Monads?
- NFTs on Cardano
- native tokens?
- What are Plutus Monads?
- Why is Plutus Script Context useful?
- How to strongly type plutus contracts?
- What is the exact specification of on-chain Plutus Core? Isn’t it just untyped lambda calculus at the end state?
- Plutus parameterized contracts
- How to implement State Machines?
- Implement Oracles on Cardano
- What is the difference between UTXO and EUTXO?
- What is PlutusTx.Data?
- Why are State Machines useful?
- What is Plutus Script Context?
- Can we watch transactions / UTXOs?
- Why are Oracles useful?
- plutus time / slots
- Account View On UTXO Model (AVOUM)
- cs2100
- MIPS boolean algebra
- MIPS Cache: Memory hierarchy
- MIPS Cache: The Principle of Locality
- Processor supported instructions
- Instruction execution stages / cycle
- MIPS Processor Control, control signals
- MIPS Control Circuit design
- MIPS function code
- MIPS RegWrite
- MIPS MemRead / MemWrite
- MIPS PCSrc
- MIPS control unit
- MIPS opcode
- MIPS ALUSrc
- MIPS r-type instruction
- MIPS MemToReg
- MIPS data memory
- MIPS control signal
- How does MIPS handle the program counter (PC)?
- MIPS Arithmetic-logical unit (ALU) / EX Stage
- MIPS RegDst
- MIPS register file
- MIPS ALUControl
- truth table
- MIPS digital circuits
- MIPS pipelining
- What are conversion rules?
- Sequential circuit
- MIPS Cache: Framework
- Convert signed numbers to binary
- What is accuracy limitation in C?
- convert from base-k to base-j
- What are the units of storage for computers?
- Convert from decimal to base-R
- What is common terminology for positional weight systems?
- MIPS Performance
- MIPS Cache: Direct-Mapped Cache
- How are programming languages related to hardware?
- What is range limitation in C?
- MIPS Cache: Cache Write & Write Miss Policy
- CS2100 Resources
- Clock signal
- MIPS Cache: Cache structure
- What is difference between float and double?
- Dissecting a sample C program
- MIPS Cache: The cache principle
- Convert from decimal to binary
- UTF-8 encoding system
- Why use C?
- Requirements of a processor
- Datatypes in C
- Ascii encoding
- IEEE 754 for floating point numbers
- What does positional weighted system mean?
- What is conversion hierachy?
- How do data types bit-size differ on different processors?
- What is caching?
- Pointers in Haskell
- CS3245
- cs3245 week 4
- Why do we need to correct spelling?
- What are general spelling correction issues?
- How do we handle wildcard queries?
- How should we store our postings?
- How do we correct spelling in documents?
- When do we usually need to correct spelling for documents?
- What do we gain from correcting malformed queries?
- Can we just store our postings in an array?
- cs3245 week 7
- Why do you need to perform weighting on term frequencies?
- score / rank documents
- How do you rank query results?
- Why is Jaccard coefficient insufficient for ranking?
- Difference between term / Collection, Document frequencies
- How are documents represented?
- tf-idf weighting
- Motivations for ranking search
- How do you perform weighting on term frequencies?
- vector space model
- weighting schemes for search
- How are queries represented?
- What is a term-document count matrix?
- cs3245 week 9
- cs3245 week 10
- cs3245 week 2
- Querying structured infomation retrieval database
- What is the point of an inverted index?
- stemming
- How do you construct an inverted index?
- How to merge AND queries
- How can we rank search results?
- How to merge OR queries
- shortcomings of removing stop words
- Structuring data for information retrieval
- case folding
- eliminate stop words
- How to obtain frequency counts of a search term in search engine?
- How to search phrase queries?
- cs3245 week 8
- cs3245 week 5
- cs3245 week 3
- How do we easily access documents with similar content?
- How do we rank documents in terms of search results relevance?
- What are examples of structured vs unstructured data?
- What is a skip pointer?
- How should we place skip pointers (heuristics)?
- How do we perform information retrieval on unstructured data?
- How do we increase merging speed?
- How do we find out which topics a document has?
- How do we perform search for phrases?
- cs3245 week 1
- cs3245 week 6
- cs3245 week 4
- cs2103T
- What are exceptions in Java?
- What are abstract classes in java?
- How to handle errors in Java?
- What is polymorphism in OOP?
- What is inheritance?
- Difference between method overloading and overriding
- What is an interface in Java?
- How are substitutability, overriding, dynamic binding related to polymorphism?
- How does substitutability work for polymorphic objects?
- What is dynamic binding (Java)?
- What is a class?
- What does an object have?
- What is encapsulation?
- What do the access modifiers in java do?
- How to access overridden methods in java?
- What are class level members?
- What is Object Oriented programming?
The zettelkasten has 1510 zettels and 1453 links. It has 292 clusters in its folgezettel graph. Each cluster's folgezettel heterarchy is rendered as a forest.
