hobbyist's comments

hobbyist | 13 years ago | on: The "Clockwise/Spiral Rule" in C

there is a cdecl package in all linux distributions, which can be used inside terminal to expand such C declrations. It was really helpful when I started C programming.

hobbyist | 13 years ago | on: The Unreasonable Effectiveness of C

Isnt high level relative. I was once speaking to a friend who is an electrical engineer. While discussing some dsp stuff with him I explained some asm instructions, and suddenly he says you are going high level :) I am pretty sure if he speaks to some physics/semiconductor guy he probably will get the same answer back from them

hobbyist | 13 years ago | on: Ubuntu for phones

I will be buying this phone. Period!

Why? The very reason why I use linux on my desktop and android just never gives you the same feeling of being differnt from the rest of the world.

hobbyist | 13 years ago | on: Canonical announces Ubuntu for smartphones

I am some how not very comfortable with ubuntu. Its bloating with so much code that its much slower than my arch linux.

But the good thing about this project is that with ubuntu, the other disributions will also try their hands on smartphones, which will certainly bring new ideas on the table. Like with current desktops there will be 2 kinds of smartphones, one which run "linux" and the rest.

P.S: Android only shares a common kernel with ubuntu, with rest being entirely different

hobbyist | 13 years ago | on: This Is Why They Call It a Weakly-Ordered CPU

Do, the memory barriers in ARM architecture also flush the caches? In Intel x86 architectures the hardware handles the coherency between all the caches, so a CPU core can directly read from the cache line of another core if it finds its own cache line to be dirty.. Does this happen in ARM also?

hobbyist | 13 years ago | on: The software development final exam: Algorithms and Data Structures

I wanted to ask this question regarding big O notation. When we say f(n) = O(g(n)) all we mean to say is that f(n) <= c(g(n)) with other constraints. My question is, why do we have an equal to sign, why is f(n) equal to O(g(n)).. they could have made up a new symbol to establish such a relationship... The reason why I think so is because I see equal to as a transitive relationship.. So, if a = b and c = b, then a = c .. This clearly doesnt hold when we use f(n) = O(g(n)) .. n^2 = O(n^2) and n = O(n^2), so n = n^2 which is not making any sense..
page 2