CST 370 - Week 3

 This week was a continuation of brute-force string matching. I think this topic is new to me, but it was easy to understand, at least the part that was mentioned. The same goes for exhaustive search. We also covered depth-first search and breadth-first search; I already had some idea about these. For divide and conquer, I was already familiar with it from sorting algorithms in videos I had watched before. Overall, this week included some topics I already knew, so I didn’t feel frustrated.

Comments

Post a Comment

Popular posts from this blog

CST 334 - Week 5

  This week was about concurrency and threads, as well as locks—a topic related to threads. I was already familiar with threads, so this topic wasn’t too hard to understand, but I still have trouble focusing on and understanding the book. Continuing with the topic, threads are compared to processes in the book, but they are not the same. One key difference mentioned is that threads share memory, which allows a program to perform multiple actions at the same time, without waiting for one action to finish before starting another. The book explains that this makes programs more efficient. However, it also introduces potential problems—such as when multiple threads try to update the same resource at the same time. This can cause the program to behave unpredictably or produce incorrect results. To help avoid this kind of issue, lock implementations are used. A lock ensures that only one thread runs at a time when accessing a shared resource. The thread holds the lock while it’s running,...
Read more

CST 334 - Week 6

This week focused on two main topics. Compared to previous weeks, the workload was lighter, which made it easier to focus and understand the material without feeling overwhelmed or frustrated. One of the key topics was  semaphores , which are synchronization tools used to manage access to shared resources in multi-threaded environments. They help prevent  race conditions , which occur when multiple threads try to modify data at the same time. As I understand it, semaphores are similar to locks, but they include a counter that keeps track of how many threads can access a resource. When the counter reaches zero, other threads must wait until a resource becomes available again. The module also introduced two well-known problems that can be solved using semaphores. The first is the  producer/consumer problem , where the producer must wait if the buffer is full, and the consumer must wait if the buffer is empty. This ensures that the producer does not overwrite data and the co...
Read more

CST 370 - Week 6

 This week was about AVL trees, 2-3 trees, hashing, heaps, and heapsort. Something new I learned was the 2-3 tree. I had already seen it in college, but I didn’t understand it back then. This week, I was finally able to understand how it works, and it seems much simpler than I thought before.
Read more