Tuesday, January 13, 2026

CST370: Week 1 (Week 52)

 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.

at

No comments:

Post a Comment

Subscribe to: Post Comments (Atom)

CST370: Week 7 (Week 58)

 This week we covered non-comparison sorting, dynamic programming, Warshall's algorithm, Floyd's algorithm, Greedy Technique, and Pr...

  • CST334: Week 5 (Week 29)
    This week we learned about threads, concurrency, and locks. We learned that a process has at least one thread and can have multiple threads....
  • CST363: Week 3 (Week 19)
     1. What is an SQL view. How is it similar to a table? In what ways is it different (think about primary keys, insert, update, delete operat...
  • CST334: Week 2 (Week 26)
    This week we covered scheduling, processes and C process APIs (fork, yield, etc). We learned about the relationship between parent and child...