This week we eased into the material by reviewing fundamental data structures like (queues, stacks, linked lists). We also reviewed trees, graphs, and weighted/unweighted maps which I think will be a foundation for what's to come in this class. We had puzzles to solve as exercises which I feel is a good way of sharpening the skills that help us break down problems algorithmically. HW0 and HW1 were relatively straight forward and remind me of programming problems that I used to use as practice when preparing for interviews. I think that in the future a lot of these types of problems will be solved by AI but I think it's incredibly valuable for us, especially as computer scientists to have a strong foundation in solving these problems by hand.
Subscribe to:
Post Comments (Atom)
CST438: Week 7 (Week 82)
One of the differences between Agile and Waterfall software development cycles is that the Agile is more flexible while Waterfall tends to b...
-
This week we covered merge sort and though we didn't have a programming assignment I took some time to explore it. I watched some video...
-
This week I learned that React is really powerful for building interactive web UIs. It ties state directly to what shows up on screen. Until...
-
This week we covered AVL trees, 2-3 trees, heap trees, and hashing. Hashing is a slight departure from the structures we've covered more...
No comments:
Post a Comment