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, including graph representations, weighted graphs, paths, and cycles, as well as understanding what exactly makes up a graph. We also covered trees, which are basically connected, acyclic graphs, and we looked into rooted trees.
We learned the differences between binary trees and binary search trees. Binary search trees are a type of binary tree with additional restrictions: each vertex has a value, and the values are ordered. The vertices on the left side of the parent must be less than the parent, and the vertices on the right side must be greater than the parent. Binary search trees are often represented as nodes with pointers to their left and right children.It’s been a lot of review, but all of it will be really useful for the coming week when we dive further into Chapter 2. I’m excited to learn more!
Comments
Post a Comment