diff --git a/Linear_DS/queue.cpp b/Linear_DS/queue.cpp
new file mode 100755
index 0000000..ea0bfd0
--- /dev/null
+++ b/Linear_DS/queue.cpp
@@ -0,0 +1,99 @@
+#include<iostream>
+using namespace std;
+class QNode
+{
+    public:
+    int key;
+    QNode *next;
+    QNode(int data)
+    {   
+        this->key=data;
+        this->next=NULL;
+    }
+};
+struct Queue 
+{ 
+	QNode *front, *rear;
+    	int size=0;
+    Queue()
+    {
+        this->front=NULL;
+        this->rear=NULL;
+    }
+    void enqueue(int val)
+    {
+        QNode* node=new QNode(val);
+        node->next=NULL;
+        if(front==NULL)
+        {
+            front=rear=node;
+            rear->next=NULL;
+        }
+        else
+        {
+            rear->next=node;
+            rear=node;
+            rear->next=NULL;
+        }
+        size++;
+        cout<<"enqueued sucessfully"<<endl;
+    }
+    void print()
+    {
+        QNode *temp=front;
+        int t=0;
+        while(t<size)
+        {
+            cout<<temp->key<<" ";
+            temp=temp->next;
+            t++;
+        }
+        cout<<endl;
+    }
+    ~Queue()
+    {
+        QNode *node;
+        while(front!=NULL)
+        {
+            node=front;
+            //cout<<"hii"<<endl;
+            front=front->next;
+            delete node;
+        }
+        front=rear=NULL;
+    }
+    QNode *dequeue()
+    {
+        if(front==NULL)
+            return NULL;
+        else
+        {
+            QNode* node=front;
+            front=front->next;
+            size--;
+             cout<<"dequeued sucessfully"<<endl;
+            //delete node;
+            return node;
+        }
+    }
+    int size1()
+    {
+        return size;
+    }
+
+}; 
+int main()
+{
+    Queue q1;
+    q1.enqueue(5);
+    q1.enqueue(8);
+    QNode *n=q1.dequeue();
+    cout<<"dequeue = "<<n->key<<endl;
+    n=q1.dequeue();
+    cout<<"dequeue = "<<n->key<<endl;
+    q1.enqueue(1);
+    q1.enqueue(30);
+    q1.print();
+    
+    return 0;
+}
diff --git a/Linear_DS/stack.cpp b/Linear_DS/stack.cpp
new file mode 100755
index 0000000..32fce1b
--- /dev/null
+++ b/Linear_DS/stack.cpp
@@ -0,0 +1,97 @@
+#include<iostream>
+using namespace std;
+class QNode
+{
+    public:
+    int key;
+    QNode *next;
+    QNode(int data)
+    {   
+        this->key=data;
+        this->next=NULL;
+    }
+};
+class Stack 
+{ 
+	public:
+    QNode *top;
+    int size;
+    Stack()
+    {
+        this->top=NULL;
+    }
+    void push(int val)
+    {
+        QNode* node=new QNode(val);
+        QNode* temp=NULL;
+        node->next=nullptr;
+        if(top==nullptr)
+        {
+            top=node;
+            top->next=nullptr;
+        }
+        else
+        {
+            temp=top;
+            top=node;
+            top->next=temp;
+        }
+        size++;
+        //cout<<"poped sucessfully"<<endl;
+    }
+    void print()
+    {
+        QNode *temp=top;
+        while(temp!=NULL)
+        {
+            cout<<temp->key<<" ";
+            temp=temp->next;
+        }
+        cout<<endl;
+    }
+    ~Stack()
+    {
+        QNode *node;
+        while(top!=NULL)
+        {
+            node=top;
+            //cout<<"hii"<<endl;
+            top=top->next;
+            delete node;
+        }
+        top=NULL;
+    }
+    QNode *pop()
+    {
+        if(top==NULL)
+            return NULL;
+        else
+        {
+            QNode* node=top;
+            top=top->next;
+            size--;
+            //cout<<"poped sucessfully"<<endl;
+            return node;
+        }
+    }
+    int size1()
+    {
+        return size;
+    }
+
+}; 
+int main()
+{
+    Stack q1;
+    q1.push(5);
+    q1.push(8);
+    QNode *n=q1.pop();
+    cout<<"dequeue = "<<n->key<<endl;
+    n=q1.pop();
+    cout<<"dequeue = "<<n->key<<endl;
+    q1.push(1);
+    q1.push(30);
+    q1.print();
+    
+    return 0;
+}
\ No newline at end of file
diff --git a/spojprobs b/spojprobs
new file mode 160000
index 0000000..7f0086a
--- /dev/null
+++ b/spojprobs
@@ -0,0 +1 @@
+Subproject commit 7f0086abcd0a0977782db09f2d4ea069b28a7825