Vishruth's Notes
Search
Search
Search
Explorer
Algorithms
⛓️ Linked List
⛰️ Heaps
🌲 Algorithms
🌳 Binary Search Tree
🍽️ Stacks
🏁 Queues
💧 Breadth First Search
📂 B-Trees and B+ Trees
📊 Graphs
📍 Hashmap
📐 K-Dimensional Tree
🗺️ Dijkstra
🥽 Union-Find
🚟 Depth First Search
🚢 Prim's and Kruskal's Algorithm
Computer Systems
Compilers
Back-end
↕️ Instruction Scheduling
🎨 Register Allocation
🧩 Instruction Selection
Front-end
🏷️ Attributes
📄 Parsing
🔍 Scanning
Middle-end
🌉 Intermediate Representation
🔬 Data Flow
Computer Networks
Naming
Protocols & Layering
Resource Allocation
Switching & Routing
Operating Systems
⚙️ Operating System
🍎 Memory Management
🎡 Events
🏠 Process
💀 Deadlock
💥 Faults
📞 System Calls
🔗 Semaphores
🔮 Condition Variables
🖥️ Monitors
🗓️ Scheduler
🧍🏼♂️Threads
🧠 Memory Protections
🚑 Privileged Instructions
🚴♂️ Concurrency
🛑 Interrupts
🌷 Computer Systems
Machine Learning
☝️ Logistic Regression
👓 Perceptron
📐 Support Vector Machine
🛟 Convex Optimization
Mathematics
Discrete Mathematics
☝️ Integer Equations
⚖️ Inclusion-Exclusion
⭐ Stars and Bars
🐇 Fibonacci Numbers
🐽 Discrete Mathematics
📊 Permutations
📚 Binomial Coefficients
🔢 Combinations
Probability Theory
☁️ Conditional Probability
🎯 Bayes' Theorem
🎲 Random Variables
🔄 Uniform Distributions
🥡 Probability Theory
🧮 Bernoulli and Binomial Distributions
🎒 Mathematics
Programming Languages
✏️ Syntax & Equations
➡️ Function Combinators
🌀 Monads
🌀 Polymorphic Data
🌲 Algebraic Data Types
🌳 Recursive Types
🌿 Haskell
🎛️ Type Classes
📐 Foldr & Foldl
📜 Lists & Comprehensions
📜 Parsers
📦 Product Types
🔀 Sum Types
🔄 Recursion & Pattern Matching
🔍 Filter
🔒 Closures
🔦 Theory
🔧 Higher‑Order Functions
🪨 Lambda Calculus
🚿 Map
🛡️ Type System
Home
❯
Computer Systems
❯
Computer Networks
❯
Protocols & Layering
Protocols & Layering
Graph View
Backlinks
No backlinks found