Blog of a Computer Science Student
Posted in Bachelor of Computer Science, Basis Year, Datastructures and Algorithms on Apr 10th, 2010
Here comes the latest announcement about the summary in Data Structures and Algorithms. We’ve pushed it a little bit and managed to complete the whole up to trees. The AVL Tree part should be finished by this weekend and then I’ll provide a new great release.
Posted in Bachelor of Computer Science, Basis Year, Datastructures and Algorithms on Mar 24th, 2010
I’m glad to announce the new release of the algorithms and data structures summary. The new release brings the an extended FPTAS solution for the knapsack problem and a a comparison of sort algorithms.
From this release on I’m working with Christian to get a better and faster progress in this. There are some issues in the layout.
Posted in Bachelor of Computer Science, Basis Year, Datastructures and Algorithms on Mar 15th, 2010
I’ve managed to upload the summary of data structures and algorithms i will upload new versions by replacing the actual file. There are only few changes and it’s completed up to bubble sort with a little to do on FPTAS. I hope I can provide a completed version up to the lectures of Thursday and Friday until this weekend.
I also get some good inputs in the Analysis I+II project. So i will upload an technical preview of this in a week or two.
Posted in Bachelor of Computer Science, Basis Year, Datastructures and Algorithms on Mar 14th, 2010
Id like to announce that the newest revision of the summary about data structures and algorithms is out now. It covers the whole lecture from the beginning up to the topic insertion sort (excl interpolation search)
I will publish it online next week because I’d like finishing the whole search/sort part before releasing it.
Posted in Bachelor of Computer Science, Basis Year, Datastructures and Algorithms on Mar 14th, 2010
Three Weeks passed and it seems that this course is one of the hardest one. Finding a way to solve a problem with less possible steps is not quite easy even though our normal approach does not increase the performance.
The course by Prof. Peter Widmayer is well presentet though sometimes a bit fast and abstract and some thing are “left as exercises”. Because of that reason I’ll provide a summary or sometimes extended lecture notes on that.
File: Datastructures and Algorithms
http://www.vvz.ethz.ch/Vorlesungsverzeichnis/lerneinheitPre.do?lerneinheitId=65030&semkez=2010S&lang=en
Link to Course Homepage
http://www.cadmo.ethz.ch/education/lectures/FS10/DA