Linear data structures like arrays, linked lists, and queues can be tricky to manage. Here are some of the main problems they have:

1. Wasted Memory: Arrays need a block of memory all in one piece. This can cause some of the memory to be empty. For big arrays with small amounts of data, around 20% of the memory might get wasted.

2. Searching Issues: Linked lists can take a long time to search through. They have a time cost of $O(n)$, which means the time it takes grows with the size of the list. This makes them slow when you're looking for specific information.

3. Inflexible Size: Arrays have a set size, and they can't easily change. If you add more data than they can hold, it can cause problems (this is called overflow). On the other hand, if you’re not using all the space, you end up wasting it (this is called underutilization).

4. Hard to Update: Adding or removing items can be easy with linked lists, taking just $O(1)$ time. But with arrays, it can take a lot longer, around $O(n)$, since the elements need to be shifted around.

In simple terms, while these data structures have their uses, they can also cause headaches when you're trying to make changes or find the data you need.