1

DAY PLANNER

2
 INDEX
S.NO TOPIC PAGE
7
ABSTRACT
8
1 INTRODUCTION
9
2 METHODOLOGY

3 FLOWCHART 10

4 IMPLEMENTATION 11-15

5 RESULTS 16-18

6 ADVANTAGES 19

7 CONCLUSION 19

3
 ABSTRACT

Day planner is the act of mapping out one's daily activities. Daily planning
can involve writing down a schedule, having a to-do list, deciding on what
meals are going to be eaten or how much money can be spent, and other daily
issues of concern. Daily planning often happens with the use of a daily
planner template

4
 INTRODUCTION

Daily planner apps can help you plan all your daily tasks, from chores to
business meetings. An efficient planning program can also incorporate
alarms and reminders that notify you at the right time. Understanding the
various planner apps available can help you choose one that suits your
schedule.

 Monitoring our work quality and rating our work will give us motivation
to work daily without losing interest
 This planner helps us to monitor our work to an extent and help us to
reach our goals.
 In our fast-paced life planning a day is extremely important to
spend our day productively

5
 METHODOLOGY

Concepts of Data structures used in implementing Day planner

• Single linked lists were used in this implementation.

• Single linked lists are implemented using data structure named node with
a member to store data give by user , another member to store priority of given
work, another member to store address of next node in sequence.

First is a globally declared node to store address of first node of schedule

A priority queue is a special type of queue in which each element is associated with
a priority value. And, elements are served on the basis of their priority. That is, higher
priority elements are served first.
Main operations
enqueue(value, priority) - Enqueue an element
dequeue() - Dequeue an element
peek() - Check the element on the top
is_empty() - Check if the queue is empty

LINKED LIST :

Linked List is a linear data structure implemented using dynamic memory allocation.
ADT OF LINKED LIST

DATA:
• list of elements
• First and last to store address of first and last element

Operations:
• Create()
• Insert( )
• Delete( )
• Display( )
• Count( )
• Search( )

6
FLOWCHART

7
 IMPLEMENTATION

#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#include<windows.h>
struct node
{
int ts;
int th; //time in hours to complete work;
int tm; //time in minutes to complete
work; char name[100]; //name of work
int p; //priority
int r; //rating of work done
char f[1000]; //Feedback of your work in 4-5
words struct node *next; //Adress of next node
int c; //c=0 for incomplete works c=1 for completed sucess works failure c=2
}*first=NULL; //first and last nodes of list
struct node *nextnode;
int a=0,n=0;
void enter()
{
printf("**************\n");
struct node *nn;
nn=(struct node *)malloc(sizeof(struct
node)); nn->next=NULL;
nn->c=0;
printf("Enter name of work\n");
scanf("%s",nn->name);
printf("Enter priority of work on a scale of 10\
n"); scanf("%d",&nn->p);
printf("Enter time required to complete task\n");
printf("Enter hours :\n");
scanf("%d",&nn->th);
printf("Enter Minutes :\n");
scanf("%d",&nn->tm);
printf("Enter Seconds :\n");
scanf("%d",&nn->ts);
if(first==NULL)
{
first=nn;
nextnode=first;
}
else
{
/high priority node near
first/ if(first->p < nn->p)
{
nn->next=first;
first=nn;

8
return;
}
struct node *temp,*t;
temp=first;
while(temp->next!=NULL && temp->next->p < nn->p)
{
temp=temp->next;
}
nn->next=temp->next;
temp->next=nn;
} n+
+;
return;
}
void list()
{
struct node
*temp; int i=1;
temp=first;
if(temp==NULL)
{
printf("No list given\n");
return;
}
while(temp!=NULL)
{
char s[10]; printf("#Task
%d:\n",i); i++;
printf("TASK NAME : %s\n",temp->name);
printf("TASK STATUS : ");
if(temp->c==1)
{
printf("Done\n");
printf("TASK RATING : %d\n",temp->r);
}
else printf("Pending\n");
printf("TASK PRIORITY : %d\n",temp->p);
printf("Time Alloted for work %d : %d : %d\n",temp->th,temp->tm,temp-
>ts); temp=temp->next;
}
}
void feed()
{
/*if(nextnode->c==2)
{
printf("Failed in task !!!\n");
printf(""); scanf("%
[^.]s",nextnode->f);
nextnode->r=0;
printf("Enter Feedback on your task\n");

9
return;
}
printf("Sucessfully completed The task Congatulations!!\n");
printf("Success is not final, failure is not fatal: It is the courage to continue that counts.\n");-
*/
printf("If you finish your task then enter 1 else enter 2 :\n ");
//to note it as success if yes or failure if
no scanf("%d",&nextnode->c);
if(nextnode->c==1)//success
{
printf("Congratulations on your well-deserved success :\n");
}
else if(nextnode->c==2)//failure
{
printf("Don't be disheartened, keep going\n");
}
printf("Jot down your Affirmations or take aways :\n ");
fflush(stdin);
scanf("%s",nextnode->f);
printf("%s\n",nextnode->f);
printf("On a scale of 1 - 5 rate your productivity :\n ");
scanf("%d",&nextnode->r);
a = a + nextnode->r;
printf("*");
if(nextnode->next != NULL)
{
nextnode=nextnode->next;
}
return;
}
void summary()
{
//no of tasks completed including sucess and failure inform of percentage and fraction
//total hours of work
//overall rating
int b = a/n;//(rating) divided by number tasks
printf("Your overall ratting today is %d\n",b);
if(b>=4)
printf("Warm wishes Champion\n");
else if(b<4&&b>=3)
printf("You are almost there\n");
else if(b<3&&b>=2)
printf("Dont be disheartened , keeping moving on and grow stronger \n");
else
printf("Dont Worry , it seems like you are quite demotivated, stay focussed\n");
struct node *temp;
temp=first;
int s=0,f=0,n=0,h=0,m=0,s1=0; while(temp!
=NULL)
{
if(temp->c==1) s++;

10
else if(temp->c==2) f++;
else if(temp->c==0) n++;
h=h+temp->th;
m=m+temp->tm;
s1=s1+temp->ts;
temp=temp->next;
}
printf("Sucessfully comlpeted %d out of %d\n",s,s+f+n);
printf("Failed in %d out of %d\n",f,s+f+n);
printf("Not completed %d out of %d\n",n,n+s+f);
if(m>=60)
{
h=h+m/60;
m=m%60;
}
printf("Today You have worked for %d hours %d minutes %d secs",h,m,s1);
}
void start()
{
int s=nextnode->ts;
int m,h;
printf("Time allotedf for work is %d hrs %d mins %d secs\n",nextnode->th,nextnode->tm,s);
m=nextnode->tm;
h=nextnode->th;
while(1)
{
Sleep(1000);// to monitor the time by 1 second
if(s!=0)//1 sec
{
s=s-1;
system("cls");
int h1;
int m1;
if(h==0) h1=0;
else h1=h-1;
if(m==0) m1=0;
else m1=m-1;
printf("\n\n\n\n\n\n\n\n\ %d : %d : %d",h1,m1,s);
}
if(m!=0&&s==0)//1 min
{
m=m-1; if(m!
=0) s=59;
printf("\nA minute completed\n");
}
if(h!=0&&m==0&&s==0)//1 hour
{
h=h-1;
if(h!=0)
{ m=5
9;

11
s=59;
}
}
if(h==0 && m==0 && s==0)
{
system("cls");
printf("Time up\n");
printf("\a");
feed();
break;
}
}
return;
}
int main()
{
int op;
printf("This is a Daily planner\n");
printf("Few guidelines about this Daily planner:\n");
printf("This daily planner will help you to summarise you daily works\n");
printf("Few Instructions\n");
printf("Step 1:Give Your Work name\n");
printf("Step 2:Give priority of work in yours today schedule on a scale of 10\n");
printf("Step 3:Give all your works information\n");
printf("That's it we will generate a personalised to do list for you\n");
printf("Do your works and after doing every list give you feedback in the form of rating
and few words\n");
printf("\n\n");
printf("*******GET STARTED*********");
do
{
printf("\n\n***\nenter\n1:To enter work\n2:To get to do list\n4:To get
summary of work\n5:start doing work\n6:To exit\n\n\n****\n");
scanf("%d",&op);
switch(op)
{
case 1:enter(); break;
case 2:list(); break;
case 4:summary(); break;
case 5:start(); break;
case 6:printf("You Are Exiting program......\n"); break;
default:printf("\n\nEnter valid option\n\n");
}
}while(op!=6);
}

12
RESULTS

13
14
15
 ADVANTAGES

When you lead a busy life, it’s essential that you keep it organized. Very
few people have the cognitive capacity to keep track of all the demands
of career, family and social life. For that, you need a daily planner.
Effective scheduling is a crucial part of time management. You achieve
the best results when you prioritize and plan your tasks before working
on them. Using a daily planner to schedule the exact time for office
tasks, personal errands, appointments and so on ensures that you prepare
well for these events.

CONCLUSIONS

• Planning makes your daily life feasible and reduces stress.

• Using day planner helps :
To track down your progress
To analyze your work.
To increase your productivity
• This planner helps to organize your work based on your priority.

16