Skip to content

Instantly share code, notes, and snippets.

View sudk1896's full-sized avatar

Sudarshan Konge sudk1896

View GitHub Profile
@zserge
zserge / guest.S
Created May 10, 2020 08:41
A tiny KVM host to run a 16-bit real mode "kernel"
# A tiny 16-bit guest "kernel" that infinitely prints an incremented number to the debug port
#
# Build it:
#
# as -32 guest.S -o guest.o
# ld -m elf_i386 --oformat binary -N -e _start -Ttext 0x10000 -o guest guest.o
#
.globl _start
[[email protected] saurabh]$ g++ -std=c++14 -O3 -w eigen_sqrt.cpp -I/usr/include/eigen3
[[email protected] saurabh]$ ./a.out
default ctor called.
default ctor called.
default ctor called.
default ctor called.
default ctor called.
default ctor called.
Task 1
initializer ctor called.
@vasanthk
vasanthk / System Design.md
Last active July 18, 2025 05:13
System Design Cheatsheet

System Design Cheatsheet

Picking the right architecture = Picking the right battles + Managing trade-offs

Basic Steps

  1. Clarify and agree on the scope of the system
  • User cases (description of sequences of events that, taken together, lead to a system doing something useful)
    • Who is going to use it?
    • How are they going to use it?
@aleksmitov
aleksmitov / DP_Triangulation.cpp
Created April 19, 2014 20:38
Optimal polygon triangulation using Dynamic programming(DP) with memoization.
#include <iostream>
#include <algorithm>
using namespace std;
int N;
double px[100];
double py[100];
double DP[100][100];
int backtrack[100][100];
double dist(int from, int to)
{
@Shaptic
Shaptic / Triangulate.cpp
Last active July 11, 2021 19:32
Fokin' triangulation in C++.
#include <cstdint>
#include <list>
#include <vector>
#include <algorithm>
// This code uses C++11 features like "auto" and initializer lists.
// Compare two floating point numbers accurately.
bool compf(float a, float b, float threshold=0.00001f)
{
@russelldb
russelldb / crdt.md
Created September 9, 2013 08:03 — forked from pozorvlak/crdt.md

CvRDTs are (almost?) as general as they can be

What are you talking about, and why should I care?

Now that we live in the Big Data, Web 3.14159 era, lots of people want to build databases that are too big to fit on a single machine. But there's a problem in the form of the CAP theorem, which states that if your network ever partitions (a machine goes down, or part of the network loses its connection to the rest) then you can keep consistency (all machines return the same answer to

@ofan
ofan / lisp.cpp
Last active January 29, 2025 11:21
Lisp interpreter in 90 lines of C++
Lisp interpreter in 90 lines of C++
I've enjoyed reading Peter Norvig's recent articles on Lisp. He implements a Scheme interpreter in 90 lines of Python in the first, and develops it further in the second.
Just for fun I wondered if I could write one in C++. My goals would be
1. A Lisp interpreter that would complete Peter's Lis.py test cases correctly...
2. ...in no more than 90 lines of C++.
Although I've been thinking about this for a few weeks, as I write this I have not written a line of the code. I'm pretty sure I will achieve 1, and 2 will be... a piece of cake!