SI12_5_24

1. Explain the primary differences between a singly linked list and a doubly linked list in terms of structure, traversal, and memory usage. Provide an example of a situation where using a singly linked list is more efficient than a doubly linked list, and vice versa.

1. Describe the how Chaining Works in Hash Tables:

1. Describe how Linear Probing Works 

1. Describe how Quadratic Probing Works 

1. Insert the following keys to a table of size 10 with mod 10 as the hash function, using chaining, linear and quadratic probing: 5, 15, 25

1. Explain how the Last-In-First-Out (LIFO) property of a stack differs from the First-In-First-Out (FIFO) property of a queue, and describe a real-world example where each would be an appropriate model.