Impulse
Notes not belonging to any heterarchy:
- What arrows are used for in Haskell
- Hello world
- Using ripgrep to find files which contain a word / phrase
- What are the differences between arrow and monads
- Loading environment variables from .env
- Scripting with languages other than Javascript on the client-side
- ZuriHac - GHC Track - Linear types
- Write a GHC extension in 30 minutes - Richard Eisenberg
- Types in Agda
- ZuriHac - Generic Programming
- How to get emacs input
- Writing yas snippets
- Why do we curry functions
- When to use effect systems
- Tiling WM for OSX
- immutable javascript array operations
- Useful firefox shortcuts
- How to amend git commit messages
- Ways to pursue career / business success
- A VC firm which invests in cities
- Commit case-sensitive filename changes in git
- Monads
- Writer Monad
- State Monad
- What's the difference between Applicatives and Monads?
- Reader Monad
- Allowing CORS for Express, React
- Using environment variables in make files
- Git rebasing on master after squash
- Git amend using previous commit message
- Some metrics for being a good tech lead
- What do double dashes mean in bash
- Reverting merge / rebase
- What does @ mean in 'A' DNS
- README
- What is RFC?
- Wipe your glasses
- Efficiently use man pages
- Installing packages through cabal
- Zippers in Haskell and Javascript (Part 1)
- CS alumni chat
- Generating documentation from API types
- Thoughts on dropping out of school
- Terminal shortcuts
- Setting up Agda via nix on osx, running hello world
- Common usage for Ripgrep
- Continuations
- What is portable pixmap format (PPM)?
- How a raytracer works
- Printing progress messages in rust
- What is the difference between carriage return and newline
- How to look up function definitions in nix via nix-repl
- Figuring out nix commands
- Using netstat to check network connections
- plfa - Naturals
- Fixing syntax errors in code
- Reading log
- Exercise log
- Understanding associated types for traits in Rust
- heap
- Rust ownership
- Lambertian reflectance
- Typing unicode in doom emacs
- Debugging large circles close to origin for raytracers
- How to be a good manager?
- Parsing pcap files
- Aosabook - Asterisk notes
- Zippers in Haskell and Javascript (Part 2)
- Stack overflow Q&A log
- Check lines in csv file
- Using Reference counted pointers in Rust
- mutex
- Resolving concurrency in mutable systems
- Haskell Streams
- Serialize access to shared state in concurrent systems
- Reading quotes in Racket
- cs2100
- Datatypes in C
- Why use C?
- Dissecting a sample C program
- CS2100 Resources
- Access file failing on osx for emacs
- How are programming languages related to hardware?
- Folding sections in markdown
- Fixing pdf-tools not rendering PDFs properly on OSX
- What is Object Oriented programming?
- cs2103T
- What are class level members?
- How to access overridden methods in java?
- What are exceptions in Java?
- Project ideas
- How are substitutability, overriding, dynamic binding related to polymorphism?
- How to handle errors in Java?
- What do the access modifiers in java do?
- What are the advantages of exception handling?
- What is encapsulation?
- What is static binding (Java)?
- How to use Stream fusion to optimize lists in Haskell?
- What does an object have?
- What is a class?
- What is dynamic binding (Java)?
- How does substitutability work for polymorphic objects?
- Overriding methods in Java
- What is an interface in Java?
- Errors
- Abstract Method (Java)
- Overloaded methods in Java
- Difference between method overloading and overriding
- What is inheritance?
- What is polymorphism in OOP?
- throwing an exception in Java
- Runtime exceptions
- What are abstract classes in java?
- Checked exceptions
- How to check an algorithm's space complexity?
- Excess representation
- Proving asymptotics using limits
- asymptotic lower bounds
- How to check an algorithm for correctness?
- How do data types bit-size differ on different processors?
- What is conversion hierachy?
- asymptotic upper bounds
- What does positional weighted system mean?
- IEEE 754 for floating point numbers
- Common asymptotic growth functions
- Ascii encoding
- UTF-8 encoding system
- Solving recurrence relations
- Convert from decimal to binary
- How to tell if an algorithm terminates?
- Convert signed numbers to binary
- cs3230
- bit overflows
- Analysis conventions
- What is difference between float and double?
- What is range limitation in C?
- How to check an algorithm's time complexity?
- Analysis of algorithm
- 2s-complement for sign integer conversion to binary
- 1s-complement for sign integer conversion to binary
- What is common terminology for positional weight systems?
- Convert from decimal to base-R
- What are the units of storage for computers?
- convert from base-k to base-j
- What is accuracy limitation in C?
- Sign and magnitude conversion to binary
- What are conversion rules?
- Debugging neuron-mode for doom-emacs
- Masters Theorem
- Masters Theorem proof
- Bitwise operations for competitive programming
- Handle n to be power of 2 in recurrence relation
- Solving mergesort’s order of growth by induction
- Recursion trees
- More recurrence induction examples
- Solving fibonacci by induction
- Weaknesses of lazy languages
- Extended proof from CLRS for master theorem
- Pitfalls of using asymptotic notation over a limited domain
- Use continuations to reverse a list
- Reversing a list with continuations
- Range transformation
- power set
- Geometric series
- View major mode commands in doom emacs
- Unsimplified Mergesort
- Cantor’s paradox
- Domain transformation
- Using range transformations to solve recurrence relations
- evil-mode
- Proving lower bounds
- Tower of Hanoi
- Integer multiplication analysis
- Quickselect analysis
- Quicksort analysis
- Swapping logarithm bases
- Mock interview prep
- What system does C use for signed integers?
- Types as axioms
- My favourite blogs / feeds
- dynamic programming vs memoization
- Permutations of a list in Haskell
- Swap registers in MIPS
- Equality constraints (Haskell)
- Reading and reflections on microservices
- Greedy algorithms
- Minimum spanning tree (MST)
- Optimal substructure
- Graph definitions
- Greedy graph algorithms
- Greedy choice property
- Local swap - greedy
- Prims algorithm
- Cut property
- Kruskals algorithm
- Record screen with FFMPEG
- Profiling haskell programs
- The y combinator
- What is applicative?
- Lexing vs Parsing
- Evaluate emacs expression
- Installing Haskell toolchain on OSX
- Persisting evil (vim) macros for a single session
- Build package with cabal with specified GHC version
- How do we map cache?
- Cache block / line
- What is caching?
- shift left
- What is temporal locality?
- What is spatial locality?
- Set associative cache
- Emergence
- MiniKanren fresh
- MiniKanren run
- MiniKanren goals
- MiniKanren
- Reification
- My overdue post on free monads
- MiniKanren eqo
- MiniKanren caro
- MiniKanren nullo
- MiniKanren conde
- MiniKanren conso
- MiniKanren pairo
- MiniKanren cdro
- MiniKanren lolo
- MiniKanren First Commandment
- MiniKanren answer
- MiniKanren loto
- MiniKanren listo
- MiniKanren twinso
- MiniKanren question
- MiniKanren reverse-list
- MiniKanren membero
- MiniKanren memo
- MiniKanren eq-caro
- MiniKanren first-value
- MiniKanren memberrevo
- MiniKanren listofo
- MiniKanren Second Commandment
- MiniKanren pmembero
- MiniKanren core substitution
- Defining variables
- Implication
- MiniKanren core unify
- MiniKanren core reify-s
- MiniKanren core reify-name
- MiniKanren core ext-s
- scheme size-s
- MiniKanren core walk
- Fibonacci memoization with State vs ST monad
- Subtyping vs subclassing
- NP
- MinTerm, MaxTerm
- Boolean algebra
- Fix github pages showing empty site
- Redirect stdout and stderr to a file
- Delete from a text file, all lines containing a specific string
- df8e86f3
- MIPS sign extend
- MIPS add
- MIPS memory access / MEM Stage
- MIPS operands
- MIPS sub
- MIPS ALU: handling branch instructions
- MIPS decode r-type instruction
- sub
- MIPS Processor Control, control signals
- MIPS adder
- MIPS ori
- MIPS slt
- Processor supported instructions
- Requirements of a processor
- MIPS decode i-type instruction
- MIPS result write / WB Stage
- MIPS Instruction memory
- MIPS sw
- MIPS Instruction Decode / ID Stage
- MIPS sll
- MIPS and
- MIPS execute
- MIPS data memory
- MIPS operand fetch / ID Stage
- Combinational logic
- MIPS control signal
- Clock signal
- MIPS memory stage - load word (lw) example
- MIPS andi
- How does MIPS handle the program counter (PC)?
- MIPS lw
- MIPS Arithmetic-logical unit (ALU) / EX Stage
- MIPS addi
- MIPS multiplexer
- MIPS register file
- MIPS Instruction fetch / IF Stage
- MIPS memory stage - store word (sw) example
- Instruction execution stages / cycle
- MIPS ALU: handling Non-branch instructions
- MIPS sequential circuit
- MIPS or
- MIPS decode branch instruction
- MIPS srl
- 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 RegDst
- MIPS ALUControl
- truth table
- MIPS ALU Multilevel decoding
- MIPS IF/ID register
- MIPS MEM/WB register
- MIPS pipeline end
- MIPS pipelining
- MIPS single-cycle
- MIPS pipelining performance
- MIPS EX/MEM register
- MIPS ID/EX register
- MIPS instruction pipelining
- MIPS pipeline registers
- MIPS multi-cycle
- MIPS pipeline control signals
- MIPS separate memory
- MIPS pipeline: data hazards / data dependency
- MIPS pipeline: structural hazards
- MIPS Pipeline hazards
- MIPS Delayed branching
- MIPS pipeline: control hazards
- MIPS stall pipeline
- MIPS early branch
- MIPS branch prediction
- DRAM
- Cache hit
- MIPS Cache: Cache structure
- MIPS first in first out (FIFO)
- Cache compulsory / cold miss
- Interesting extracts from Gobel, Bach, Escher
- Cache block replacement policy
- Gobel, Bach, Escher
- MIPS volatile memory
- MIPS Cache: Framework
- Cache block size trade offs
- MIPS Random Replacement (RR)
- MIPS Cache: Spatial locality
- Cache write allocate
- MIPS Cache: Cache Write & Write Miss Policy
- MIPS: Advantage of associative caching
- MIPS Cache: The cache principle
- MIPS least recently used (LRU)
- Cache set index for associative caches
- Cache write around
- MIPS Cache: Memory hierarchy
- MIPS Cache: temporal locality
- Cache capacity miss
- SRAM
- MIPS non-volatile memory
- Cache mapping
- Cache miss
- Cache conflict miss
- MIPS Cache: Direct-Mapped Cache
- MIPS cache conditions
- MIPS least frequently used (LFU)
- MIPS most frequently used (MFU)
- MIPS Cache: The Principle of Locality
- Magnetic disk
- NOT GATE
- lock
- Integrated Circuit (IC) chips
- Full adder
- Gate-level design method
- Average CPI
- Read, Copy, Update (RCU)
- Prime implicant
- READ-WRITE locks
- My First Kernel Module: A Debugging Nightmare
- Sequential circuit
- AND GATE
- A curious moon
- Evolution
- MIPS Performance
- XNOR GATE
- Complement boolean function
- simplification of boolean algebra
- 6-variable k-map
- XOR GATE
- MIPS digital circuits
- NAND GATE
- data races
- MIPS boolean algebra
- Block-level design method
- msleep
- Amdahl’s Law
- Half adder
- OR GATE
- 5-variable k-map
- 4-variable K-Map
- Game ideas
- 4-bit parallel adder
- Karnaugh-Map (K-Map)
- Programming resources
- CPU Execution Time
- spinlock
- analog circuit
- Boolean functions
- NOR GATE
- Combinational circuit
- 2-Variable K-Map
- 3-variable K-Map
- Pointers in Haskell
- Mips Memory element
- Pulse-triggered latch
- Bistable (2 stable states)
- S-R Latch
- Multivibrator circuits
- What is AI
- Astable (no stable state)
- Edge-triggered latch
- flip-flops
- Building a computer from scratch (diary)
- Beautiful moon review / diary
- Competitive programming
- Unplugged book (diary)
- How does Git actually work
- WIP blogpost tracker
- Song discoveries
- High-level overview of my ray-tracer
- Purely functional data structures and algorithms (log)
- NP-Complete
- Vertex Cover
- NP hardness of dominating set (reduction from Vertex Cover)
- NP-Hard
- How react performs reloading of webpages [WIP]
- Game of Death
- Seidels sub-cubic algorithm (INCOMPLETE)
- December 2021 plans
- Declaratively constructing cons from lambdas
- Haskell singletons [WIP]
- Category theory log
- cost centres
- GHC profiling
- How to tell if a haskell package is built as an executable in nix?
- Difference between scp and rsync
- What is Weak Head Normal Form (WHNF)?
- TensorFlow serving - setup
- Things which compound
- RandomAccessIterators
- ostep log
- virtualization
- running a program
- OS API
- syscalls
- Process ID (PID)
- Virtualizing memory
- Concurrency
- Checking the size of recursive types in Rust
- What are Tokio threads (Rust)
- ST2334
- ST2334 Week 1
- Learning ROS
- CS2106 - Operating systems
- Operating Systems
- Resource allocator
- Control program
- Kernel mode
- User mode
- Monolithic
- Virtual machines / Hypervisors
- MicroKernel OS
- Layered Systems
- Client-Server Model
- What exactly is a kernel?
- Permutations
- Combinations
- Relative frequency
- Axioms of probability
- cs4215
- CS4215 Week 1
- Tombstone diagrams (T-diagrams)
- Set definitions have to be precise
- cs2105
- cs2105 week 1
- Network delay
- Network hosts
- Networking Communication links
- Packet switches
- Internet of things (IoT)
- What is network core?
- What is internet?
- What is network edge?
- Network servers
- Routing algorithms
- Packet transmission delay
- Store and forward
- Queueing delay, loss
- Network routing
- Network forwarding
- Circuit switching
- Internet structure
- propagation delay
- nodal queueing delay
- nodal processing delay
- throughput
- TCP/IP
- What is a protocol
- transport layer
- network layer
- Application layer
- Internet protocol stack / Network stack
- Networks Physical layer
- Link layer
- CS3245
- Unigram model
- cs3245 week 1
- Ngram language model LM
- Markov model
- Probability-based LM
- smoothing
- ST2334 week 2
- Process abstraction
- Memory context
- OS Context
- Hardware context
- What is Process Control Block and Process Table
- Interaction between OS and process
- memory (Program execution)
- Generic computer organization
- cs2105 week 2
- network client
- p2p architecture
- server process
- client process
- network socket
- addressing processes
- protocol table
- app layer protocol
- http
- cookies
- Web caches
- Domain name system (DNS)
- name servers
- Influences on Operating systems
- CS4215 week 2
- configuring kinesis advantage
- Syntax
- Denotational semantics
- Static semantics
- Dynamic semantics
- cs3245 week 2
- lsm1303 week 2
- lsm1303
- lsm1303 week 1
- Structuring data for information retrieval
- Querying structured infomation retrieval database
- Network Bandwidth / capacity
- Function pointers
- C programming 101
- Profiling Haskell programs
- Memory layout
- Data
- Text
- Heap
- Stack
- Stack frame
- Stack pointer
- Frame pointer
- CS4215 week 3
- Implementing your own programming language
- Evaluate
- cs2105 week 3
- ip address
- url vs ip address
- what is url (uniform resource locator)
- domain name url mapping
- timing
- transport service properties
- data integrity
- security
- UDP
- transport service protocols
- udp sockets
- Sample UDP client
- Sample UDP server
- tcp sockets
- Sample TCP client
- Sample TCP server
- Primitive expressions
- Combinations (program eval)
- Syntactic forms
- function application
- stack frame setup
- dynamic memory
- manage heap memory
- process states
- process state new
- process state running
- process state ready
- CPU
- process state blocked
- process state terminated
- process creation in unix
- process termination
- process on exit
- process synchronization
- process state diagram - unix
- SSH into NUS Compute clusters
- Operating systems concepts - Chapter 1
- What are the 2 main functions of an operating system?
- Operating systems processes management
- Operating systems overview
- Operating Process Communication
- What is a process?
- program
- What is a process state?
- What is process control block?
- How are processes scheduled?
- queues
- Process control blocks (PCB)
- doubly linked list
- device queue
- ready queue
- short-term / CPU scheduler
- CPU scheduler
- long term scheduler
- How do we deal with many incoming processes?
- How do we gauge the efficacy of a long term scheduler?
- medium term scheduler
- Combination laws
- Probability reference
- Counting methods
- De Morgan’s law
- Basic probability concepts
- properties of probability
- Bayes theorem
- conditional probability
- Independent events
- Random variables
- Equivalent events
- Basic properties
- cs3245 week 3
- How do we perform information retrieval on unstructured data?
- Boolean retrieval model
- What are examples of structured vs unstructured data?
- How do we easily access documents with similar content?
- How do we rank documents in terms of search results relevance?
- Clustering
- Classification
- Ranking
- How do we find out which topics a document has?
- saved model variables
- What is segfault?
- Making slides from markdown
- Message passing
- Shared memory
- Signal
- Pipes
- Why use shared memory?
- How do we manage shared memory in unix?
- What is system V (sysV)?
- What data structure pipes use?
- Are all pipes unidirectional / half-duplex, i.e. one way from one process to another?
- cs2105 week 4
- Why do we assign a pointer, not a owned variable to malloc?
- Why use double reference (**x)?
- lsm1303
- What is musth?
- How many organisms described by man so far?
- What are the Tree of life classification of organisms?
- What do the classifications: Kingdom, phylum, class, order, family, genus, species mean?
- How were animals named?
- How are animals named now?
- What’s the point though with all these fancy names?
- What does ecology mean?
- What is fitness of an individual?
- What are some ecological concepts?
- Fecundity
- What is Ethology?
- How do you observe animal behaviour?
- How do you prevent bias when studying animals?
- What influences behaviour?
- units of behaviour
- What is an ethogram?
- What are Sampling methods?
- behaviour sampling
- focal sampling
- scan sampling
- ad libitum sampling
- Innate behaviour
- What problems plague innate behaviour?
- What are action patterns?
- Beewolf case study
- Fixed action patterns (FAP)
- Innate releasing mechanism (IRM)
- How do animals learn?
- What are the types of learning
- stimuli without association, with reinforcement
- stimuli with association , with reinforcement
- How do you gauge the association of a species?
- domesticated
- How do you perform associative learning?
- classical conditioning
- operant conditioning
- shaping
- filial imprinting
- latent learning
- object oriented play
- Exercise play
- what’s the point of play
- Social playing / learning
- no immediate adaptive value
- What are the costs of group living?
- What are animal social groups?
- What are the types of animal social groups?
- What are the benefits of group living?
- What categorizations of social groups exist?
- When does natural selection favour group living?
- What are the costs and benefits of interactive aggregation?
- Protection from predators
- Cooperative hunting
- improved foraging
- mate access
- social transmission of info
- communal care
- disease spread
- increased competition
- cannibalism
- obvious to predators
- inbreeding
- interference with reproduction
- risk of inbreeding
- solitary
- social animal
- eusocial animal
- pair
- family
- harem
- Classic dimorphism
- matriarchy
- oligarchy
- Arena/Lek
- hierarchy
- aggregation
- caste system
- What is a skip pointer?
- How to obtain frequency counts of a search term in search engine?
- How to merge OR queries
- How to merge AND queries
- stemming
- case folding
- eliminate stop words
- How to search phrase queries?
- What is go-back-N protocol?
- What is selective repeat?
- What is UDP protocol?
- UDP checksum
- How do you design a reliable data transfer protocol (rdt)?
- Connectionless multiplexing / de-multiplexing
- What can UDP be used for?
- Why is UDP unreliable?
- How can we manage (relatively) reliable transmission over UDP?
- De-Multiplexing
- Multiplexing (Muxing)
- destination port
- source ports
- 1s complement
- What is reliable data transfer protocol (rdt)?
- rdt2.0
- rdt1.0
- What if ACK / NAK is corrupted?
- rdt2.1
- rdt2.2
- rdt3.0
- Why rdt3.0 perf is shitty?
- How do we make rdt3.0 better?
- CS4215 week 5
- What is the motivation for compiling Source 0 to machine language (SVML)?
- What conveniences did transpiling Source 0 to a higher level language provide us?
- How do we represent machine instructions efficiently?
- How do we execute machine code?
- What about branching?
- program counter
- What about division?
- What about names?
- How do you compile functions?
- How do you call functions?
- Operating systems threads
- What kinds of thread models exist?
- What are threads?
- What are thread implementations in Unix (POSIX threads)?
- Why use threads?
- Processes are expensive
- What is an example of a concurrent program, with threads / processes?
- What are the differences between threads and processes?
- How do you context switch between threads?
- How do you context switch between processes?
- Kernel thread
- User thread
- What are the advantages of user threads?
- What are the disadvantages of user threads?
- advantages of kernel threads
- disadvantages of kernel threads
- Hybrid threads
- How have Threads on modern processors advanced?
- Hardware support for threads
- General purpose registers
- Special registers
- Simultaneous multi-threading (SMT)
- Hyperthreading
- How to use POSIX thread (pthread)?
- What is SAML?
- service provider
- SAML
- identity provider
- Single sign-on (SSO)
- How do we perform search for phrases?
- How do we increase merging speed?
- posting
- What is the point of an inverted index?
- How can we rank search results?
- How should we place skip pointers (heuristics)?
- Bigram
- Positional indexes
- proximity queries
- combining biword and positional indices
- How do you construct an inverted index?
- Text extraction
- Tokenizer
- How can we reduce the time space complexity of our index?
- What are the difficulties the tokenizer faces with languages?
- stop word / stop list
- semantic differences between strict and lazy evaluation?
- Is there a reason to choose strict algorithms over lazy or vice-versa?
- lazy evaluation
- What are the difficulties functional languages face?
- Understanding linear types in Haskell [WIP]
- cs3245 week 4
- Can we just store our postings in an array?
- How should we store our postings?
- Hash table for postings
- B-Tree (BBST) for postings
- How do we handle wildcard queries?
- permuterm index
- Bigram for wildcard queries
- How do we correct spelling in documents?
- Why do we need to correct spelling?
- Correcting word spelling in isolation
- Correcting words based on context
- When do we usually need to correct spelling for documents?
- What do we gain from correcting malformed queries?
- Levenshtein distance (Edit distance)
- Weighted edit distance
- ngram overlap
- Longest common subsequence (LCS)
- Technical analysis of blockchains [WIP]
- strict vs lazy
- Strict evaluation order
- Why is it easier to reason about asymptotic complexity in strict vs lazy languages?
- Benefits of laziness?
- Jaccard coefficient
- misconception on performance on lazy programs
- What are general spelling correction issues?
- soundex
- usefulness of soundex
- shortcomings of removing stop words
- Porter’s algorithm
- What algorithms exist for stemming?
- Conventions for Porter’s algorithm
- Reduction phases for Porter’s algorithm
- Lovin’s stemmer
- cs3245 week 5
- How to handle changes to the index?
- How to make index construction scalable?
- Blocked sort-based indexing (BSBI)
- Distributed indexing
- SPIMI
- Dynamic indexing
- What are the bottlenecks for information retrieval?
- Transfer time
- Seek time
- What are the bottlenecks for index construction?
- How to perform indexing if data is dynamic?
- Logarithmic merge
- abstract datatype
- Simple explicitly lazy functions
- Simple lazy data structures
- Comparisons of different containerization technologies [WIP]
- How discrimination can help us accomplish linear time sorting for a multitude of data types [IDEA]
- LaTeX package manager
- cs4215 week 4
- How do you implement condiitonal expressions?
- What is a function?
- How do you define function application?
- What are the steps to defining a typed language?
- What is an expression?
- What is a statement?
- How do you define conditionals?
- What are free names?
- Is the free names relation: >< a total function?
- How do you define function substitution?
- Substitution relation
- cs2105 week 5
- Summary of stop and wait protocols
- What is TCP?
- What is TCP sequence number for?
- When to retransmit TCP?
- What is acknowledgement number for?
- How to terminate connection?
- How to setup connection?
- What are properties of TCP?
- Point to point
- Connection oriented communication
- pipelined tcp
- reliable, in-order byte stream
- full duplex data
- How do you setup send and receive buffers (TCP)?
- How do we structure a TCP segment?
- Application data buffer size
- How do you connect in TCP?
- What is the TCP sequence number?
- What is Maximum segment size (MSS)?
- ST2334 week 3
- What is a random variable?
- What is a discrete random variable?
- countable (set)
- What is a probability function?
- What is a probability distribution?
- What is a cumumlative distribution function?
- What is a continuous random variable?
- Probability density function
- What is Chebyshev’s Inequality?
- Editor optimization
- CS4215 week 6
- Once a data structure is created, will it have to be stored until the end of the program execution?
- Can we design a virtual machine that makes effective use of the available memory?
- Will a given program run out of memory?
- What are general ways to manage memory?
- How did memory management evolve?
- What is a mental model for heap memory?
- Static memory management (naive)
- Stack allocation
- Heap allocation
- Memory address space of a process
- Operating systems synchronization / synchronizing threads
- deadlocks
- Critical section (CS)
- naive Critical section implementation
- Mutual exclusion
- Independence property
- peterson’s algorithm
- busy waiting (spinning)
- Using testandset instruction
- Implementing critical section
- Load Link / Store conditional
- Compare and Exchange
- Atomic Swap
- Semaphore interface
- Semaphore data structure
- Semaphore state interaction example
- Binary semaphore
- General / counting semaphore
- Semaphore with critical section example
- Semaphore invariant
- Conditional Variable
- monitor
- Producer consumer
- Producer consumer: Busy waiting
- Producer consumer: Blocking
- Readers Writers
- Readers Writers: Simple Version
- Companies I want to work at / want to learn more about
- string encodings
- Preventing ssh timeouts
- Readers Writers: Addressing writer starvation
- Readers Writers: Address reader, writer starvation
- Dining philosophers
- atomic increment with busy waiting
- Convert video with ffmpeg
- C macros
- What is a barrier?
- What is CSS?
- cs4215 week 8
- Syntax of records
- cs3245 week 6
- Why use compression?
- What are examples of lossy compression?
- Heaps’ Law
- Zipf’s law
- Refresh a tab on file update
- How does blocking increase compression?
- How to do posting file compression?
- variable byte encoding?
- cs3245 week 7
- score / rank documents
- Collection statistics
- Term frequency
- Motivations for ranking search
- weighting schemes for search
- vector space model
- Why is Jaccard coefficient insufficient for ranking?
- What is a term-document count matrix?
- Why do you need to perform weighting on term frequencies?
- How do you perform weighting on term frequencies?
- log-frequency weighting scheme
- idf-weighting scheme
- Difference between term / Collection, Document frequencies
- tf-idf weighting
- How are documents represented?
- How are queries represented?
- How do you rank query results?
- cs2106 week 7
- What are OS responsibilities for memory management?
- How do we manage chunks of memory?
- What interface does memory access use?
- Disjoint memory schemes
- How do we use secondary storage (virtual mmemory)?
- Random access / direct access
- How do we allocate memory?
- What are the types of fragmentation, and how do they occur?
- What are dynamic allocation algorithms?
- Removing nixos packages / nixos maintainance / nixos garbage collecting
- What is quasi-quote?
- cs3245 week 8
- speed up and shortcut ranking
- search system
- incorporate additional ranking information into vector space model (VSM)
- Use unweighted queries
- Optimize cosine ranking
- Index elimination
- Compute K largest cosines
- Champion / Tiered lists
- Early termination / Impact-ordered postings
- Cluster pruning / Preprocessing
- Evaluation of IR models
- cs3245 week 9
- Speed of search for IR
- Speed of index for IR
- cs3245 week 10
- Relevance feedback formulae for IR
- What is the Working Set Page Replacement algorithm?
- cs2106 week 10
- demand paging
- reference locality
- working set
- page fault overheads
- prepaging
- cs2105 week 10
- Variable bit rate
- Constant Bit Rate
- decrease bits to encode image
- Multimedia encoding types
- Streaming flow
- How to resolve playback jitters
- How to handle client interactivity?
- How to stream via HTTP?
- What is voice-over-ip?
- What is SIP
- What is Real-Time Protocol (RTP)
- What is dynamic adaptive streaming over HTTP?
- cs4215 week 9
- referential transparency
- imperative languages
- imperative syntax
- imperative language: denotational semantics
- imperative language: denotate assignment
- pass-by-value
- pass-by-copy
- pass-by-reference
- Assignment for mutable records
- Implementations of error handling in imperative languages
- cs4215 week 10
- oop: aggregation
- oop: classification
- oop: specialization
- Difference between poisson and binomial distribution
- Binomial vs Negative binomial distribution
- Book wishlist
- ST2334 week 9
- What is a statistic?
- What is an estimator?
- What is interval estimation?
- What is unbiased estimator?
- hacky module bundling for Python
- Remove untracked files in git
- How not to study in NUS CS [IDEA]
- Difference between hypothesis tests
- Information retrieval FAQ
- What is a language model?
- How Unix directories permissions work
- thrashing
- workflow problems
- memory management
- Why is memory management needed?
- How do we manage the memory of multiple processes?
- buddy allocation
- disjoint memory mapping
- page scheme: protection
- page table entry (PTE)
- optimize disjoint memory allocation
- Differences between microkernel and kernel
- Word documents with images to markdown via pandoc
- Compiler
- lexical analysis
- parsing
- intermediate representation
- semantics
- code generation
- semantic analysis
- What is Flex?
- remove ssh key password
- what is closure
- What is REVERT and RETURN opcodes in EVM?
- What are v r s fields in Ethereum transactions?
- Learning K Framework
- What problem does K Framework solve?
- What are Design principles of K Framework?
- How are various language constructs made concrete?
- Currying in Scheme (cut operator)
- How Gerbil Poo’s Objection Orientation System works
- What is a port in Gerbil?
- structs in gerbil scheme (defstruct)
- What is a fixup?
- object file .o / .obj
- object code
- What is a Directive?
- What is a Label in Compiler Speak?
- Debugging tips
- What is live variable analysis (compilers)?
- Hacking on Gerbil
- What are Ethereum transactions?
- Signing a contract on the blockchain
- What are the types of blockchain ledgers?
- cs411 notes
- why use x64 as compiler target language?
- Auto recompile / rebuild when modifications were made
- Bytes, uint8, Bits, Decimal, Hexadecimal and Ascii
- Why use little endian / big endian encoding?
- Compilers checklist / log
- bottom up parsing
- Compiler optimization
- typechecking
- top down parsing
- local optimization
- global optimization
- context-free grammars
- terminals
- nonterminal
- Cardano Transaction Metadata
- transaction witnesses
- Notes on Glow’s language model
- What problems do compilers solve?
- What are smart contract events compiled to in EVM asm?
- How do we know if an event has occurred?
- Fixing contract timeouts in Glow
- My Glow debugging log
- Financial plans
- EVM Program Counter and instruction sizes (PC)
- How much space is left on linux file system?
- Workspace optimization / fixes
- String substitution / replacement and file renaming one-liners
- How to send message across processes
- How to run shell commands when initializing nix-shell
- Remove all docker images
- Possible Open source contributions
- Learning linux
- linux Terminal tools
- linux Sysadmin
- linux Networking
- Unspent Transaction outputs (UTXO)
- regex
- What are ethereum accounts and addresses, how do they relate to public keys?
- Why are ethereum addresses hashes of public keys?
- ecrecover
- What is small endian / big endian?
- Tezos
- Glow end point projection (EPP)
- zk-SNARKs Zero-Knowledge Succinct Non-Interactive Argument of Knowledge
- Why left pad or right pad for ethereum types?
- Learning Plutus
- What is EUTXO model?
- How to strongly type plutus contracts?
- validation scripts
- Account model
- Plutus components
- Cardano node’s chain sync protocol
- Balancing transactions
- Probabilistic AGI
- Which commit was a file deleted / changed in git?
- Memory format
- lambda calculus
- compiling with continuations
- Executable and Linkable Format (ELF)
- Scott encoding
- How to compile to Lambda calculus
- Is Plutus Core pure? It can throw exceptions
- Glow development log
- How to compile with continuations?
- What does a Plutus Contract spit out as Plutus Core?
- How do we do continuations in state machine? How can we do this in stateless way but consensually?
- Plutus lecture summary
- Scaling
- Nanopass compilers
- How can we encode state in lambda calculus?
- How does PlutusTx target plutus core?
- How to target plutus core?
- upgrading nixos
- LL parser / What is LL(n)
- Casper
- How does sharding work?
- How to do inter contract communication?
- What consensus algorithm does Casper use?
- What instruction set does Casper use?
- What consensus protocol does Casper use?
- What are useful features of smart contracts on Casper?
- What is difference between block proposer selection, consensus algorithm?
- What is the architecture of Casper Network?
- How accounts are managed in Casper?
- How communication happens in Casper network?
- How blocks are structured in Casper?
- How is global state managed in Casper?
- How instructions get executed in Casper?
- What are unforgeable references in Casper?
- How to serialize in Casper?
- How to implement tokens on Casper?
- How does consensus algorithm of Casper promote economic activity?
- How does runtime support economics of Casper?
- What exists in the Casper ecosystem?
- What is Casper macroeconomy?
- What problems is Casper / highway solving?
- partially synchronous Byzantine fault Tolerance (BFT) consensus protocols
- Proof of work
- Proof of stake
- account management
- targets webassembly
- upgradeable on-chain / deployed contracts
- predictable network fees
- Network communication
- Casper runtime
- When is spending allowed?
- A-normal form (ANF)
- What are Capture lists?
- What is Phi for LLVM?
- How does Plutus persist state across transactions?
- How does LLVM support functions?
- What are parameter lists?
- subroutines
- What is PlutusTx.Data?
- What is PlutusTx.Validator?
- What is Plutus Script Context?
- Why is Plutus Script Context useful?
- What are Plutus Monads?
- Why do we need these Plutus Monads?
- How do we mint / burn tokens in Plutus?
- What is a Value / token bundle in Plutus?
- minting policies in Plutus
- What are Oracles?
- Why are Oracles useful?
- Why are State Machines useful?
- How to implement State Machines?
- How to implement Uniswap in Plutus?
- Intervening / interrupting UTXO transactions
- Haskell development with Nix
- pinning nixpkgs
- YSC4230
- YSC4230 Lecture 1
- What makes languages different?
- What is the difference between a compiler and interpreter?
- How are programs end up being executed?
- Design principles of languages
- How to view machine code?
- What are properties of assembly code?
- How is assembly code translated into machine code?
- What are desirable properties of translation?
- How do we decide if compilation is correct?
- How to express programs as data structures in ocaml?
- What is an Object language?
- What is Metalanguage?
- What is Grammer used for a simple language?
- Backus-Naur form (BNF)
- What is difference between concrete and abstract syntax?
- learning to learn
- learning tips
- How to get things done?
- How is Plutus Compiled to Plutus Core?
- Can we target Plutus IR instead of Plutus Core?
- How can we get a dump of Plutus IR?
- What is the exact specification of on-chain Plutus Core? Isn’t it just untyped lambda calculus at the end state?
- What is the difference between UTXO and EUTXO?
- How are validators compiled to plutus core with template Haskell and the GHC plugin?
- How can we get plutus core dump from validator scripts?
- Can we watch transactions / UTXOs?
- plutus time / slots
- Plutus Address
- Plutus parameterized contracts
- Scala object
- Scala class
- How to write a cold email
- Error vs Exception
- What is definition of EUTXO?
- native tokens?
- NFTs on Cardano
- YSC4230 Lecture 2 x86Lite
- Stripe interview walkthrough
- Implement Oracles on Cardano
- Notes from Greylock Techflair
- Implementing a blockchain
- How do we store state of the state machine?
- PlutusTx.Redeemer
- YSC4230 Lecture 3
- How was Python implemented?
- Designing X language
- Why use Python?
- Python design considerations
- Why NOT to use Python?
- YSC4230 Lecture 4
- Why do we not write compiler for Haskell in Haskell?
- Amazing games
- YSC4230 Lecture 5
- file descriptor vs file names
- file descriptors vs file names
- File descriptor vs file names
- File descriptor vs file name
- File descriptor vs file name
- AVOUM for Nervos
- Daily routine
- Scheduling
- Read learning to learn
- Read deep work
- Read getting things done
- Algorithm practice
- Learning about things I’m curious about
- Cryptography
- Programming Languages
- homoiconicity
- Interesting cs problems
- Compilers
- Art Gallery Problem
- Security
- Glow internals
- Glow Command line internals
- Gerbil scheme
- bugs I’ve encountered
- multicall binary
- burnout
- shell scripting
- Work
- Blockchain
- Work readings
- libp2p
- peer to peer networking (p2p networks)
- What are the sources used to generate randomness for private keys?
- Homomorphic encryption
- Nervos Blockchain
- Formal verification
- Inverse Multiplexing
- secure communication
- Networks
- Network Address Translation (NAT)
- Libp2p protocols
- Libp2p peerid and peerinfo
- multihash
- Libp2p multiaddress
- Libp2p security concerns
- Libp2p pubsub
- Libp2p stream multiplexing
- YSC4230 Lecture 6
- lexers / lexing
- parse table
- How to view binary signal trace
- Formal arguments
- simulation of plants
- simulation
- Computer Science fundamentals
- Operating systems
- Computer Organization and Design
- Linux Sockets
- Blockchain encryption schemes
- Blockchain consensus algorithms
- Algorithms
- Leetcode
- General Problem solving tips
- System design
- Getting better as a developer
- Distributed systems
- Game development
- Decentralized Finance (DeFi) protocols
- Decentralized Applications (DApps)
- Automated Market Makers (AMM)
- Flash loans
- Great Evil - Roguelike Boss fights against demon kings, urban setting.
- Http implementation
- Creating an interactive and visualized a full network trace from start to finish
- OS from scratch tutorial
- How are UTXOs produced?
- Medikanren
- Literate programming
- Account View On UTXO Model (AVOUM)
- EUTXO datum hash
- Migrating from github to gitlab
- What happens when you access google.com in your browser?
- Packet switching network
- network address
- nmap
- Network tools
- tcpdump
- ping
- ICMP
- internet protocol suite
- YSC4230 Lecture 7
- Parsing
- Finding my public IP
- Finding my gateway ip (usually your router’s ip, could be vpn as well)
- network gateway
- Port number usage
- network protocols
- libp2p
- bittorrent
- Network Log
- subnet
- IPv4 subnet
- ipv4
- check linux arp table
- arp table
- routing tables
- Why recursive or iterative DNS?
- DNS resolution
- SMURF attacks
- root name servers (RNS)
- Connectionless communication
- Unreliable network protocol
- udp datagram
- udp ports
- Routing information Protocol (RIP)
- Dynamic Host Configuration Protocol (DHCP)
- Dynamic scoping is useful
- gerbil scheme debugging
- Dealing with burnout
- Observing the effects of instruction pipelining [IDEA]
- Observing the effects of IO bottleneck [IDEA]
- YSC4230 Lecture 8
- Meal Preparation
- Watching filesystem for updates
- AVOUM for Nervos FAQ
- CS3211
- What is the difference between concurrency and parallelism?
- How to prevent race conditions?
- How to debug deadlocks?
- GET1029
- Moral Philosophy
- parallelism / TRUE concurrency
- Threads vs Processes
- User level vs Kernel level threads
- When does starvation occur?
- livelock
- What are disadvantages of concurrent code?
- Cache coherency
- Memory consistency
- Software engineering design principles
- Atomics
- Memory orders
- Sequential Consistency
- release-acquire
- Relaxed Ordering
- The Colonial pipeline ransomware attacks
- Creating a linux environment with docker
- Get segfault address with gdb
- 3 stages of union find
- Why poll-based futures in Rust
- Quotes
- Learning how compilers work
- base pointer (rbp)
- stack and heap memory
- View elf binary info
- tldr of a tldr: select, poll, epoll from Julia Evans
- gdb cheatsheet
- connect to soc vpn on nixos
- Functor
- Building cpp projects with Nixos
- Learning SQL
- Godbolt templates
- XOR
- Cool Haskell tools
- What is sequential locality
- High Frequency Trading (HFT)
- B+Tree
- LSM Tree
- SSTable
- OLAP Database
- Transaction Processing Performance Council (TPC Council)
- Real time data analytics
- Stream processing vs batch processing
- Stream data processing
- Rising Wave
- Apache Flink
- State Management in Apache Flink (Notes)
- Science of high rise building foundations [WIP]
- How trains (MRT) forecast arrival times [WIP]
- Computers - a puzzle [WIP]
- What is Pin, how does it relate to futures?
- Consistent hashing
- Designing Data-Intensive Applications
- dijkstra
- source vs ./
- scanf tips
- Bootloader
- A Deep Dive into Cpu Cache and memory
- Poisson distribution from first principles
The notebook has 1516 notes and 1456 links. It has 2 clusters in its folgezettel graph. Each cluster's folgezettel heterarchy is rendered as a forest.
