CST 489 - Week 8

Comments

Post a Comment

Popular posts from this blog

CST 489 - Week 4

 Hey everyone, Since I have chosen to take part in the Certificate Track of the capstone project, I have faced some challenges during this week's assignments. This week, I spent time developing my certificate track capstone proposal, which helped me clarify my learning goals and better understand how each certification connects to my long-term career plans. Writing the proposal forced me to think beyond just completing courses and instead focus on the skills, artifacts, and outcomes I want to gain from each certificate. I also spent a significant amount of time trying to figure out how to enroll in the AWS Cloud Practitioner course. Navigating AWS’s training site was more complicated than I expected, and it took some trial and error to understand the different learning paths and options available. Although it was a bit frustrating, the experience helped me become more comfortable with AWS’s ecosystem and reminded me that problem-solving and persistence are essential parts of learni...
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

CST 370 - Week 5

 Hey everyone! This week, I explored several important algorithm design techniques and deepened my understanding of how they are applied in solving complex problems efficiently. One of the key highlights was learning about Quick Sort , a widely used sorting algorithm that relies on the Divide-and-Conquer strategy. I now understand how Quick Sort works by dividing the array into smaller parts around a pivot, sorting those parts recursively, and then combining the results. I also learned about its efficiency and how its performance depends on the choice of the pivot. I also studied Binary Tree traversal methods, such as inorder, preorder, and postorder, and how each serves a specific purpose when working with hierarchical data. Alongside traversal, I learned how to calculate the height of a binary tree , which is a foundational concept for evaluating the balance and efficiency of tree-based data structures. I even added my insights on the class Discord group, explaining an easy calc...
Read more