CUT TO:
INT. PROJECT ARCHIVE — STORYBOARD ROOM
The USER opens Linked-List Task Management System.
DIVAKAR DESSAI
CUT TO:
The USER opens Linked-List Task Management System.
DIVAKAR DESSAI
CASE FILE / COMP1511 / C / Data Structures
Built a command-line task-management application in C around dynamically allocated linked lists for active and completed tasks.
01–02 / OPENING SEQUENCE
01 / Establishing Shot
A dynamic task-management system needed to store an unknown number of changing tasks without relying on fixed-size collection storage.
02 / Wide Shot
The assignment introduced linked data structures, pointers and explicit memory management within a practical command-line application.
03 / CHARACTER NOTE
Subject
Divakar Dessai
Production
Linked-List Task Management System
Take
03 / Role
Role notes
DIVAKAR DESSAI
04 / CLOSE-UP
Operations frequently changed the linked structure, so pointer manipulation had to remain correct across insertion, deletion and reordering.
05 / TRACKING SHOT
A plan emerges.
I represented each task as a dynamically allocated node and maintained separate linked collections for active and completed work.
06 / INSERT SHOTS
The system takes shape.
07 / DIRECTOR'S NOTES
Things we decided along the way
01
Used linked lists to support dynamic collection size.
02
Separated active and completed tasks.
03
Stored task state directly within structured nodes.
design decisions
somewhere mid-build
08 / RETAKES
Naturally, not everything cooperates.
09 / FINAL SHOT
Built a complete linked-list application.
Developed practical pointer-manipulation skills.
Strengthened understanding of dynamic memory and data structures.
10 / PRODUCTION NOTES
The tools behind the scenes.
11 / BEHIND THE SCENES
FADE OUT.
USER closes the file.
One project down. A few more stories left.
DIVAKAR DESSAI