0% found this document useful (0 votes)

71 views

C++ Practicals

The document contains code for several linked list operations - inserting nodes at the front, back, and before a specified node. It defines a NODE class with data and link fields, and functions to get a new node, insert at different positions, and display the list. The main function runs a menu loop allowing the user to choose an insert or display operation and test the code.

Uploaded by

LAVANYA T.L.

We take content rights seriously. If you suspect this is your content, claim it here.

Available Formats

Download as DOCX, PDF, TXT or read online on Scribd

0% found this document useful (0 votes)

71 views

C++ Practicals

Uploaded by

LAVANYA T.L.

We take content rights seriously. If you suspect this is your content, claim it here.

Available Formats

Download as DOCX, PDF, TXT or read online on Scribd

You are on page 1/ 32

Practical 1:

#include<iostream>

#include<stack>

using namespace std;

// funtion to check if character is operator or not

bool isOperator(char x) {

switch (x) {

case '+':

case '-':

case '/':

case '*':

return true;

return false;

// Convert prefix to Postfix expression

string preToPost(string pre_exp) {

stack<string> s;

// length of expression

int length = pre_exp.size();

// reading from right to left

for (int i = length - 1; i >= 0; i--) {

// check if symbol is operator

if (isOperator(pre_exp[i])) {

// pop two operands from stack

string op1 = s.top(); s.pop();

string op2 = s.top(); s.pop();

// concat the operands and operator

string temp = op1 + op2 + pre_exp[i];

// Push string temp back to stack

s.push(temp);

// if symbol is an operand

else {

// push the operand to the stack

s.push(string(1, pre_exp[i]));

// stack contains only the Postfix expression

return s.top();

// Driver Code

int main() {

char pre_exp[20];
cout<<"Enter the expresstion :";

cin>>pre_exp;

//string pre_exp = "*-A/BC-/AKL";

cout << "Postfix : " << preToPost(pre_exp);

return 0;

OUTPUT:
Enter the expresstion :+ABC
Postfix : ABC-+

Enter the expresstion :*A-/BC-/AKL
Postfix : ABC/AK/L--*

Practical 2:

#include <iostream>

using namespace std;

int stack[20];
int top=-1;

void push(int x)
{
stack[++top]=x;
}
int pop()
{
return stack[top--];
}

int main()
{
char expe[20];
char *e;
int n1,n2,n3,num;
cout<<"ENter the expression:";
cin>>expe;
e=expe;
while(*e !='\0')
  {
if(isdigit(*e))
    {
num=*e-48;
push(num);
    }
else
    {
n1=pop();
n2=pop();
switch(*e)
      {
case '+':
n3=n1+n2;
break;
case '-':
n3=n2-n1;
break;
case '*':
n3=n2*n1;
break;
case '/':
n3=n2/n1;
break;
      }
push(n3);
    }
e++;
  }
cout<<"\n The result of the expression"<<expe<<"="<<pop();
return 0;
}

OUTPUT:
ENter the expression:12+3+1-

The result of the expression 12+3+1-=5

ENter the expression:42*2/3+

The result of the expression 42*2/3+=7
Practical 4:
B]

#include <iostream>

using namespace std;

void towerOfHanoi(int n, char from_rod,

char to_rod, char aux_rod)

if (n == 1)

cout << "Move disk 1 from rod " << from_rod <<

" to rod " << to_rod<<endl;

return;

towerOfHanoi(n - 1, from_rod, aux_rod, to_rod);

cout << "Move disk " << n << " from rod " << from_rod <<

" to rod " << to_rod << endl;

towerOfHanoi(n - 1, aux_rod, to_rod, from_rod);

// Driver code

int main()

int n = 4; // Number of disks

towerOfHanoi(n, 'A', 'C', 'B'); // A, B and C are names of rods

return 0;

OUTPUT:
Move disk 1 from rod A to rod B
Move disk 2 from rod A to rod C
Move disk 1 from rod B to rod C
Move disk 3 from rod A to rod B
Move disk 1 from rod C to rod A
Move disk 2 from rod C to rod B
Move disk 1 from rod A to rod B
Move disk 4 from rod A to rod C
Move disk 1 from rod B to rod C
Move disk 2 from rod B to rod A
Move disk 1 from rod C to rod A
Move disk 3 from rod B to rod C
Move disk 1 from rod A to rod B
Move disk 2 from rod A to rod C
Move disk 1 from rod B to rod C

Move disk 1 from rod A to rod C
Move disk 2 from rod A to rod B
Move disk 1 from rod C to rod B
Move disk 3 from rod A to rod C
Move disk 1 from rod B to rod A
Move disk 2 from rod B to rod C
Move disk 1 from rod A to rod C

#include <iostream>

using namespace std;

// Driver code

int main()

int sum,n;

cout<<"Entyer the no:";

cin>>n;

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

sum=sum+i;

cout<<"Sum of "<<n <<" is :"<<sum;

return 0;

OUTPUT:
Entyer the no:5
Sum of 5 is :10

Entyer the no:25
Sum of 25 is :300

Practical 5:
#include <iostream>

using namespace std;

class NODE

public:

int data;

NODE *link;

};

void display(NODE *start)

NODE *temp;

if(start==NULL)

cout<<"\n---------LIST IS EMPTY----------\n";
return;

temp = start;

while(temp !=NULL)

cout<< temp->data << " ";

temp = temp->link;

NODE* getnode()

NODE *p;

p = new NODE;

p->link = NULL;

return p;

NODE* insertend(NODE *start)

NODE *p,*cur;

p=getnode();

cout<<"ENTER DATA:";

cin>>p->data;

if(start==NULL)

return p;

cur=start;
while(cur->link !=NULL)

cur=cur->link;

cur->link=p;

cout<<"\nNode at the End inserted successfully\n";

return start;

NODE* insertbefore (NODE *start,int key)

NODE p,cur, *prev;

p=getnode();

cout<<"Enter data";

cin>>p->data;

if(start==NULL)

return p;

prev=cur=start;

while(cur->data !=key)

prev=cur;

cur=cur->link;

if(cur== NULL)

cout<<"Element"<<key<<"Not found in the list"<<endl;

return start;

prev->link=p;

p->link = cur;

cout<<"\n Node Inserted Before"<<key<<endl;

return start;

NODE* insertfront (NODE *start)

NODE *p;

p=getnode();

cout<<"Enter data:";

cin>>p->data;

p->link = start;

start=p;

cout<<"\n Node at the beginning Inserted successfully\n";

return start;

int main()

NODE *start= NULL;

int choice, key, pos;

while(1)

{
cout<<"\n****************LINKED LIST*****************"<<endl;

cout<<"1.Insert at Frot"<<endl;

cout<<"2.Insert at End"<<endl;

cout<<"3.Insert Before a given Element"<<endl;

// cout<<"4.Insert at the Position"<<endl;

cout<<"4.Display"<<endl;

cout<<"5.Exit"<<endl;

cout<<"\n\n Enter Your Choice";

cin>>choice;

switch(choice)

case 1: start = insertfront(start);

break;

case 2: start = insertend(start);

break;

case 3:

cout<<"Enter the key element:"<<endl;

cin>>key;

start = insertbefore(start,key);

break;

/*case 4:

cout<<"Enter the Position:"<<endl;

cin>>pos;

start = insertatpos(start,pos);

break;*/

case 4: display(start);

break;
default : return 0;

return 0;

OUTPUT:

****************LINKED LIST*****************
1.Insert at Frot
2.Insert at End
3.Insert Before a given Element
4.Display
5.Exit


Enter Your Choice1
Enter data:2

Node at the beginning Inserted successfully

****************LINKED LIST*****************
1.Insert at Frot
2.Insert at End
3.Insert Before a given Element
4.Display
5.Exit


Enter Your Choice2
ENTER DATA:0

Node at the End inserted successfully

****************LINKED LIST*****************
1.Insert at Frot
2.Insert at End
3.Insert Before a given Element
4.Display
5.Exit


Enter Your Choice3
Enter the key element:
0
Enter data5

Node Inserted Before0

****************LINKED LIST*****************
1.Insert at Frot
2.Insert at End
3.Insert Before a given Element
4.Display
5.Exit


Enter Your Choice4
2 5 0
****************LINKED LIST*****************
1.Insert at Frot
2.Insert at End
3.Insert Before a given Element
4.Display
5.Exit


Enter Your Choice4
2 5 0
****************LINKED LIST*****************
1.Insert at Frot
2.Insert at End
3.Insert Before a given Element
4.Display
5.Exit


Enter Your Choice5


...Program finished with exit code 0
Press ENTER to exit console.

Practical 7:
#include<iostream>

using namespace std;

#define max 5

class Dequeue

private:

int DQ[max],front,rear;

public:
Dequeue();

void insertFront(int);

void insertRear(int);

void deleteFront();

void deleteRear();

void display();

};

Dequeue::Dequeue()

front=rear=-1;

void Dequeue::insertFront(int itm)

if(rear==max-1)

cout<<"\ninsertion is not possible overflow!!1";

return;

if(front==-1)

front++;

else

for(int i=rear; i>=front;i--)

DQ[i+1]=DQ[i];

DQ[front]=itm;

rear++;

cout<<"\n*********************insertion is successfull**************";
}

void Dequeue::insertRear(int itm)

if(rear==max-1)

cout<<"\ninsertion is not possible overflow!!!";

return;

if(front==-1)

front++;

DQ[++rear]=itm;

cout<<endl<<"*********************insertion is successfull**************";

void Dequeue::display()

cout<<endl<<"*******Queue Element are\n";

for(int temp=front;temp<=rear;temp++)

cout<<DQ[temp]<<" ";

void Dequeue::deleteFront()

if(front==-1)

cout<<"\nDeletion is not possible underflow!!!";

return;
}

int ele=DQ[front];

if(front==rear)

cout<<"\n\n.......Queue Empty.....!\n\n";

front=rear=-1;

else

front=front+1;

cout<<endl<<"Deleted Element = "<<ele<<endl;

cout<<endl<<"***********************************\n";

void Dequeue::deleteRear()

if(front==-1)

cout<<"\nDeletion is not possible underflow!!!";

return;

int ele=DQ[rear];

if(front==rear)

cout<<"\n\n.......Queue Empty.....!\n\n";

front=rear=-1;

else

rear=rear-1;
cout<<endl<<"Deleted Element = "<<ele<<endl;

cout<<endl<<"***********************************\n";

int main()

int choic,itm;

Dequeue mydq;

while(1)

cout<<"\n\n*****Dequeue Operation*******\n";

cout<<"\n1.insert at begining\n2.insert at end\n3.display\n4.Deletion from front\n5.deletion from

end\n5.exit";

cout<<"\nEnter your choice<1-6>:";

cin>>choic;

switch(choic)

case 1:

cout<<"Enter the element to be inserted:";

cin>>itm;

mydq.insertFront(itm);

break;

case 2:

cout<<"Enter the element to be inserted:";

cin>>itm;

mydq.insertRear(itm);

break;

case 3:
cout<<"Enter the element to be inserted:";

mydq.display();

break;

case 4:

mydq.deleteFront();

break;

case 5:

mydq.deleteRear();

break;

case 6:

exit(1);

break;

return 0;

OUTPUT:

*****Dequeue Operation*******

1.insert at begining
2.insert at end
3.display
4.Deletion from front
5.deletion from end
5.exit
Enter your choice<1-6>:1
Enter the element to be inserted:3

*********************insertion is successfull**************

*****Dequeue Operation*******

1.insert at begining
2.insert at end
3.display
4.Deletion from front
5.deletion from end
5.exit
Enter your choice<1-6>:2
Enter the element to be inserted:6

*********************insertion is successfull**************

*****Dequeue Operation*******

*****Dequeue Operation*******

1.insert at begining
2.insert at end
3.display
4.Deletion from front
5.deletion from end
5.exit
Enter your choice<1-6>:2
Enter the element to be inserted:9

*********************insertion is successfull**************

*****Dequeue Operation*******

1.insert at begining
2.insert at end
3.display
4.Deletion from front
5.deletion from end
5.exit
Enter your choice<1-6>:3
Enter the element to be inserted:
*********************Queue Element are**************
3 6 9

*****Dequeue Operation*******

1.insert at begining
2.insert at end
3.display
4.Deletion from front
5.deletion from end
5.exit
Enter your choice<1-6>:4

Deleted Element = 3

***********************************


*****Dequeue Operation*******

1.insert at begining
2.insert at end
3.display
4.Deletion from front
5.deletion from end
5.exit
Enter your choice<1-6>:5

Deleted Element = 9

***********************************

*****Dequeue Operation*******

1.insert at begining
2.insert at end
3.display
4.Deletion from front
5.deletion from end
5.exit
Enter your choice<1-6>:3
Enter the element to be inserted:
*********************Queue Element are**************
6

*****Dequeue Operation*******

1.insert at begining
2.insert at end
3.display
4.Deletion from front
5.deletion from end
5.exit
Enter your choice<1-6>:5
Practical 8:
A]
#include<iostream>

using namespace std;

class NODE

public:

NODE *left;

int data;

NODE *right;

};

NODE* getNode()

NODE *p=new NODE;

p->left=NULL;

p->right=NULL;

return p;

NODE* push(int itm,NODE *top)

NODE *p;

p=getNode();

if(p==NULL)

cout<<"\nOverflow...no memory in heap...";

return top;
}

p->data=itm;

p->left=NULL;

p->right=top;

if(top!=NULL)

top->left=p;

top=p;

return top;

NODE* pop(NODE* top)

NODE *cur;

if(top==NULL)

cout<<"\nStack undeflow\n";

return top;

cur=top;

top=top->right;

if(top!=NULL)

top->left=NULL;

cout<<"\nDeleted Item="<<cur->data<<endl;

delete cur;

return top;

void Displaystack(NODE *top)

{

NODE *temp;

if(top==NULL)

cout<<"\nStack is empty\n";

return ;

temp=top;

cout<<"\n The contents of list:\n";

while(temp != NULL)

cout<<temp->data<<" ";

temp=temp->right;

int main()

int opt,itm;

NODE *top=NULL;

cout<<"\n Stack Using Doble LInked list******\n";

while(1)

cout<<"\nMenu....\n1.push\n2.pop\n3.display\n4.exit\n";

cout<<"Enter your option:";

cin>>opt;

switch(opt)

case 1:

cout<<"\nEnter item to be inserted :";

cin>>itm;

top=push(itm,top);

break;

case 2:

top=pop(top);

break;

case 3:

Displaystack(top);

break;

default:exit(0);

return 0;

OUTPUT:
Stack Using Doble LInked list******

Menu....
1.push
2.pop
3.display
4.exit
Enter your option:1

Enter item to be inserted :1

Menu....
1.push
2.pop
3.display
4.exit
Enter your option:1

Enter item to be inserted :2

Menu....
1.push
2.pop
3.display
4.exit
Enter your option:3

The contents of list:
2 1
Menu....
1.push
2.pop
3.display
4.exit
Enter your option:2

Deleted Item=2

Menu....
1.push
2.pop
3.display
4.exit
Enter your option:3

The contents of list:
1
Menu....
1.push
2.pop
3.display
4.exit
Enter your option:4

B]
#include<iostream>

using namespace std;

class NODE

public:

NODE *left;

int data;

NODE *right;

};
NODE *front=NULL,*tail=NULL;

NODE* getNode()

NODE *p=new NODE;

p->left=NULL;

p->right=NULL;

return p;

void enQueue()

int elem;

cout<<"Enter element to be inserted :";

cin>>elem;

NODE *p=getNode();

p->data=elem;

if(front==NULL)

front=p;

else

tail->right=p;

p->left=tail;

tail=p;

cout<<"Element has been inserted in the queue \n";

void deQueue()

if(front==NULL)

{
cout<<"Queue is empty !!\n";

return;

NODE* temp=front;

front=front->right;

if(front!=NULL)

front->left=NULL;

cout<<"Element removed= "<<temp->data<<endl;

delete temp;

void displayQueue()

NODE *p=front;

if(p==NULL)

cout<<"Queue is empty !!\n";

return ;

cout<<"Queue element are :\n";

while(p!=NULL)

cout<<p->data<<" ";

p=p->right;

cout<<"**************END*********"<<endl;

int main()

int choic;
while(1)

cout<<"\n\n****QueueFIFO******\n";

cout<<"\n1.EnQueue\n2.DeQueue\n3.display\n4.exit";

cout<<"\nEnter your choice<1-4>:";

cin>>choic;

switch(choic)

case 1:

enQueue();

break;

case 2:

deQueue();

break;

case 3:

displayQueue();

break;

deafult:

exit(0);

return 0;

OUTPUT:
****QueueFIFO******

1.EnQueue
2.DeQueue
3.display
4.exit
Enter your choice<1-4>:1
Enter element to be inserted :2
Element has been inserted in the queue


****QueueFIFO******

1.EnQueue
2.DeQueue
3.display
4.exit
Enter your choice<1-4>:1
Enter element to be inserted :3
Element has been inserted in the queue


****QueueFIFO******

1.EnQueue
2.DeQueue
3.display
4.exit
Enter your choice<1-4>:3
Queue element are :
2 3 **************END*********


****QueueFIFO******

1.EnQueue
2.DeQueue
3.display
4.exit
Enter your choice<1-4>:2
Element removed= 2


****QueueFIFO******

1.EnQueue
2.DeQueue
3.display
4.exit
Enter your choice<1-4>:3
Queue element are :
3 **************END*********
Practical 12:
using namespace std;

#include<iostream>

int binarysearch(int *a,int low,int high,int key)

int mid;

if(low>high)

return -1;

mid=(low+high)/2;

if(key<a[mid])

binarysearch(a,low,mid-1,key);

else

binarysearch(a,mid+1,high,key);

int linearsearch(int *a,int size,int key)

int i;

for(i=0;i<size;i++)

if(key==a[i])

return i;
}

return -1;

int main()

int size,a[20],choice,key,i,index;

cout<<endl<<"......menu......."<<endl;

cout<<"1.linear search"<<endl;

cout<<"2.binary search"<<endl;

cout<<"enter your choice";

cin>>choice;

cout<<"\n enter the size of array";

cin>>size;

cout<<"enter the element\n";

for(i=0;i<size;i++)

cin>>a[i];

cout<<"enter the search element";

cin>>key;

if(choice == 1)

index=linearsearch(a,size,key);

else

index=binarysearch(a,0,size-1,key);

if(index==-1)

cout<<"the key element not found in array"<<endl;

else

cout<<"the key is found at position:"<<index+1<<endl;

return 0;

OUTPUT:

......menu.......
1.linear search
2.binary search
enter your choice1

enter the size of array5
enter the element
1
2
3
4
5
enter the search element4
the key is found at position:4

......menu.......
1.linear search
2.binary search
enter your choice2

enter the size of array5
enter the element
4
5
6
7
8
enter the search element6
the key is found at position:3

Implement A Doubly Link List Using Template. Include Function For Insertion, Deletion, Search of A No., Reverse The List.
No ratings yet
Implement A Doubly Link List Using Template. Include Function For Insertion, Deletion, Search of A No., Reverse The List.
7 pages
PHP Project
100% (1)
PHP Project
52 pages
Ericsson Radio Node Retu Troubleshooting Guide
100% (5)
Ericsson Radio Node Retu Troubleshooting Guide
10 pages
C++ Project On Cricket Database System
50% (2)
C++ Project On Cricket Database System
53 pages
DS
No ratings yet
DS
16 pages
Program: Singly Linked List
No ratings yet
Program: Singly Linked List
12 pages
Ads Lab Program
No ratings yet
Ads Lab Program
13 pages
ds_lab_report
No ratings yet
ds_lab_report
28 pages
Theory Paper: Arid Agriculture University, Rawalpindi
No ratings yet
Theory Paper: Arid Agriculture University, Rawalpindi
14 pages
q4
No ratings yet
q4
14 pages
Data Structure is All Here You Need
No ratings yet
Data Structure is All Here You Need
67 pages
Datastructure Lab
No ratings yet
Datastructure Lab
52 pages
Document 22
No ratings yet
Document 22
62 pages
Merge Two Arrays: " - Merging Two Array'S - " "/N/Nenter No. of Elements in First Array: "
No ratings yet
Merge Two Arrays: " - Merging Two Array'S - " "/N/Nenter No. of Elements in First Array: "
21 pages
Practical Data Structure
No ratings yet
Practical Data Structure
10 pages
CDLL
No ratings yet
CDLL
7 pages
Computer SC
No ratings yet
Computer SC
30 pages
C++ and Data Structures Shortned Programs
No ratings yet
C++ and Data Structures Shortned Programs
20 pages
all dsa program
No ratings yet
all dsa program
35 pages
DS Practical Journal
No ratings yet
DS Practical Journal
123 pages
DSA Lab List
No ratings yet
DSA Lab List
21 pages
DSA_Exe_No.11
No ratings yet
DSA_Exe_No.11
5 pages
dsa - Copy
No ratings yet
dsa - Copy
7 pages
Ds Programs All
No ratings yet
Ds Programs All
26 pages
Dsa 11
No ratings yet
Dsa 11
10 pages
DS internal programs
No ratings yet
DS internal programs
11 pages
Dsa Practical Questions
No ratings yet
Dsa Practical Questions
40 pages
C-- CODE OF PRACTICAL.docx
No ratings yet
C-- CODE OF PRACTICAL.docx
22 pages
Data Structure Record
No ratings yet
Data Structure Record
94 pages
Ds&Cpp Record
No ratings yet
Ds&Cpp Record
48 pages
My Cs Notes
No ratings yet
My Cs Notes
28 pages
Programs
No ratings yet
Programs
54 pages
DSA ANS
No ratings yet
DSA ANS
9 pages
code
No ratings yet
code
4 pages
191CS35 - Lab Programs Print Out
No ratings yet
191CS35 - Lab Programs Print Out
26 pages
Dsa
No ratings yet
Dsa
59 pages
Some Dsa Programs
No ratings yet
Some Dsa Programs
56 pages
Name
No ratings yet
Name
46 pages
23HCS4103 DS1 Merged
No ratings yet
23HCS4103 DS1 Merged
64 pages
Index: S.No Date Experiments NO Signature Object Oriented Programming
No ratings yet
Index: S.No Date Experiments NO Signature Object Oriented Programming
56 pages
Sahil Sharma Dsa File
No ratings yet
Sahil Sharma Dsa File
57 pages
Advanced Data Structures Lab Updated
No ratings yet
Advanced Data Structures Lab Updated
14 pages
OOPS C++ File
No ratings yet
OOPS C++ File
46 pages
DS Practical File by Simran
No ratings yet
DS Practical File by Simran
65 pages
DoubledLinkedList Implemented Using C++
No ratings yet
DoubledLinkedList Implemented Using C++
5 pages
oops hi
No ratings yet
oops hi
67 pages
Original With Detail Out Put
No ratings yet
Original With Detail Out Put
64 pages
Tree
No ratings yet
Tree
3 pages
Datastructure Programs
No ratings yet
Datastructure Programs
66 pages
Codes (DSA)
No ratings yet
Codes (DSA)
31 pages
C++ Lab Programs - With output-FINAL
No ratings yet
C++ Lab Programs - With output-FINAL
26 pages
Dsa 2
No ratings yet
Dsa 2
12 pages
coLabfile
No ratings yet
coLabfile
14 pages
Sheet
No ratings yet
Sheet
7 pages
Function Overloading
No ratings yet
Function Overloading
38 pages
C++ Guides
No ratings yet
C++ Guides
6 pages
Array Tasks
No ratings yet
Array Tasks
14 pages
DSA DA - 1 - Merged - Compressed
No ratings yet
DSA DA - 1 - Merged - Compressed
30 pages
C++ Lab Manual
100% (2)
C++ Lab Manual
115 pages
Program No. Factorial Using Recursion
No ratings yet
Program No. Factorial Using Recursion
28 pages
DSA Practical List
No ratings yet
DSA Practical List
13 pages
150+ C Pattern Programs
From Everand
150+ C Pattern Programs
Hernando Abella
No ratings yet
Professional Writing
No ratings yet
Professional Writing
7 pages
Micro Embedded Solutions Micro Embedded Solutions: World of The Electronics
No ratings yet
Micro Embedded Solutions Micro Embedded Solutions: World of The Electronics
1 page
Teju Transport Report C++
100% (1)
Teju Transport Report C++
24 pages
Java Introduction
No ratings yet
Java Introduction
19 pages
Infrared Remote Switch Project Report
75% (24)
Infrared Remote Switch Project Report
34 pages
Download the 2025 version of Test Bank for Modern Systems Analysis and Design 6th Edition by Hoffer (PDF) with all chapters
100% (9)
Download the 2025 version of Test Bank for Modern Systems Analysis and Design 6th Edition by Hoffer (PDF) with all chapters
57 pages
Unit 3
No ratings yet
Unit 3
17 pages
HP Z400_Z600_Z800 Workstation - Diagnostic LED Codes _ HP® Customer Support
No ratings yet
HP Z400_Z600_Z800 Workstation - Diagnostic LED Codes _ HP® Customer Support
1 page
CMSC21 Recario LabWk1 CBasics
No ratings yet
CMSC21 Recario LabWk1 CBasics
5 pages
English 4 IT - Unit 19 A Controversial IT Purchase Reading
No ratings yet
English 4 IT - Unit 19 A Controversial IT Purchase Reading
2 pages
Python Numbers
No ratings yet
Python Numbers
1 page
Quectel MC60 GSM Reference Design Rev.A Preliminary 160530
No ratings yet
Quectel MC60 GSM Reference Design Rev.A Preliminary 160530
11 pages
Oneaccess1645 PDF
No ratings yet
Oneaccess1645 PDF
54 pages
ARM MC Module 03
No ratings yet
ARM MC Module 03
21 pages
Ethernet Cable: Types, Performance & Pinout - Cat 5, 5e, 6, 6a, 7, 8
No ratings yet
Ethernet Cable: Types, Performance & Pinout - Cat 5, 5e, 6, 6a, 7, 8
7 pages
Ultrasound Digital Doppler
No ratings yet
Ultrasound Digital Doppler
68 pages
Assignment no 1 assembly language
No ratings yet
Assignment no 1 assembly language
14 pages
Agile Unified Process
0% (1)
Agile Unified Process
2 pages
ZS5601 AZ5121 zone selector manual
No ratings yet
ZS5601 AZ5121 zone selector manual
8 pages
Assembly Language Basics Presentation
No ratings yet
Assembly Language Basics Presentation
47 pages
6132
No ratings yet
6132
3 pages
Powerspace GitHub
No ratings yet
Powerspace GitHub
4 pages
Syllabus Electronics
No ratings yet
Syllabus Electronics
12 pages
EGN3211.Chapter.11.Non Graded Questions
100% (1)
EGN3211.Chapter.11.Non Graded Questions
7 pages
Esplink For PC: User Manual (Manu-0024 Rev. 01)
No ratings yet
Esplink For PC: User Manual (Manu-0024 Rev. 01)
25 pages
Advantages of Bus Topology
No ratings yet
Advantages of Bus Topology
4 pages
Ra Sapnotes Res DWLD
No ratings yet
Ra Sapnotes Res DWLD
24 pages
라자비 초3
No ratings yet
라자비 초3
51 pages
PDMS and Associated Products Installation Guide
No ratings yet
PDMS and Associated Products Installation Guide
86 pages
IOT2050 How To Firmware Update V1.1
No ratings yet
IOT2050 How To Firmware Update V1.1
10 pages
lcd-mst6m48v2.0c 244 PDF
No ratings yet
lcd-mst6m48v2.0c 244 PDF
12 pages
En 808D Commissioning Guide 2013-09
No ratings yet
En 808D Commissioning Guide 2013-09
98 pages

Uploaded by

Uploaded by

Practical 1:

using namespace std;

// funtion to check if character is operator or not

// Convert prefix to Postfix expression

string preToPost(string pre_exp) {

int length = pre_exp.size();

// reading from right to left

for (int i = length - 1; i >= 0; i--) {

// pop two operands from stack

string op1 = s.top(); s.pop();

string op2 = s.top(); s.pop();

// concat the operands and operator

string temp = op1 + op2 + pre_exp[i];

// Push string temp back to stack

// push the operand to the stack

// stack contains only the Postfix expression

//string pre_exp = "*-A/BC-/AKL";

cout << "Postfix : " << preToPost(pre_exp);

using namespace std;

using namespace std;

void towerOfHanoi(int n, char from_rod,

char to_rod, char aux_rod)

" to rod " << to_rod<<endl;

towerOfHanoi(n - 1, from_rod, aux_rod, to_rod);

" to rod " << to_rod << endl;

towerOfHanoi(n - 1, aux_rod, to_rod, from_rod);

int n = 4; // Number of disks

towerOfHanoi(n, 'A', 'C', 'B'); // A, B and C are names of rods

using namespace std;

cout<<"Entyer the no:";

cout<<"Sum of "<<n <<" is :"<<sum;

using namespace std;

void display(NODE *start)

cout<< temp->data << " ";

NODE* insertend(NODE *start)

cout<<"\nNode at the End inserted successfully\n";

NODE* insertbefore (NODE *start,int key)

NODE *p,*cur, *prev;

cout<<"Element"<<key<<"Not found in the list"<<endl;

cout<<"\n Node Inserted Before"<<key<<endl;

NODE* insertfront (NODE *start)

cout<<"\n Node at the beginning Inserted successfully\n";

NODE *start= NULL;

int choice, key, pos;

cout<<"3.Insert Before a given Element"<<endl;

// cout<<"4.Insert at the Position"<<endl;

cout<<"\n\n Enter Your Choice";

case 1: start = insertfront(start);

case 2: start = insertend(start);

cout<<"Enter the key element:"<<endl;

cout<<"Enter the Position:"<<endl;

using namespace std;

void Dequeue::insertFront(int itm)

cout<<"\ninsertion is not possible overflow!!1";

for(int i=rear; i>=front;i--)

void Dequeue::insertRear(int itm)

cout<<"\ninsertion is not possible overflow!!!";

cout<<endl<<"*********************Queue Element are**************\n";

cout<<"\nDeletion is not possible underflow!!!";

cout<<endl<<"Deleted Element = "<<ele<<endl;

cout<<"\nDeletion is not possible underflow!!!";

cout<<"\n1.insert at begining\n2.insert at end\n3.display\n4.Deletion from front\n5.deletion from

cout<<"\nEnter your choice<1-6>:";

cout<<"Enter the element to be inserted:";

cout<<"Enter the element to be inserted:";

using namespace std;

NODE *p=new NODE;

NODE* push(int itm,NODE *top)

cout<<"\nOverflow...no memory in heap...";

NODE* pop(NODE* top)

void Displaystack(NODE *top)

cout<<"\n The contents of list:\n";

cout<<"\n Stack Using Doble LInked list******\n";

cout<<"Enter your option:";

cout<<"\nEnter item to be inserted :";

using namespace std;

NODE *p=new NODE;

cout<<"Enter element to be inserted :";

NODE p,cur, *prev;

cout<<endl<<"*******Queue Element are\n";