Week 1 - CST 370

 This week we learned how to define graphs, how to calculate the greatest common divisor (GCD) using Euclid's algorithm, and algorithm analysis. Graphs are part of the data structure in computer science, defined by a set of vertices and a set of edges. Algorithm analysis helps determine the efficiency of an algorithm. This will indicate how fast an algorithm rune and the amount of memory is required by the algorithm. 

One question I asked in discord was about resubmission for hw assignments that were graded before the due date. I asked if we had to notify the TA or professor when we resubmitted the assignment. 

Comments

Popular posts from this blog

Week 1 - CST 438

Week 4