Design & Analysis of Algorithms: Week 1


I am excited and nervous to take this class. The information sounds appealing, but I am nervous because it seems difficult, and I am hoping to get a good grade in this class. I have learned several concepts this first week. I went over the GCD, pseudocode, and learned about Eculid’s algorithm. I read and viewed videos on important problem types, fundamental data structures, and algorithm analysis framework.
What I found interesting was the different graph representations. There are unweighted graphs and weighted graphs. In this section, I learned about adjacency matrix and adjacency list. The difference between weighted and unweighted graphs is that weighted graphs have numbers or costs. I also learned the tree introduction and learned about the difference between a binary tree and a binary search tree.
Throughout this week, we also practice solving puzzles that the professor provided to us, and I enjoyed that challenge!

Comments

Popular posts from this blog

My first week

Second Week

Fourth Week