CST 489 Week 10

 

WELCOME TO WEEK 10

Learning Journal - 



What project milestones did you accomplish this week?

This week I continued working on the front end and added the remaining components needed for the Home page. The Home page had the most information, so it took the longest. I only need one modal to finish up the Calendar, Home, and Login pages. 

What is your plan for next week?

My plan for next week is to figure out what features will be accessible inside the modal after we meet with our mentor. They suggested changes, but we are not completely sure which direction to take yet. After resolving this, we will move into integrating the back end with the front end. Once I finish the remaining front-end work, I plan to help with the integration.

What challenges, if any, are you currently facing in project development? Do you need instructor assistance?

Some challenges this week included making the layout look good on mobile screens and adjusting component dimensions so the UI didn’t break on smaller devices. At the moment we do not need instructor assistance, but if issues come up during modal design or backend integration, we may reach out.

Comments

Post a Comment

Popular posts from this blog

CST 370 Week 3

Image
  WELCOME TO WEEK 3 Learning Journal - CST 370  This week, we learned a lot. We started with Brute-Force String Matching , an algorithm that aligns the pattern against the first characters of the text and begins to match pairs of characters from left to right. It continues this process until there is either a match or, in the worst case, the pattern is not found in the text at all. The best case occurs when the first characters in the text immediately match the pattern. Next, we learned about Exhaustive Search and its application to three important problems. Exhaustive Search is simply a brute-force approach to combinatorial problems such as permutations, combinations, and subsets of a given set. The first problem we covered was the Traveling Salesman Problem , which involves finding the shortest path through a set of cities (visiting each city exactly once) and returning to the starting city. It is also described as the problem of finding the shortest Hamiltonian cycle. The...
Read more

CST 438 Week 7

Image
  WELCOME TO WEEK 7 Learning Journal - CST 438 Describe some of the differences between using an Agile process and using a  Plan and Document (or Waterfall) process.        This week I reviewed the differences between using an Agile process and a Plan and Document (Waterfall) process. In a Plan and Document approach, requirements are written as a detailed SRS during a dedicated requirements phase, with the expectation that they remain complete and stable for the rest of the project. Changes are handled through a formal change control process, which involves evaluating the impact on cost and schedule before updating documents, code, and tests. Design is completed after requirements and is intended to be stable, while cost estimates are based on person-weeks from past experience. Scheduling uses tools like PERT charts with periodic status meetings, and testing is split between developers writing unit tests and QA handling system and acceptance tests. Howeve...
Read more

CST 370 Week 2

Image
  WELCOME TO WEEK 2 Learning Journal - CST 370  This week, I learned about the Analysis of Algorithms . First, we reviewed the topic of time efficiency notations , focusing on three key types: Big O Notation , Big-Theta Notation , and Big-Omega Notation . Big O Notation represents the upper bound, meaning it describes all functions with the same or lower order of growth as f(n). Big-Theta Notation represents the exact bound, meaning it includes all functions with the same order of growth as f(n). Big-Omega Notation represents the lower bound, meaning it captures all functions with the same or higher order of growth as f(n).      We also revisited the orders of growth , which, to be honest, I had forgotten about. Luckily, we reviewed them this week to help us better analyze algorithms and identify their time complexity or order of growth. The eight most common categories we covered were: 1, log n, n, n log n, n², n³, 2ⁿ, and n!. To figure out the order of gro...
Read more