cst348 - week 6

    This week we focused on unit and system testing. Writing these tests changed how I think about projects. Id previously assumed most effort would be focused into writing the logic for a project followed by testing as a smaller task at the end but working through these unit tests and the Selenium system test showed testing takes just as much effort to perform successfully. A well tested feature often has as much to it as implementation code. At one point I spent some time debugging a multi dialog DOM ambiguity issue in AssignmentViews, a bug that never showed up just from reading and normally running the code, only from testing it properly.   

    This weeks lecture talk about needing more tests than you'd expect which also clicked once I saw unit and system tests side by side. My mocked unit tests were fast to write and good for edge cases, like an instructor trying to access another instructor's roster. But they couldn't tell me the pieces actually worked together. Only the system test running through real navigation and data could confirm that.

Comments

Post a Comment

Popular posts from this blog

cst370 week5

       This week, we covered the quicksort algorithm along with the median of three selection technique that helps improve efficiency and reduce the likelihood of worst case scenarios. We also reviewed binary tree concepts such as height and traversals. While binary tree traversals were a review for me, it was still nice to revisit them and reinforce that knowledge.      We then moved on to binary search and the decrease and conquer strategy, focusing on how breaking problems down in smaller pieces can lead to increased efficiency. One of the most interesting topics this week was directed acyclic graphs and their sorting method. The process of removing source nodes and repeatedly identifying new source nodes felt very intuitive and made the idea of topological sorting easy to understand.       Finally, we discussed the usefulness of presorting and how it can greatly improve algorithm complexity by allowing more efficient approaches...
Read more

cst 383 - Week 1

     For our the first week, time was spent setting up Anaconda and learning the fundamentals of Python along with an introduction to NumPy. While the basic syntax was straightforward, it was good review to revisit the distinction between expressions and statements and how expressions produce values while statements perform actions.      An interesting topic this week was the difference between standard Python lists and NumPy arrays. took a look at how NumPy is faster for numerical operations largely due to how data is stored in memory. NumPy arrays store elements of the same type in a contiguous block of memory, which makes access much more efficient. This allows NumPy to take advantage of low level optimizations showing that that NumPy’s speed is not just about better algorithms, but also about how data is structured and processed.     P ractice with manipulating arrays using slicing and fancy indexing, as well as creating and working with mult...
Read more

CST334 Week 2

    This week has been a great introduction to how CPU process selection works in operating systems. We covered a range of scheduling algorithms, including FIFO (First In, First Out), LIFO (Last In, First Out), Shortest Job First (SJF), and Round Robin (RR). I learned how each algorithm has its own strategy for picking which process should run next, and how these choices affect system performance and metrics like response times.      I also learned to calculating those performance metrics such as response time, turnaround time, average arrival time, and average turnaround time. For Round Robin scheduling in particular, I learned how to calculate how long a process will stay in the system based on the time slice and the number of other processes in the queue. These exercises helped me understand the mechanics of how schedulers work and why the design choices made are so important.      One of the most interesting parts was comparing the pros and ...
Read more