-
8/7/2019 52158371-DATA-STRUCTURE-AND-PROGRAMMING-METHODOLOGY
1/54
Institute of Engineering and Technology CSE-Y Batch 2009
Usman Ghani
1. WAP to traverse a linear array.Program : //To traverse a linear array #include #include void main() { clrscr(); int a[5],n,i,sum=0; coutn; cout
-
8/7/2019 52158371-DATA-STRUCTURE-AND-PROGRAMMING-METHODOLOGY
2/54
Institute of Engineering and Technology CSE-Y Batch 2009
Usman Ghani
Output :
INSTITUTE OF ENGINEERING AND TECHNOLOGY, BHADDAL
Page 2
-
8/7/2019 52158371-DATA-STRUCTURE-AND-PROGRAMMING-METHODOLOGY
3/54
Institute of Engineering and Technology CSE-Y Batch 2009
Usman Ghani
2. WAP to insert an element in the beginning of linear array.Program : //To insert an element in the beginning of a linear array #include #include void main() { clrscr(); int a[10],n,i,item,j; cout>n; cout=0) { a[j+1]=a[j]; j=j-1; } a[0]=item; n=n+1; cout
-
8/7/2019 52158371-DATA-STRUCTURE-AND-PROGRAMMING-METHODOLOGY
4/54
Institute of Engineering and Technology CSE-Y Batch 2009
Usman Ghani
Output :
INSTITUTE OF ENGINEERING AND TECHNOLOGY, BHADDAL
Page 4
-
8/7/2019 52158371-DATA-STRUCTURE-AND-PROGRAMMING-METHODOLOGY
5/54
Institute of Engineering and Technology CSE-Y Batch 2009
Usman Ghani
3. WAP to insert an element at the end of linear array.Program : //To insert an element at end in a linear array #include #include void main() { clrscr(); int a[100],n,i,item; cout>n; cout
-
8/7/2019 52158371-DATA-STRUCTURE-AND-PROGRAMMING-METHODOLOGY
6/54
Institute of Engineering and Technology CSE-Y Batch 2009
Usman Ghani
Output :
INSTITUTE OF ENGINEERING AND TECHNOLOGY, BHADDAL
Page 6
-
8/7/2019 52158371-DATA-STRUCTURE-AND-PROGRAMMING-METHODOLOGY
7/54
-
8/7/2019 52158371-DATA-STRUCTURE-AND-PROGRAMMING-METHODOLOGY
8/54
Institute of Engineering and Technology CSE-Y Batch 2009
Usman Ghani
Output :
INSTITUTE OF ENGINEERING AND TECHNOLOGY, BHADDAL
Page 8
-
8/7/2019 52158371-DATA-STRUCTURE-AND-PROGRAMMING-METHODOLOGY
9/54
Institute of Engineering and Technology CSE-Y Batch 2009
Usman Ghani
5. WAP to detete an element from the end of linear array.Program : //To delete an element from end in a linear array #include#include void main() { clrscr(); int a[100],n,i,item; cout>n; couta[i]; } cout
-
8/7/2019 52158371-DATA-STRUCTURE-AND-PROGRAMMING-METHODOLOGY
10/54
Institute of Engineering and Technology CSE-Y Batch 2009
Usman Ghani
Output :
INSTITUTE OF ENGINEERING AND TECHNOLOGY, BHADDAL
Page 10
-
8/7/2019 52158371-DATA-STRUCTURE-AND-PROGRAMMING-METHODOLOGY
11/54
Institute of Engineering and Technology CSE-Y Batch 2009
Usman Ghani
6. WAP to implement linear search in linear array.Program : //To do linear search #include #include #include void main() { clrscr();
int i,a[5],n; for(i=0;i
-
8/7/2019 52158371-DATA-STRUCTURE-AND-PROGRAMMING-METHODOLOGY
12/54
Institute of Engineering and Technology CSE-Y Batch 2009
Usman Ghani
Output :
INSTITUTE OF ENGINEERING AND TECHNOLOGY, BHADDAL
Page 12
-
8/7/2019 52158371-DATA-STRUCTURE-AND-PROGRAMMING-METHODOLOGY
13/54
Institute of Engineering and Technology CSE-Y Batch 2009
Usman Ghani
7. WAP to implement a binary search.Program : //To search an element in array using binary search #include #include void main() { clrscr(); int a[100],n,i,j,item,temp; cout>n; cout
-
8/7/2019 52158371-DATA-STRUCTURE-AND-PROGRAMMING-METHODOLOGY
14/54
Institute of Engineering and Technology CSE-Y Batch 2009
Usman Ghani
cout
-
8/7/2019 52158371-DATA-STRUCTURE-AND-PROGRAMMING-METHODOLOGY
15/54
Institute of Engineering and Technology CSE-Y Batch 2009
Usman Ghani
Output :
INSTITUTE OF ENGINEERING AND TECHNOLOGY, BHADDAL
Page 15
-
8/7/2019 52158371-DATA-STRUCTURE-AND-PROGRAMMING-METHODOLOGY
16/54
-
8/7/2019 52158371-DATA-STRUCTURE-AND-PROGRAMMING-METHODOLOGY
17/54
Institute of Engineering and Technology CSE-Y Batch 2009
Usman Ghani
Output :
INSTITUTE OF ENGINEERING AND TECHNOLOGY, BHADDAL
Page 17
-
8/7/2019 52158371-DATA-STRUCTURE-AND-PROGRAMMING-METHODOLOGY
18/54
Institute of Engineering and Technology CSE-Y Batch 2009
Usman Ghani
9. WAP to traverse a linked list.Program : //To create and traverse a linked list #include #include class node { public: int data; node *next; }; void main() { node *start,
*p; char ch='y'; int j=0; clrscr(); start='\0'; do { if (start=='\0') { start= new node; p=start; } else { p->next = new node; p=p->next; } cout
-
8/7/2019 52158371-DATA-STRUCTURE-AND-PROGRAMMING-METHODOLOGY
19/54
Institute of Engineering and Technology CSE-Y Batch 2009
Usman Ghani
cin>>p->data; j++; coutch; } while(ch=='y' ch=='Y'); p->next='\0'; cout
-
8/7/2019 52158371-DATA-STRUCTURE-AND-PROGRAMMING-METHODOLOGY
20/54
Institute of Engineering and Technology CSE-Y Batch 2009
Usman Ghani
10. WAP to insert an element in the beginning of linked list.Program : //To insert an element in the beginning of linked list #include #include class node { public: int data ; node *next; }; /////////
///////////////////////////////////////////////////////////////////// void main() { node *start,*p,*beg; char ch; int j=0; clrscr(); start='\0'; do { if(start=='\0') { start = new node; p= start; } else { p->next=new node;INSTITUTE OF ENGINEERING AND TECHNOLOGY, BHADDAL Page 20
-
8/7/2019 52158371-DATA-STRUCTURE-AND-PROGRAMMING-METHODOLOGY
21/54
Institute of Engineering and Technology CSE-Y Batch 2009
Usman Ghani
p=p->next; } coutp->data; j++; coutch; }while(ch=='y'ch=='Y'); p->next='\0'; ///////////////////////////TRAVERSING A LINKED LIST///////////////////////// cout
-
8/7/2019 52158371-DATA-STRUCTURE-AND-PROGRAMMING-METHODOLOGY
22/54
Institute of Engineering and Technology CSE-Y Batch 2009
Usman Ghani
cout
-
8/7/2019 52158371-DATA-STRUCTURE-AND-PROGRAMMING-METHODOLOGY
23/54
-
8/7/2019 52158371-DATA-STRUCTURE-AND-PROGRAMMING-METHODOLOGY
24/54
Institute of Engineering and Technology CSE-Y Batch 2009
Usman Ghani
p->next=new node; p=p->next; } coutp->data; j++; coutch; } while(ch=='Y'ch=='y'); p->next='\0'; //////////////////////////////////Display Data///////////////////////////// cout
-
8/7/2019 52158371-DATA-STRUCTURE-AND-PROGRAMMING-METHODOLOGY
25/54
Institute of Engineering and Technology CSE-Y Batch 2009
Usman Ghani
{
current=new node; coutcurrent->data;
p=start; while(p!='\0' && countnext; count++; } current->next=p->next; p->next=current; cout
-
8/7/2019 52158371-DATA-STRUCTURE-AND-PROGRAMMING-METHODOLOGY
26/54
Institute of Engineering and Technology CSE-Y Batch 2009
Usman Ghani
Output :
INSTITUTE OF ENGINEERING AND TECHNOLOGY, BHADDAL
Page 26
-
8/7/2019 52158371-DATA-STRUCTURE-AND-PROGRAMMING-METHODOLOGY
27/54
-
8/7/2019 52158371-DATA-STRUCTURE-AND-PROGRAMMING-METHODOLOGY
28/54
Institute of Engineering and Technology CSE-Y Batch 2009
Usman Ghani
} coutp->data; j++; coutch; }while(ch=='y'ch=='Y'); p->next='\0'; ///////////////////////////TRAVERSING A LINKED LIST/////////////////////// cout
-
8/7/2019 52158371-DATA-STRUCTURE-AND-PROGRAMMING-METHODOLOGY
29/54
Institute of Engineering and Technology CSE-Y Batch 2009
Usman Ghani
end->next='\0'; cout
-
8/7/2019 52158371-DATA-STRUCTURE-AND-PROGRAMMING-METHODOLOGY
30/54
Institute of Engineering and Technology CSE-Y Batch 2009
Usman Ghani
13. WAP to delete an element from the begining of linked list.Program : //To delete a node from the beginning of the linked list #include #include class node { public: char data; node *next; }; ///////
//////////////////////////////////////////////////////////// void main() { node*start, *p; char ch; int j=0; clrscr(); start='\0'; do { if(start=='\0') { start=new node; p=start; } else {INSTITUTE OF ENGINEERING AND TECHNOLOGY, BHADDAL Page 30
-
8/7/2019 52158371-DATA-STRUCTURE-AND-PROGRAMMING-METHODOLOGY
31/54
Institute of Engineering and Technology CSE-Y Batch 2009
Usman Ghani
p->next=new node; p=p->next; } coutp->data; j++; coutch; }while(ch=='Y'ch=='y'); p->next='\0'; /////////////////////////////////Display data/////////////////////////////// cout
-
8/7/2019 52158371-DATA-STRUCTURE-AND-PROGRAMMING-METHODOLOGY
32/54
Institute of Engineering and Technology CSE-Y Batch 2009
Usman Ghani
start=p->next; delete p; cout
-
8/7/2019 52158371-DATA-STRUCTURE-AND-PROGRAMMING-METHODOLOGY
33/54
Institute of Engineering and Technology CSE-Y Batch 2009
Usman Ghani
14. WAP to delete an element from the end of linked list.Program : //To delete a node from the end of the linked list #include #include class node { public: char data; node *next; }; /////////////
////////////////////////////////////////////////////// void main() { node *start, *p ,*save; char ch; int j=0; clrscr(); start='\0'; do { if(start=='\0') { start=new node; p=start; } else { p->next=new node; p=p->next; } coutp->data;INSTITUTE OF ENGINEERING AND TECHNOLOGY, BHADDAL Page 33
-
8/7/2019 52158371-DATA-STRUCTURE-AND-PROGRAMMING-METHODOLOGY
34/54
Institute of Engineering and Technology CSE-Y Batch 2009
Usman Ghani
j++; coutch; }while(ch=='Y'ch=='y'); p->next='\0'; /////////////////////////////////Display data/////////////////////////////// cout
-
8/7/2019 52158371-DATA-STRUCTURE-AND-PROGRAMMING-METHODOLOGY
35/54
Institute of Engineering and Technology CSE-Y Batch 2009
Usman Ghani
save->next=0; delete p; } /////////////////////////////////Display data/////////////////////////////// cout
-
8/7/2019 52158371-DATA-STRUCTURE-AND-PROGRAMMING-METHODOLOGY
36/54
Institute of Engineering and Technology CSE-Y Batch 2009
Usman Ghani
15. WAP to delete an element from given location in linked list.Program : //To delete a node from a given location #include #include struct node { int data; node *next; }*p,*start,*save,*loc,*locp; int f
indloc(int); int deleteitem(); /////////////////////////////////////////////////////////////////// void main() { char ch; int j=0; clrscr(); start='\0'; do { if(start=='\0') { start=new node; p=start; } else { p->next=new node; p=p->next; }coutp->data;INSTITUTE OF ENGINEERING AND TECHNOLOGY, BHADDAL Page 36
-
8/7/2019 52158371-DATA-STRUCTURE-AND-PROGRAMMING-METHODOLOGY
37/54
Institute of Engineering and Technology CSE-Y Batch 2009
Usman Ghani
j++; coutch; }while(ch=='Y'ch=='y'); p->next='\0'; /////////////////////////////////Display data/////////////////////////////// cout
-
8/7/2019 52158371-DATA-STRUCTURE-AND-PROGRAMMING-METHODOLOGY
38/54
Institute of Engineering and Technology CSE-Y Batch 2009
Usman Ghani
/////////////////////////////////findloc func///////////////// int findloc(int d) { if (start==0) { loc=0; locp=0; return(0); } if (start->data==d) { loc=start;locp=0; return(0); } save=start; p=start->next; while (p!=0) { if (p->data==d)
{loc=p; locp=save; return(0); } save=p; p=p->next; } loc=0; return(0); }INSTITUTE OF ENGINEERING AND TECHNOLOGY, BHADDAL Page 38
-
8/7/2019 52158371-DATA-STRUCTURE-AND-PROGRAMMING-METHODOLOGY
39/54
Institute of Engineering and Technology CSE-Y Batch 2009
Usman Ghani
/////////////////////////////////////deleteitem func//////////////// int deleteitem() { if(loc==0) {coutnext=loc->next; } delete loc; }
Output :
INSTITUTE OF ENGINEERING AND TECHNOLOGY, BHADDAL
Page 39
-
8/7/2019 52158371-DATA-STRUCTURE-AND-PROGRAMMING-METHODOLOGY
40/54
Institute of Engineering and Technology CSE-Y Batch 2009
Usman Ghani
16. WAP to search an element in linked list.Program : //To search an element in the linked list #include #include #include class node { public: int data ; node *next; }; //
//////////////////////////////////////////////////////////////////////////// void main() { node *start,*p,*beg,*end,*loc; char ch; int j=0,item; clrscr(); start='\0'; do { if(start=='\0') { start = new node; p= start; } else { p->next=new node;INSTITUTE OF ENGINEERING AND TECHNOLOGY, BHADDAL Page 40
-
8/7/2019 52158371-DATA-STRUCTURE-AND-PROGRAMMING-METHODOLOGY
41/54
Institute of Engineering and Technology CSE-Y Batch 2009
Usman Ghani
p=p->next; } coutp->data; j++; coutch; }while(ch=='y'ch=='Y'); p->next='\0'; ///////////////////////////TRAVERSING A LINKED LIST/////////////////////////// cout
-
8/7/2019 52158371-DATA-STRUCTURE-AND-PROGRAMMING-METHODOLOGY
42/54
Institute of Engineering and Technology CSE-Y Batch 2009
Usman Ghani
} else { p=p->next; } } loc='\0'; cout
-
8/7/2019 52158371-DATA-STRUCTURE-AND-PROGRAMMING-METHODOLOGY
43/54
Institute of Engineering and Technology CSE-Y Batch 2009
Usman Ghani
17. WAP to implement push and pop in stack.Program : //To implement stack using Linear array #include #include void main() { clrscr(); int stack[10],maxstk,n,item,ch,top,i; char c; c
outn; if(n!=0) { cout
-
8/7/2019 52158371-DATA-STRUCTURE-AND-PROGRAMMING-METHODOLOGY
44/54
Institute of Engineering and Technology CSE-Y Batch 2009
Usman Ghani
cin>>item; top=top+1; stack[top]=item; cout
-
8/7/2019 52158371-DATA-STRUCTURE-AND-PROGRAMMING-METHODOLOGY
45/54
Institute of Engineering and Technology CSE-Y Batch 2009
Usman Ghani
Output :
INSTITUTE OF ENGINEERING AND TECHNOLOGY, BHADDAL
Page 45
-
8/7/2019 52158371-DATA-STRUCTURE-AND-PROGRAMMING-METHODOLOGY
46/54
Institute of Engineering and Technology CSE-Y Batch 2009
Usman Ghani
18. WAP for insertion, deletion and traversing a queue.Program : //To insert, delete and traverse a queue #include #include void main() { clrscr(); int queue[10],front=0,rear=0,n,item,ch; char c
hoice; cout
-
8/7/2019 52158371-DATA-STRUCTURE-AND-PROGRAMMING-METHODOLOGY
47/54
Institute of Engineering and Technology CSE-Y Batch 2009
Usman Ghani
else if(rear==n) { rear=1; coutitem; queue[rear]=item; } else { rear=rear+1; coutitem; queue[rear]=item; } break; case 2: if(front==0) { cout
-
8/7/2019 52158371-DATA-STRUCTURE-AND-PROGRAMMING-METHODOLOGY
48/54
Institute of Engineering and Technology CSE-Y Batch 2009
Usman Ghani
case 3: if(front
-
8/7/2019 52158371-DATA-STRUCTURE-AND-PROGRAMMING-METHODOLOGY
49/54
Institute of Engineering and Technology CSE-Y Batch 2009
Usman Ghani
Output :
INSTITUTE OF ENGINEERING AND TECHNOLOGY, BHADDAL
Page 49
-
8/7/2019 52158371-DATA-STRUCTURE-AND-PROGRAMMING-METHODOLOGY
50/54
Institute of Engineering and Technology CSE-Y Batch 2009
Usman Ghani
19.PROGRAM TO PERFORM I-SORT OPERATION#include #include void main() { clrscr(); int a[10],i,s,temp,ptr; cout
-
8/7/2019 52158371-DATA-STRUCTURE-AND-PROGRAMMING-METHODOLOGY
51/54
Institute of Engineering and Technology CSE-Y Batch 2009 for(i=1;i
-
8/7/2019 52158371-DATA-STRUCTURE-AND-PROGRAMMING-METHODOLOGY
52/54
Institute of Engineering and Technology CSE-Y Batch 2009
Usman Ghani
20.PROGRAM TO FIND THE LENGTH OF STRING WITHOUT USING STRING OPERATIONS#include #include #include #include voidmain() { clrscr(); char s[20]; int c=0,i=0; cout
-
8/7/2019 52158371-DATA-STRUCTURE-AND-PROGRAMMING-METHODOLOGY
53/54
Institute of Engineering and Technology CSE-Y Batch 2009
Usman Ghani
OUTPUT
INSTITUTE OF ENGINEERING AND TECHNOLOGY, BHADDAL
Page 53
-
8/7/2019 52158371-DATA-STRUCTURE-AND-PROGRAMMING-METHODOLOGY
54/54