CST438 Week 3

    Git is really useful for managing code because it keeps a full record of every change and lets people work on separate branches without stepping on each other’s work. It makes collaboration smoother and gives you the safety of rolling back if something goes wrong. But Git can’t solve every type of conflict. If two developers make different edits to the same spot in the code, Git can’t tell which one is correct. It also won’t help when the changes technically merge but create logical or design problems. In those cases, developers still need to talk things out and decide how the code should actually behave.

Comments

Post a Comment

Popular posts from this blog

CST370 Week 3

 This week we went over BFS and DFS algorithms. We covered how BFS uses a FIFO queue, while DFS uses LIFO stacks. The first homework focused on DFS and used recursion to take advantage of the implicit stack. Our second assignment was on the Traveling Salesman Problem, using brute force to try all possible paths. Since the input could have up to 15 cities, the program had to generate and check every permutation, which really showed how quickly brute force becomes inefficient.
Read more

CST438 Week 2

     This week I learned how React uses components to build web pages and how data can be passed from a parent to a child using props. I also learned about hooks like useState, which manages state, and useEffect, which runs code when something changes or when the page first loads. I think React is really powerful because it makes it easy to create reusable and interactive parts of a website, and it updates the page quickly without needing to reload everything. One weakness of React is that it can be hard to learn at first because there are so many new concepts like JSX, hooks, and state management. It also requires setting up several tools and libraries to get a full project working, which was a bit overwhelming.
Read more

CST370 Week 5

     This week we went over Kahn’s algorithm, Quick Sort, and how to traverse a BST. I struggled a bit on my first read-through, but going step by step and writing things out helped a lot. Following the pointers in Quick Sort and tracking each step made it easier to understand. For Kahn’s algorithm, building the in degree table and manually popping nodes off my paper queue helped me visualize the process and work through it more clearly. Breaking things into smaller chunks made the material feel a lot more manageable.
Read more