Tech Blog

ORACLE - SQL Query - 3

noreply@blogger.com (Anonymous) — Thu, 30 Jan 2014 07:06:00 +0000

Query to display first n records of the table

Structure and data of the table i used

query to display first n records of the table. where &n is a substitution variable in oracle, whose values can be assigned at runtime, very much similar to scanf function in C language

rownum column i used here is a pseudo-column supplied from oracle with every table that you create. Be sure with the behaviour of rownum. check the below queries to understand the behaviour

ORACLE - SQL Query - 2

noreply@blogger.com (Anonymous) — Fri, 13 Dec 2013 11:37:00 +0000

Query to display 1st highest,2nd highest salary earners.

This is the table i am using here.

Query to display 1st highest earners

Query to display 2nd highest earners

ORACLE - SQL Query - 1

noreply@blogger.com (Anonymous) — Tue, 12 Nov 2013 07:15:00 +0000

custom strcpy function in c to copy a string

noreply@blogger.com (Anonymous) — Sun, 06 Oct 2013 15:05:00 +0000

#include<stdio.h>
#include<conio.h>
void mystrcpy(char *dest,const char*src)
{
while(*src)
{
*dest=*src;
src++;
dest++;
}
*dest='\0';
}
int main()
{
char str1[10]="Welcome";
char str2[10];
clrscr();
printf("\nEnter a string: ");
gets(str2);
puts(str1);
puts(str2);
//stcpy(str1,str2); -- way to call library function
mystrcpy(str1,str2);
puts(str1);
puts(str2);
return 0;
}

custom strcmp function in c to compare two strings

noreply@blogger.com (Anonymous) — Sun, 06 Oct 2013 15:03:00 +0000

#include<stdio.h>
#include<string.h>
#include<conio.h>
int mystrcmp(const char*s1,const char*s2)
{
int r=0;
while(*s1!='\0'||*s2!='\0')
{
if(*s1!=*s2)
{
r=(int)(*s1-*s2);
return r;
}
s1++;
s2++;
}
return r;
}

int main()
{
char s1[10]="Hello";
char s2[10]="HeLlo";
int d;
clrscr();
puts(s1);
puts(s2);
//d=strcmp(s1,s2);
d=mystrcmp(s1,s2);
printf("\nDiff is:%d",d);
getch();
return 0;
}

C program to find length of the string using custom strlen function

noreply@blogger.com (Anonymous) — Sun, 06 Oct 2013 15:00:00 +0000

#include<stdio.h>
#include<conio.h>
int main()
{
char src[10];
int l;
int mystrlen(const char*);
clrscr();
printf("\nEnter a string: ");
gets(src);
//l=strlen(src);
l=mystrlen(src);
printf("\nString lenght:%d",l);
getch();
return 0;
}
int mystrlen(const char*src)
{
int c=0;
while(*src!='\0')
{
++c;
src++;
}
return c;
}

C program to print fibonacci series upto a given number

noreply@blogger.com (Anonymous) — Sun, 06 Oct 2013 14:49:00 +0000

#include<stdio.h>
#include<conio.h>
int main()
{
int m=0,n=1,temp,a;
printf("enter the value upto which you want to print fibonacci numbers\n");
scanf("%d",&a);
printf("%d\n%d\n",m,n);
while(n<a)
{
temp=m;
m=n;
n=temp+n;
while(n<a)
{
printf("%d\n",n);
break;
}
}
_getch();
return 0;
}

C program to find gcd of N inputs

noreply@blogger.com (Anonymous) — Sun, 06 Oct 2013 14:47:00 +0000

#include<stdio.h>
#include<conio.h>
#define size 100
int Gcd(int *);
int n=0;
int main()
{
int x[size],z=0;
printf("\n for how many values do u want to find gcd????::::");
scanf("%d",&n);
printf("\n enter %d values to find gcd ...",n);
while(z<n)
{
scanf("%d",&x[z]);
z++;
}
x[n]=Gcd(x);
if(x[n]==-1)
{
printf("\n gcd doesn't exist....");
}
else if(x[n]==-2)
{

}
else
{
printf("gcd of given numbers is : %d",x[n]);
}
_getch();
return 0;
}
int Gcd(int *ptr)
{
int a[size],c,d,i=0,j=1,k=0,z=0;
while(k<n)
{
a[k]=*ptr;
ptr++;
k++;
}
while(z<n)
{
if(a[z]==0)
{
printf("\n gcd of the given numbers is : 0");
goto a;
}
z++;
}
while(i<n)
{
while(j<n)
{
if(a[i]>a[j])
{
c=a[i];
a[i]=a[j];
a[j]=c;
}
j++;
}
i++;
}
c=a[0];
d=n-1;
while(c>1)
{
while(a[d]%c==0)
{
if(d>1)
{
d--;
continue;
}
else
return c;
}
c--;
if(c==1)
return -1;
}
a:
return -2;
}

C program to reverse given number

noreply@blogger.com (Anonymous) — Sun, 06 Oct 2013 14:46:00 +0000

//reversing a number
#include<stdio.h>
#include<conio.h>
int main()
{
int sum=0,n;
printf("enter a number to reverse : ");
scanf("%d",&n);
while(n)
{
sum=sum*10+n%10;
n=n/10;
}
printf("%d",sum);
_getch();
return 0;
}

i/p : 1234
o/p : 4321

C program to swap two integer numbers without using third variable

noreply@blogger.com (Anonymous) — Sun, 06 Oct 2013 14:45:00 +0000

#include<stdio.h>
#include<conio.h>
int main()
{
float a,b;
printf("enter the values to swap \n");
scanf("%f%f",&a,&b);
printf("before swapping a:%f b:%f\n",a,b);
/*a=a+b;
b=a-b;
a=a-b;*/
a=a*b;
b=a/b;
a=a/b;
printf("After swapping a:%f b:%f\n",a,b);
_getch();
return 0;
}

C++ code to implement stack using arrays

noreply@blogger.com (Anonymous) — Sun, 06 Oct 2013 14:43:00 +0000

#include<iostream>
using namespace std;
#include<conio.h>
#include<process.h>
template<class T>
class Stack
{
private:
int top,maxtop;
T *stack;
public:
Stack(int maxstacksize)
{
top=-1;
maxtop=maxstacksize;
stack=new T[maxtop];
}
~Stack()
{
delete[] stack;
}
int isfull();
int isempty();
void insertion();
void deletion();
void display();
void topmost();
};
template<class T>
int Stack<T>::isempty()
{
if(top==-1)
return 1;
else
return 0;
}
template<class T>
int Stack<T>::isfull()
{
if(top==maxtop-1)
return 1;
else
return 0;
}
template<class T>
void Stack<T>::topmost()
{
if(isempty())
cout<<"\nstack is underflow.......";
else
cout<<"\n topmost element of the stack is:"<<stack[top];
}
template<class T>
void Stack<T>::display()
{
if(isempty())
cout<<"\n stack is underflow..........";
else
cout<<"\nstack elements are :";
for(int i=0;i<=top;i++)
{
cout<<"\t";
cout<<stack[i];
}
}
template<class T>
void Stack<T>::insertion()
{
T ele;
if(isfull())
cout<<"\n stack is overflow.........";
else
{
cout<<"\n enter the element u want to insert :";
cin>>ele;
stack[++top]=ele;
}
}
template<class T>
void Stack<T>::deletion()
{
if(isempty())
cout<<"\n stack is underflow..........";
else
cout<<"\n deleted element is:"<<stack[top--];
}
int main()
{
int choice;
Stack<int> s(10);
do
{
cout<<"\n1.insertion\n2.deletion\n3.topmost\n4.display\n5.exit\n";
cout<<"\n enter ur choice :";
cin>>choice;
switch(choice)
{
case 1:
s.insertion();
break;
case 2:
s.deletion();
break;
case 3:
s.topmost();
break;
case 4:
s.display();
break;
case 5:
_exit(0);
}
}while(choice<=5);
_getch();
return 0;
}

C++ code to implement stack using linked list

noreply@blogger.com (Anonymous) — Sun, 06 Oct 2013 14:43:00 +0000

/*top was compared to null instead of initializing to null*/
#include<iostream>
using namespace std;

template<class T>
class node
{
public:
T data;
node *link;
};
template<class T>
class stack
{
node<T> *top;
public:
stack();
~stack();
int isempty();
void push(T x);
T pop();
T topmost();
void display();
};
template<class T>
stack<T>::stack()
{
top=NULL;/*initially was top==null*/
}
template<class T>
int stack<T>::isempty()
{
if(top==NULL)
return 1;
else
return 0;
}
template<class T>
void stack<T>::push(T x)
{
node<T> *temp;
temp=new node<T>;
temp->data=x;
temp->link=top;
top=temp;
}
template<class T>
T stack<T>::pop()
{
node<T> *temp;
T x;
if(isempty())
return -1;
else
{
temp=top;
top=top->link;
x=temp->data;
delete temp;
return x;
}
}
template<class T>
void stack<T>::display()
{
node<T> *temp;
if(isempty())
{
cout<<"\n stack is empty ";
}
else
{
cout<<"\nthe contents are :";
temp=top;
while(temp!=NULL)
{
cout<<temp->data;
temp=temp->link;
}
}
}
template<class T>
T stack<T>::topmost()
{
if(isempty())
return -1;
else
return(top->data);
}
template<class T>
stack<T>::~stack()
{
node<T> *temp=NULL;
while(top!=NULL)
{
temp=top;
top=top->link;
delete temp;
}
}
int main()
{
int ch,x;

stack<int> a;
do
{
cout<<"\n 1.insertion \n 2.deletion \n 3.display \n 4.topmost element \n 5.exit \n";
cout<<"\n enter ur choice :";
cin>>ch;
switch(ch)
{
case 1:
cout<<"enter data element :\n";
cin>>x;
a.push(x);
break;
case 2:
x=a.pop();
if(x==-1)
cout<<"\n stack is empty....";
else
cout<<"\n the deleted value is :"<<x<<"\n";
break;
case 3:
a.display();
break;
case 4:
x=a.topmost();
if(x==-1)
cout<<"\n stack is empty..";
else
cout<<"\n the topmost value is :"<<x<<"\n";
break;
case 5:
break;
}
}while(ch<5);
return 0;

}

C++ code to implement single linked list

noreply@blogger.com (Anonymous) — Sun, 06 Oct 2013 14:41:00 +0000

#include<iostream>

using namespace std;

#include<conio.h>

template<class T>

class node

{

public:

T data;

node<T> *link;

};

template<class T>

class list

{

private:

node<T> *first;

public:

list();

~list();

void createlist();

void deletion();

void insertion();

void display();

};

template<class T>

list<T>::list()

{

first=NULL;

}

template<class T>

list<T>::~list()

{

node<T> *next;

while(first)

{

next=first->link;

delete first;

first=next;

}

}

template<class T>

void list<T>::createlist()

{

T a;

node<T> *cur,*ptr;

cout<<"\nenter data for new node:";

cin>>a;

while(a)

{

cur=new node<T>;

cur->data=a;

cur->link=NULL;

if(first==NULL)

first=cur;

else

ptr->link=cur;

ptr=cur;

cout<<"\nenter data for new node :";

cin>>a;

}

}

template<class T>

void list<T>::insertion()

{
node<T> *cur,*ptr;

T ele;

char ch;

ptr=first;

cur=new node<T>;

cout<<"\n enter data for new node :";

cin>>cur->data;

cur->link=NULL;

cout<<"\n do u want to insert first [y/n]:";

cin>>ch;

if(ch=='Y'||ch=='y')

{

cur->link=first;

first=cur;

}

else

{

cout<<"\n after which element do u want to insert :";

cin>>ele;

while(ptr!=NULL)

{

if(ptr->data==ele)

{

cur->link=ptr->link;

ptr->link=cur;

break;

}

else

{

ptr=ptr->link;

}

}

}

}

template<class T>

void list<T>::deletion()

{

T ele;

char ch;

node<T> *ptr,*ptr1;

if(first==NULL)

{

cout<<"\nlist is empty .....";

}

else

{

ptr=first;

cout<<"\ndo u want to delete first element [y/n]:";

cin>>ch;

if(ch=='y'||ch=='Y')

{

first=first->link;

delete ptr;

}

else

{

cout<<"\nwhich element do u want to delete :";

cin>>ele;

while(ptr!=NULL)

{

if(ptr->link->data==ele)

{

ptr1=ptr->link;

ptr->link=ptr1->link;

delete ptr1;

return;

}

else

{

ptr=ptr->link;

}

}

}

}

}

template<class T>

void list<T>::display()

{

node<T> *ptr;

if(first==NULL)

{

cout<<"\n list is empty..";

}

else

{

ptr=first;

while(ptr!=NULL)

{

cout<<ptr->data<<" ";

ptr=ptr->link;

}

}

}

int main()

{

int n;

list <int> l;

l.createlist();

do

{

cout<<"\n 1.insertion \n2.deletion \n3.display \n4.exit \n";

cout<<"\n enter ur option : ";

cin>>n;

switch(n)

{

case 1: l.insertion();

break;

case 2: l.deletion();

break;

case 3: l.display();

break;

case 4:
exit(0);

break;

}

}while(n<=4);

_getch();

return 0;

}

Selection Sort code in C++

noreply@blogger.com (Anonymous) — Sun, 06 Oct 2013 14:40:00 +0000

//selection sorting
#include<iostream.h>
using namespace std;
#include<conio.h>
template <class T>
void selectionsort(T a[],int n)
{
int i,j,temp;
for(i=0;i<n;i++)
{
for(j=i+1;j<n;j++)
{
if(a[j]<a[i])
{
temp=a[i];
a[i]=a[j];
a[j]=temp;
}
}
}
}
int main()
{
int a[50],i,n;
cout<<"enter number of elements do u want to sort :";
cin>>n;
cout<<"enter elements to sort:";
for(i=0;i<n;i++)
{
cin>>a[i];
}
selectionsort(a,n);
cout<<"after sorting the elements are....\n";
for(i=0;i<n;i++)
{
cout<<a[i]<<"\n";
}
_getch();
return 0;
}

Quick Sort code in C++

noreply@blogger.com (Anonymous) — Sun, 06 Oct 2013 14:39:00 +0000

//Quick Sort Algorithm
#include<iostream>
using namespace std;
#include<conio.h>
//Function for partitioning the array

int Partition(int low,int high,int arr[])
{
int i,high_var=high,low_var=low,pivot,temp;
pivot=arr[low];
while(low<high)
{
while(arr[low_var]<pivot)
{
low_var++;
}
while(arr[high_var]>pivot)
{
high_var--;
}
if(low_var<high_var)
{
temp=arr[low_var];
arr[low_var]=arr[high_var];
arr[high_var]=temp;
}
else
{
temp=pivot;
pivot=arr[low_var];
arr[low_var]=temp;
break;
}
}
return high_var;
}
void Quick_sort(int low,int high,int arr[])
{
int Piv_index,i;
if(low<high)
{
Piv_index=Partition(low,high,arr);
Quick_sort(low,Piv_index-1,arr);
Quick_sort(Piv_index+1,high,arr);
}
}
int main()
{
int a[100],n,low,high,i;
cout<<"Enter number of elements:";
cin>>n;
//a=new int[n];
cout<<"enter the elements:";
for(i=0;i<n;i++)
cin>>a[i];
//for(i=0;i<n;i++)
//a[i]=rand()%100;
cout<<"\nInitial Order of elements:\n";
for(i=0;i<n;i++)
{
cout<<a[i]<<"\t";
}
high=n-1;
low=0;
Quick_sort(low,high,a);
cout<<"\nFinal Array After Sorting:\n";
for(i=0;i<n;i++)
{
cout<<a[i]<<"\t";
}
_getch();
return 0;
}

Queue program using arrays

noreply@blogger.com (Anonymous) — Sun, 06 Oct 2013 14:39:00 +0000

//c++ code
#include<iostream>
using namespace std;
#include<conio.h>
#include<process.h>
template<class T>
class Queue
{
private:
int front,rear;
T *queue;
int maxsize;
public:
Queue(int maxqueuesize)
{
front=0;
rear=-1;
maxsize=maxqueuesize;
queue=new T[maxsize];
}
~Queue()
{
delete[] queue;
}
int isempty();
int isfull();
void insertion();
void deletion();
void _front();
void _rear();
void display();
};
template<class T>
int Queue<T>::isempty()
{
if(front==0&&rear==-1)
return 1;
else
return 0;
}
template<class T>
int Queue<T>::isfull()
{
if(rear==maxsize-1)
return 1;
else
return 0;
}
template<class T>
void Queue<T>::_front()
{
if(isempty())
cout<<"\n queue is empty.............";
else
cout<<"\n front element of the queue is:"<<queue[front];
}
template<class T>
void Queue<T>::_rear()
{
if(isempty())
cout<<"\n queue is empty.............";
else
cout<<"\n rear element of the queue is:"<<queue[rear];
}
template<class T>
void Queue<T>::insertion()
{
T ele;
if(isfull())
cout<<"\n queue is full........";
else
{
cout<<"\n enter the element do u want to insert :";
cin>>ele;
queue[++rear]=ele;
}
}
template<class T>
void Queue<T>::deletion()
{
if(isempty())
cout<<"\n queue is empty........";
else
cout<<"\n the deleted element of the queue is :"<<queue[front++];
}
template<class T>
void Queue<T>::display()
{
if(isempty())
cout<<"\n queue is empty.........";
else
{
cout<<"\n queue elements are :";
for(int i=front;i<=rear;i++)
{
cout<<"\t"<<queue[i];
}
}
}
int main()
{
int ch;
Queue<int> q(10);
do
{
cout<<"\n 1.insertion \n 2.deletion \n 3.front \n 4.rear \n 5.display \n 6.exit \n";
cout<<"enter ur choice:";
cin>>ch;
switch(ch)
{
case 1:
q.insertion();
break;
case 2:
q.deletion();
break;
case 3:
q._front();
break;
case 4:
q._rear();
break;
case 5:
q.display();
break;
case 6:
_exit(0);
}
}while(ch<=6);
_getch();
return 0;
}

C++ program to evaluate postfix expression

noreply@blogger.com (Anonymous) — Sun, 06 Oct 2013 14:37:00 +0000

#include<iostream>
using namespace std;
#include<conio.h>
#include<string.h>
template<class T>
class evaluation
{
private:
T postfix[20];
int stack[20],top;
public:
evaluation()
{
top=-1;
}
void getpostfixexpr();
void calculate();
void display();
};
template<class T>
void evaluation<T>::getpostfixexpr()
{
cout<<"\n enter the postfix expression :";
cin>>postfix;
}
template<class T>
void evaluation<T>::display()
{
cout<<"\n the calculate value is :"<<stack[top];
}
template<class T>
void evaluation<T>::calculate()
{
int l=strlen(postfix);
int k=l;
for(int i=0;i<k;i++)
{
int x;
if((postfix[i]>='a'&&postfix[i]<='z')||(postfix[i]>='A'&&postfix[i]<='Z'))
{
cout<<"\n enter the value of "<<postfix[i]<<":";
cin>>x;
stack[++top]=x;
}
else
{
int a=stack[top];
int b=stack[top-1];
switch(postfix[i])
{
case '+':
stack[top-1]=b+a;
top--;
break;
case '-':
stack[top-1]=b-a;
top--;
break;
case '*':
stack[top-1]=b*a;
top--;
break;
case '/':
stack[top-1]=b/a;
top--;
break;
}
}
}
}
int main()
{
evaluation<char> e;
e.getpostfixexpr();
e.calculate();
e.display();
_getch();
return 0;
}

Merge Sort program in C++

noreply@blogger.com (Anonymous) — Sun, 06 Oct 2013 14:36:00 +0000

#include<iostream>
using namespace std;
#include<conio.h>
template<class T>
void m_sort(T numbers[],T temp[],int left,int right);
template<class T>
void mergesort(T numbers[],T temp[],int array_size)
{
m_sort<T>(numbers,temp,0,array_size-1);
}
template<class T>
//void merge(T numbers[],T temp[],int left,int mid,int right);
//template<class T>
void m_sort(T numbers[],T temp[],int left,int right)
{
int mid;
if(right>left)
{
mid=(right+left)/2;
m_sort(numbers,temp,left,mid);
m_sort(numbers,temp,mid+1,right);
merge(numbers,temp,left,mid+1,right);
}
}
template<class T>
void merge(T numbers[],T temp[],int left,int mid,int right)
{
int i,left_end,num_elements,temp_pos;
left_end=mid-1;
temp_pos=left;
num_elements=right-left+1;
while((left<=left_end)&&(mid<=right))
{
if(numbers[left]<=numbers[mid])//(kept -numbers instead )
{
temp[temp_pos]=numbers[left];
temp_pos++;
left++;
}
else
{
temp[temp_pos]=numbers[mid];
temp_pos++;
mid++;
}
}
while(left<=left_end)
{
temp[temp_pos]=numbers[left];
left++;
temp_pos++;
}
while(mid<=right)
{
temp[temp_pos]=numbers[mid];
mid++;
temp_pos++;
}
for(i=0;i<=num_elements;i++)
{
numbers[right]=temp[right];
right--;
}
}
int main()
{
int a[20],b[20],n;
cout<<"\n enter the value of n:";
cin>>n;
cout<<"\nenter n elements:";
for(int i=0;i<n;i++)
{
cin>>a[i];
}
mergesort(a,b,n);
cout<<"\n sorted elements are :";
for(int i=0;i<n;i++)
{
cout<<"\t"<<a[i]<<"\t";
}
_getch();
return 0;
}

Insertion Sort program in C++

noreply@blogger.com (Anonymous) — Sun, 06 Oct 2013 14:35:00 +0000

//insertion sort
#include<iostream>
using namespace std;
#include<conio.h>
template<class T>
void insertionsort(T a[],int n)
{
for(int i=1;i<n;i++)
{
T temp=a[i];
int j;
for(j=i-1;j>=0&&temp<a[j];j--)
{
a[j+1]=a[j];
}
a[j+1]=temp;
}
}
int main()
{
int a[50],i,n;
cout<<"enter number of elements do u want to sort :";
cin>>n;
cout<<"enter elements to sort:";
for(i=0;i<n;i++)
{
cin>>a[i];
}
insertionsort(a,n);
cout<<"after sorting the elements are....";
for(i=0;i<n;i++)
{
cout<<a[i]<<"\n";
}
_getch();
return 0;
}

Brinay Tree Traversals program in C++

noreply@blogger.com (Anonymous) — Sun, 06 Oct 2013 14:34:00 +0000

#include <iostream>
using namespace std;
template <class T>
class BinaryTree
{
BinaryTree<T> *left;
T data;
BinaryTree<T> *right;
public :
BinaryTree()
{
left=right=NULL;
}
void create();
void preorder();
void inorder();
void postorder();
};
template <class T>
void BinaryTree<T> :: create()
{
char opt;
cout << "\n Enter the element : ";
cin >> data;
cout << "\n Is there left child for " << data << " [y/n] ? : ";
cin >> opt;
if (opt=='y')
{
left = new BinaryTree<T>;
left->create();
}
cout << "\n Is there right child for " << data << " [y/n] ? : ";
cin >> opt;
if (opt=='y')
{
right = new BinaryTree<T>;
right->create();
}
}
template <class T>
void BinaryTree<T> :: preorder()
{
if (this!=NULL)
{
cout << data << " ";
left->preorder();
right->preorder();
}
}
template <class T>
void BinaryTree<T> :: inorder()
{
if (this!=NULL)
{
left->inorder();
cout << data << " ";
right->inorder();
}
}
template <class T>
void BinaryTree<T> :: postorder()
{
if (this!=NULL)
{
left->postorder();
right->postorder();
cout << data << " ";
}
}
int main()
{
BinaryTree<char> *Root;
Root=NULL;
int ch;
do
{
cout << "Binary Tree Operation Menu\n";
cout << "1. Creation\n";
cout << "2. Preorder Traversal\n";
cout << "3. InOrder Traversal\n";
cout << "4. PostOrder Traversal\n";
cout << "5. Exit\n\n";
cout << "Enter Your Choice [1..5] ? : ";
cin >> ch;
switch(ch)
{
case 1 :
Root = new BinaryTree <char>;
Root->create();
break;
case 2 :
Root->preorder();
break;
case 3 :
Root->inorder();
break;
case 4 :
Root->postorder();
break;
case 5 :
break;
default :
cout << "Invalid Choice ....";
}
}while (ch!=5);
return 0;
}

Heap Sort Program in C++

noreply@blogger.com (Anonymous) — Sun, 06 Oct 2013 14:32:00 +0000

#include<iostream>
using namespace std;
#include<conio.h>
template<class T>
void heapsort(T a[],int n)
{
int x;
for(int i=1;i<=n;i++)
{
insert(a,i);
}
for(int i=n;i>=1;i--)
{
delmax(a,i,x);
a[i]=x;
}
}
template<class T>
int insert(T a[],int n)
{
int i=n;
int item=a[n];
while((i>1)&&(a[i/2]<item))
{
a[i]=a[i/2];
i=i/2;

}
a[i]=item;
return 1;
}
template<class T>
int delmax(T a[],int n,int &x)
{
if(n==0)
{
cout<<"heap is empty:";
return 0;
}
x=a[1];
a[1]=a[n];
adjust(a,1,n-1);
return 1;
}
template<class T>
void adjust(T a[],int i,int n)
{
int j=2*i;
int item=a[i];
while(j<=n)
{
if((j<n)&&(a[j]<a[j+1]))
{
j++;
}
if(item>a[j])
{
break;
}
a[j/2]=a[j];
j=2*j;
}
a[j/2]=item;
}
int main()
{
int a[20],n;
cout<<"\nenter the value :";
cin>>n;
cout<<"\n enter the elements:";
for(int i=1;i<=n;i++)
{
cin>>a[i];
}
cout<<"\nbefore sorting:";
for(int i=1;i<=n;i++)
{
cout<<a[i]<<"\t";
}
heapsort(a,n);
cout<<"\n";
cout<<"\n elements after sorting:";
for(int i=1;i<=n;i++)
{
cout<<a[i]<<"\t";
}
_getch();
return 0;
}

Double Linked List program in C++

noreply@blogger.com (Anonymous) — Sun, 06 Oct 2013 14:32:00 +0000

//double linked list
#include<iostream>
using namespace std;
#include<conio.h>
#define double Double
template<class T>
class node
{
public:
T data;
node *left,*right;
};
template<class T>
class double
{
private:
node<T> *first;
public:
double()
{
first==NULL;
}
void createlist();
void deletion();
void insertion();
void display();
};
template<class T>
void double<T>::createlist()
{
int a;
node<T> *cur,*ptr;
first=NULL;
cout<<"\n enter data for new node:";
cin>>a;
while(a)
{
cur=new node<T>;
cur->data=a;
cur->left=cur->right=NULL;
if(first==NULL)
{
first=cur;
}
else
{
cur->left=ptr;
ptr->right=cur;
}
ptr=cur;
cout<<"\nenter data of node:";
cin>>a;
}
}
template<class T>
void double<T>::display()
{
node<T> *ptr,*last;
ptr=first;
last=NULL;
cout<<"\n the list is:\n:";
while(ptr!=NULL)
{
cout<<ptr->data<<"\t";
if(ptr->right==NULL)
last=ptr;
ptr=ptr->right;
}
cout<<"\n reverse list is:";
ptr=last;
while(ptr!=NULL)
{
cout<<ptr->data<<"\t";
ptr=ptr->left;
}
}
template<class T>
void double<T>::insertion()
{
T ele;
char ch;
node<T> *ptr,*cur;
ptr=first;
cur=new node<T>;
cout<<"enter data for the node:";
cin>>cur->data;
cur->right=cur->left=NULL;
cout<<"do u want to insert first [y/n]:";
cin>>ch;
if(ch=='y'||ch=='Y')
{
ptr->left=cur;
cur->right=ptr;
first=cur;
}
else
{
cout<<"after which element do u want to insert:";
cin>>ele;
while(ptr!=NULL)
{
if(ptr->data==ele)
{
cur->right=ptr->right;
cur->left=ptr;
ptr->right->left=cur;
ptr->right=cur;
break;
}
else
{
ptr=ptr->right;
}
}
}
}
template<class T>
void double<T>::deletion()
{
T ele;
char ch;
node<T> *ptr;
ptr=first;
cout<<"do u want to delete first element[y/n]:";
cin>>ch;
if(ch=='y'||ch=='Y')
{
ptr->right->left=NULL;
first=ptr->right;
}
else
{
cout<<"enter the element which u want to delete:";
cin>>ele;
while(ptr!=NULL)
{
if(ptr->data==ele)
{
ptr->right->left=ptr->left;
ptr->left->right=ptr->right;
break;
}
else
{
ptr=ptr->right;
}
}
}
}
int main()
{
int ch;
double<int> d;
d.createlist();
do
{
cout<<"\n 1.insert \n 2.delete \n 3.display \n 4.exit \n";
cout<<"enter the choice:";
cin>>ch;
switch(ch)
{
case 1: d.insertion();
break;
case 2: d.deletion();
break;
case 3: d.display();
break;
case 4:
break;
}
}while(ch<=4);
_getch();
return 0;
}

Circular Linked List program in C++

noreply@blogger.com (Anonymous) — Sun, 06 Oct 2013 14:28:00 +0000

//circular linked list

#include<iostream>

using namespace std;

#include<conio.h>

template<class T>

class node

{

public:

T data;

node<T> *link;

};

template<class T>

class list

{

private:

node<T> *first;

public:

list();

~list();

void createlist();

void deletion();

void insertion();

void display();

};

template<class T>

list<T>::list()

{

first=NULL;

}

template<class T>

list<T>::~list()

{

node<T> *next;

while(first)

{

next=first->link;

delete first;

first=next;

}

}

template<class T>

void list<T>::createlist()

{

T a;

node<T> *cur,*ptr;

first=NULL;

cout<<"\nenter data for new node:";

cin>>a;

while(a)

{

cur=new node<T>;

cur->data=a;

cur->link=NULL;

if(first==NULL)

first=cur;

else

ptr->link=cur;

ptr=cur;

cout<<"\nenter data for new node :";

cin>>a;

}

ptr->link=first;

}

template<class T>

void list<T>::insertion()

{
node<T> *cur,*ptr,*exmp;

T ele;

char ch;

ptr=exmp=first;

cur=new node<T>;

cout<<"\n enter data for new node :";

cin>>cur->data;

cur->link=NULL;

cout<<"\n do u want to insert first [y/n]:";

cin>>ch;

if(ch=='Y'||ch=='y')

{
while(ptr->link!=first)

{

ptr=ptr->link;

}

cur->link=first;

first=cur;

ptr->link=first;
}

else

{

cout<<"\n after which element do u want to insert :";

cin>>ele;

do

{

if(exmp->data==ele)

{

cur->link=exmp->link;

exmp->link=cur;

}

exmp=exmp->link;

}while(exmp!=first);

}

}

template<class T>

void list<T>::deletion()

{

T ele;

char ch;

node<T> *ptr,*ptr1;

ptr=ptr1=first;

cout<<"\ndo u want to delete first element [y/n]:";

cin>>ch;

if(ch=='y'||ch=='Y')

{

while(ptr->link!=first)

{
ptr=ptr->link;

}

first=ptr1->link;

ptr->link=first;

}

else

{

cout<<"\nwhich element do u want to delete :";

cin>>ele;

do

{

if(ptr1->link->data==ele)

{

ptr1->link=ptr1->link->link;

break;

}

ptr1=ptr1->link;

}while(ptr1!=first);

}

}

template<class T>

void list<T>::display()

{

node<T> *ptr;

ptr=first;

do

{
cout<<ptr->data<<"---->";

ptr=ptr->link;

}while(ptr!=first);

}

int main()

{

int n;

list <int> l;

l.createlist();

do

{

cout<<"\n 1.insertion \n2.deletion \n3.display \n4.exit \n";

cout<<"\n enter ur option : ";

cin>>n;

switch(n)

{

case 1: l.insertion();

break;

case 2: l.deletion();

break;

case 3: l.display();

break;

case 4:

break;

}

}while(n<=4);

_getch();

return 0;

}

Bubble Sorting program in C++

noreply@blogger.com (Anonymous) — Sun, 06 Oct 2013 14:27:00 +0000

//bubble sorting
#include<iostream>
using namespace std;
#include<conio.h>
template <class T>
void bubblesort(T a[],int n)
{
int i,j,temp;
for(i=0;i<n;i++)
{
for(j=0;j<n-i-1;j++)
{
if(a[j]<a[i])
{
temp=a[i];
a[i]=a[j];
a[j]=temp;
}
}
}
}
int main()
{
int a[50],i,n;
cout<<"enter number of elements do u want to sort :";
cin>>n;
cout<<"enter elements to sort:";
for(i=0;i<n;i++)
{
cin>>a[i];
}
bubblesort(a,n);
cout<<"after sorting the elements are....\n";
for(i=0;i<n;i++)
{
cout<<a[i]<<"\n";
}
_getch();
return 0;
}

Binary Search program in C++

noreply@blogger.com (Anonymous) — Sun, 06 Oct 2013 14:25:00 +0000

#include<iostream>
using namespace std;
#include<conio.h>
template<class T>
T binarysearch(T a[20],T n,T key)
{
int left,right,mid;
left=0;
right=n-1;
while(left<=right)
{
mid=(left+right)/2;
if(key==a[mid])
return mid;
else
if(key<a[mid])
right=mid-1;
else
left=mid+1;
}
return -1;
}
int main()
{
int a[20],n,key,p,i;
cout<<"\n enter number of elements:";
cin>>n;
cout<<"\n enter "<<n<<" values in ascending order :";
for(i=0;i<n;i++)
cin>>a[i];
cout<<"\n enter the key value:";
cin>>key;
p=binarysearch(a,n,key);
if(p!=-1)
cout<<"\n the element is found at "<<p+1<<" position";
else
cout<<"\n search is unsucessful......";
_getch();
return 0;
}