CST370 - Learning Journal Week 1: Introduction to Algorithms and Data Structures Review

 Week 1 Learning Recap

        The first week of CST370 - Design and Analysis of Algorithms wrought a rousing return to one of my most revered regions of Computer Science: creative problem solving! While I spent the time before this class lightly reviewing typical Algorithm/DSA coding problems, I can appreciate that the curriculum requires first discussing how to approach problems and consider structured solutions before diving straight into the syntax and implementation details. The reading material and lectures from Week 0/1 invite students to think about how we think about problems.

        Revisiting the concept of an algorithm was a sturdy if not somewhat expected kickoff to the materials for CST370, this class and textbook provided an initial and familiar concept to get started: Euclid's algorithm for computing the greatest common divisor. Having worried about GCD since elementary school math, peering into this numerical quandary from an algorithmic vantage point illustrated the logical and practical necessities of repeatable and efficient problem solving. I deeply enjoyed the puzzle challenges and hope they continue on in future lectures, using the concepts learned in a very tangible almost riddle-like context helps cap off and solidify the ideas explored. Cracking a clever riddle and then explaining it to unwilling family members will be a future highlight of this class (I hope)! 

        Reviewing sorting, searching, graph problems (weighted/unweighted alike), linked lists, stacks, queues, and trees helped further illustrate the tools for problem solving that we will use in this class and beyond. These concepts work in tandem with the introduction to algorithm analysis framework/time complexity. Discussing an algorithm in the context of effectiveness but additionally its performance feels like true classic Computer Science. Considering the nature of the material and the assignments, this is one of the most exciting classes so far! 

Week 1 Class Engagement

        For class engagements, this week I met with our TA Khanh and discussed a couple aspects of Codespaces, C++, how cases are tested for this class, and alternatives to the algorithmic logic behind solving the introductory assignment after I had already submitted. Khanh is clearly a dedicated and highly capable TA even with just one office hour session attended. 

Comments

Post a Comment

Popular posts from this blog

Week 1 - CST363 First Post: Relational Database Reflections

From the orientation, your reading from week 1, and your own experience answer the following questions: Relational database tables and spreadsheets look similar with both having rows and columns.  What are some important differences between the two? At first glance, a relational database and a spreadsheet in an application such as Excel look fairly commensurate to each other in purpose and functionality--they both are comprised of rows and columns that hold data organized by column names and row numbers. The truth is that their visual similarity is where the commensuration ends and the vast differences begin. Relational databases adhere to strict and organized rules that ensure they can manage large volumes of structured data as well as complex queries to return results from that data whereas spreadsheets can be filled out arbitrarily. Foreign keys and primary keys can tie individual values or sets of values to other tables of data which in turn impact how data can be returned or c...
Read more

Week (6/)7/8 Markov End-of-Semester Reflection

           While the Markov assignment seemed daunting upon first viewing the assignment requirements, this revisiting of the task reveals a much simpler project than the caliber of code work that now occupies my mind. Firstly, having dove into the various design patterns that CST338 covers I now am curious to identify design patterns in code prompts. In this case the various methods of the code serve to "build" chains of text collectively into what could be argued to be a Builder pattern. The Builder pattern is categorized as a creational design pattern and thusly suggests how the code will best be formulated. Functionally, this mostly serves to inform the bigger picture as during the process I was heavily focused on following the prompt in more of a "flying blind" styled approach.            In terms of how I would approach this project differently now, I can never stress enough that homing in on each of the respective r...
Read more

Week 4 Project 1 Post-Review

  Journal Prompt Reflections With whom did you work? Ethan G, Keshab N What was your strategy for solving the assignments? I first got all the fields/variables/methods in place until I matched the UML diagram, looked over the entire assignment prompt, and then flew blindly along to each method description. I wrote TODOs for what I couldn’t solve right away and sort of manically switched between each method until the test file could run. From there homed in on each failing test one by one. The first tests I singled out called methods that relied on other methods the least.  Did you start writing code right away? Did you plan it out on paper? I did initially attempt to create a checklist document but it became so overwhelming that I chose to just start working on it and the tasks that still needed to be done were readily apparent anytime I checked the tests or output. TODO’s and getting the UML matching were essentially the planning aspect.   What was THEIR strategy for sol...
Read more