| File | Description |
|---|---|
prac.c |
Main Testing File |
prac.h |
Main Testing Header File |
| Assignment | Files | Description |
|---|---|---|
| #1 | #1.c |
Basic array operations and fundamentals |
| #2 | #2.c, arrayList.h, linkList.h |
Array vs Linked List implementations |
| #3 | (Empty - Upcoming) | TBD |
| #4 | #4.c |
Advanced data structure operations |
| #5 | #5.c + 6 header files |
Complete ADT Library |
- arrQueue.h, arrStack.h - Array-based Stack/Queue |
||
- CursorBasedQueue.h, CursorBasedStack.h - Cursor implementations |
||
- LLQueue.h, LLStack.h - Linked List implementations |
||
- studtype.h - Student data type definitions |
||
| #6 | Multiple applications | Real-World Applications |
- knowledgeBase.c/.txt - Knowledge management system |
||
- pharmacyQueueing.c/.txt - Pharmacy queue simulation |
||
- warehouseInventory.c/.txt - Inventory management |
||
- arrayQueue.h, arrayStack.h - Supporting ADTs |
||
| #7 | (Empty - Upcoming) | TBD |
| Data Structure | Files | Description |
|---|---|---|
| Array | 4 progressive versions | Foundation Array Implementations |
- ArrayV1.c/.h - Basic array operations |
||
- ArrayV2.c/.h - Enhanced array with dynamic sizing |
||
- ArrayV3.c/.h - Advanced array with utilities |
||
- ArrayV4.c/.h - Complete array implementation |
||
| LinkedList | LinkListV1.c/.h |
Core Linked List Implementation |
| - Insertion, deletion, traversal operations | ||
| - Memory management and pointer manipulation | ||
| CursorBased | CursorBased.c/.h |
Memory-Efficient Cursor Arrays |
| - Simulated pointers using array indices | ||
| - Fixed memory allocation approach | ||
| Stack | 2 implementation versions | LIFO Data Structure |
- StackV1.c/.h - Array-based stack implementation |
||
- StackV2.c/.h - Enhanced stack with utilities |
||
| Queue | 2 implementation versions | FIFO Data Structure |
- QueueV1.c/.h - Circular array-based queue |
||
- QueueV2.c/.h - Advanced queue implementation |
||
| Dictionary | 4 Complete Hashing Implementations | Hash Table Collision Resolution |
- openHashingArr.c/.h - Open hashing with arrays |
||
- openHashingLL.c/.h - Open hashing with linked lists |
||
- closedHashingLinearHashing.c/.h - Linear probing technique |
||
- closedHashingProgressiveOverflow.c/.h - Progressive overflow method |
||
| BinaryHeap | 3 heap implementations | Priority-Based Data Structures |
- binaryHeapMin.c/.h - Min heap implementation |
||
- binaryHeapMax.c/.h - Max heap implementation |
||
- priorityQueue.c/.h - Priority queue using heaps |
||
| BitVectorSet | 3 progressive versions | Bit Manipulation Sets |
- BitVectorSetV1.c/.h - Basic bit vector operations |
||
- BitVectorSetV2.c/.h - Enhanced bit manipulation |
||
- BitVectorSetV3.c/.h - Complete bit vector set |
| Practice Area | Files | Description |
|---|---|---|
adtPractice/ |
Multiple practice files | Hands-on ADT implementation practice |
- ADTPractice.c - Main practice file |
||
- array.h, linklist.h - Core data structures |
||
- name.h, struct.h, student.h - Custom data types |
||
| - Template folder with clean starting files |
| Tutorial | Files | Description |
|---|---|---|
| 09-06-2025 Tutorial | 09-06-2025.c, stack.h |
Stack Operations Tutorial |
| - Stack operations tutorial session | ||
| - Practical implementation examples | ||
| Bitwise Operations | Multiple bitwise files | Comprehensive Bitwise Manipulation |
- BitwiseOperations.c/.h - Core bitwise operations |
||
- subwaySurfers.c/.h - Fun bitwise application |