Answer to Question #236639 in C for SOM

Question

Write a menu driven program to implement Deques (both Input-restricted and Output-restricted) operations such as Enqueue, Dequeue, Peek, Display of elements, Is Empty, Is Full using static array.

Answer 1

#include<conio.h>
#include <iostream>
# include<stdio.h>
//using namespace std;


# define MAX_SIZE 5


int deque_arr[MAX_SIZE];
int Left = -1;
int Right = -1;


void InsertRight()
{
	int added_item;
	if((Left == 0 && Right == MAX_SIZE-1) || (Left == Right+1))
	{	
		printf("Queue Overflow\n");
		return;
	}
	if (Left == -1)
	{
		Left = 0;
		Right = 0;}
	else
	if(Right == MAX_SIZE-1)  
		Right = 0;
	else
		Right = Right+1;
	printf("Input the element for adding in queue : ");
	scanf("%d", &added_item);
	deque_arr[Right] = added_item ;
}


void InsertLeft()
{	int added_item;
	if((Left == 0 && Right == MAX_SIZE-1) || (Left == Right+1))
	{	
		printf("Queue Overflow \n");
		return;	 
	}
	if (Left == -1)
	{	
		Left = 0;
		Right = 0;	 
	}
	else
	if(Left== 0)
		Left=MAX_SIZE-1;
	else
		Left=Left-1;
	printf("Input the element for adding in queue : ");
	scanf("%d", &added_item);
	deque_arr[Left] = added_item ;	 
}




void DeleteLeft()
{	if (Left == -1)
	{	printf("Queue Under-flow\n");
		return ;	}
	printf("Element has been deleted from queue is : %d\n",deque_arr[Left]);
	if(Left == Right) 
	{	Left = -1;
		Right=-1;	 }
	else
		if(Left == MAX_SIZE-1)
			Left = 0;
		else
			Left = Left+1;
}


void DeleteRight()
{
	if (Left == -1)
	{
		printf("Queue Under flow\n");
		return ;	 
	}
	printf("Element has been deleted from queue is : %d\n",deque_arr[Right]);
	if(Left == Right) 
	{	
		Left = -1;
		Right=-1;	 }
	else
		if(Right == 0)
			Right=MAX_SIZE-1;
		else
			Right=Right-1;	
}


void Display()
{	int fpos = Left,rpos = Right;
	if(Left == -1)
	{	
		printf("Queue is empty\n");
		return;	 
	}
	printf("Queue elements :\n");
	if( fpos <= rpos )
	{	
		while(fpos <= rpos)
		{
			printf("%d ",deque_arr[fpos]);
			fpos++;	}	
		}
	else
	{	
		while(fpos <= MAX_SIZE-1)
		{	
			printf("%d ",deque_arr[fpos]);
			fpos++;	
		}
		fpos = 0;
		while(fpos <= rpos)
		{	
			printf("%d ",deque_arr[fpos]);
			fpos++;
		}
	}
	printf("\n");
}


void Input()
{	
	int Option=0;
	do//while(Option<0 || Option>5)
	{	
		printf("1.Insert at Right\n");
		printf("2.Delete from Left\n");
		printf("3.Delete from Right\n");
		printf("4.Display\n");
		printf("5.Quit\n");
		printf("Enter your choice : ");
		scanf("%d",&Option);


		switch(Option)
		{	
			case 1:		InsertRight();			break;
		 	case 2:		DeleteLeft();			break;
		 	case 3:		DeleteRight();			break;
		 	case 4:		Display();				break;
			case 5:					            break;
		 	default:	printf("Wrong Option\n");
		}
	}while(Option!=5);
}


void Output()
{	int Option=0;
	do//while(Option<=0 || Option>5)
	{	printf("1.Insert at Right\n");
		printf("2.Insert at Left\n");
		printf("3.Delete from Left\n");
		printf("4.Display\n");
		printf("5.Quit\n");
		printf("Enter your choice : ");
		scanf("%d",&Option);
		switch(Option)
		{
		 case 1:	InsertRight();	break;
		 case 2:	InsertLeft();	break;
		 case 3:	DeleteLeft();	break;
		 case 4:	Display();		break;
		 case 5:	break;
		 default:	printf("Wrong Option\n");
		}
	}while(Option!=5);
}

main()
{	int Option=0;
	printf("1.Input restricted dequeue\n");
	printf("2.Output restricted dequeue\n");
	printf("Enter your choice : ");
	scanf("%d",&Option);
	switch(Option)
	{
	 case 1 :	Input();	break;
	 case 2:	Output();	break;
	 default:	printf("Wrong Option\n");
	}
}