CST370 Week 2

This week, I deepened my understanding of algorithm analysis by studying asymptotic notations, including Big-O, Big-Ω, and Big-Θ, and applying them to both recursive and nonrecursive algorithms. I practiced solving recurrence relations using backward substitution and worked through example problems and puzzles like the 4-gallon water challenge. I also learned about brute force as a problem-solving paradigm and how it applies to algorithm design. Overall, this week strengthened my ability to evaluate algorithm efficiency more systematically.

Comments

Post a Comment

Popular posts from this blog

CST363 Week 4 May 21st - May 27th

Five things i've learned so far in the course so far... 1. Relational Schema Design and Normalization How to structure data into tables, define their primary and foreign keys, and apply normalization rules to eliminate redundancy and ensure data integrity. 2. Basic CRUD operations with SQL Writing SELECT , INSERT , UPDATE , and DELETE statements to retrieve and manipulate data, including filtering with WHERE , sorting with ORDER BY , and limiting results with LIMIT 3. Joins and Set Operations Combining data across multiple tables using INNER JOIN , LEFT/RIGHT JOIN , as well as operations like UNION and EXCEPT to merge or compare result sets. 4. Aggregate Functions and Grouping Using COUNT() , SUM() , AVG() , MIN() , MAX() along with GROUP BY and HAVING clauses to summarize statistics and filter groups. 5. Database Design Designing databases by creating ER diagrams using primary and foreign key relationships between entities. Three questions I have regarding databases... 1. Scali...
Read more

CST363 Week 3 May 14th - May 20th

A view is essentially a saved query that you can treat like a table. Under the hood, the database doesn’t necessarily store the view’s data separately; it re-runs the defining SELECT every time you reference it  The similarities to a table are the Rows and Column, you SELECT from a view similar as to how you would do it from a table. Join and filters also looks the same. The key differences between the two... Aspect Tables View Storage Physically stores data on disk. Usually virtual (query results are generated on the fly). Some DBs support materialized views. Primary Key Defined directly on the table; enforced. No inherent PK—though some systems allow unique indexes on views, most treat them as keyless. Updatability Always updatable (barring triggers/locks). Only if certain rules are met: Comparing SQL with Java there are notable differences a...
Read more

CST 370 Week 4

 This week I focused on learning merge sort and its divide-and-conquer approach. I practiced breaking down arrays into subproblems, merging sorted halves, and analyzing its time efficiency. We also had a review session for the midterm, which helped clarify key topics from previous weeks such as asymptotic notation, brute force, and search algorithms. Preparing for the midterm encouraged me to revisit exercises and puzzles, reinforcing my understanding and giving me more confidence in applying these techniques.
Read more