Author Archives: spsneo

A Simple LRU Cache Implementation

Posted on March 15, 2011 by spsneo

LRU Cache is a caching strategy where we use Least Recently Used (LRU) eviction policy when the cache is full and we want to add more new data to the cache. LRU cache is used in many caching applications. For … Continue reading →

Posted in Algorithm, Caching Algorithm, Data Structure, Linked HashMap | Tagged , , , , | Leave a comment

Perplexing Probability – Things are not always obvious

Posted on January 17, 2011 by spsneo

Note: Below mentioned story is a purely hypothetical one. Think of it as just another probability problem. Don’t get into the complexities of real world. Everything you need to ponder upon is already mentioned in the story. After the recent … Continue reading →

Posted in Probability | Tagged | 3 Comments

What’s wrong with binary search!

Posted on January 11, 2011 by spsneo

There’s a bug in the code of “Binary Search” as most of us write it. When asked most of us code binary search as – int binary_search(int *a, int len, int key) { int low = 0; int high = … Continue reading →

Posted in Algorithm, Binary Search, Google | Tagged , , , , | 7 Comments

What’s been keeping me busy these days?

Posted on January 8, 2011 by spsneo

Of late, I have not been adding new pages to my blog. A lot has changed since I last blogged. From an undergrad student at IIT Guwahati to a Software Developer at Adobe India now. Transitioning from one role to … Continue reading →

Posted in Life, Memory Management Algorithms, Nova, OpenStack, Page Replacement Algorithms, Swift, Trading Algorithm | Tagged , , , , , , , , | 2 Comments

IITG Webmail Extension – Auto Login Feature

Posted on March 3, 2010 by spsneo

Note: This post is only for currently enrolled IITG students. Today I added a new feature to the “IITG webmail chrome extension” – Auto Login feature. Now you can save your username and password in the options page of the … Continue reading →

Posted in Chrome, IITG, IITG webmail | Tagged , , , | Leave a comment