CST 438 - Module 2

 Week 2,

This week's module covers material based on REACT which serves as the front end of the web development framework. While in last week's assignment, we implemented a simple database that can be used updated or changed via typical html requests. However, we would only be able to do this by typing in the URL and parameters, while passing in a body containing JSON. This week allows us to create web pages where a user can interact with input fields, see error messages and make changes to the database, while making the webpage run more efficiently using a virtual DOM (Document Object Model). 

I consider the strength of REACT is the improved efficiency from a normal framework. From what I understand, a DOM is a structure that represents the HTML elements of a webpage, and when changing the DOM, it updates all of the browser rendered elements. However, with the use of the virtual DOM, which is a lightweight version of the real DOM, we can change that first and only have to re-render the parts of the DOM that did change, instead of the whole thing. However, when it comes to manipulating state variables, you would need to call a function to use the state first, then use a setter to change it. I can imagine in a larger project, and something needs to be changed, there will need to be additional changes compared to a simpler framework.

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