templates | Student Projects

C++ program to implement stack using Linked List

Editorial Team — Thu, 03 Feb 2011 10:50:47 +0000

#include 
template
class Node
{
	friend LinkedStack;
	private:
	T data;
	Node *link;
};
template
class LinkedStack {
	public:
		LinkedStack() {top = 0;}
		~LinkedStack();
		int IsEmpty() const {return top == 0;}
		T Top() const;
		LinkedStack& Add(const T& x);
		LinkedStack& Delete(T& x);
	private:
		Node *top; 
};
	template
LinkedStack::~LinkedStack()
{// Stack destructor..
	Node *next;
	while (top) {
		next = top->link;
		delete top;
		top = next;
	}
}
template
T LinkedStack::Top() const
{// Return top element.
	if (IsEmpty()) cout<<"Stack empty:";
	else
		return top->data;
}
	template
LinkedStack& LinkedStack::Add(const T& x)
{// Add x to stack.
	Node *p = new Node;
	p->data = x;
	p->link = top;
	top = p;
	return *this;
}
	template
LinkedStack& LinkedStack::Delete(T& x)
{// Delete top element and put it in x.
	if (IsEmpty()) 
	{
		cout<<"Stack empty";
		return *this;
	}
	x = top->data;
	Node *p = top;
	top = top->link;
	delete p;
	return *this;
}
void main(void)
{
	int x;
	LinkedStack S;
	S.Add(1).Add(2).Add(3).Add(4);
	cout << "Stack should be 1234" << endl;
	cout << "Stack top is " << S.Top() << endl;
	S.Delete(x);
	cout << "Deleted " << x << endl;
	S.Delete(x);
	cout << "Deleted " << x << endl;
	S.Delete(x);
	cout << "Deleted " << x << endl;
	S.Delete(x);
	cout << "Deleted " << x << endl;
}

The post C++ program to implement stack using Linked List first appeared on Student Projects.

C++ program to implement Stack using Formula Based Representation

Editorial Team — Thu, 03 Feb 2011 10:47:47 +0000

#include
#include
template
class Stack
{
	public:
		Stack(int MaxStackSize);
		~Stack(){delete[] S;}
		int IsEmpty()const{return top==-1;}
		int IsFull()const{return top==MaxTop;}
		T Peek()const;
		void Push(T);
		T Pop();
		void Display();
	private:
		int top; //current top of stack
		int MaxTop; //max val for top
		T *S; //element array
};
	template
Stack::Stack(int MaxStackSize)
{
	//stack constructor
	MaxTop=MaxStackSize-1;
	S=new T[MaxStackSize];
	top=-1;
}
template
T Stack::Peek()const
{
	if(IsEmpty()) //top fails
		return 0;
	else
		return S[top];
}
	template
void Stack::Push(T x)
{
	if(IsFull())
		cout<<"no memory()"; //add fails
	else
	{
		S[++top]=x;
	}
}
	template
T Stack::Pop()
{
	T x;
	if(IsEmpty())
	{
		cout<<"stack is empty\n";
		return -1;
	}
	else
	{
		x=S[top--];
		return x;
	}
}
	template
void Stack::Display()
{
	if(IsEmpty())
		cout<<"out of bounds"; //delete fails
	else
		for(int i=top;i>=0;i--)
		{
			cout<iobj(5);
	int ch,x;
	clrscr();
	do
	{
		menu();
		cout<<"enter the choice\n";
		cin>>ch;
		switch(ch)
		{
			case 1:
				cout<<"enter x value to push into the stack\n";
				cin>>x;
				iobj.Push(x);
				break;
			case 2:
				x=iobj.Pop();
				if(x!=-1)
					cout<<"poped value is \t"<=1&&ch<=4);
	getch();
}

The post C++ program to implement Stack using Formula Based Representation first appeared on Student Projects.

Program to represent Indirect Addressing of Linear List using Templates

Editorial Team — Sat, 29 Jan 2011 10:49:31 +0000

#include
#include
template
class IndirectList
{
	private:
		int length;
		int MaxSize;
		T**table; 
	public:
		IndirectList(int MaxLinearSize=10);  	
		~IndirectList();//destructor
		int IsEmpty()const{return length==0;}
		int Length()const{return length;}
		int Find(int k,T&x)const;
		int Search(const T&x)const;
		void Delete(int k,T&x);

		void Insert(int k,const T&x);

		void Output()const;
};
	template
IndirectList::IndirectList(int MaxListSize)
{
	MaxSize=MaxListSize;
	table=new T*[MaxSize];
	length=0;
}
	template
IndirectList::~IndirectList()
{
	for(int i=0;i
int IndirectList::Find(int k,T&x)const
{
	if(k<1||k>length)
		return 0; //no kth element
	if(x==*table[k-1])
		return 1;
	else
		return 0;
}
template
int IndirectList::Search(const T&x)const
{
	for(int i=0;i
void IndirectList::Delete(int k,T&x)
{
	if(Find(k,x))
	{
		for(int i=k;i
void IndirectList::Insert(int k,const T&x)
{
	if(k<0||k>length)
		cout<<"out of bounds\n";
	if(length==MaxSize)
		cout<<"no memory\n";
	for(int i=length-1;i>=k;i--)
		table[i+1]=table[i];
	table[k]=new T;
	*table[k]=x;
	length++;
}
template
void IndirectList::Output()const
{
	if(IsEmpty())
		cout<<"list is empty\n";
	else
		for(int i=0;iobj;
	do
	{
		menu();
		cout<<"enter choice\n";
		cin>>choice;
		switch(choice)
		{
			case 1:
				len=obj.Length();
				if(len==0)
					cout<<"List is empty\n";
				else
					cout<<"length of Indirectlist is "<>k>>x;
				p=obj.Find(k,x);
				if(p==1)
					cout<<"found"<>x;
				p=obj.Search(x);
				if(p)
					cout<<"searching is sucessful and found at "<>k>>x;
				obj.Delete(k,x);
				break;
			case 5:
				cout<<"enter k,x(index and value)\n";
				cin>>k>>x;
				obj.Insert(k,x);
				break;
			case 6:
				cout<<"elements in the list are:\n\n";
				obj.Output();
				break;
			default:
				cout<<"invalid choice\n";
		}
	}
	while(choice>=1&&choice<=6);
	getch();
}

The post Program to represent Indirect Addressing of Linear List using Templates first appeared on Student Projects.

Program to implement linked representation of Linear list using templates

Editorial Team — Fri, 28 Jan 2011 10:47:11 +0000

#include
#include
#include
template
class ChainNode
{
	friend Chain;
	private:
	T data;
	ChainNode*link;
};
template
class Chain
{
	private:
		ChainNode*first; 
	public:
		Chain()
		{
			first=0;
		}
		~Chain();
		int IsEmpty()const;
		int Length()const;
		int Find(int k,T&x);
		int Search(const T&x);
		void Delete(int k,T&x);
		void Insert(int k,const T&x);
		void Output();
};
	template
Chain::~Chain()
{
	ChainNode*next;
	while(first)
	{
		next=first->link;
		delete first;
		first=next;
	}
}
template
int Chain::Length()const
{
	ChainNode*current=first;
	int len=0;
	while(current)
	{
		current=current->link;
		len++;
	}
	return len;
}
	template
int Chain::Find(int k,T&x)
	//set x to the kth element in the chain
	//return 0 if no kth element, return 1 otherwise
{
	if(k<1)
		return 0;
	ChainNode*current=first;
	int index=1; //index of current
	while(indexlink;
		index++;
	}
	if(current&&x==current->data)
		return 1;
	else
		return 0; //no kth element
}
	template
int Chain::Search(const T&x)
{
	ChainNode*current=first;
	int index=1; //index of current
	while(current&¤t->data!=x)
	{
		current=current->link;
		index++;
	}
	if(current)
	{
		return index;
	}
	else
		return 0;
}
	template
void Chain::Delete(int k,T&x)
{
	if(k<1||!first)
		cout<<"out of bounds\n"; //no kth element
	ChainNode*p=first;
	if(k==1) //p is already at k
		first=first->link; //remove
	else
	{
		ChainNode*q=first;
		for(int index=1;indexlink;
		}
		if(!q||!q->link)
			cout<<"the element doesnot exist\n";
		p=q->link;
		q->link=p->link; //remove from linked list
		//free node p
		delete p;
	}

}
	template
void Chain::Insert(int k,const T&x)
{
	if(k<0)
		cout<<"out of bounds\n"; //no kth element
	//p will be eventually to kth node
	ChainNode*p=first;
	for(int index=1;indexlink;
	if(k>0&&!p)
		cout<<"out of bounds\n"; //no kth element
	ChainNode*y=new ChainNode;
	y->data=x;
	if(k)
	{
		//insert after p
		y->link=p->link;
		p->link=y;
	}
	else
	{
		y->link=first;
		first=y;
	}
}
	template
void Chain::Output()
{
	ChainNode*p=first;
	while(p)
	{
		cout<data<<"\t";
		p=p->link;
	}
}


void menu()
{
	cout<<"\n MENU\n";
	cout<<"1.Length\n";
	cout<<"2.Find\n";
	cout<<"3.Search\n";
	cout<<"4.Delete\n";
	cout<<"5.Insert\n";
	cout<<"6.Output\n";
}
void main()
{
	int choice;
	int k,x,len,p;
	clrscr();
	Chainobj;
	do
	{
		menu();
		cout<<"enter choice\n";
		cin>>choice;
		switch(choice)
		{
			case 1:
				len=obj.Length();
				if(len==0)
					cout<<"List is empty\n";
				else
					cout<<"length of linkedlist is "<>k>>x;
				p=obj.Find(k,x);
				if(p==1)
					cout<<"found"<>x;
				p=obj.Search(x);
				if(p)
					cout<<"searching is sucessful and found at "<>k>>x;
				obj.Delete(k,x);
				break;
			case 5:
				cout<<"enter k,x(index and value)\n";
				cin>>k>>x;
				obj.Insert(k,x);
				break;
			case 6:
				cout<<"elements in the list are:\n\n";
				obj.Output();
				break;
			default:
				cout<<"invalid choice\n";
		}
	}
	while(choice>=1&&choice<=6);
	getch();
}

The post Program to implement linked representation of Linear list using templates first appeared on Student Projects.

Program for Array Based Representation of Linear List using templates

Editorial Team — Thu, 27 Jan 2011 10:41:23 +0000

#include
#include
template
class LinearList
{
	private:
		int length;
		int MaxSize;
		T *element;
	public:
		LinearList(int MaxLinearSize=10);
		~LinearList(){delete[]element;}
		int isEmpty()const{return length==0;}
		int Length()const{return length;}
		int Find(int k,T&x)const;
		int Search(const T&x)const;
		void Delete(int k,T&x);
		void Insert(int k,const T&x);
		void Output()const;
};
	template
LinearList::LinearList(int MaxListSize)
{
	MaxSize=MaxListSize;
	element=new T[MaxSize];
	length=0;
}
template
int LinearList::Find(int k,T&x)const
{
	if(k<1||k>length)
		return 0;
	x=element[k-1];
	return 1;
}
template
int LinearList::Search(const T&x)const
{
	for(int i=0;i
void LinearList::Delete(int k,T&x)
{
	if(Find(k,x))
	{
		for(int i=k;i
void LinearList::Insert(int k,const T&x)
{
	if(k<0||k>length)
		cout<<"out of bounds\n";
	if(length==MaxSize)
		cout<<"no memory\n";
	for(int i=length-1;i>=k;i--)
		element[i+1]=element[i];
	element[k]=x;
	length++;
}
template
void LinearList::Output()const
{
	if(isEmpty())
		cout<<"list is empty\n";
	else
		for(int i=0;i obj;
	do
	{
		menu();
		cout<<"enter choice\t";
		cin>>ch;
		switch(ch) {
			case 1:
				len=obj.Length();
				if(len==0)
					cout<<"List is empty\n";
				else
					cout<<"length of linearlist is "<>k>>x;
				p=obj.Find(k,x);
				if(p==1)
					cout<<"found"<>x;
				p=obj.Search(x);
				if(p)
					cout<<"searching is sucessful and found at"<>k>>x;
				obj.Delete(k,x);
				break;
			case 5:
				cout<<"enter k,x(index and value)\n";
				cin>>k>>x;
				obj.Insert(k,x);
				break;
			case 6:
				cout<<"elements in the list are:\n\n";
				obj.Output();
				break;
			default:
				cout<<"invalid choice\n";
				break;
		}  } while(ch>=1&&ch<=6);
		getch();
}

The post Program for Array Based Representation of Linear List using templates first appeared on Student Projects.