Add files via upload

Author: Sushavan20

circular linked list.cpp

@@ -0,0 +1,147 @@
+#include <iostream>
+#include <stdlib.h>
+using namespace std;
+struct node{
+int data;
+struct node *next;
+}*tail;
+
+void insert_begin(int value)
+{
+    struct node *curr;
+    curr=(struct node *)malloc(sizeof(struct node));
+	curr->data=value;
+	if(tail==0)
+    {
+		curr->next=curr;
+		tail=curr;
+	}
+	curr->next=tail->next;
+	tail->next=curr;
+}
+
+void insert_end(int value)
+{
+    struct node *new_node;
+    new_node=(struct node *)malloc(sizeof(struct node));
+    new_node->data=value;
+    if (tail==0)
+    {
+        tail=new_node;
+        tail->next=new_node;
+    }
+    else
+    {
+        new_node->next=tail->next;
+        tail->next=new_node;
+        tail=new_node;
+    }
+}
+
+void del_begin()
+{
+    struct node *temp;
+    temp=tail->next;
+    cout<<"Deleted item: "<<temp->data<<endl;
+    if (temp->next==temp)
+    {
+        tail=0;
+        free(temp);
+    }
+    else
+    {
+        tail->next=temp->next;
+        free(temp);
+    }
+}
+
+void del_end()
+{
+    struct node *current,*prev;
+    current=tail->next;
+    if (current->next==current)
+    {
+        cout<<"Deleted item: "<<current->data<<endl;
+        tail=0;
+        free(current);
+    }
+    else
+    {
+        while (current->next!=tail->next)
+        {
+            prev=current;
+            current=current->next;
+        }
+        cout<<"Deleted item: "<<current->data<<endl;
+        prev->next=tail->next;
+        tail=prev;
+        free(current);
+    }
+}
+
+void display()
+{
+    struct node *temp;
+    temp=tail->next;
+    cout<<"LIST: ";
+    while (temp->next!=tail->next)
+    {
+        cout<<temp->data<<"->";
+        temp=temp->next;
+    }
+    cout<<temp->data;
+}
+
+int main ()
+{
+    int choice,val;
+    tail=0;
+    do{
+        cout<<"1 for insert at beginning"<<endl;
+        cout<<"2 for insert at end"<<endl;
+        cout<<"3 for display"<<endl;
+        cout<<"4 for delete from beginning"<<endl;
+        cout<<"5 for delete from end"<<endl;
+        cout<<"0 to exit"<<endl;
+        cin>>choice;
+        switch(choice)
+        {
+            case 1:
+                cout<<"Enter the data: ";
+                cin>>val;
+                insert_begin(val);
+                break;
+            case 2:
+                cout<<"Enter the data: ";
+                cin>>val;
+                insert_end(val);
+                break;
+            case 3:
+                if (tail==0)
+                    cout<<"List is Empty."<<endl;
+                else
+                    display();
+                cout<<endl;
+                break;
+            case 4:
+                if (tail==0)
+                    cout<<"List is Empty."<<endl;
+                else
+                    del_begin();
+                cout<<endl;
+                break;
+            case 5:
+                if (tail==0)
+                    cout<<"List is Empty."<<endl;
+                else
+                    del_end();
+                cout<<endl;
+                break;
+            case 0:
+                return 0;
+        }
+    }while (choice<6);
+    return 0;
+}
+
+

queue using array.cpp

@@ -0,0 +1,101 @@
+#include <iostream>
+using namespace std;
+#define MAX 5
+
+int arr[MAX];
+int front=-1;
+int rear=-1;
+
+void enQueue ()
+{
+    int item;
+    if (rear==MAX-1) //Queue is full
+        cout<<"Queue is Full."<<endl;
+    else if (front==-1 && rear==-1) //Queue is empty
+    {
+        front=0;
+        rear=0;
+        cout<<"Inset the element in queue : ";
+        cin>>item;
+        arr[rear]=item;
+    }
+    else
+    {
+        rear++;
+        cout<<"Inset the element in queue : ";
+        cin>>item;
+        arr[rear]=item;
+    }
+}
+
+void deQueue ()
+{
+    if (front==-1 && rear==-1) //Queue is empty
+        cout<<"Queue is Empty."<<endl;
+    else if (front==rear) // on;y one item present
+    {
+        cout<<"Deleted item: "<<arr[front]<<endl;
+        front=-1;
+        rear=-1;
+    }
+    else
+    {
+        cout<<"Deleted item: "<<arr[front]<<endl;
+        front++;
+    }
+}
+
+void peek ()
+{
+    if (front==-1 && rear==-1)
+        cout<<"Queue is Empty."<<endl;
+    else
+        cout<<"Peeked value: "<<arr[front]<<endl;
+}
+
+void display ()
+{
+    int i;
+    if (front==-1 && rear==-1)
+        cout<<"Queue is Empty."<<endl;
+    else
+    {
+        cout<<"Queue is:"<<endl;
+        for (i=front;i<=rear;i++)
+            cout<<arr[i]<<" ";
+        cout<<endl;
+    }
+}
+
+int main()
+{
+    int choice;
+    do
+    {
+        cout<<"1.EnQueue"<<endl;
+        cout<<"2.DeQueue"<<endl;
+        cout<<"3.Peek"<<endl;
+        cout<<"4.Display"<<endl;
+        cout<<"Enter your choice : ";
+        cin>>choice;
+        switch (choice)
+        {
+            case 1:
+                enQueue();
+                break;
+            case 2:
+                deQueue();
+                break;
+            case 3:
+                peek();
+                break;
+            case 4:
+                display();
+                break;
+            default:
+                cout<<"Wrong choice.\n";
+        }
+    }while (choice<5);
+    return 0;
+}
+

queue using linked list.cpp

@@ -0,0 +1,102 @@
+#include <iostream>
+#include <stdlib.h>
+using namespace std;
+
+struct node{
+int data;
+struct node *next;
+};
+struct node *front=0;
+struct node *rear=0;
+
+void enQueue(int val)
+{
+    struct node *new_node;
+    new_node=(struct node *)malloc(sizeof(struct node));
+    new_node->data=val;
+    new_node->next=0;
+    if (front==0 && rear==0)
+    {
+        front=new_node;
+        rear=new_node;
+    }
+    else
+    {
+        rear->next=new_node;
+        rear=new_node;
+    }
+}
+
+void peek()
+{
+    if (front==0)
+        cout<<"List is empty."<<endl;
+    else
+        cout<<"Peeked value: "<<front->data<<endl;
+}
+
+void deQueue()
+{
+    struct node *temp;
+    temp=front;
+    cout<<"Deleted item: "<<front->data<<endl;
+    front=front->next;
+    free(temp);
+}
+
+void display()
+{
+    struct node *temp;
+    temp=front;
+    while(temp->next!=0)
+    {
+        cout<<temp->data<<"->";
+        temp=temp->next;
+    }
+    cout<<temp->data<<endl;
+}
+
+int main ()
+{
+    int choice,value;
+    do{
+        cout<<"1 for enQueue"<<endl;
+        cout<<"2 for deQueue"<<endl;
+        cout<<"3 for peek"<<endl;
+        cout<<"4 for display"<<endl;
+        cout<<"0 to exit"<<endl;
+        cout<<"Enter your choice: ";
+        cin>>choice;
+        switch(choice)
+        {
+            case 1:
+                cout<<"Enter the data: ";
+                cin>>value;
+                enQueue(value);
+                break;
+            case 2:
+                if (front==0)
+                    cout<<"List is empty."<<endl;
+                else
+                    deQueue();
+                cout<<endl;
+                break;
+            case 3:
+                peek();
+                cout<<endl;
+                break;
+            case 4:
+                if (front==0)
+                    cout<<"List is empty."<<endl;
+                else
+                    display();
+                cout<<endl;
+                break;
+            case 0:
+                return 0;
+        }
+    }while (choice<5);
+    return 0;
+}
+
+