CST 334 - Week 8

 Hey everyone,
This is the last week of this class. Time went by so fast and I learned so much! 

    This week in CST 334, I explored the concept of persistence, both as it applies to operating systems and as a crucial trait for success in this course. In the context of operating systems, persistence refers to the ability to maintain system state and data beyond the lifespan of the processes that created them. This is achieved through storage mechanisms such as file systems, databases, and other non-volatile storage solutions. Understanding how operating systems manage data storage, retrieve persistent states, and ensure data integrity has been eye-opening. Concepts such as journaling file systems and crash recovery mechanisms illustrate the importance of designing systems that can withstand unexpected interruptions and preserve critical information.

    On a personal level, persistence in this course has meant pushing through challenges such as complex topics, technical hurdles, and time management issues. Just as operating systems use persistence to maintain functionality and recover from setbacks, I have learned to apply resilience and determination to stay on track with my studies. Completing this week’s material reinforced the importance of persistence not only in technology but also as a life skill for achieving academic and professional goals.

    Hope to see you guys soon after the winter break. Happy Holidays!

Comments

Post a Comment

Popular posts from this blog

CST 334 - Week 6

 Hey everyone!      This week we submitted our research collab project. It was quite interesting and fun. I learned a lot and our team bonded more as well. We also learned many new things through our lectures and labs.       Concurrency is a critical concept in computer systems, enabling multiple processes to execute simultaneously. However, with great power comes great complexity.       A semaphore is a synchronization primitive that helps manage access to shared resources in a concurrent environment. Semaphores can be thought of as counters that control the number of processes allowed to access a resource. They come in two main types :             - Counting Semaphores : These can have values greater than one and are often used to manage a   pool of resources, such as threads or connections.           - Binary Semaphores : These function like locks and c...
Read more

CST 334 - Week 4

Hey everyone!       This week, I learned about how operating systems manage memory, which is one of their most important jobs. One topic was free space management , where the system keeps track of memory or storage that isn’t being used. Two common methods are bitmaps (using bits to mark if memory is free or taken) and linked lists (connecting free memory blocks together). Each method has its pros and cons, like how much space they use or how fast they work.      I also studied paging , which splits memory into small chunks called pages. These pages are mapped to physical memory, keeping processes separate and organized. However, this mapping can slow things down because the computer has to translate addresses often. To make it faster, Translation Lookaside Buffers (TLBs) store recent translations in a small, quick cache. I also learned about advanced page tables , which are smarter ways of organizing these mappings to save memory.    ...
Read more

CST 370 - Week 1

 Hey everyone, This week, we learned several important topics that form the foundation of computer science and programming. We started with GitHub and practiced using manual commands like git init, git add, git commit, and git push to manage our code. This helped us understand version control and how to keep track of changes when working on projects, especially when collaborating with others. We were also introduced to algorithms and learned what they are—step-by-step methods for solving problems. One example we focused on was Euclid’s Algorithm for finding the greatest common divisor (GCD) of two numbers. It uses a simple but powerful idea: repeatedly replace the numbers with GCD(b, a % b) until the second number becomes zero. We also practiced writing pseudocode, which helped us plan out algorithms in plain language before coding. We also had a homework assignment to help us further understand GitHub commands. Later in the week, we learned about graphs, both weighted and unweight...
Read more