CST 370 Week 1
WELCOME TO WEEK 1 Learning Journal - CST 370 Oh, we’re back! A year into the program and a year left to go. I’m very excited for the coming year and all the classes left to take. The class I’m starting with this year is CST 370 - Design and Analysis of Algorithms . So far this week, we’ve reviewed and learned material like data structures. We got an introduction to algorithms and why they’re important. We covered Euclid’s algorithm for finding the greatest common divisor (GCD) of two numbers. Then, we talked about important problem types that drive algorithms, such as sorting, searching, and string processing. These problem types define what must be accomplished by an algorithm. To further explore algorithms, we reviewed some familiar data structures like linked lists (both singly and doubly linked), stacks , queues , and graphs . This week, we focused a lot on graphs and trees , which will be very important throughout the course. We started with the basics of graphs, in...