EC6312 OOPS DS LAB Manual, Oops Data Structures Laboratory Manual – ECE 3rd SEM Anna University


Anna University Regulation 2013 Electronics and Communication Engineering (ECE) EC6312 OOPS DS LAB Manual for all experiments is provided below. Download link for ECE 3rd SEM EC6312 Oops Data Structures Laboratory Manual is listed down for students to make perfect utilization and score maximum marks with our study materials.

Anna University Regulation 2013 Electronics and Communication Engineering (ECE) 3rd SEM EC6312 OOPS DS LAB-Oops Data Structures Laboratory Manual



To  write a  C++  program  for  array  implementation  of  List  ADT and  perform  the  following operations:

a) Create b) Insert c) Delete d) Display


1. Start the program.

2. Initialize the list with n items.

3. Get the choice of operation from user.

4. For insertion, get the item to be inserted and its position. Then position to last position      move the items in the list one step forward, then insert the new item in its  corresponding position.

5. For deletion get the item to be deleted and find its position then move the items in the      list one step backward from last position to position found.

6. If user choice is display then display the elements.

7. End the program.




#define MAX 10

void create(); void insert();

void deletion(); void search();

void display();

int a,b[20], n, p, e, f, i, pos;

void main() {


int ch; char g=’y’;

do {

cout<<“\n Main Menu”;

cout<<“\t 1.Create \t 2.Delete \t 3.Search \t 4.Insert \t 5.Display\t 6.Exit \t”;

cout<<“\n Enter your Choice”;

cin>>ch; switch(ch) {

case 1: create(); break; case 2: deletion(); break;

case 3: search(); break; case 4: insert(); break;

case 5: display(); break; case 6: exit(0); break;

default: cout<<“\n Enter the correct choice:”;


cout<<“\n Do u want to continue:::”; cin>>g;


while(g==’y’||g==’Y’); getch(); }

void create() {

cout<<“\n Enter the number of nodes”;

cin>>n; for(i=0;i<n;i++) {=””

cout<<“\n enter the  element:”<<i+1;=”” cin=””>>b[i]; } }

void deletion() {

cout<<“\n Enter the position u want to delete::”; cin>>pos;

if(pos>=n) { cout<<“\n Invalid Location::”; }

else { for(i=pos+1;i<n;i++) {=”” b[i­1]=”b[i];” }=”” n­­;=””

cout<<“\n the elements after deletion”;=”” for(i=”0;i<n;i++)”

cout<<“\t”<< b[i];=”” void search()=””

cout<<“\n enter the element to be searched:”;=”” cin=””>>e;

for(i=0;i<n;i++) {=”” if(b[i]=”=e)”

cout<<“value is in the position”<<i;=”” }=””

void insert()=”” cout<<“\n enter the position u need to insert::”;=””

cin=””>>pos; if(pos>=n) { cout<<“\n invalid Location::”; }

else {

for(i=MAX­1;i>=pos­1;i­­) { b[i+1]=b[i]; }

cout<<“\n Enter the element to insert::\n”; cin>>p; b[pos]=p; n++;  }

cout<<“\n The list after insertion::\n”; display(); }

void display() {

cout<<“\n The Elements of The list ADT are:”;




EC6312 OOPS DS Lab Manual with all experiments – Download Here

If you require any other notes/study materials, you can comment in the below section.

Related Links

For EC6312 OOPS DS Lab Syllabus – Click here

Search Terms

Anna University 3rd SEM ECE OOPS DS LAB Manual

EC6312 Oops Data Structures Laboratory Manual free download

Anna University ECE OOPS DS LAB Manual Regulation 2013

EC6312 Manual, OOPS DS LAB experiment wise Manual – ECE 3rd Semester


Comments are closed.