01Why do we need to explicitly manage memory for linked lists in C?
02What is the time complexity of inserting an element at the beginning of a singly linked list?
03What is the advantage of a circular buffer over a standard array-based queue?
04In a hash table implementation, what is collision resolution?
05What is the purpose of the struct keyword in C?
06Why might you use a union instead of a struct in C?
07What is a memory pool allocator, and when would you use one?