CST 438-40 Software Engineering - Week 5

Week 5 Learning Journal:

This week, I learned about large-scale testing and how it differs from unit testing. I also learned about the importance of realistic test data, proper system configuration, and clear ownership of tests. Canary testing and A/B testing showed me how organizations like Google can test changes safely and identify problems before releasing them to everyone. In our group project, our team completed Iteration 2 by reviewing code, merging pull requests, fixing issues found during testing, responding to reviewer feedback, and verifying that the frontend, backend, and database worked together correctly. We also used Git branches, commits, pull requests, and team communication to coordinate our work. I also learned that Agile practices such as assigning priorities and estimating tasks with points are very useful because they help the team understand which work is most important, compare the size of different tasks, and divide the workload more fairly. My main takeaway is that successful software development depends on testing, collaboration, planning, and clear organization, not just writing code.

Comments

Post a Comment

Popular posts from this blog

CST 370-30 - Algorithm Design & Analysis Week 1

 CST 370-30 - Algorithm Design & Analysis Week 1 This week in CST 370, we went over the basics of algorithm design and analysis and what to expect from the course. A big focus was on understanding how to think about problems in terms of best case and worst case scenarios, not just getting an answer. We worked on logic puzzles like the fake coin and ball matching problems, which helped me see how algorithms can be about strategy and guarantees rather than code. These problems showed how careful reasoning can minimize steps while still covering all cases, which I think will be important later in the class.
Read more

CST 370-30 - Algorithm Design & Analysis Week 7

Week 7 Learning Journal -  This week focused on advanced algorithm design techniques including non comparison sorting, dynamic programming, and graph algorithms such as Warshall’s and Floyd’s algorithms. I learned how algorithm efficiency changes depending on the approach used. For example, Counting Sort achieves linear time by avoiding comparisons, and Dynamic Programming reduces repeated computation through optimal substructure. In our group bonus project, we also applied algorithmic efficiency principles. For example, we used an unordered_map for fast keyword searching with average constant time lookup. We also used a priority_queue to efficiently rank bookmarked verses. Even though we did not actually code dynamic programming or graph algorithms in our project, working on it still made me think more about why choosing the right data structure matters. When we picked unordered_map and priority_queue, I could clearly see how much easier and faster certain operations became compar...
Read more

CST 334 - Week 6

Week 6 Overview: This week in CST 334 felt like everything I’ve been learning about threads and synchronization finally came together. We didn’t have actual coding assignments for the lectures on the Bounded Buffer (OSTEP 30a), Semaphores (OSTEP 31), and Synchronization Barriers (OSTEP 31a), but we dove deep into how all these concepts work behind the scenes. It was honestly helpful to slow down a bit and focus more on understanding the patterns and problems before jumping straight into code. The lectures on the Bounded Buffer really helped clarify how semaphores control access between producers and consumers, and how you can use just a few semaphores to avoid race conditions and deadlocks. It made me realize how important the order of operations is when multiple threads are sharing data. The semaphore lecture helped things click a bit more for me. I’ve come across wait() and signal() before, but I always kind of just accepted them without fully grasping why they were used the way they...
Read more