برنامه نویسی to do list با C

---

شرح پروژه

To-Do List Description

• In This Homework, You Must Use Your Knowledge of C Programming and Data Struc-

tures to Implement a Basic To-Do List.

• Your Implementation Must Be in ”Modular” Format Which Means Program’s Function-

alities Must Be Separated into Independent Modules (Files).

• To-Do List is a List of Tasks You Need to Complete.

Each Task Contains 3 Sections: 1. Title, 2. Description, 3. Dead-Line Date.

• Use ”Linked List” Data Structure As Your Base Container.

Each Node of the Linked List Represents One of the Tasks in Your To-Do List.

User Operations

• Create New Task

1. Dynamically Allocate Memory For a New Node

2. Input a Title, a Description, and a Dead-Line Date and Assign Them To the Newly-

Created Node’s Fields.

3. Append the Newly-Created Node to the End of the Linked-List

• Search a Task

1. Iterate Through Linked List and Output an Enumerate-List of All Tasks’ Titles

2. Select a Task By Inputting It’s Number

3. Return the Chosen Node

• Edit Sections of a Task

1. Search a Task

2. Select a Section

(a) Output an Enumerate-List of All Sections

(b) Select a Section By Inputting It’s Number

3. Input and Assign New Data to the Selected Section of the Node

• Remove a Task

1

1. Search a Task

2. Remove the Searched Node From the Linked List

• Prioritize Tasks *Bonus*

– Search a Task

– Input a Number As New Position of the Searched Task

– Change Searched-Task’s Position to the Inputted Number.

Grading System

• Features and Operations

– Create New Task: 10%

– Search a Task: 15%

– Edit Sections of a Task: 20%

– Remove a Task: 25%

– Prioritize Tasks *Bonus*: +30%

• User-Friendly Environment: 10%

• Modular Format: 10%

• Clean Code: 10%

مهارت ها و تخصص های مورد نیاز

---

---