A symbol table uses a hash function h(k) = k mod 7. Where does key k = 25 hash to? 

A hash table with 8 slots uses h(k) = k mod 8. Keys 8, 16, 24 are inserted. All map to slot 0. With linear probing, where does key 24 end up?

In open addressing, which probing method avoids primary clustering?

The primary purpose of a symbol table in a compiler is to:

What information is typically NOT stored in a symbol table entry?

Which symbol table structure is best suited for block-structured languages with nested scopes?

Which data structure provides O(1) average-case lookup for a symbol table?

In a hash table-based symbol table, which technique handles collisions by storing multiple entries in the same bucket?

Static storage allocation is NOT suitable for: