Theses / Proposed Topics
Mobile task-management application with hierarchical data structure
An Android to-do application where tasks form a tree with arbitrary nested subtasks. The work covers the data model, tree operations, linear UI rendering of the hierarchy, branch collapse/expand behavior and task editing/completion mechanisms.
Topic description
The aim of the thesis is to design and implement a mobile to-do application for Android that allows tasks to be created and organized as a tree structure. Each task can act as a tree node and contain any number of subtasks, enabling a multi-level hierarchy with practically unlimited depth.
From the data-model perspective, the structure can be implemented using an adjacency-list approach, where each item stores its own identifier and the identifier of its parent. The work requires algorithms for building, searching and presenting the tree in the user interface, as well as mechanisms for adding, deleting, editing and marking nodes as completed.
An important part of the project is transforming the hierarchical structure into a linear representation for list rendering, while preserving nesting levels and branch collapse/expand behavior. The application will be implemented in Kotlin in Android Studio.