CST 438 - Module 7

 Week 7,

This week was rather interesting because of two parts. For one, we were tasked with pushing our work on the past few assignments into the Amazon Web Services (AWS). This allowed us to run our website's backend and front end in amazon's servers where they have many beneficial services to use in running it. It took a while for me to get running because somewhere along the lines I think I had a typo and I didn't catch it until the end. 

The second part of this weeks module was making our own Software Requirements Specification (SRS). Whereas previous weeks, we've been following the Agile process to complete a project, this week gives us experience in the Plan & Document (PD) process. The SRS is part of PD process and it takes a good amount of time, especially if you are working on a large project. After reading up on it and already having an understanding of the Agile process, there are some key differences. 

The main difference is that in PD, the project starts with understanding the requirements of the software. This process takes a while and must be done before designing and implementing. It is very much like a waterfall where you move from one stage of the project to another. The Agile process on the other hand is done iteratively. You first make "stories" which describes what the user wants and build the project around that. The customer will be constantly involved throughout the project in providing feedback. However, because the project is being worked on iteratively, any changes needed to be made to early iterations can slow down the team velocity. 

Comments

Post a Comment

Popular posts from this blog

CST 311 - Module 3

 Week 3 This week's material was very more focused on the transport layer. One topic was multiplexing and demultiplexing. To sum the topic up, this is how data is handled from multiple sockets using a transport header. The multiplexing occurs at the sender, using the transport header containing the source and destination port number, then demultiplexing occurs at the receiver, which allows the receiver to deliver the received segments to the correct socket. There are also two variants of these, connectionless demux and connection-oriented demux.  More on the topic of connection and connectionless transport, connectionless refers to the UDP protocol and is considered bare bones, there is no handshaking and each UDP segment is handled independently. What makes it bare bones is the fact that there is no effort in flow control, delivering data in order, reliable data transfer. However, it can be implemented at the application layer. On the other hand, with connection transport (us...
Read more

CST 338 - Module 4

 This week in CST 338, there were few assignments to complete. This time we got to get our hands on Android Studio, where we created very simple app where android users can convert temperature °c to temperature °f, or vice versa. We also got to complete our first project, where we practiced inheritance using an abstract class, and concrete classes. However, besides that, we were also allowed to go back to our previous assignment, Markov, and have our teammates review each other's code. I worked with my teammate Ryan Matsuo  and after reviewing his code, I learned a few things that could help me in the future, like splitting a string using str.split() with a regex of "\\s+" instead of what I did which was more complicated. My strategy with solving the Markov assignment was that I started writing the code right away. I didn't put anything to practice into paper because I feel I can do the same thing in the code. I would read the prompt, create stubs for the methods to b...
Read more

CST 370 - Module 3

 Week 3, This week's module started off with the continuation of Brute Force. This time using Brute Force with string matching problems. In short, when given a string of text and a pattern, find the pattern within the text. Using brute force, you would compare the strings character by character, and if there is a mismatch, shift a character and re-compare. This could have a fast best case scenario, however, worst case is longer than you would initially think. The next topic involved Exhaustive Search, an algorithm which determines all possible scenarios of a solution to the problem, compares each of them, and selects the fastest/lowest cost result. For example, the Traveling Salesman Problem requires you to find the shortest path to visit all nodes once, and return to the starting nodes. Using the Exhaustive Search approach, you would first find out all the different combinations of paths to take when starting from the first node, find out how much it costs for each path, then choo...
Read more