Blog :: All

when i click on a drive it opens in new window but when drive gets open sub-folders open normally.How to fix it?


First scan with avg free...remove any infections found. Then go to Tools>>Folder Options>>View >> Uncheck Hide Protected Operating System files.

Now you can delete the autorun.inf file in each drive.

Scan with AVG once again just for precaution.

hey guys i got this idea while studying the shortest path algos like djikstra nd warshall.

this can be done as a minor project... very simple thing to do.. we can write a symbian os program to find shortest path between 2 destinations on a map...... we will first have to make a map according to a scale, and then when the user enters the source and destination.. it will find out the shortest path between them using djikstra or warshall.......

we can also extend this algo to be of better use by also inculcating the traffic density, stoppages etc in the weigthage we give to each edge of the graph and then calculating the shortest path.....

 

i hope this is fine for minor projects......what do you think guys??...... 

well its really quite simple but will require loads of coding thing to be done. kind of a starter concept of AI where the computer decides the move.....

 Well the informal algo goes as follows... computer will calculate probability of winning and loosing for each possible  move  at each step in the game... if will then have to take a weighted average of those probability and calculate total winning probability... the move which gives him the highest total winning probability will be his move....... sounds simple isnt it but the coding of the same will ummmmm not complicated but will definately be lengthy.........

you are given an expression like (a+((b+c)))..... here extra braces are provided on b+c... i mean like (b+c) is ok... but ((b+c)) isnt as it contains redundant brackets.. So for a given expression you have to tell whether expression contains redundant paranthesis or not.....?

 

I would like you people to try this question.... its quite simple .... i will provide you with the answer in next couple of days................... 

hey people i would like to suggest an alternate approach to be used for radix sort.

The general approach is to apply counting sort on each digit of every number starting from the units place( now onwards LSB) and going upto the highest place(now onwards MSB)

eg suppose we have the numbers-> 219,357,557,639,426,620,345

so first it applies counting sort on LSB

hence the list will now be

620

345

426

357

557

219

639

then counting sort is applied to the tens plance and so on till MSB

Hence in this case we will have to check for each digits place uptil MSB.

Rather than doing this what we can do is start applying the counting sort from MSB, we will have following cases possible for each place(i.e. thousand, hundred, tens, units etc)

case 1: if all the digits (i.e of different numbers at that place) are different the counting sort will be applied and we will get the sorted list

eg if the numbers are : 128,532,457

then upon applying the modified radix sort we will first apply counting sort on the MSB's, since they are all different we will get the sorted list in one operation only

i.e. we will get 128,457,532

case 2: if 2 or more digits of the same place are equal, in this case we will apply the counting sort(preserving the ordering) and then sort for the next lower place

eg if the numbers are 253,146,223

then upon first applying counting  sort we get 146,253,223

then we check for next place and get the result as 146,223,253 

so we keep on applying these two cases until we get the sorted list. 

Therefore we can easily see that in case of the usual Radix sort, we will have to apply counting sort for each digit place while in case of this modification we can get the sorted list if at some place we get all the digits different ( we can easily use a counter for this)

I would like you people to think about this and tell me in which sorting the complexity will be less always... As far as i think it will be less in the second case.

Thank you 

It appears that we will be seeing the long awaited Google Phone sooner than we originally thought. This has been a long running saga where the original stories began to break about the phone, followed swiftly by all the rumors about what it may do, what it cannot do and so on, until it reaches the point where we all wonder if this is really ever going to happen at all. So what has the Google phone got in store for us?Rumours are that the Google phone will be using the Texas instrument 3G phone platform, and will of course have Gmail, Gtalk, Google Maps and anything else that is available with a “G” in front of it, so lets hope that it is great! There has been little information regarding the networks that the phone will be available to. According to many sources the phones must be nearing a launch date, as the manufacturers Taiwan based phone maker High Tech Computer are said to be preparing for the first shipments by the end of this year, 2007. This means that there will be a build up to a massive launch in early 2008!

Storage Components

Memory:
–Volatile: retains data only when it is powered
–Non-volatile: retains data even when it is not on
–Primary: hold programs when they are running
–Secondary: Store data and programs

DRAM vsMagnetic disks
–Access time for DRAM:40-80 nanoseconds
–Access time for Disks: 5-15 milliseconds
–However cost per megabyte of disk is 100 times less expensive

The day comes flying with dreams…
No, I don’t wanna dream tonight…
I just wanna scream in flight…
Just wanna look deep below the light…

Am I still dreaming?
No, I don’t wanna be illusive in daylight…
I just wanna beam ahead with light…
Just wanna spree around with time…

If I was lost in a dream…
If I was boss of my every seam…
If I was to emboss every spin of my wheel…
If I was to toss every brim of spiel…

I could have rested in peace…
I could have shattered that scream…
I could have stopped the era traverse…
I could have pattered with the verse…

Hopes are high…
No, I don’t wanna dream & fly…
I just wanna brace my hopes & ply…
Just wanna let my dreams apply…

Am I still dreaming?
No, I don’t wanna be illusive in daylight…
I just wanna beam ahead with light…
Just wanna spree around with time…

Yet another blog set by me to fly today...