This week in CST334 I learned about memory virtualization. It gives each process its own virtual memory space, making it feel like it has more memory than physically available. It improves security by isolating each process and uses tools like paging and the Memory Management Unit to translate virtual addresses to physical ones. In this weels lab we explored how processes work independently but communicate through mechanisms like pipes, showing how the operating system manages memory and resources to keep processes separate yet functional together. It was a great way to see these concepts in action.
This week I focused a lot on understanding time complexity and recursive analysis. It was challenging at first to figure out how to break down recursive functions and write the correct recurrence relations. Applying the Master Theorem was especially tough because I had to carefully identify each part of the formula and decide which case applied. I also spent time reviewing the difference between Big O, Big Omega, and Big Theta, which helped me better understand how to describe the efficiency of an algorithm. These concepts took time to click but working through examples really helped.
Comments
Post a Comment