The CSUMB Online Program is great!

Comments

Post a Comment

Popular posts from this blog

CST-370 Week 6

 This week, I learned about linear probing in hash tables. It's a way to handle collisions within a hash table. When a key is placed into a table and its index is already occupied, it checks one by one until there is an empty space left. A visual example: Index: 0, 1, 2, 3, 4, 5 Value: _, _, _, _, _, _ Insert key 50 50 % 6 = 2 Index: 0, 1, 2, 3, 4, 5 Value: _, _, 50, _, _, _ Insert key 20 20 % 6 = 2 (collision in index 2) (2 + 1) % 6 = 3 (index 3 is open) Index: 0, 1,  2,   3, 4, 5 Value: _, _, 50, 20, _, _ I've watched previous lectures to study what I've answered incorrectly in past quiz assignments.
Read more

CST-370 Week 4

 Learning about merge sort was interesting. I used the PowerPoint exercise as well as watched the video lecture about merge sort. I used the video to help study for the midterm and other quizzes. Merge sort is simple to understand; the algorithm divides the array into two segments, which then recursively solves the first and second halves of the array before merging the two now sorted halves together.
Read more

CST-370 Week 2

 This week I've learned that brute force is a legitimate strategy that is used to solve issues. It uses pure trial and error without a systematic design in order to solve and or find what the purpose of the program is for. It is also possible to use algorithms in a brute force way, such as using selection sort. I've gone over past video recordings in order to supplement the questions on the previous quiz that I have answered incorrectly.
Read more