CST462S_40-41_2262-Meta: RaceGender&ClassDigitalWorld

Service Learning Journal Reflection

Overall, my service learning experience went well and felt very relevant to my major. I was able to apply my computer science skills to a real organization by building automation scripts that reduced manual administrative work. One of the most successful parts of the project was developing solutions that improved efficiency in data handling and reporting. Seeing how automation could directly save time and reduce errors made the work feel meaningful and impactful.

If I were to improve anything, it would be communication and collaboration throughout the project. Since I completed the work mostly independently, there were fewer opportunities for regular feedback. More consistent check-ins could have helped align development more closely with the organization’s evolving needs and possibly expand the scope of the project further.

The most impactful part of this experience was realizing how technical skills can be used to support real-world organizations, especially those focused on helping communities. It showed me that software engineering is not just about writing code, but about solving problems that make a difference. A challenge I faced was balancing school responsibilities with the project, which sometimes made scheduling and time management difficult.

For future service learning students, my advice is to stay proactive and communicate regularly with your organization, even if schedules are busy. Try to fully understand the problem before jumping into development, because that will save time later. Also, treat the experience like a real-world project, since it is a great opportunity to build both technical and professional skills. 

Comments

Post a Comment

Popular posts from this blog

CST 334 - Week 3

Week 3 Summary: This week in CST 334 was a rollercoaster. We started working on PA3, which is all about building a memory allocator. Basically our own version of malloc() and free(). At first, I thought, “okay cool, pointers and structs again,” but this assignment humbled me quick. Managing memory manually, keeping track of chunks, splitting them, and then coalescing them back together sounds simple on paper but actually implementing it without causing segmentation faults or crashing everything was tough. One thing that stood out was just how fragile everything becomes when you're directly manipulating memory. A wrong pointer or forgetting to update a linked list will break the whole thing. A lot of my time was spent debugging and going through each line of my code just to figure out where things were going sideways. The split_node function specifically gave me a hard time. It took me a while to realize how important it is to keep the fwd and bwd pointers clean or everything falls ...
Read more

CST 334 - Week 2

Week 2 Summary:  This week in CST 334, we dug into how operating systems handle processes, and honestly, things are starting to make more sense now. I’ve heard the term “context switching” before, but I never really got what it meant until we broke it down. Learning the difference between voluntary and involuntary switches like when a process is just waiting for input vs. when the OS forces it to stop, helped a lot. It’s kind of wild to think about how much the OS is doing behind the scenes just to keep everything running without us even noticing.  We also got into how processes are created in C with fork(), exec(), and wait(). The fork() function really threw me off at first. I was like is the same program just running twice? But it made sense after printing out a bunch of values and looking at the return codes. It’s pretty cool how the parent and child processes end up doing different things, even though they start from the same place. Later in the week, we went over schedul...
Read more

CST 370-30 - Algorithm Design & Analysis Week 1

 CST 370-30 - Algorithm Design & Analysis Week 1 This week in CST 370, we went over the basics of algorithm design and analysis and what to expect from the course. A big focus was on understanding how to think about problems in terms of best case and worst case scenarios, not just getting an answer. We worked on logic puzzles like the fake coin and ball matching problems, which helped me see how algorithms can be about strategy and guarantees rather than code. These problems showed how careful reasoning can minimize steps while still covering all cases, which I think will be important later in the class.
Read more