If you are familiar with socket programming, you would be aware that send and recv are usually blocking calls. This means that the code execution will be blocked until they are successfully resolved. This prevents us from writing TCP servers that can respond to multiple clients. However, there are different Read more…
I was recently diagnosed with ADHD (Attention Deficit Hyperactivity Disorder) as an adult, and suddenly, an epiphany ran through my eyes. My life span through my eyes in a short video clip when I learned more about it. It made sense now why I couldn’t sit at a place for Read more…
The Least Recently Used (LRU) cache is a cache eviction algorithm that organizes elements in order of use. In LRU, as the name suggests, the element that hasn’t been used for the longest time will be evicted from the cache.
I recently started using Emacs for text editing purposes and was pleasantly surprised. My main goal to learn it was to work efficiently in teams that don’t have a nice local dev environment and you need to have a dev machine running to run, build, and debug your code.I started Read more…
AdBlock for blocking ads. also adblock plus Go Fucking Work is what I use to block sites like Reddit or Facebook so that I don’t get distracted. Grammarly is a grammar-checking extension for you to improve any writing. (It’s also available for Firefox and Safari if you use those.) Lastpass is the password Read more…
C++ hasn’t yet caught up with implementing 2D arrays like other languages yet. So there is no inbuilt 2D array in C++.But lose no hope, with some template programming to the rescue we can create our own multidimensional data structure. Here is a basic design of how a 2d Array Read more…
Below is an implementation of thread-safe queue using synchronization primitives.
There are 2 ways in C++ to get the size of an array. The first is using run-time computation with sizeof, but there is a better compile-time way to compute the size. The way to do it as follows: Note: char* is not the same as char[]. When you do Read more…
Topological Sort is used to find a linear ordering of elements that have dependencies on each other. For example, if event ‘B’ is dependent on event ‘A’, ‘A’ comes before ‘B’ in topological ordering. Lets say we are asked to find all possible variations of topological sort. There are ‘N’ tasks, Read more…
To measure how well our models are performing we may need to define some metrics. One of the metrics which is quite straight forward is accuracy. Accuracy is defined as the number of correctly classified points divided by the total number of points in Dtest. But there are several places Read more…