CST370 Week 2

CST370 Week 2

Week 2: I still need more practice on the homework. I am rusty when it comes to manipulating vertices and displaying them correctly. The other homework about manipulating time differences was very easy in comparison. 

I learned a great deal about recursion! Biggest concepts to me to not forget are:
  • Big Om notation is an upper bound, so an algorithm must be the same order or lower growth as f(n). So, n^2 would not be within bounds for Omega notation of n.
  • Big Theta notation is a tight bound, meaning an algorithm must remain within the same order of growth as f(n). So, n^2 or log(n) would not be within bounds for Theta notation of n, only n.
  • Big Omega notation is a lower bound, so an algorithm must be the same order or higher growth as f(n). So, log(n) would not be within bounds for Omega notation of n.
Isopod Update: I can see my cappuccinos occasionally, so they're still doing okay!

Comments

Post a Comment

Popular posts from this blog

CST300 - Week 4

Week 4 has been busy! I have gotten work done a lot later than I would have liked. Part 1: Education Goals My educational goals would be to expand my knowledge about Javascript. The most tangible project to put this in practice would be to create a simple interactable website, possibly using React as a frontend. One of my ideas for a capstone project would be to create a website for a tabletop game I am developing, so the practice would be great for it.   The first step would be to learn about networking -- CST311: Intro to Computer Networking and CST336: Internet Programming would be where I hone these skills. Before these classes, I would like to create a single-task web app as a practice. It would have a starting list of about 20 items, and allow the user to arrange them into 6 specific item slots, like a digital pin board. Then, once I am in these classes, I will look back at this project and see what I can do differently or what I have learned since then.   My web develop...
Read more

CST334 - Week 6

Week 6 Reflection This week, we learned more about semaphores, and the bugs that are commonly faced in concurrency, such as deadlocks.  Semaphores are a synchronization primitive that has a modifiable integer value. The behavior of the semaphore is determined by this value. They can be used as both locks and condition variables for concurrency.  sem_wait() and sem_post() are used to interact with a semaphore. sem_wait() waits for a condition to be met, while sem_post() increments the value of the semaphore, then wakes a waiting thread. If a semaphore's value is negative, this number is equal to the number of waiting threads. For example, -4 equals four waiting threads, incrementing by 1 will change it to -3, waking one thread and now resulting in three waiting threads. Concurrency creates bugs that are difficult or costly to fix correctly. Non-deadlock bugs include atomicity violations and order violations. Atomicity violations occur when instructions that sho...
Read more

CST363 - Week 1

Since this is the new fall semester, I'm not too sure whether to include the last two weeks as part of the 100-week count for this program. I'm going to assume no, that is not included. CST363 - Week 1 This week I had trouble finding information to help with the java labs. I felt like I had to research a lot more information than what was provided in the course for these specifically. On the other hand, the ZyBooks textbook is very well made and helped me relearn MySQL statements from years ago. I plan on writing a whole notebook using this textbook just so I have access to it later. There are some questions that this week wants answered:  Relational database tables and spreadsheets look similar with both having rows and columns.  What are some important differences between the two? Data that is inserted into relational database tables must adhere to the table's constraints. For spreadsheets, any data that is inserted is not validated (some spreadsheets can enable this). ...
Read more