Data structures project — implemented from scratch, with analysis
Data structures assignments almost always ban the easy path: no built-in collections, implement the structure yourself. UniForge treats that ban as a verified constraint, so a linked list is a real linked list and not a wrapper around a library class.
Linked lists, stacks, queues, binary search trees, graphs, hashing — the structure comes from your brief, along with the operations your rubric names.
The report includes the complexity analysis such assignments are graded on, and the viva pack asks the questions an examiner asks about your specific implementation.
Start building — 3 builds freeCommon questions
Can it avoid STL / built-in collections?
Yes — "no STL" in C++ or "no ArrayList/Collections" in Java becomes an executable check verified by a parser for that language.
Is time complexity covered?
The report documents the complexity of each operation, which is usually a marked section of a DSA submission.
Which structures are supported?
Arrays, linked lists (single, double, circular), stacks, queues, trees, graphs, sorting and searching — driven by what your handout asks for.