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.
Over the past few days I completed the final sections of the Google Cloud Digital Leader certification. These modules reinforced my understanding of how cloud systems scale, maintain availability, and how services like compute and storage work together in real-world environments. At the same time I worked on drafting my capstone presentation. I organized it around the three certifications and focused on clearly explaining what I learned and how the concepts connect. Overall, this stage was about bringing everything together and making sure I could clearly communicate what I’ve learned.
Comments
Post a Comment