508 reputation
212
bio website
location
age
visits member for 3 years, 5 months
seen Oct 18 at 10:40

Hello world,

My name is not Monster Truck II and I was not born in 1920. But here is something about me that I feel comfortable sharing. I studied physics and computer science at college and enjoy reading (history, politics, and economics) and listening to music.

Here is my bookshelf:

https://www.goodreads.com/review/list/20250758-monster?order=a&shelf=non-fiction&sort=position


Nov
19
comment need explanation on amortization in algorithm
Hey. I understand what you are saying but you don't write O(9). You write just 9. P.S.:- I did not down vote.
Nov
19
comment need explanation on amortization in algorithm
Can you post the code snippet or pseudo code so that we can see the full function? It is not clear what the author is writing about. Also, that is not how one interprets big O --O(5) does not mean cost to execute for 5 elements. Please read en.wikipedia.org/wiki/Big_O_notation for more details on what this function means as the comment box is too small. I will need
Nov
18
answered need explanation on amortization in algorithm
Nov
16
comment When would someone use MongoDB (or similar) over traditional RDMS?
It has to be remembered that sharding is heavily dependent on the architecture of your data centre. If you have a server rack its performance is awesome. On distributed DCs, not so much. Agreed on what you say about the general ease of partioning on NoSql DBs --but reliability is a key concern.
Nov
16
comment When would someone use MongoDB (or similar) over traditional RDMS?
If you write a lot of data won't global write locks negatively affect you?
Nov
3
comment Is experience very important when hiring/being hired in your country?
Chapter 2, Outliers by Malcolm Gladwell.
Oct
27
comment Can a recursive function have iterations/loops?
You can use anything that works Omega. Very rarely do software specifications specify what style of programming to use --unless you are in school and your assignment says so.
Oct
24
comment Protobuf design patterns
I agree it is fast and we use it elsewhere for small objects. But for the specific case of my project where we will end up reading/sending millions of results per day protobuf's savings add up significantly.
Oct
22
comment Protobuf design patterns
Where I come from (huge message wonderland) default Java serialisation created severe performance problems and XML created a huge mem. footprint. Protobuf scores on both fronts and makes the code dirty.
Oct
21
comment Best approach for saving highlighted areas on geographical map
+1. This is better than my answer because it provides a complete solution with minimal coding. Internally the library seems to be doing the same thing as what I had outlined though.
Oct
21
revised Protobuf design patterns
Code details, code formatting
Oct
21
comment Reasons to Use a VM For Development
+1. RDP is truly pathetic.
Oct
21
answered Best approach for saving highlighted areas on geographical map
Oct
21
comment Protobuf design patterns
I need 12 more points to create new tags and I think protobuf should be a tag for this post.
Oct
21
asked Protobuf design patterns
Oct
5
comment How can I reformat my condition to make it better?
+1 for saying something about useful names. But somewhere you will have to reformat the conditional.
Oct
5
comment How can I reformat my condition to make it better?
I prefer !exists || !isDirectory over the last one.
Sep
22
comment Improving without mentor
+1: Teach. Yes. Sometimes when I am preparing a small demo session I invariably find myself asking questions that my audience would. In an attempt to prepare for answers I research and more often than not I learn something invaluable.
Aug
18
comment Should I take care of race conditions which almost certainly has no chance of occuring?
Ever heard of a black swan? The 2007 financial crisis?
Aug
18
comment Should I take care of race conditions which almost certainly has no chance of occuring?
I down voted this one. The cost of the error matters not its chances of occurring.