This week explored algorithms including the brute force method by performing an exhaustive search. We also learned about two primary strategies to transverse a graph. These two methods were depth first search and breadth first search. Of the two I am more comfortable with the depth first search. I find it somewhat more simple to code an algorithm that performs a depth first search. When coding for the breadth first search I found I had to keep track of the queue and in the homework I had to keep track of what permutation produced the optimal path. I also learned about the divide and conquer strategy and how to use the master theorem to calculate time complexity. We will also have our midterm this week so I will need to review and solidify my understanding of the concepts presented in these first three weeks.
Part One: Supporting and Commenting on Teammate's Goals I visited the following teammate's blogs and commented on their goals. Juan's Blog Vance's Blog Part Two: Possible Capstone Ideas The three ideas I have for my capstone project are two different mobile apps and one indie game. For the two apps I am thinking of creating something in Swift, the programming language of iOS. The first app is a passion project that involves a list builder for a miniature tabletop game called OnePageRules. It is an independent miniature game ruleset and already has a web version. My app would take that template and adapt it for iOS. The second app would be a simple star wars app that utilizes an online API for Star Wars call SWAPI. This API has a number of entries related to the Star Wars universe in JSON format. My app would connect to this online API, download specific pieces of data and display them in the app. The third idea would be to create a simple side scroller game. The game ...
Comments
Post a Comment