CS2001 Data Structures
Instructor Usman Ghous
Session Spring 2025
Topics to be Covered:
• Linked List / Queue / Stack
Instructions:
1) You are required to submit a Microsoft Word file, containing all your codes along with
screenshots (complete console) of every question next to it. Any question without the
screenshot will not be accepted. PDF or other format files will not be accepted.
2) Late submissions will not be accepted.
3) Word file format should be “Roll-Number-Section-AsNo”, for example 23F-0101-5A-As
#01. Marks will be deducted for not following the correct format.
4) Plagiarism will not be tolerated, either done from internet or from some fellow classmate
of same/other section. Plagiarized questions will result in straight zero or negative
marking.
Advanced Task Manager
1. Introduction
This project is an Advanced Task Manager that uses Queues and Stacks (implemented with
Linked Lists) to manage tasks for multiple users. Each user has a specific role, and the system
assigns tasks accordingly.
2. Features
1. User-Specific Task Management
• Each user logs in with a unique username.
• Tasks are assigned based on the user’s role.
2. Task Addition (Enqueue & Push)
Users can add tasks with:
• Task Name
• Priority Level (High, Medium, Low)
• Task Type (Work, Personal, Urgent)
• Assigned User (For teamwork)
3. Task Completion (Dequeue & Pop)
• FIFO (Queue): Oldest task is completed first.
• LIFO (Stack): Latest task is completed first.
• Priority Handling: Urgent tasks get priority.
4. Undo Last Completed Task
• If a task was completed by mistake, it can be restored.
5. Search for a Task
• Users can search for a task by name or type.
6. Remove Specific Task
• Users can delete a task by providing its name.
7. Task Statistics
• Total tasks added
• Total tasks completed
• Pending tasks by priority
• Average time to complete a task
8. User-Specific Task Suggestions
• Tasks are suggested based on the user’s role.
• If a Developer logs in, system suggests coding tasks.
• If a Designer logs in, system suggests UI tasks.
3. Implementation Details
Data Structures Used
1. Queue (FIFO)
• Implemented using Linked List.
• Stores tasks in the order they are added.
2. Stack (LIFO)
• Implemented using Linked List.
• Stores tasks where the most recent is completed first.
Algorithm Overview
Task Addition
1. User logs in.
2. If the user adds a task, it's pushed into both the queue and stack.
3. If the user doesn’t add a task, system suggests a task.
Task Completion
1. User selects a task to complete.
2. The task is removed from the queue (FIFO) or stack (LIFO).
3. The system logs the completion time.
Undo Last Completed Task
1. If a task was removed by mistake, it is restored.
Task Search & Removal
1. User searches by task name or type.
2. If found, the task is displayed.
3. If the user chooses, the task is removed.
4. User Guide
Login
1. The system asks for a username.
2. The user selects a role.
3. The system loads tasks based on the role.
Adding a Task
1. Select "Add Task."
2. Enter:
• Task Name
• Priority (High/Medium/Low)
• Type (Work/Personal/Urgent)
• Assigned User (Optional)
Task is added to Queue & Stack.
Viewing Tasks
1. Select "View Tasks."
Tasks are displayed in priority order.
Completing a Task
1. Select a task.
2. Choose to complete it from Queue (FIFO) or Stack (LIFO).
Task is removed.
Undo Last Completed Task
1. Select "Undo."
Last completed task is restored.
Searching for a Task
1. Enter a task name or type.
System displays matching tasks.
