CST 370 Week 6

This week in class, I learned about heaps, AVL trees, and 2-3 trees. For each of these trees, I focused on better understanding the algorithms needed to insert values, delete values, and search for values. I found that even when I studied materials provided in class this week, these concepts were more difficult to understand than the concepts from previous weeks. What helped me the most in retaining any of the material covered this week was the programming assignment.  Actually applying what I learned from pseudocode in the text book to creating functions helped better my understanding of how these algorithms work. Since our programming assignment focused on heaps, I have a better understanding of heaps work compared to the other trees discussed. When I have the chance, I will try to implement my own AVL tree and 2-3 tree data structures to help myself in the future.

Comments

Post a Comment

Popular posts from this blog

CST 363 Week 8

Briefly summarize what you consider to be the three (3) most important things you learned in this course.     I believe that learning SQL was one of the most important things I learned in this class. Knowing SQL provides someone the ability to work directly with a  relational database in the MySQL work bench or to work with applications that access a relational database. In this class, I gained experience in both, through labs and homework assignments.     I also think that learning about MongoDB was also very important. The last lab showed the importance of MongoDB in instances where a flexible database schema is needed. The knowledge of both MongoDB and SQL are helpful tools in becoming a successful positions that require backend development or data analysis     Lastly I believe that learning about the design process of a database will be helpful moving forward. I can take what I have learned about design processes and improve my final project from m...
Read more

CST 334 Week 8

  3 important topics I have learned about in this class are virtualization, concurrency, and persistence. Virtualization allows multiple processes or dynamic instances of a running program to run in parallel, even on single processor systems. To accomplish this, the OS virtualizes physical memory, which provides the process its own address space, and controls its use of the CPU through context switching. In this class, I learned about several memory allocation techniques such as paging and segmentation as well as different scheduling algorithms such as using multilevel feedback queues scheduling. Concurrency is essential in the execution of multiple threads, the most basic unit of execution of a process. Issues can occur when multiple threads attempt to enter access and manipulate shared data. Race conditions and inconsistent program results can occur if the order in which threads enter a critical section is not regulated. To ensure atomicity, synchronization primitives such as loc...
Read more

CST 334 Week 6

During this week of class, I spent most of my time learning about semaphores. A semaphore is a synchronization primitive that can be used either as a lock or a condition variable. It consists of an int value and this value plays a significant role in how it can be used for synchronization. There are several semaphore management routines, but the routines discussed in this week’s reading assignment are sem_wait and sem_post. Sem_wait, decrements the value of the semaphore and waits to see if the value is negative and sem_post increments the value and wakes a waiting thread if there is a negative semaphore. An example discussed creates a lock using a semaphore initialized to 1. When sem_wait is first called, the thread that calls it does not have to wait since the semphore’s value is not negative (sem val = 0). If or when another thread calls sem_wait, it must wait (since sem val is now negative) until the first thread calls the function sem_post. Once the original thread calls sem_post,...
Read more