CST 338 - Week 5

 Hey everyone! Here is an update on my week. We did two major things: started planning to build our own app and coding a text generation program called Markov.java. We then reviewed our MArkov.java with our classmates. Here are some analysis questions.

  1. Who did you work with?
I worked with my classmate, Adan Valadez. 

2. What was your strategy for solving the Markov assignment?
I first started writing the methods according to the UML diagram provided. Then I created two branches, and divided the methods into both those branches. I started to work through my methods one by one, debugging when needed.

3. What was THEIR strategy for solving the Markov assignment
Adan first wrote all the methods without any context. Then he followed the instructions and completed each methos. He tested the methods when possible as well. Finally, he debugged the code where needed and completed the program. 

4. How would you change your strategy having worked on the assignment?
I think I would have read the instructions more carefully I tried to understand what we needed to do properly to avoid silly mistakes. 

5. According to your classmate(s): how well does your code follow the Google Java Style Guide? 
According to Adan, I followed the Google Java Style Guide properly. 

Well that was my week this week. Next few weeks will be busy with the group project but looking forward to completing it!

Comments

Post a Comment

Popular posts from this blog

CST 334 - Week 6

 Hey everyone!      This week we submitted our research collab project. It was quite interesting and fun. I learned a lot and our team bonded more as well. We also learned many new things through our lectures and labs.       Concurrency is a critical concept in computer systems, enabling multiple processes to execute simultaneously. However, with great power comes great complexity.       A semaphore is a synchronization primitive that helps manage access to shared resources in a concurrent environment. Semaphores can be thought of as counters that control the number of processes allowed to access a resource. They come in two main types :             - Counting Semaphores : These can have values greater than one and are often used to manage a   pool of resources, such as threads or connections.           - Binary Semaphores : These function like locks and c...
Read more

CST 334 - Week 4

Hey everyone!       This week, I learned about how operating systems manage memory, which is one of their most important jobs. One topic was free space management , where the system keeps track of memory or storage that isn’t being used. Two common methods are bitmaps (using bits to mark if memory is free or taken) and linked lists (connecting free memory blocks together). Each method has its pros and cons, like how much space they use or how fast they work.      I also studied paging , which splits memory into small chunks called pages. These pages are mapped to physical memory, keeping processes separate and organized. However, this mapping can slow things down because the computer has to translate addresses often. To make it faster, Translation Lookaside Buffers (TLBs) store recent translations in a small, quick cache. I also learned about advanced page tables , which are smarter ways of organizing these mappings to save memory.    ...
Read more

CST 370 - Week 1

 Hey everyone, This week, we learned several important topics that form the foundation of computer science and programming. We started with GitHub and practiced using manual commands like git init, git add, git commit, and git push to manage our code. This helped us understand version control and how to keep track of changes when working on projects, especially when collaborating with others. We were also introduced to algorithms and learned what they are—step-by-step methods for solving problems. One example we focused on was Euclid’s Algorithm for finding the greatest common divisor (GCD) of two numbers. It uses a simple but powerful idea: repeatedly replace the numbers with GCD(b, a % b) until the second number becomes zero. We also practiced writing pseudocode, which helped us plan out algorithms in plain language before coding. We also had a homework assignment to help us further understand GitHub commands. Later in the week, we learned about graphs, both weighted and unweight...
Read more