Computer Science - Data Structures - Hash tables - Hash Table Tracing

8 questions. Q1: Hash function: h(key) = key % 7. Where does key=15 go? → 15%7 = 1 (index 1). Q2: Insert keys [5, 12, 19] with h(k)=k%7. Which keys collide? → 5→5, 12→5, 19→5 (all map to index 5!). Q3: With chaining, what's at index 5 after inserting [5,12,19]? → A linked list: 5→12→19. Q4: With lin