CST 334 - Week 3

 Hello everyone!
I am back with an update on my online journey of learning. It was quite a week, I must say. 
    In the third week of CST 334, I learned about memory virtualization, which is key to how operating systems manage and allocate memory. The first concept covered was Address Space, both in the video and slides, where we saw how the operating system uses address spaces to provide an abstraction between the physical memory and what the programs see, helping to avoid conflicts and manage resources better. Next, we explored the Memory API in C through a lecture and slides, which showed how programs request memory from the operating system using system calls, giving them the ability to allocate, access, and manage memory dynamically. We then delved into Address Translation, a process where the operating system translates virtual memory addresses into physical ones, ensuring that programs access the correct memory locations without interfering with others. Finally, in the Segmentation lecture and slides, we learned about dividing memory into segments, such as code, data, and stack, to improve organization and protection. These concepts helped me understand how memory is efficiently managed, ensuring each program runs safely and independently.
    We also did a lab in which we practiced how to use makefiles, forking, and piping. It was a challenge at first, but once I started to understand the concepts, I had a lot of fun and I am excited to learn more throughout this journey. I will be back with an update next week. See you next time!

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