LAB # 1 (DATA STRUCTURE AND OBJECT ORIENTED PROGRAMING)

   LAB # 1

CoNTeNT

TASk#1

Write a program that demonstrates the inserting.

TASk#2

Write a program that demonstrates the traversing.

TASk#3

Write a program that demonstrates deletion using class.

TASK # 1 writes a program that demonstrates the inserting technique?

CODE

#include <iostream>

using namespace std;

class interopt

{

public:

void insert (int data [10], int&n, int k, int

item)

{

int j=n;

while(j>=k)

{

data[j+1] =data[j];

j--;

}

data[k]=item;

n++;

}

}

int main ()

{

interopt obj;

int data [10], n, k, item;

cout<<"number of elements";

cin>>n;

for (int i=0; i<=n; i++)

{

cout<<"data ["<<i<< “] =";

cin>>data[i];

}

cout<<"Enter location";

cin>>k;

cout<<"enter item";

cin>>item;

obj. insert (data, n, k, item);

for (int i=0; i<=n; i++)

cout<<"data ["<<i<< “] ="<<data[i]<<endl;

return 0;

}

OUTPUT

TASK write a program that demonstrates traversing technique?

CODE

OUTPUT

TASK Write a program that demonstrates deleting technique?

CODE

OUTPUT