B1 and the Algorithm Presentation

Algorithm – a set of instructions designed to perform a specific task. Of course this is the definition of the word, but it is also the topic of one of the groups presenting in my Intro to Computer Science class. The group introduced the history of algorithms, practical applications, as well as varying types of algorithms. Being that we had already covered the topic as a class, the presentation was easier to comprehend, since some background knowledge had already been obtained. It was very interesting to hear about the different types of algorithms, from the “brute force” algorithm to an algorithm used for backtracking. It was great for them to return to the core idea of why we need algorithms, and the fact that they exist even if we do not realize it.

I do appreciate the wealth of information contained within the presentation, but at times I questioned if the information was a bit repetitive and redundant (you know, like saying something that means the same thing twice). And while this information was new, and believe me when I say it actually was nice to learn a thing or two along the way, it seemed very information heavy. Of course this is to be partially expected since it is a “research” topic presentation, but above all the word “presentation” needs to be stressed. At times, I found it less interesting when I realized that I would be looking at another large wall of text on the next slide of the PowerPoint.

I give kudos to the group for separating their information by their individual subtopics. While this made it apparent where the work was divided, it helped the transition, ensuring everyone would be on the same page when the next topic was reached. The visual of the presentation was very easy on the eyes, meaning that outside of the walls of text, the presentation was nice to look at. The visual aids, as well, were a boon in this presentation. They were very explanatory, and added an extra touch of information.

Overall, this was a good presentation based on the team’s ability to review what had been previously covered, as well as further elaborating on the topic. My only unfulfilled question would be this: what other practical algorithms can be demonstrated? We all know the PB&J algorithm, and those who enjoy solving Rubik’s cubes have algorithms for them. It’s always interesting to see how an additional level of thought can be put into the simplest of things.

Nice presentation, group B1. Would recommend.