|
Technical -
Technical
|
|
Written by Karthikeyan NG
|
|
Sunday, 27 September 2009 17:57 |
|
Hi friends, I welcome you all for taking time to visit this. I am Karthikeyan NG. I have completed my studies in a college as a mediocre boy. This is a portal for my personal use and for some entertainment to me and to my friends. So have a look at all the pages, but before leaving please make a comment on the page.
This portal mainly for:
* My personal use
* For updating my events
* Sharing my knowledge
* This portal comes under a combined license of CC and GPL
|
|
Read more...
|
|
|
Entertainment -
Movie Reviews
|
|
Written by Karthikeyan NG
|
|
Monday, 19 October 2009 09:44 |
|
To avoid swine flu problems, they didn't allow us to go to home for this deepavali. So we have planned to go for a movie here. We went to Anjali theatre in trivandrum on saturday morning. We thought there won't be any crowd since it is releasing in thamizh. But we didn't expect that much crowd there. There was a heavy crowd than we can see in tamilnadu theatres. There is a lot of fans for surya. One friend from Kerala told that Vijay has more fans than other thamizh actors. I was really wondering. In Tamilnadu there won't be any other language films. But here it is not like that. They like other language films a lot, especiallt Thamizh movies. There is a lot of fan clubs for Surya, Vijay and vikram here. me, kavin, Raveen and Samuel went to the film.
Aadhavan is directed by K S Ravikumar and produced by Udhayanidhi Stalin, starring Surya and Nayanthara. In over all the film was good. We can see once.
Story:
The whole film was suited in Kolkata and its surrondings.Surya is a local gangster with some fellows around him. He gets a job for killing a judge.The judge is supposed to submit a report regarding many illegal activities. So somebody pays money to hero's gang to kill him. But he misses his chance to kill him. So he plans to kill him with in ten days. So he goes into his home with the help of Vadivel.His every attempt fails in home also with Gun and Bombs. Our heroine also lives in that home. In the mean time his fightings also good. Some of the fight sequences copied from the movies Wanted and District.
|
|
Last Updated on Monday, 19 October 2009 09:51 |
|
Read more...
|
|
Technical -
Technical
|
|
Written by Karthikeyan NG
|
|
Sunday, 27 September 2009 19:43 |
|
This function converts strings into upper case in C language. It is a simple one. I use ternary operator.
Code:
void UppCase(Char *str)
{
while(*str!=0)//traversing until end of atring
/* check whether the char is between 'a' and 'z'. If it is subtract the ASCII value of 'a' and add ASCII value of 'A'. Otherwise print the char as it is */
*str = (*str>='a' && *str <= 'z')?(*str-'a'+'A'):*str;
str++;//increment pointer to next position
} |
|
|
Technical -
Technical
|
|
Written by Karthikeyan NG
|
|
Sunday, 27 September 2009 19:44 |
|
This is the question asked for me in one of my interviews. It is quite simple to answer. But involves quite a big process.
First URL stands for Uniform Resource Locator. It will be very difficult to remember an IP address. Instead of remembering the IP addresses URL came like www.intrepidkarthi.com. Url normally contains three parts. For example http://intrepidkarthi.com/index.php.Here "http" refers to the protocol it uses. Then the server name and then the requested file name.
Here I have enlisted the flow of working mechanism behind your browser
The flow of work
* Your browser communicates with a name server to translate the server name "www.intrepidkarthi.com" into an IP Address, which it uses to connect to the server machine.
|
|
Read more...
|
|
Technical -
Technical
|
|
Written by Karthikeyan NG
|
|
Sunday, 27 September 2009 17:52 |
|
This is an application on LAMP stack which can be used further for online GRE tests. This is how all GRE tests works at the back end. I have tried in this method.
Autosyngen:
As we know, the wordnet(online dictionary from princeton university) db is organized in "synsets", so each word has several synonyms, and those synonyms in turn have their own synonyms, and so on. This arrangement can be used to dynamically generate a multiple choice question for each word. Here this will pick a random word from a attached file and generate a multiple choice question having five answer choices, of which one choice alone is correct (ie it is one of the valid synonyms of the given word) and the other four choices are randomly picked from entries in the db.
So far, so good. But there is a problem: What if, among the four "wrong" choices, there are words close to the main word? Maybe another direct synonym, or the synonym of a synonym? Thus we should define a metric, "Minimal Path Length" or MPL that tells us "how far apart two words are, in their meanings".
For Eg, the word "be" has a synonym "live", and "live" in turn has a synonym "endure", which in turn has a synonym, "suffer". So the words <"be", "suffer"> have an MPL of 3 as you have to hop 3 synonyms to get to one from the other.
Of course, this is assuming that there are no common synonyms across this set (eg. "suffer" is not a synonym of "live") - that's what "Minimum" means, ie it's the shortest path. So, use the above logic to ensure that your four wrong answer choices are at an MPL >= 4 from the main word. Now, for each question, the generated answer choices have 1 right choice and 4 very wrong choices. But an intelligent question will also have a "distracter" answer choice, ie one that's close to the right answer but is not the right answer. Ie 1 right choice, 1 distracter choice and 3 very wrong choices. I think you have understood the scenario now. Okay. For achieving these things,
Other things are explained in the downloadable application in the projects page. If you have any questions feel free to contact me. Online demo is available @ http://intrepidkarthi.com/autosyngen |
|
|
|
|
|
|
Page 1 of 2 |
