Skip to main content

CST 370 Week 7 Journal Entry

 This week we learned about two additional algorithms: Counting Sort and Radix Sort. Counting sort involved finding the frequency of a given value in an input array and then generating output based on that frequency. Radix Sort takes an set of input numbers and looks at the least significant digit in each entry and creates an output order based on that digit. The algorithm continues with each least significant digit and will order all the numbers once it is complete. One other topic I found this week to be interesting was the idea of dynamic programming where we keep an array of solutions to sub problems to help with future calculations. 

Overall I felt this week provided great information on additional sorting algorithms and the concept of dynamic programming.

Comments

Popular posts from this blog

CST 338: Week 4 Learning Journal - Markov Project Peer Review

For the Markov code review I worked with my teammate Brandon Hoppens. My strategy for the Markov assignment was to first read through the entire prompt and ensure that I had a general idea of what the program was supposed to do. I then worked through the prompt building each method before moving on to the next. I built all of the methods and then ran the test after my initial build. I was able to pass a few of the test and failed others. I then went back to the individual tests I failed and manually debugged them. This was in contrast to how Brandon tackled the prompt as he was implementing the methods as they were needed. He worked to ensure each piece that he added worked with the existing code base. I think I would change my strategy to adopt some of his methods and use an incremental approach. I relied on building the entire program before running the first test, and I can see how on bigger projects this could lead to some frustration.  The feedback I received from Brandon was ...

Week 5 Learning Journal

Part One:  Supporting and Commenting on Teammate's Goals I visited the following teammate's blogs and commented on their goals. Juan's Blog Vance's Blog Part Two: Possible Capstone Ideas The three ideas I have for my capstone project are two different mobile apps and one indie game. For the two apps I am thinking of creating something in Swift, the programming language of iOS. The first app is a passion project that involves a list builder for a miniature tabletop game called OnePageRules. It is an independent miniature game ruleset and already has a web version. My app would take that template and adapt it for iOS. The second app would be a simple star wars app that utilizes an online API for Star Wars call SWAPI. This API has a number of entries related to the Star Wars universe in JSON format. My app would connect to this online API, download specific pieces of data and display them in the app.  The third idea would be to create a simple side scroller game. The game ...

CST334 Week 4 Journal Entry

 During this week of CST334 we continued to learn about memory virtualization, focusing on the technique of paging. Paging divides virtual memory into fixed-size pages that are mapped to physical memory frames, reducing fragmentation. We practiced using page tables and multi-level paging to learn how the Memory Management Unit (MMU) translates virtual to physical addresses. We also learned about temporal and spatial locality and calculated average memory access times with paging. We also explored the mechanics of swapping in operating systems and simulated various page replacement policies and analyzing their effects. This week helped me to continue to build on my understanding of efficient memory management and virtualization techniques in operating systems.