Week 54 (2/11/2026 - 2/17/2026)
(Click on READ MORE for better formatting)
Hi everyone, welcome to my 54th blog! This is the Week 6 post for CST 370 Design and Analysis of Algorithms.- Weekly learning journal relevant to this week's module. (50 words)
- This week expanded upon tree-based data structures discussed earlier in class, such as AVL trees, 2-3 trees, and max heaps. In addition, hashing (separate chaining, linear probing) was also discussed. In the case of AVL trees and hashing, I spent time studying those in my community college data structures course, so I decided to put most of my focus for this week on studying 2-3 trees and heaps. I suppose these were the more challenging ones to wrap my head around as these were first-time concepts rather than review.
- There was also a homework assignment this week that tasked me to write two programs:
- 1. Write a program to conduct heap operations.
- To enable this functionality, the program is able to execute on the following commands:
- displayMax - displays the current max heap value
- insert - inserts a new value and conducts "heapify" to adjust the heap
- deleteMax - deletes the current max heap value, the largest child node will become the new max heap.
- display - displays the list of values as represented in a max heap data structure
- 2. Write a program to simulate the operations of linear probing covered in the lecture.
- To enable this functionality, the program is able to execute on the following commands:
- insert - insert a key in the hash table
- displayStatus - displays the status of an entry in the table
- tableSize - displays the hash table size
- search - searches for a key in the hash table
- Finally, I also contributed my perspective (as a newly hired entry-level software engineer) on this article posted by the TA, Khanh Nguyen, in our course's official Discord server: https://www.oreilly.com/radar/the-end-of-programming-as-we-know-it/
That is all for this week, see you in my Week 55 post!
Comments
Post a Comment