cst-370- week 6 - learning journal

This week’s module helped me strengthen my understanding of heap structures and hash tables through hands-on Java implementation. In the first lab, I implemented a max heap that supported insertion, deletion of the maximum element, checking whether an array satisfied heap properties, and rebuilding the heap when necessary. Writing the sift-up and sift-down operations from scratch helped me better understand how heap order is maintained after structural changes. In the second lab, I implemented linear probing with rehashing when the load factor exceeded 0.5. Reinserting all keys into a newly sized prime table made me clearly understand how resizing preserves performance. These labs reinforced how theoretical data structure concepts translate into practical code.

Comments

Popular posts from this blog

Week 2 Learning Journal 5 Parts

Week 4 Journal

BOOK REPORT EXTRA CREDIT