// the find
NadiaNaureen/Warehouse-Inventory
A first data-structures assignment in C: a menu-driven console program that tracks televisions and fridges in a warehouse, using queues so stock is handled first in, first out. It suits someone learning queues and C, not anyone running a real inventory.
The README maps each requirement to a named function (enqueue1 and enqueue2, display1, add, dequeue_buy), so the code is easy to check against the spec. Using a queue is a defensible choice when older units should go out first, and the README states that reason instead of leaving it implicit. The scope is small and clearly bounded: two product types, four tasks, and a menu that loops until the user exits.
Each product type gets its own queue and function pair (enqueue1 and enqueue2, enqueue_date1 and enqueue_date2), so adding a third product means copying the whole set rather than parameterising it. On a plain FIFO queue, dequeue_buy suggests a purchase always removes the oldest unit, and the README does not say whether a buyer can pick a specific one. Nothing in the README mentions persistence, so inventory is probably lost when the program exits. The visible tree has no tests and no build file, and the last push was May 2024.