Subject Code :-  ICT208
Title :-  Algorithms And Data Structures
Assignment Type :- Assessment 2 Case Study 1
Weighting :-  40%
Linked Lists- Case study 1
In this assessment students will analyse a case and develop appropriate data structures and finally write code.
ICT208 Algorithms And Data Structures Assessment 2 Case Study 1

Case study:
In this assessment you are required to develop a to-do list application in C++. The list must be implemented by linked list. A linked list is a linear data structure in which the elements are not stored at contiguous memory locations. The elements in a linked list are linked using pointers as shown in the below image:

Each element in the link is called a node which is composed of two parts:

a. Data stored by the node
b. Link pointed to the next node in the linked list

The final application must meet the following functional requirements:
1. The user can create unlimited to-do lists. Each list must have a unique name (i.e., two lists with same name are not allowed).
2. User can insert a new list at the start and delete the first list.
3. User can insert an item in a list specified by the user. User inputs the name of the list to insert the item. If the list exists, then the user has the option to either insert the item at the end of the list or after an item at an index specified by the user. If the list does not exist an appropriate message is shown.
4. User can delete an item from a list specified by the user. User inputs the name of the list to insert the item. If the list exists, then the user is prompted to enter the index of the item to delete. If the list does not exist an appropriate message is shown.
5. User can see the names of stored lists.
6. User must be able to display the items stored in a to-do list specified by the user.

ICT208 Algorithms And Data Structures Assessment 2 Case Study 1

The to-do list has the following functional requirements:
1. Each node in the list stores a string that is entered by the user. The stored string describes the user task.
2. There must be a way to delete last item from the list.
3. There must be a way to insert an item at the end of the list.
4. There must be a way to insert and delete an item at a specific index. You can assume that the first item in the list has an index 0.

ICT208 Algorithms And Data Structures Assessment 2 Case Study 1

Please note to score maximum marks you must implement all the requirements.
However you can still obtain a maximum of 70% marks if your application allows users to create only a single to-do list.

The following reference sites can be of helpful to enhance your understanding of Linked List class structure based on Node and associated methods: