WAP for Stack implementation through Array

#include <stdio.h>
#include<conio.h>
# define MAXSIZE 200
void push(char []);
void display();
char stack[MAXSIZE];
int top; //index pointing to the top of stack
int main()
{
void pop();
int will=1,i;
char nam[10];


while(will ==1)
{
printf("\nMAIN MENU:\n1.Add element to stack\n2.Delete element from the stack");
scanf("%d",&will);

switch(will)
{
case 1:
printf("Enter the data... ");
scanf("%s",nam);
push(nam);
break;
case 2:pop();

break;

case 3:display();
 break;
default: printf("Invalid Choice . ");
}

printf("\n do you want to do more operations on Stack ( 1 for yes, any other key to exit) ");
scanf("%d" , &will);
} //end of  outer while
}               //end of main


void display()
{
int i;
for(i=0;i<top;i++)
printf("%c",stack[i]);
}


void push(char a[])
{

int t;
if(top>MAXSIZE)
{
printf("stack FULL");
return;
}
else
{
 t=strlen(a);
 strcpy(stack,a);
 top+=t;
 stack[top]=' ';
 top++;
 printf("\n top=  %d\n",top);
}
}

void pop()
{
char a;
if(top<0)
{
printf("stack EMPTY");
return;
}
else
{
top--;
while(stack[top] != ' ')
{

a=stack[top];
top--;
}
//return(a);
}
}

WAP to enter the name of the person into a linked list through the concept of strings.

#include <stdio.h>
#include <stdlib.h>

//Structure containing a Data part & a
//Link part to the next node in the List

struct Node
{
 char Data[10];
 struct Node *Next;
}*Head;

// Counting number of elements in the List

int length()
{
  struct Node *cur_ptr;
  int count=0;

  cur_ptr=Head;

  while(cur_ptr != NULL)
  {
 cur_ptr=cur_ptr->Next;
 count++;
  }
  return(count);
}

// Deleting a node from List depending upon the data in the node.

int delNodeData(char num[])
{
  struct Node *prev_ptr, *cur_ptr;

  cur_ptr=Head;

  while(cur_ptr != NULL)
  {
 if(strcmp(cur_ptr->Data,num) == 0)
 {
 if(cur_ptr==Head)
 {
 Head=cur_ptr->Next;
 free(cur_ptr);  
 return 0;
 }
 else
 {
 prev_ptr->Next=cur_ptr->Next;
 free(cur_ptr);
 return 0;
 }
 }
 else
 {
 prev_ptr=cur_ptr;
 cur_ptr=cur_ptr->Next;
 }
  }

  printf("\nElement %s is not found in the List", num);
  return 1;
}

// Deleting a node from List depending upon the location in the list.

int delNodeLoc(int loc)
{
  struct Node *prev_ptr, *cur_ptr;
  int i;

  cur_ptr=Head;

  if(loc > (length()) || loc <= 0)
  {
printf("\nDeletion of Node at given location is not possible\n ");
  }
  else
  {
// If the location is starting of the list
if (loc == 1)
{
Head=cur_ptr->Next;
free(cur_ptr);
return 0;
}
else
{
for(i=1;i<loc;i++)
{
 prev_ptr=cur_ptr;
 cur_ptr=cur_ptr->Next;
}

prev_ptr->Next=cur_ptr->Next;
free(cur_ptr);
}
  }
  return 1;
}

//Adding a Node at the end of the list

void addEnd(char num[])
{
  struct Node *temp1, *temp2;

  temp1=(struct Node *)malloc(sizeof(struct Node));
  strcpy(temp1->Data,num);

  // Copying the Head location into another node.
  temp2=Head;

  if(Head == NULL)
  {
 // If List is empty we create First Node.
 Head=temp1;
 Head->Next=NULL;
  }
  else
  {
 // Traverse down to end of the list.
 while(temp2->Next != NULL)
 temp2=temp2->Next;

 // Append at the end of the list.
 temp1->Next=NULL;
 temp2->Next=temp1;
  }
}

// Adding a Node at the Beginning of the List

void addBeg(char num[])
{
  struct Node *temp;

  temp=(struct Node *)malloc(sizeof(struct Node));
  strcpy(temp->Data,num);

  if (Head == NULL)
  {
 //List is Empty
 Head=temp;
 Head->Next=NULL;
  }
  else
  {
 temp->Next=Head;
 Head=temp;
  }
}

// Adding a new Node at specified position

void addAt(char num[], int loc)
{
  int i;
  struct Node *temp, *prev_ptr, *cur_ptr;

  cur_ptr=Head;

  if(loc > (length()+1) || loc <= 0)
  {
 printf("\nInsertion at given location is not possible\n ");
  }
  else
  {
// If the location is starting of the list
if (loc == 1)
{
addBeg(num);
}
else
{
for(i=1;i<loc;i++)
{
 prev_ptr=cur_ptr;
 cur_ptr=cur_ptr->Next;
}

temp=(struct Node *)malloc(sizeof(struct Node));
strcpy(temp->Data,num);

prev_ptr->Next=temp;
temp->Next=cur_ptr;
}
  }
}

// Displaying list contents

void display()
{
  struct Node *cur_ptr;

  cur_ptr=Head;

  if(cur_ptr==NULL)
  {
 printf("\nList is Empty");
  }
  else
  {
printf("\nElements in the List: ");
//traverse the entire linked list
while(cur_ptr!=NULL)
{
printf(" -> %s ",cur_ptr->Data);
cur_ptr=cur_ptr->Next;
}
printf("\n");
  }
}

//Reversesing a Linked List

/*void reverse()
{
  struct Node *prev_ptr, *cur_ptr, *temp;

  cur_ptr=Head;
  prev_ptr=NULL;

  while(cur_ptr != NULL)
  {
 temp=prev_ptr;
 prev_ptr=cur_ptr;

 cur_ptr=cur_ptr->Next;
 prev_ptr->Next=temp;
  }

  Head=prev_ptr;
} */


int main()
{
 int i=0;
 char num[10];

 //Set HEAD as NULL
 Head=NULL;

 while(1)
 {
printf("\n####################################################\n");
printf("MAIN MENU\n");
printf("####################################################\n");
printf(" \nInsert a number \n1. At the Beginning");
printf(" \n2. At the End");
printf(" \n3. At a Particular Location in the List");
printf(" \n\n4. Print the Elements in the List");
printf(" \n5. Print number of elements in the List");
printf(" \n6. Reverse the linked List");
printf(" \n\nDelete a Node in the List");
printf(" \n7. Delete a node based on Value");
printf(" \n8. Delete a node based on Location\n");
printf(" \n\n9. Exit\n");
printf(" \nChoose Option: ");
scanf("%d",&i);

switch(i)
{
case 1:
{

printf(" \nEnter a Name to insert in the List: ");
scanf("%s",num);
addBeg(num);
display();
break;
}

case 2:
{

printf(" \nEnter the Name to insert: ");
scanf("%s",num);
addEnd(num);
display();
break;
}

case 3:
{
int loc;
printf("\nEnter the Name to insert: ");
scanf("%s",num);
printf("\nEnter the location Number in List at which \
the Number is inserted: ");
scanf("%d",&loc);
addAt(num,loc);
display();
break;
}

case 4:
{
display();
break;            
}

case 5:
{
display();
printf(" \nTotal number of nodes in the List: %d",length());
break;
}

case 7:
{

printf(" \nEnter the name to be deleted from List: ");
scanf("%s",num);
delNodeData(num);
display();
break;
}

case 8:
{
int loc;
printf(" \nEnter the location of the node to \
be deleted from List: ");
scanf("%d",&loc);
delNodeLoc(loc);
display();
break;
}

case 9:
{
struct Node *temp;

while(Head!=NULL)
{
 temp = Head->Next;
 free(Head);
 Head=temp;
}
exit(0);
}

default:
{
printf("\nWrong Option choosen");
}
}/* end if switch */
 }/* end of while */
}/* end of main */