Thiloshon Nagarajah

The blog is migrated to  https://thiloshon.wordpress.com       The path finding is one of the most common problems found in computer science, especially in game development and AI. The problem has been analyzed, scrutinized and dissected by various people and several possible solutions and algorithms have been implemented. The important part is not to implement one by ourselves but to understand what each does and how its effective from one another. In the CW, this is exactly what’s expected. You don’t necessarily have to implement the best solution. You just have to implement one and understand how efficient it is. I.e. derive the growth rate.  It can be a slow algorithm. If its slow say its slow and justify why its slow. Derive the growth rate and support your rationale. I’m using the Dijkstra’s Algorithm in this blog to find the shortest distance path. Don’t be intimidated by the name of the Algorithm, its fairly simple one. It uses Greedy Algorithm with a simple tweak and is

The blog is migrated to  https://thiloshon.wordpress.com   IIT is in my opinion a coursework-driven university where students believe they can learn more in the last two days before submission than in the entire lectures. At IIT programming is taught from the first day itself and I have seen students trying and failing to grasp the sense of programming and proper programming practices despite of lecturers trying all their best to provide students what they need. So this is from my experience of how to get good grades in 1st year CWs and to build on top of what you learned at IIT. Lecturers teach everything there is to get good grade and be a good programmer. If you listened to all the programming and design lectures and attended all the tutorials, then this blog is not probably for you. You know all this. For others, see if this makes sense. This is the first part of 2-part blog. 2nd part covers 2nd CW. Note: I’m using and recommending IntelliJ IDEA as the IDE and f