diff --git a/cicularqueue.cpp b/cicularqueue.cpp
new file mode 100644
index 0000000..bbda887
--- /dev/null
+++ b/cicularqueue.cpp
@@ -0,0 +1,68 @@
+using namespace std;
+#include<iostream>
+int arr[20];
+int front =-1;
+int rear=-1;
+int size =5;
+void insertion(int s)
+{
+	if(rear==-1&&front==-1)
+	{
+		rear=rear+1;
+		front = front+1;
+		arr[rear]=s;
+	}
+else if(front==0&&rear==size-1)
+	{
+		cout<<"overflow"<<endl;
+	}
+else if(front==rear+1)
+	{
+		cout<<"overflow"<<endl;
+	}
+else if(front!=0&&rear==size-1)
+	{
+		rear=0;
+		arr[rear]=s;
+	}
+	else
+	{
+		rear=rear+1;
+		arr[rear]=s;
+	}
+}
+void deletion()
+{
+if(rear==-1&&front==-1)
+{
+	cout<<"underflow"<<endl;
+}
+else if(front==rear)
+{
+	front=rear=-1;
+	}	
+	else if(front==size-1&&front!=rear)
+	{
+		front=0;
+	}
+	else
+	{
+		front=front+1;
+	}
+}
+int main()
+{
+	insertion(5);
+	insertion(10);
+	insertion(15);
+	insertion(20);
+		insertion(25);
+deletion();
+		while(front!=rear)
+		{
+			cout<<arr[front]<<endl;
+			front=front+1;
+		}
+		cout<<arr[front]<<endl;
+	
+}
diff --git a/cicularqueue.exe b/cicularqueue.exe
new file mode 100644
index 0000000..092341f
Binary files /dev/null and b/cicularqueue.exe differ
diff --git a/circularlinkedqueue.cpp b/circularlinkedqueue.cpp
new file mode 100644
index 0000000..a32cff8
--- /dev/null
+++ b/circularlinkedqueue.cpp
@@ -0,0 +1,84 @@
+using namespace std;
+#include<iostream>
+struct node
+{
+	int data;
+	struct node* next=NULL;
+};
+struct node *front=NULL;
+struct node *rear=NULL;
+struct node *createnode()
+{
+	struct node *p;
+	p=new(struct node);
+	cin>>p->data;
+	p->next=NULL;
+}
+struct node *insertnode()
+{
+
+		struct node *p;
+	p=createnode();
+	if(front==NULL&&rear==NULL)
+	{
+		front=p;
+		rear=p;
+		p->next=NULL;
+	}
+	else
+	{
+		struct node *t;
+	t=front;
+	while(t->next!=NULL)
+	{
+		t=t->next;
+	}
+	t->next=p;
+	p->next=NULL;
+	rear=p;
+}
+}
+struct node *deletion()
+{
+	if(rear->next==NULL&&front->next==NULL)
+	{
+		front=NULL;
+		cout<<"nothing to be deleted"<<endl;
+	}
+	else if(rear->next==front->next)
+	{
+	rear=NULL;
+	front=NULL;	
+	}
+	else if(front->next==NULL&&front!=rear)
+	{
+		front=NULL;
+	}
+	else
+	{
+		front = front->next;
+	}
+	return front;
+}
+int main()
+{
+	insertnode();
+	insertnode();
+	insertnode();
+	insertnode();
+	deletion();
+	deletion();
+		deletion();
+		deletion();
+			//	deletion();
+	while(front->next!=NULL)
+	{
+		cout<<front->data;
+		front=front->next;
+		
+	}
+		cout<<front->data;
+	{
+		
+	}
+}
diff --git a/circularlinkedqueue.exe b/circularlinkedqueue.exe
new file mode 100644
index 0000000..68aa060
Binary files /dev/null and b/circularlinkedqueue.exe differ
diff --git a/circularlinkedqueuee.cpp b/circularlinkedqueuee.cpp
new file mode 100644
index 0000000..77217fb
--- /dev/null
+++ b/circularlinkedqueuee.cpp
@@ -0,0 +1,84 @@
+using namespace std;
+#include<iostream>
+struct node
+{
+	int data;
+	struct node* next=NULL;
+};
+struct node *front=NULL;
+struct node *rear=NULL;
+struct node *createnode()
+{
+	struct node *p;
+	p=new(struct node);
+	cin>>p->data;
+	p->next=NULL;
+}
+struct node *insertnode()
+{
+
+		struct node *p;
+	p=createnode();
+	if(front==NULL&&rear==NULL)
+	{
+		front=p;
+		rear=p;
+		p->next=NULL;
+	}
+	else
+	{
+		struct node *t;
+	t=front;
+	while(t->next!=NULL)
+	{
+		t=t->next;
+	}
+	t->next=p;
+	p->next=NULL;
+	rear=p;
+}
+}
+struct node *deletion()
+{
+	if(rear->next==NULL&&front->next==NULL)
+	{
+		front=NULL;
+		rear=NULL;
+		cout<<"nothing to be deleted"<<endl;
+	}
+	else if(rear->next==front->next)
+	{
+	rear=NULL;
+	front=NULL;	
+	}
+	else if(front->next==NULL&&front!=rear)
+	{
+		front=NULL;
+	}
+	else
+	{
+		front = front->next;
+	}
+	return front;
+}
+int main()
+{
+	insertnode();
+	insertnode();
+	insertnode();
+	insertnode();
+	deletion();
+	deletion();
+		deletion();
+		deletion();
+				deletion();
+	while(front!=NULL)
+	{
+		cout<<front->data;
+		front=front->next;
+		
+	}
+	{
+		
+	}
+}
diff --git a/circularqueue.cpp b/circularqueue.cpp
new file mode 100644
index 0000000..118947c
--- /dev/null
+++ b/circularqueue.cpp
@@ -0,0 +1,83 @@
+using namespace std;
+#include<iostream>
+struct node
+{
+	int data;
+	struct node* next=NULL;
+};
+struct node *front=NULL;
+struct node *rear=NULL;
+struct node *createnode()
+{
+	struct node *p;
+	p=new(struct node);
+	cin>>p->data;
+	p->next=NULL;
+}
+struct node *insertnode()
+{
+
+		struct node *p;
+	p=createnode();
+	if(front==NULL&&rear==NULL)
+	{
+		front=p;
+		rear=p;
+		p->next=NULL;
+	}
+	else
+	{
+		struct node *t;
+	t=front;
+	while(t->next!=NULL)
+	{
+		t=t->next;
+	}
+	t->next=p;
+	p->next=NULL;
+	rear=p;
+}
+}
+/*struct node *deletion()
+{
+	if(rear->next==NULL&&front->next==NULL)
+	{
+		cout<<"nothing to be deleted"<<endl;
+	}
+	else if(rear->next==front->next)
+	{
+	rear=NULL;
+	front=NULL;	
+	}
+	else if(front->next==NULL&&front!=rear)
+	{
+		front=NULL;
+	}
+	else
+	{
+		front = front->next;
+	}
+	return front;
+}*/
+int main()
+{
+	insertnode();
+	insertnode();
+	insertnode();
+	insertnode();
+	//deletion();
+	//deletion();
+		//deletion();
+		//	deletion();
+			//	deletion();
+	while(front->next!=NULL)
+	{
+		cout<<front->data;
+		front=front->next;
+		
+	}
+		cout<<front->data;
+	{
+		
+	}
+}
diff --git a/circularqueue.exe b/circularqueue.exe
new file mode 100644
index 0000000..4050682
Binary files /dev/null and b/circularqueue.exe differ
diff --git a/deque.cpp b/deque.cpp
new file mode 100644
index 0000000..4d156d5
--- /dev/null
+++ b/deque.cpp
@@ -0,0 +1,93 @@
+using namespace std;
+#include<iostream>
+int left1=-1;
+int right1=-1;
+int arr[90]={0};
+int size=7;
+void right_insertion(int p)
+{
+	if((left1==-1 )&&(right1==-1))
+	{
+		left1=left1+1;
+		right1=right1+1;
+		arr[right1]=p;
+	}
+	else if((right1==size-1)&&left1==0)
+	{
+		cout<<"overflow"<<endl;
+	}
+	else if((right1==size-1)&&left1!=0)
+	{
+		right1=0;
+		arr[right1]=p;
+	}
+	else if(left1==right1+1)
+	{
+	cout<<"overflow"<<endl;	
+	}
+	else
+	{
+		right1=right1+1;
+		arr[right1]=p;
+	}
+	
+}
+int left_insertion(int k)
+{
+	if(left1==-1&&right1==-1)
+	{
+		left1=left1+1;
+		right1=right1+1;
+		arr[left1]=k;
+	}
+	else if(right1==size-1&&left1==0)
+	{
+		cout<<"overflow"<<endl;
+	}
+	else if( right1!=size-1&&left1==0)
+	{
+		left1=size-1;
+		arr[left1]=k;
+	}
+	else if(right1==left1+1)
+		{
+			cout<<"overflow"<<endl;
+		}
+	else
+	{
+		left1=left1-1;
+		arr[left1]=k;
+	}
+}
+int left_deletion()
+{
+
+	
+}
+int right_deletion()
+{
+	
+}
+traverse()
+{
+left1=0;
+{
+	while(left1!=size-1)
+	{
+		cout<<arr[left1]<<endl;
+		left1=left1+1;
+	}
+}
+cout<<arr[left1]<<endl;
+}
+int main()
+{
+left_insertion(23);
+left_insertion(36);
+left_insertion(21);	
+ right_insertion(788);
+  right_insertion(123);
+   right_insertion(456);
+
+traverse();
+}
diff --git a/deque.exe b/deque.exe
new file mode 100644
index 0000000..b462dbf
Binary files /dev/null and b/deque.exe differ
diff --git a/dequee.cpp b/dequee.cpp
new file mode 100644
index 0000000..e19204c
--- /dev/null
+++ b/dequee.cpp
@@ -0,0 +1,63 @@
+using namespace std;
+#include<iostream>
+int lft=-1;
+int rght = -1;
+int arr[34]={0};
+int mx=5;
+insertion_left1(int p)
+{
+	if(rght==mx-1&&lft==0)
+	{
+		cout<<"overflow"<<endl;
+	}
+	else if(lft==-1&&rght==-1)
+	{
+		lft=lft+1;
+		rght=rght+1;
+		arr[rght]=p;
+	}
+	else if(lft==rght+1)
+	{
+		cout<<"overflow"<<endl;
+	}
+	else if(rght==mx-1&&lft!=rght)
+	{
+		rght=0;
+	}
+	else
+	{
+		rght=rght+1;
+		arr[rght]=p;
+	}
+
+}
+insertion_right(int p)
+{
+if(left==-1&&right==-1)
+{
+	left=
+	}	
+	
+}
+deletoin()
+{
+lft=lft+1;	
+}
+traverse()
+{
+	while(lft!=rght)
+	{
+		cout<<arr[lft]<<endl;
+		lft = lft+1;
+	}
+	cout<<arr[lft];
+}
+int main()
+{
+insertion_left1(12);
+insertion_left1(121);insertion_left1(123);
+insertion_left1(126);insertion_left1(126);insertion_left1(126);
+traverse();
+
+//insertion_right(34);	
+}
diff --git a/dequee.exe b/dequee.exe
new file mode 100644
index 0000000..b9439fa
Binary files /dev/null and b/dequee.exe differ
diff --git a/priorityqueue.cpp b/priorityqueue.cpp
new file mode 100644
index 0000000..654b8d1
--- /dev/null
+++ b/priorityqueue.cpp
@@ -0,0 +1,71 @@
+using namespace std;
+#include<iostream>
+struct node
+{
+	int data;
+	int pri;
+	struct node *next=NULL;
+};
+struct node* start=NULL;
+struct node* createnode()
+{
+	struct node *temp;
+	temp = new(struct node);
+	cin>>temp->data;
+	cin>>temp->pri;
+	temp->next=NULL;
+}
+struct node *insertnode()
+{
+	struct node *t;
+	t = createnode();
+	struct node *t1;
+		struct node *k;
+	
+	if(start==NULL||t->pri<start->pri)
+	{
+		t->next=start;
+		start=t;
+	}
+	else
+	{
+			t1=start;
+		while(t1->next!=NULL&&t1->pri<t->pri)
+		{
+			k=t1;
+			t1=t1->next;
+		}
+		 if(t1->pri>t->pri)
+	{
+		k->next=t;
+		t->next=t1;
+	}
+	else 
+	{42
+				
+		t1->next=t;
+		t->next=NULL;
+	
+
+	}
+		
+	}
+}
+void traverse()
+{
+	struct node *t;
+	t=start;
+	while(t!=NULL)
+	{
+		cout<<t->data<<"--> "<<t->pri<<endl;
+		t= t->next;
+	}
+}
+int main()
+{
+	for(int i=0;i<5;i++)
+	{
+		insertnode();
+	}
+	traverse();
+}
diff --git a/priorityqueue.exe b/priorityqueue.exe
new file mode 100644
index 0000000..3605e45
Binary files /dev/null and b/priorityqueue.exe differ
diff --git a/queue.cpp b/queue.cpp
new file mode 100644
index 0000000..a8de25e
--- /dev/null
+++ b/queue.cpp
@@ -0,0 +1,59 @@
+using namespace std;
+#include<iostream>
+#include<queue>
+int rear=-1;
+int front=-1;
+int size=5;
+int q[5];
+void insertion(int c)
+{
+		
+		if(rear==-1 && front==-1)
+	{
+		front+=1;
+		rear+=1;
+		q[rear]=c;
+	}
+	else if(rear==size-1)
+	{
+		cout<<"overflow"<<endl;
+	}
+	else
+	{
+		rear=rear+1;
+		q[rear]=c;
+	}
+}
+void deletion()
+{
+		if(rear==front==-1||front>rear)
+	{
+		cout<<"underflow"<<endl;
+	}
+	else 
+	{
+	
+		front=front+1;
+	}
+
+}
+
+int main()
+{
+
+insertion(5);
+insertion(55);
+insertion(25);
+insertion(35);
+deletion();
+
+
+
+while(front!=rear)
+{
+	cout<<q[front]<<endl;
+	front=front+1;
+}
+cout<<q[front];
+}
+	
diff --git a/queue.exe b/queue.exe
new file mode 100644
index 0000000..1a3047e
Binary files /dev/null and b/queue.exe differ
diff --git a/queueusing stack.cpp b/queueusing stack.cpp
new file mode 100644
index 0000000..523596a
--- /dev/null
+++ b/queueusing stack.cpp	
@@ -0,0 +1,62 @@
+using namespace std;
+#include<iostream>
+#include<stack>
+	stack<int>s;
+	stack<int>s2;
+
+void deletion()
+	{
+		int p=0;
+		if((!s.empty())||s2.empty())
+		{
+		while(!s.empty())
+		{
+			p=s.top();
+			s.pop();
+			s2.push(p);
+			
+		}
+		s2.pop();
+		return s2;
+	}
+	else
+	{
+		/*while(!s2.empty())
+		{
+			p=s2.top();
+			s2.pop();
+			s.push(p);
+		}*/
+		s2.pop();	
+		return s2;
+	}
+	}
+int main()
+{
+//stack<int>k;
+s.push(3);
+s.push(31);
+s.push(23);
+s.push(45);
+s.push(37);
+deletion();
+/*k=deletion();
+k=deletion();
+k=deletion();*/
+if(s.empty())
+{
+	
+	k.push(100);
+
+	}
+else
+{
+	s2.push(100);
+}
+while(!k.empty())
+{
+	cout<<k.top()<<endl;
+	k.pop();
+}
+	
+}
diff --git a/queueusing stack.exe b/queueusing stack.exe
new file mode 100644
index 0000000..76ffd84
Binary files /dev/null and b/queueusing stack.exe differ