VIDYA NIKETAN
SCHOOL
PROGRAM FILE
NAME: ABHINAV VARSHNEY
CLASS: XII S2
ROLL NO: 7
SUBMITTED TO:MRS.SANDHYA SAINI
session: 2019-2020
1
ACKNOWLEDGEMENT
I Would like to express my special thank of gratitude
to my teacher Mrs. Sandhya Saini as well as our
principal Mr. Alok Varshney who gave me the golden
oppurtunity to do this wonderful program file,which
also hepled me in doing a lot of research and I came
to know about so many new things.
I am really thankfull to them.
Secondly,I would also like to thank my parents and
friends who helped me a lot in finishing this
program file within the limited time.
I am making this program file not only for marks but
to also increase my knowlede.
THANKS AGAIN TO ALL WHO HELPED ME
2
CERTIFICATE
This is to certify that this program file has been
made by ABHINAV VARSHNEY of class XII S2 under
the guidance of our computer science teacher
Mrs.Sandhay Saini and have been completed it
successfully.
Yours truly
ABHINAV VARSHNEY
3
QUESTIONS PAGE NO.
Q1.WRITE A PROGRAM TO ILLUSTRATE THE CONCEPT OF
#DEFINE AND TYPEDEF.
Q2.WRITE A PROGRAM TO ILLUSTRATE THE CONCEPT OF CLASS
Q3.WRITE A PROGRAM TO ILLUSTRATE THE CONCEPT OF
CONSTRUCTOR OVERLADING.
Q4.WRITE A PROGRAM TO SHOW THE WORKING OF COPY
CONSTRUCTOR.
Q5.WRITE A PROGRAM TO ILLUSTRATE THE CONCEPT OF
MULTIPLE INHERITANCE.
Q6.WRITE A PROGRAM TO ILLUSTRATE THE CONCEPT OF
DESTRUCTOR WITH MULTI LEVEL INHERITANCE.
Q7.WRITE A PROGRAM TO PERFORM BINARY SEARCH.
Q8.WRITE A PROGRAM TO SORT 1-D ARRAY USING INSERTION
SORT.
4
QUETIONS PAGE
NO.
Q9.WRITE A PROGRAM TO SORT AN ARRAY USING SELECTION
SORT.
Q10.WRITE A PROGRAM TO TAKE A 2D ARRAY OF SIZE 3X3 AND
PRINT SUM OF EACH ROW AND EACH COLUMN OF THAT ARRAY.
Q11.WRITE A PROGRAM TO COUNT HOW MANY VOWELS EXIST IN
A
FILE
Q12.WRITE A PROGRAM TO COUNT HOW MANY LINES STARTS
WITH LETTER ‘I’ EXIST IN THE FILE NAMED LINES.TXT.
Q13.WRITE A PROGRAM TO COUNT HOW MANY ME AND MY
FROM A FILE WORD.DAT.
Q14.WRITE A PROGRAM TO ADD,SEARCHAND DISPLAY THE
RECORD IN THE FILE BINARY_FILE.DAT
Q15. WRITE A PROGRAM TO ILLUSTRATE THE CONCEPT OF
TEELG(),TELLP(),SEEKG() AND SEEKP().
Q16.WRITE A PROGRAM TO IMPLEMENT STACK THROUGH ARRAY.
5
PAGE
QUESTIONS NO.
Q17.WRITE A PROGRAM TO IMPLEMENT STACK THROUGH LINKED LIST.
Q18.WRITE A PROGRAM TO IMPLEMENT QUEUE THROUH ARRAY.
Q19.WRITE A PRORGRAM TO IMPLEMENT QUEUE THROUGH LINKED
LIST.
Q20.WRITE A PROGRAM TO IMPLEMNT CIRCULAR QUEUE THROUGH
LINKED LIST.
Q21.WRITE A PROGRAM TO ILLUSTURATE THE CONCEPT OF POINTER.
6
Q1.WRITE A PROGRAM TO ILLUSTRATE THE CONCEPT OF #DEFINE AND
TYPEDEF.
ANS:
#include<iostream.h>
#include<conio.h>
#define PI 3.14
void main()
{ clrscr();
int r=0;
typedef float area;
cout<<"ENTER RADII\n";
cin>>r;
area a;
a=PI*r*r;
cout<<"AREA IS"<<a;
getch();
7
OUPUT 1:
Q2.WRITE A PROGRAM TO ILLUSTRATE THE CONCEPT OF CLASS.
ANS:
#include<iostream.h>
#include<conio.h>
class hotel
int roomno,toriph,days;
public:
8
void acceptinfo()
cin>>roomno>>toriph>>days;
void displayinfo()
cout<<"\n"<<roomno<<" "<<toriph<<" "<<days;
cout<<"\n"<<"TOTAL CHARGE="<<toriph*days;
};
void main()
{ clrscr();
hotel h;
h.acceptinfo();
h.displayinfo();
getch();
9
}
OUTPUT:
Q3.WRITE A PROGRAM TO ILLUSTRATE THE CONCEPT OF
CONSTRUCTOR OVERLADING.
ANS:
#include<iostream.h>
#include<conio.h>
class student
int rollno;
10
float percentage;
public:
void display()
cout<<"\nROLL NO."<<rollno;
cout<<"\nPERCENTAGE"<<percentage;
student()
rollno=0;
percentage=0.0;
student(float p)
percentage=p;
student(int rno,float p)
rollno=rno;
11
percentage=p;
};
void main()
{ clrscr();
student s1;
student s2(93.3);
s1.display();
s2.display();
getch();
OUTPUT:
12
Q4.WRITE A PROGRAM TO SHOW THE WORKING OF COPY
CONSTRUCTOR.
ANS:
#include<iostream.h>
#include<conio.h>
class ABC
int x,y;
public:ABC()
x=3;
y=4;
ABC(ABC&c)
x=c.x;
y=c.y;
void display()
13
cout<<x<<" "<<y;
};
void main()
{ clrscr();
ABC A;
ABC B(A);
B.display();
getch();
OUTPUT:
14
Q5.WRITE A PROGRAM TO ILLUSTRATE THE CONCEPT OF MULTIPLE
INHERITANCE.
ANS:
#include<conio.h>
#include<iostream.h>
class A
public:
int x,y;
void getA()
cin>>x>>y;
};
class B:public A
public:
int p,q;
15
void showB()
cout<<x<<" "<<y;
};
class C:public B
int c,d;
public:
void get()
getA();
showB();
};
void main()
{clrscr();
C c;
c.get();
getch();
16
}
OUTPUT:
Q6.WRITE A PROGRAM TO ILLUSTRATE THE CONCEPT OF DESTRUCTOR
WITH MULTI LEVEL INHERITANCE.
#include<iostream.h>
#include<conio.h>
class exterior
public:
int orderid;
exterior()
17
{
cout<<"\nCONSTRUCTOR EXTERIOR IS CALLED FIRST";
orderid=2;
};
class paint:public exterior
public:
int area;
paint()
cout<<"\nCONSTRUCTOR PAINT IS CALLED AT SECOND";
area=200;
};
class bill:public paint
public:
float rs;
bill()
18
{
cout<<"\nCONSTRUCTOR BILL IS CALLED AT LAST";
rs=2.3*area;
display()
cout<<"\norder id:"<<orderid;
cout<<"\n area"<<area;
cout<<"\n total cost"<<rs;
};
void main()
clrscr();
bill b;
b.display();
getch();
19
OUTPUT:
Q7.WRITE A PROGRAM TO PERFORM BINARY SEARCH.
#include<iostream.h>
#include<conio.h>
void BINARYSEARCH(int A[],int n);
void BINARYSEARCH(int A[],int n)
{ int num;
cout<<"ENETER ELEMENT TO SEARCH";
cin>>num;
int left,right,mid,flag=0,pos;
left=0;
20
right=n-1;
while((left<=right)&&(flag==0))
mid=(left+right)/2;
if(A[mid]==num)
flag=1;
pos=mid;
break;
else if(A[mid]>num)
right=mid-1;
else if(A[mid]<num)
left=mid-1;
21
if(flag==1)
cout<<"element found at position:"<<pos;
else
cout<<"element not found";
void main()
{clrscr();
int A[10],n=10;
cout<<"ENTER ELEMENTS OF ARRAY";
for(int i=0;i<10;i++)
cin>>A[i];
BINARYSEARCH(A,n);
getch();
22
}
OUTPUT:
Q8.WRITE A PROGRAM TO SORT 1-D ARRAY USING INSERTION SORT.
ANS:
#include<iostream.h>
#include<conio.h>
void insertionsort(int A[],int n);
void insertionsort(int A[],int n)
int temp,i,k,j;
for(i=1;i<n;i++)
{temp=A[i];
j=i-1;
23
while((temp<A[j])&&(j>=0))
A[j+1]=A[j];
j--;
A[j+1]=temp;
cout<<"SORTED ARRAY IS:";
for(int d=0;d<5;d++)
cout<<" "<<A[d];
void main()
{clrscr();
int A[5],n=5;
cout<<"ENTER ELEMENTS OF ARRAY";
24
for(int i=0;i<5;i++)
cin>>A[i];
insertionsort(A,n);
getch();
OUTPUT:
25
Q9.WRITE A PROGRAM TO SORT AN ARRAY USING SELECTION SORT.
ANS:
#include<iostream.h>
#include<conio.h>
void selectionsort(int A[],int n);
void selectionsort(int A[],int n)
int temp,i,j,small,pos;
for(i=0;i<n;i++)
small=A[i];
pos=i;
for(j=i+1;j<n;j++)
if(A[j]<small)
small=A[j];
pos=j;
26
}
temp=A[i];
A[i]=A[pos];
A[pos]=temp;
cout<<"SORTED ARRAY IS:";
for(int d=0;d<5;d++)
cout<<" "<<A[d];
void main()
{clrscr();
int A[5],n=5;
cout<<"ENTER ELEMENTS OF ARRAY";
for(int i=0;i<5;i++)
27
cin>>A[i];
selectionsort(A,n);
getch();
OUTPUT:
28
Q10.WRITE A PROGRAM TO TAKE A 2D ARRAY OF SIZE 3X3 AND PRINT
SUM OF EACH ROW AND EACH COLUMN OF THAT ARRAY.
ANS:
#include<conio.h>
#include<iostream.h>
void main()
{ clrscr();
int sum=0;
int arr[3][3];
cout<<"ENTER ELEMENTS FOR ARRAY\n";
for(int i=0;i<3;i++)
for(int j=0;j<3;j++)
cin>>arr[i][j];
cout<<" SUM OF EACH ROW:\n";
29
for(i=0;i<3;i++)
for(int j=0;j<3;j++)
sum=sum+arr[i][j];
cout<<"SUM OF "<<i+1<<" ROW IS:"<<sum<<"\n";
sum=0;
cout<<" SUM OF EACH COLUMN:\n";
for(i=0;i<3;i++)
for(int j=0;j<3;j++)
sum=sum+arr[j][i];
30
cout<<"SUM OF "<<i+1<<" COLUMN IS:"<<sum<<"\n";
getch();
OUTPUT:
Q11.WRITE A PROGRAM TO COUNT HOW MANY VOWELS EXIST IN A
FILE VOWELS.TXT
START,
START WITH FEAR,
START WITH VOICE TREMBLING,
START WITH HAND SHAKING,
31
JUST START AND NEVER STOP
ANS:
#include<iostream.h>
#include<conio.h>
#include<fstream.h>
#include<stdio.h>
void main()
{ clrscr();
int count1=0;
ifstream fin;
fin.open("vowels.txt");
char ch;
while(!fin.eof())
fin.get(ch);
if((ch=='a')||(ch=='e')||(ch=='i')||(ch=='o')||(ch=='u')||(ch=='A')||
(ch=='E')||(ch=='I')||(ch=='O')||(ch=='U'))
32
{
count1=count1+1;
fin.close();
cout<<"TOTAL NUMBER OF VOWELS IN THE FILE ARE:"<<count1;
getch();
OUTPUT:
Q12.WRITE A PROGRAM TO COUNT HOW MANY LINES STARTS WITH
LETTER ‘I’ EXIST IN THE FILE NAMED LINES.TXT.
FILE LINES.TXT
33
My name is abhinav.I am studying in 12 standard.I am preaparing for
IIT-JEE.Our India is a developing country
ANS:
#include<iostream.h>
#include<conio.h>
#include<fstream.h>
#include<ctype.h>
void main()
{ int count=0;
clrscr();
ifstream fin;
fin.open("lines.txt");
char line[20];
while(!fin.eof())
fin>>line;
if(line[0]=='I')
count=count+1;
34
}
fin.close();
cout<<"NUMBER OF LINES STRATING WITH LETTER I IS: ";
cout<<count;
getch();
OUTPUT:
Q13.WRITE A PROGRAM TO COUNT HOW MANY ME AND MY FROM A
FILE WORD.DAT.
FILE WORD.DAT:
i am abhinav.I am studying in 12 standard.
my father gives lot of surprises
ANS:
#include<iostream.h>
#include<conio.h>
35
#include<fstream.h>
#include<ctype.h>
#include<string.h>
void main()
{ int count=0;
clrscr();
ifstream fin;
fin.open("words.txt");
char word[4];
while(!fin.eof())
fin>>word;
if((strcmpi(word,"my")==0)||(strcmpi(word,"me")==0))
count=count+1;
fin.close();
cout<<"NUMBER OF WORDS ARE "<<count;
36
getch();
OUTPUT:
Q14.WRITE A PROGRAM TO ADD,SEARCHAND DISPLAY THE RECORD IN
THE FILE BINARY_FILE.DAT
ANS:
#include<iostream.h>
#include<conio.h>
#include<fstream.h>
#include<string.h>
class student
int rollno;
char name[44];
float marks;
37
public:
void readdata()
cin>>rollno>>marks>>name;
cout<<"\n";
void displaydata()
cout<<"\nrollno "<<rollno;
cout<<"\nname "<<name;
cout<<"\nmarks "<<marks;
int retrollno()
return rollno;
} };
void add()
int n,i=0;
38
cout<<"ENTER NUMBER OF RECORDS YOU WANT TO ENTER\n";
ofstream fout;
fout.open("student.dat",ios::binary||ios::app);
student s;
cin>>n;
for(i=0;i<n;i++)
s.readdata();
fout.write((char*)&s,sizeof(s));
cout<<" ALL RECORD ADDED SUCCESSFULLY ";
fout.close();
void search()
cout<<"\nENTER ROLL NO. YOU WANT TO SEARCH\n";
int rno,found=0;
cin>>rno;
ifstream fin("student.dat",ios::binary);
39
student f;
while(fin.read((char*)&f,sizeof(f)))
if(f.retrollno()==rno)
found=1;
f.displaydata();
getch();
break;
if(found==0)
cout<<"\nno results\n";
fin.close();
void main()
40
{
clrscr();
add();
search();
getch();
OUTPUT:
Q15. WRITE A PROGRAM TO ILLUSTRATE THE CONCEPT OF
TEELG(),TELLP(),SEEKG() AND SEEKP().
41
ANS:
#include<iostream.h>
#include<conio.h>
#include<fstream.h>
#include<string.h>
class student
int rollno;
char name[44];
float marks;
public:
void readdata()
cin>>rollno>>marks>>name;
cout<<"\n";
void displaydata()
cout<<"\nrollno "<<rollno;
cout<<"\nname "<<name;
42
cout<<"\nmarks "<<marks;
int retrollno()
return rollno;
} };
void add()
int n,i=0;
ofstream fout;
fout.open("student.dat",ios::binary||ios::app);
student s;
cout<<"type number of bytes to seek position of write pointer from
begining";
cin>>n;
fout.seekp(n,ios::beg);
s.readdata();
fout.write((char*)&s,sizeof(s));
43
cout<<"position of write ponter is"<<fout.tellp();
cout<<" RECORD ADDED SUCCESSFULLY ";
fout.close();
void search()
cout<<"\nENTER ROLL NO. YOU WANT TO SEARCH\n";
int rno,found=0;
cin>>rno;
ifstream fin("student.dat",ios::binary);
student f;
while(fin.read((char*)&f,sizeof(f)))
if(f.retrollno()==rno)
found=1;
f.displaydata();
44
getch();
cout<<"\nseeking read pointer\n";
fin.seekg(4*sizeof(f),ios::beg);
cout<<"now read pointer is at record"<<fin.tellg()/sizeof(f);
break;
if(found==0)
cout<<"\nno results\n";
fin.close();
void main()
clrscr();
add();
45
search();
getch();
OUTPUT:
Q16.WRITE A PROGRAM TO IMPLEMENT STACK THROUGH ARRAY.
ANS:
#include<iostream.h>
#include<conio.h>
#include<process.h>
#define size 5
class stack
{int a[size];
46
int top;
public:
stack()
top=-1;
void push(int);
int pop();
void display();
};
void stack::push(int item)
if (top==size-1)
cout<<"\nSTACK OVERFLOW";
else{
top=top+1;
a[top]=item;
47
}
int stack::pop()
if(top==-1)
cout<<"\nSTACK IS UNDER FLOW";
return-1;
else
{ int item=a[top];
cout<<"DETECTED ELEMENT";
top--;
return item;
void stack::display()
{int i;
for(i=top;i>=0;i--)
48
cout<<a[i]<<"\t";
void main()
{ clrscr();
stack s1;
int ch,val;
do
cout<<"\nMAIN MENU";
cout<<"\n1.PUSH ELEMENT";
cout<<"\n2.POP ELEMENT";
cout<<"\n3.DISPLAY STACK";
cout<<"\n4.EXIT";
49
cout<<"\nENTER YOUR CHOICE";
cin>>ch;
switch(ch)
case 1:cout<<"\nENTER VALUE TO BE PUSHED";
cin>>val;
s1.push(val);
break;
case 2:int i;
i=s1.pop();
if(i!=-1)
cout<<"\nTHE VALUE POPPED IS"<<i;
break;
case 3:s1.display();
break;
case 4:exit(0);
break;
getch();
50
while(1);
getch();
OUTPUT:
Q17.WRITE A PROGRAM TO IMPLEMENT STACK THROUGH LINKED LIST.
ANS:
#include<iostream.h>
#include<conio.h>
#include<process.h>
51
struct node
int data;
node*next;
};
class stack
node*top;
public:
stack()
top=NULL;
void push();
void pop();
void display();
~stack();
};
void stack::push()
52
node*temp;
temp=new node;
cout<<"ENTER DATA";
cin>>temp->data;
temp->next=top;
top=temp;
void stack::pop()
if(top!=NULL)
node*temp=top;
top=top->next;
cout<<temp->data<<"ELEMENT DELETED";
delete temp;
else
cout<<"\n"<<"STACK IS EMPTY";
void stack::display()
53
{
node*temp=top;
while(temp!=NULL)
cout<<temp->data<<" ";
temp=temp->next;
stack::~stack()
while(top!=NULL)
node*temp=top;
top=temp->next;
delete temp;
int main()
clrscr();
54
stack st;
int ch;
do
cout<<"\nMAIN MENU";
cout<<"\n1.PUSH ELEMENT";
cout<<"\n2.POP ELEMENT";
cout<<"\n3.DISPLAY STACK";
cout<<"\n4.EXIT";
cout<<"\nENTER YOUR CHOICE";
cin>>ch;
switch(ch)
case 1:st.push();
break;
case 2:st.pop();
break;
55
case 3:st.display();
break;
case 4:exit(0);
getch();
while(1);
getch();
OUTPUT:
56
Q18.WRITE A PROGRAM TO IMPLEMENT QUEUE THROUH ARRAY.
ANS:
#include<iostream.h>
#include<conio.h>
#include<process.h>
#define size 5
class queue
int front,rear;
int a[size];
public:
queue()
front=0;rear=0;
void addQ(int item)
if(rear==size)
cout<<"QUEUE IS FULL\n";
57
else
a[rear++]=item;
int delQ(int item)
if(front==rear)
cout<<"QUEUE IS EMPTY\n";
else
return a[front++];
void display()
{int i;
if(front==rear)
cout<<"\nEMPTY QUEUE";
getch();
return;
for(i=front+1;i<=rear;i++)
58
cout<<a[i]<<" ";
};
void main()
clrscr();
queue q1;
int ch,val;
cout<<"\nMAIN MENU";
cout<<"\n1.ADD";
cout<<"\n2 DELETE";
cout<<"\n3.DISPLAY ";
cout<<"\n4.EXIT";
do
59
cout<<"\nENTER YOUR CHOICE";
cin>>ch;
switch(ch)
case 1:cout<<"\nENTER AN ELEMENT";
cin>>val;
q1.addQ(val);
break;
case 2:cout<<"\nENTER ELEMENT TO DELETE";
cin>>val;
cout<<q1.delQ(val);
break;
case 3:q1.display();
break;
case 4:exit(0);
break;
getch();
while(1);
60
getch();
#include<iostream.h>
#include<conio.h>
#include<process.h>
#define size 5
class queue
int front,rear;
int a[size];
public:
queue()
front=0;rear=0;
void addQ(int item)
61
if(rear==size)
cout<<"QUEUE IS FULL\n";
else
a[rear++]=item;
int delQ(int item)
if(front==rear)
cout<<"QUEUE IS EMPTY\n";
else
return a[front++];
void display()
{int i;
if(front==rear)
cout<<"\nEMPTY QUEUE";
getch();
return;
62
}
for(i=front+1;i<=rear;i++)
cout<<a[i]<<" ";
};
void main()
clrscr();
queue q1;
int ch,val;
cout<<"\nMAIN MENU";
cout<<"\n1.ADD";
cout<<"\n2 DELETE";
cout<<"\n3.DISPLAY ";
cout<<"\n4.EXIT";
do
63
{
cout<<"\nENTER YOUR CHOICE";
cin>>ch;
switch(ch)
case 1:cout<<"\nENTER AN ELEMENT";
cin>>val;
q1.addQ(val);
break;
case 2:cout<<"\nENTER ELEMENT TO DELETE";
cin>>val;
cout<<q1.delQ(val);
break;
case 3:q1.display();
break;
case 4:exit(0);
break;
getch();
64
}
while(1);
getch();
OUTPUT:
Q19.WRITE A PRORGRAM TO IMPLEMENT QUEUE THROUGH LINKED
LIST.
65
ANS:
#include<iostream.h>
#include<conio.h>
#include<process.h>
struct node
int data;
node*next;
};
class queue
node*rear,*front;
public:
queue()
rear=NULL;
front=NULL;
void qinsert();
void qdelete();
66
void qdisplay();
~queue();
};
void queue::qinsert()
node*temp;
temp=new node;
cout<<"ENTER DATA";
cin>>temp->data;
temp->next=NULL;
if(rear==NULL)
rear=temp;
front=temp;
else
rear->next=temp;
rear=temp;
67
}
void queue::qdelete()
if(front!=NULL)
node*temp=front;
cout<<front->data<<"\nELEMENT DELETED";
delete temp;
if(front==NULL)
rear=NULL;
else
cout<<"\n"<<"QUEUE IS EMPTY";
void queue::qdisplay()
node*temp=front;
while(temp!=NULL)
68
cout<<temp->data<<" \n";
temp=temp->next;
queue::~queue()
while(front!=NULL)
node*temp=front;
front=front->next;
delete temp;
int main()
clrscr();
queue st;
int ch;
69
cout<<"\nMAIN MENU";
cout<<"\n1.INSERT";
cout<<"\n2.DELETE";
cout<<"\n3.DISPLAY";
cout<<"\n4.EXIT";
do
cout<<"\nENTER YOUR CHOICE";
cin>>ch;
switch(ch)
case 1:st.qinsert();
break;
case 2:st.qdelete();
break;
case 3:st.qdisplay();
break;
case 4:exit(0);
70
}
getch();
while(1);
getch();
OUTPUT:
Q20.WRITE A PROGRAM TO IMPLEMNT CIRCULAR QUEUE THROUGH
LINKED LIST.
ANS:
71
#include<iostream.h>
#include<conio.h>
struct strudent
student*prev;
int rollno;
char name[20];
student*next;
};
class c_queue
student*rear;
student*front;
public:c_queue()
front=rear=NULL;
void c_insert();
void c_deletion();
void c_display();
72
};
void c_queue::c_insert()
student*temp;
temp=new(student);
temp->prev=NULL;
cout<<"enter roll no";
cin>>temp->rollno;
temp->next=NULL;
if(rear==NULL)
front=rear=temp;
else
rear->next=temp;
temp->prev=rear;
temp->next=front;
front->prev=temp;
rear=temp;
73
}
void c_queue::c_deleteion()
student*temp;
if(rear==NULL)
cout<<"empty queue";
else
temp=front;
front=temp->next;
rear->next=front;
front->prev=rear;
cout<<"deleted node is:";
cout<<temp->rollno<<temp->name;
delete(temp);
void c_queue::c_display()
74
{
student*temp;
if(rear==NULL)
cout<<"nothing to display";
else
temp=front;
while(temp!=rear)
cout<<temp->rollno;
cout<<":";
cout<<temp->name;
temp=temp->next;
}}}
void main()
{ clrscr();
cout<<"/t/t/t/t//TCIRCULAR QUEUE”;
c_queue Q;
75
int c;
cout<<"ENTER HOW MANY TIMES YOU WANT TO PERFORM";
cin>>c;
for(int i=0;i<c;i++)
Q.c_insert();
cout<<"ENTER HOW MANY NODES YOU WANT TO DELETE";
cin>>c;
for(i-0;i<c;i++)
Q.c_deletion();
getch();
getch();
OUTPUT:
76
Q21.WRITE A PROGRAM TO ILLUSTURATE THE CONCEPT OF POINTER.
ANS:
#include<iostream.h>
#include<conio.h>
void main()
clrscr();
char line[100];
77
char*ptr;
int i,count=0;
cout<<"ENTER A LINE\n";
cin.getline(line,100);
ptr=line;
for(;*ptr!='\0';ptr++)
if((*ptr>=65&&*ptr<=90)||(*ptr>=97&&*ptr<+122))
count++;
cout<<"\n TOTAL NO. OF ALPHABETS IN THE LINE ARE"<<count;
getch();
OUTPUT:
78
79
