HELP!!!I Need Thesis Topics

Hi! I'm just new here and I was wondering if you could help me. Me and my groupmates have been proposing to our professor several topics for the last 2 weeks with regards to Computer Science but he keeps on rejecting us. He told us that he wants something algorithmic but we can't think of any. Can you please help us find a suitable topic for our thesis...please...we will definitely appreciate all your help....thanks in advance..

Please Register or Log in to view the hidden image!

 

Log in or Sign up to hide all adverts.

You might want to try the edit distance problem if you have studied dynamic programing. I will just repeat most of the problem as it is stated in Introduction to Algorithms. You want to find the minimum number of transformations to translate strings x[1..m] to y[1..n]. Operators are copy, replace, delete, insert, twiddle, and kill. Each operator has a specific cost.

copy := z[j] = x; j++; i++;
replace := z[j] = c; i++; j++;
insert := z[j] = c; j++;
twiddle := z[j] = x[i + 1]; x = z[j + 1]; i += 2; j +=2;
kill := i = m+1. Must be the final operation.

 

Log in or Sign up to hide all adverts.

Thanks Very Much!

Thank You Very Much for your Help!!! I really appreciate it! Thanks a Lot!!!!!!! Thank you...thank you!

Please Register or Log in to view the hidden image!

 

Log in or Sign up to hide all adverts.

Try creating what is called an "infinite precision" numerical data type. You are familiar with the other numerical data types: integer, float, single, long, double, etc. The infinite precision data type holds numerical values with any number of significant figures as a string of arbitrary length, literally a number could be hundreds of pages long. Non-terminating decimals are represented as a Taylor expansion. It performs fundamental calculations on them using boolean algebra (I think). Could be interesting.

 

Thanks Success Machine!

Thanks very much! I really appreciate it! Thank you so very much!

Please Register or Log in to view the hidden image!