0% found this document useful (0 votes)

61 views

Datastructure Practical - 2

The document describes how to implement a stack data structure using arrays and structs in C. It includes functions to push, pop, peek, and display elements in the stack. The array implementation shows pushing, popping, and other operations without and with separate functions. The struct implementation defines a node struct with next pointers and uses pointers to the stack top to implement the stack.

Uploaded by

WHATSAPP STATUSLY

Available Formats

Download as PDF, TXT or read online on Scribd

0% found this document useful (0 votes)

61 views

Datastructure Practical - 2

Uploaded by

WHATSAPP STATUSLY

Available Formats

Download as PDF, TXT or read online on Scribd

You are on page 1/ 39

20SOECE13007_DURAGIYA HITESH V.

DATA STRUCTURE(CE317)

Tutorial - 2

R.K. UNIVERSITY 1
20SOECE13007_DURAGIYA HITESH V. DATA STRUCTURE(CE317)

Output :

R.K. UNIVERSITY 2
20SOECE13007_DURAGIYA HITESH V. DATA STRUCTURE(CE317)

1. Design a data structure “stack” with necessary members (array,top,size). Also

implement operations on stack (push, pop, peep, change). (Note:- with and
without function ).

#include<stdio.h>

int stack[100],choice,n,top,x,i;

void push(void);

void pop(void);

void display(void);

void peek();

int main()

top=-1;

int r;

printf("Enter the size of STACK : ");

scanf("%d",&n);

printf("0.Without Function\n1.With Function\n-> ");

scanf("%d",&r);

if(r==0)

printf("\n STACK OPERATIONS USING ARRAY");

printf("\n--------------------------------");

printf("\n\t1.PUSH\n\t2.POP\n\t3.PEEK\n\t4.DISPLAY\n\t5.EXIT");

printf("\nEnter your choice : ");

scanf("%d",&choice);

R.K. UNIVERSITY 3
20SOECE13007_DURAGIYA HITESH V. DATA STRUCTURE(CE317)

if(choice==1)

if(top==n)

printf("Stack is overflow.");

else

int data;

printf("Enter value to push : ");

scanf("%d",&data);

top = top + 1;

stack[top] = data;

else if(choice==2)

if(top==-1)

printf("Stack is underflow");

else

R.K. UNIVERSITY 4
20SOECE13007_DURAGIYA HITESH V. DATA STRUCTURE(CE317)

int data;

stack[top] = data;

top = top - 1;

printf("Popped Element : %d",data);

else if(choice==3)

if(top==-1)

printf("Stack is underflow");

else

printf("Top Element = %d",stack[top]);

else if(choice==4)

if(top>=0)

printf("The elements in STACK -> ");

for(i=top; i>=0; i--)

R.K. UNIVERSITY 5
20SOECE13007_DURAGIYA HITESH V. DATA STRUCTURE(CE317)

printf("\n%d",stack[i]);

else

printf("The STACK is empty");

else

printf ("\t Please Enter a Valid Choice(1/2/3/4/5)");

else

printf("\n STACK OPERATIONS USING ARRAY");

printf("\n--------------------------------");

printf("\n\t1.PUSH\n\t2.POP\n\t3.PEEEK\n\t4.DISPLAY\n\t5.EXIT");

printf("\nEnter the Choice:");

scanf("%d",&choice);

switch(choice)

R.K. UNIVERSITY 6
20SOECE13007_DURAGIYA HITESH V. DATA STRUCTURE(CE317)

case 1:

push();

break;

case 2:

pop();

break;

case 3:

display();

break;

case 4:

peek();

break;

case 5:

break;

R.K. UNIVERSITY 7
20SOECE13007_DURAGIYA HITESH V. DATA STRUCTURE(CE317)

default:

printf ("\n\t Please Enter a Valid Choice(1/2/3/4/5)");

while(choice!=5);

return 0;

void push()

if(top>=n-1)

printf("\nSTACK is over flow");

else

printf("Enter a value to be pushed:");

scanf("%d",&x);

top++;

R.K. UNIVERSITY 8
20SOECE13007_DURAGIYA HITESH V. DATA STRUCTURE(CE317)

stack[top]=x;

void pop()

if(top<=-1)

printf("\nStack is under flow");

else

printf("\nThe popped elements is %d",stack[top]);

top--;

void peek()

if(top==-1)

printf("Stack is underflow");

else

R.K. UNIVERSITY 9
20SOECE13007_DURAGIYA HITESH V. DATA STRUCTURE(CE317)

printf("Top Element = %d",stack[top]);

void display()

if(top>=0)

printf("\nThe elements in STACK -> ");

for(i=top; i>=0; i--)

printf("\n%d",stack[i]);

else

printf("\nThe STACK is empty");

R.K. UNIVERSITY 10
20SOECE13007_DURAGIYA HITESH V. DATA STRUCTURE(CE317)

Output :

R.K. UNIVERSITY 11
20SOECE13007_DURAGIYA HITESH V. DATA STRUCTURE(CE317)

2. Design a data structure “stack” using “struct” with necessary members

(array,top,size). Also implement operations on stack (push, pop, peep, change).
(Note:- with and without function ).

#include <stdio.h>

#include <stdlib.h>

struct node

int info;

struct node *ptr;

}*top,*top1,*temp;

int topelement();

void push(int data);

void pop();

void empty();

void display();

void destroy();

void stack_count();

void create();

int count = 0;

int main()

R.K. UNIVERSITY 12
20SOECE13007_DURAGIYA HITESH V. DATA STRUCTURE(CE317)

int no, ch, e;

printf("\n 1 - Push");

printf("\n 2 - Pop");

printf("\n 3 - Top");

printf("\n 4 - Empty");

printf("\n 5 - Exit");

printf("\n 6 - Display");

printf("\n 7 - Stack Count");

printf("\n 8 - Destroy stack");

create();

while (1)

printf("\n Enter choice : ");

scanf("%d", &ch);

switch (ch)

case 1:

printf("Enter data : ");

scanf("%d", &no);

R.K. UNIVERSITY 13
20SOECE13007_DURAGIYA HITESH V. DATA STRUCTURE(CE317)

push(no);

break;

case 2:

pop();

break;

case 3:

if (top == NULL)

printf("No elements in stack");

else

e = topelement();

printf("\n Top element : %d", e);

break;

case 4:

empty();

break;

case 5:

exit(0);

case 6:

display();

break;

case 7:

R.K. UNIVERSITY 14
20SOECE13007_DURAGIYA HITESH V. DATA STRUCTURE(CE317)

stack_count();

break;

case 8:

destroy();

break;

default :

printf(" Wrong choice, Please enter correct choice ");

break;

return 0;

void create()

top = NULL;

void stack_count()

printf("\n No. of elements in stack : %d", count);

R.K. UNIVERSITY 15
20SOECE13007_DURAGIYA HITESH V. DATA STRUCTURE(CE317)

void push(int data)

if (top == NULL)

top =(struct node )malloc(1sizeof(struct node));

top->ptr = NULL;

top->info = data;

else

temp =(struct node )malloc(1sizeof(struct node));

temp->ptr = top;

temp->info = data;

top = temp;

count++;

void display()

top1 = top;

if (top1 == NULL)

R.K. UNIVERSITY 16
20SOECE13007_DURAGIYA HITESH V. DATA STRUCTURE(CE317)

printf("Stack is empty");

return;

while (top1 != NULL)

printf("%d ", top1->info);

top1 = top1->ptr;

void pop()

top1 = top;

if (top1 == NULL)

printf("\n Error : Trying to pop from empty stack");

return;

else

top1 = top1->ptr;

printf("\n Popped value : %d", top->info);

R.K. UNIVERSITY 17
20SOECE13007_DURAGIYA HITESH V. DATA STRUCTURE(CE317)

free(top);

top = top1;

count--;

int topelement()

return(top->info);

void empty()

if (top == NULL)

printf("\n Stack is empty");

else

printf("\n Stack is not empty with %d elements", count);

void destroy()

top1 = top;

while (top1 != NULL)

R.K. UNIVERSITY 18
20SOECE13007_DURAGIYA HITESH V. DATA STRUCTURE(CE317)

top1 = top->ptr;

free(top);

top = top1;

top1 = top1->ptr;

free(top1);

top = NULL;

printf("\n All stack elements destroyed");

count = 0;

R.K. UNIVERSITY 19
20SOECE13007_DURAGIYA HITESH V. DATA STRUCTURE(CE317)

Output :
Infix to postfix conversion

R.K. UNIVERSITY 20
20SOECE13007_DURAGIYA HITESH V. DATA STRUCTURE(CE317)

3. Develop the following stack application

a. Infix to postfix conversion

#include <stdio.h>

#include <string.h>

#include <stdlib.h>

struct Stack

int top;

unsigned capacity;

int* array;

};

struct Stack* createStack( unsigned capacity )

struct Stack* stack = (struct Stack*)

malloc(sizeof(struct Stack));

if (!stack)

return NULL;

stack->top = -1;

R.K. UNIVERSITY 21
20SOECE13007_DURAGIYA HITESH V. DATA STRUCTURE(CE317)

stack->capacity = capacity;

stack->array = (int) malloc(stack->capacity

sizeof(int));

return stack;

int isEmpty(struct Stack* stack)

return stack->top == -1 ;

char peek(struct Stack* stack)

return stack->array[stack->top];

char pop(struct Stack* stack)

if (!isEmpty(stack))

return stack->array[stack->top--] ;

return '$';

void push(struct Stack* stack, char op)

R.K. UNIVERSITY 22
20SOECE13007_DURAGIYA HITESH V. DATA STRUCTURE(CE317)

stack->array[++stack->top] = op;

int isOperand(char ch)

return (ch >= 'a' && ch <= 'z') ||

(ch >= 'A' && ch <= 'Z');

int Prec(char ch)

switch (ch)

case '+':

case '-':

return 1;

case '*':

case '/':

return 2;

case '^':

return 3;

R.K. UNIVERSITY 23
20SOECE13007_DURAGIYA HITESH V. DATA STRUCTURE(CE317)

return -1;

int infixToPostfix(char* exp)

int i, k;

struct Stack* stack = createStack(strlen(exp));

if(!stack)

return -1 ;

for (i = 0, k = -1; exp[i]; ++i)

if (isOperand(exp[i]))

exp[++k] = exp[i];

else if (exp[i] == '(')

push(stack, exp[i]);

R.K. UNIVERSITY 24
20SOECE13007_DURAGIYA HITESH V. DATA STRUCTURE(CE317)

else if (exp[i] == ')')

while (!isEmpty(stack) && peek(stack) != '(')

exp[++k] = pop(stack);

if (!isEmpty(stack) && peek(stack) != '(')

return -1;

else

pop(stack);

else

while (!isEmpty(stack) &&

Prec(exp[i]) <= Prec(peek(stack)))

exp[++k] = pop(stack);

push(stack, exp[i]);

while (!isEmpty(stack))

exp[++k] = pop(stack );

exp[++k] = '\0';

R.K. UNIVERSITY 25
20SOECE13007_DURAGIYA HITESH V. DATA STRUCTURE(CE317)

printf( "%s", exp );

int main()

char exp[] = "a+b+(c/d)*e/f";

infixToPostfix(exp);

return 0;

R.K. UNIVERSITY 26
20SOECE13007_DURAGIYA HITESH V. DATA STRUCTURE(CE317)

Output :
Evaluation of postfix expression

R.K. UNIVERSITY 27
20SOECE13007_DURAGIYA HITESH V. DATA STRUCTURE(CE317)

b. Evaluation of postfix expression

#include <stdio.h>

#include <string.h>

#include <ctype.h>

#include <stdlib.h>

struct Stack

int top;

unsigned capacity;

int* array;

};

struct Stack* createStack( unsigned capacity )

struct Stack* stack = (struct Stack*) malloc(sizeof(struct Stack));

if (!stack) return NULL;

stack->top = -1;

stack->capacity = capacity;

stack->array = (int) malloc(stack->capacity sizeof(int));

if (!stack->array) return NULL;

R.K. UNIVERSITY 28
20SOECE13007_DURAGIYA HITESH V. DATA STRUCTURE(CE317)

return stack;

int isEmpty(struct Stack* stack)

return stack->top == -1 ;

char peek(struct Stack* stack)

return stack->array[stack->top];

char pop(struct Stack* stack)

if (!isEmpty(stack))

return stack->array[stack->top--] ;

return '$';

void push(struct Stack* stack, char op)

R.K. UNIVERSITY 29
20SOECE13007_DURAGIYA HITESH V. DATA STRUCTURE(CE317)

stack->array[++stack->top] = op;

int evaluatePostfix(char* exp)

struct Stack* stack = createStack(strlen(exp));

int i;

if (!stack) return -1;

for (i = 0; exp[i]; ++i)

if (isdigit(exp[i]))

push(stack, exp[i] - '0');

else

int val1 = pop(stack);

int val2 = pop(stack);

switch (exp[i])

case '+': push(stack, val2 + val1); break;

case '-': push(stack, val2 - val1); break;

R.K. UNIVERSITY 30
20SOECE13007_DURAGIYA HITESH V. DATA STRUCTURE(CE317)

case '': push(stack, val2 val1); break;

case '/': push(stack, val2/val1); break;

return pop(stack);

int main()

char exp[] = "153+8-3*";

printf ("postfix evaluation: %d", evaluatePostfix(exp));

return 0;

R.K. UNIVERSITY 31
20SOECE13007_DURAGIYA HITESH V. DATA STRUCTURE(CE317)

Output :
To demonstrate the use of multiple stack

R.K. UNIVERSITY 32
20SOECE13007_DURAGIYA HITESH V. DATA STRUCTURE(CE317)

R.K. UNIVERSITY 33
20SOECE13007_DURAGIYA HITESH V. DATA STRUCTURE(CE317)

c. To demonstrate the use of multiple stack

#include<stdio.h>

#include<conio.h>

#define MAX_X 5

#define MAX_Y 5

int topx=-1;

int topy=10;

void push_x(int *stack)

int info;

if(topx>=(MAX_X-1))

{ printf("\nStack OverFlow");

return;

else

{ printf("\nEnter The info To Push : ");

scanf("%d",&info);

topx++;

stack[topx]=info;

}}

R.K. UNIVERSITY 34
20SOECE13007_DURAGIYA HITESH V. DATA STRUCTURE(CE317)

void push_y(int *stack)

int info;

if(topy<=(MAX_Y))

printf("\nStack OverFlow");

return;

else

printf("\nEnter The info To Push : ");

scanf("%d",&info);

topy--;

stack[topy]=info;

void pop_x(int *stack)

{ if(topx==-1)

printf("Stack X is Underflow");

return;

R.K. UNIVERSITY 35
20SOECE13007_DURAGIYA HITESH V. DATA STRUCTURE(CE317)

else

printf("Item Poped from stack X is :%d\n",stack[topx]);

topx--;

void pop_y(int *stack)

{ if(topy==10)

{printf("Stack y is Underflow");

return;

else

{ printf("Item Poped from stack Y is:%d\n",stack[topy]);

topy++;

}}

void display_x(int *stack)

int i;

if(topx==-1)

R.K. UNIVERSITY 36
20SOECE13007_DURAGIYA HITESH V. DATA STRUCTURE(CE317)

printf("Stack X is Empty");

return;

else

{ for(i=topx;i>=0;i--)

{printf("%d,",stack[i]);}

printf("\n");

}}

void display_y(int *stack)

int i;

if(topy==10)

{printf("Stack Y is Empty");

return;}

else

{for(i=topy;i<=9;i++)

printf("%d,",stack[i]);

printf("\n");

} }

R.K. UNIVERSITY 37
20SOECE13007_DURAGIYA HITESH V. DATA STRUCTURE(CE317)

int main()

{ int choice;

char ch;

int stack[MAX_X+MAX_Y];

{ printf("1.Push_X\n2.Push_Y");

printf("\n3.Pop_X\n4.Pop_Y");

printf("\n5.Display_X\n6.Display_Y");

printf("\n7.Exit");

printf("\nEnter Choice : ");

scanf("%d",&choice);

switch(choice)

case 1: push_x(stack);break;

case 2: push_y(stack);break;

case 3: pop_x(stack);break;

case 4: pop_y(stack);break;

case 5: display_x(stack);break;

case 6: display_y(stack);break;

case 7: break;

default: printf("Wrong Option...");

R.K. UNIVERSITY 38
20SOECE13007_DURAGIYA HITESH V. DATA STRUCTURE(CE317)

}while(choice!=7);

return 0;

R.K. UNIVERSITY 39

Parallel Algorithm Merged
No ratings yet
Parallel Algorithm Merged
76 pages
Programming in Modern C++
No ratings yet
Programming in Modern C++
1 page
Week 3
No ratings yet
Week 3
19 pages
Dsa Assignment 2 Drashti Patel 19BCE0602
No ratings yet
Dsa Assignment 2 Drashti Patel 19BCE0602
19 pages
stackll
No ratings yet
stackll
3 pages
DS Lab
No ratings yet
DS Lab
46 pages
Datastructure Practical - 4
No ratings yet
Datastructure Practical - 4
42 pages
Practical 1
No ratings yet
Practical 1
9 pages
A69 DS Ass11
No ratings yet
A69 DS Ass11
6 pages
DS (KCS-301) Unit 2 CSE Stack (Till ST)
No ratings yet
DS (KCS-301) Unit 2 CSE Stack (Till ST)
15 pages
202411005_ CS162_2
No ratings yet
202411005_ CS162_2
21 pages
Ds - All Codes
No ratings yet
Ds - All Codes
18 pages
DSA_EXP1.docx
No ratings yet
DSA_EXP1.docx
9 pages
9842 DSA Exp4
No ratings yet
9842 DSA Exp4
8 pages
Parth DS SEM 3
No ratings yet
Parth DS SEM 3
25 pages
DSA Practical File
No ratings yet
DSA Practical File
50 pages
DS Lab Manual-Final
No ratings yet
DS Lab Manual-Final
28 pages
XVCXBV XVXXXXXXXV
No ratings yet
XVCXBV XVXXXXXXXV
22 pages
Program: Implement Stack ADT Using Array
No ratings yet
Program: Implement Stack ADT Using Array
18 pages
Exercise 5
No ratings yet
Exercise 5
14 pages
Data Structures Lab
No ratings yet
Data Structures Lab
10 pages
Linked Lists
No ratings yet
Linked Lists
11 pages
Stack in Linked List
No ratings yet
Stack in Linked List
8 pages
Turbo C Code Solutions Fixed
No ratings yet
Turbo C Code Solutions Fixed
10 pages
Oop Notes
No ratings yet
Oop Notes
29 pages
DS Lab
No ratings yet
DS Lab
46 pages
Exp 4
No ratings yet
Exp 4
5 pages
Stack Problems
No ratings yet
Stack Problems
15 pages
sodapdf-converted (1)
No ratings yet
sodapdf-converted (1)
9 pages
Source Code
No ratings yet
Source Code
33 pages
DS Micro
No ratings yet
DS Micro
2 pages
Implementing Stack in C
No ratings yet
Implementing Stack in C
6 pages
DSA Using C
No ratings yet
DSA Using C
52 pages
DS File
No ratings yet
DS File
21 pages
Stack
No ratings yet
Stack
20 pages
MOHAMMED BILAL DS EXPERIMENT
No ratings yet
MOHAMMED BILAL DS EXPERIMENT
21 pages
Dsu Micro Project
No ratings yet
Dsu Micro Project
14 pages
Stack (Array Implementation)
No ratings yet
Stack (Array Implementation)
3 pages
UNIT_3
No ratings yet
UNIT_3
33 pages
Data Structure
No ratings yet
Data Structure
21 pages
Stack Implementation
No ratings yet
Stack Implementation
10 pages
Stack PDF
No ratings yet
Stack PDF
14 pages
Palindrome Using C Programming
No ratings yet
Palindrome Using C Programming
19 pages
DSU Program By Rajan Sir V2V
No ratings yet
DSU Program By Rajan Sir V2V
11 pages
DS
No ratings yet
DS
53 pages
Acp Part B Programs
No ratings yet
Acp Part B Programs
10 pages
Q 1. Write A Program To Implementation of The Stack Using Array
No ratings yet
Q 1. Write A Program To Implementation of The Stack Using Array
5 pages
Practical DS 2024
No ratings yet
Practical DS 2024
7 pages
Practical Stack Queue Linkedlist
No ratings yet
Practical Stack Queue Linkedlist
8 pages
DSA Programs 1 12
No ratings yet
DSA Programs 1 12
67 pages
Data Structures Practfile File
No ratings yet
Data Structures Practfile File
40 pages
DataStructure Lab Manual
No ratings yet
DataStructure Lab Manual
46 pages
Lab Assignment - V (Bcac393)
No ratings yet
Lab Assignment - V (Bcac393)
26 pages
Lab Program No. 3
No ratings yet
Lab Program No. 3
2 pages
Ques
No ratings yet
Ques
78 pages
Computer Science Practical File
No ratings yet
Computer Science Practical File
30 pages
Computer Science Practical File
No ratings yet
Computer Science Practical File
30 pages
Ashutosh Prasad Yadav Btech (Cse) - 3 Sem Roll No.-191112015010 Date-13-01-2021 CS392 Data Structure Practical
No ratings yet
Ashutosh Prasad Yadav Btech (Cse) - 3 Sem Roll No.-191112015010 Date-13-01-2021 CS392 Data Structure Practical
17 pages
Data Structure Lab Manual
No ratings yet
Data Structure Lab Manual
24 pages
Data Structure
No ratings yet
Data Structure
10 pages
DS2021 Lab Component
No ratings yet
DS2021 Lab Component
37 pages
Computer Engineering Laboratory Solution Primer
From Everand
Computer Engineering Laboratory Solution Primer
Karan Bhandari
No ratings yet
6 IP Security
No ratings yet
6 IP Security
30 pages
5 Smime
No ratings yet
5 Smime
10 pages
2 MAC and Hash Functions
No ratings yet
2 MAC and Hash Functions
34 pages
1 Public Key & RSA
No ratings yet
1 Public Key & RSA
28 pages
3 Digital Signature
No ratings yet
3 Digital Signature
15 pages
Datastructure Practical - 1
No ratings yet
Datastructure Practical - 1
12 pages
(Ebook) Programming in Objective-C, 4th Edition by Stephen Kochan ISBN 9780321811905, 0321811909 download
No ratings yet
(Ebook) Programming in Objective-C, 4th Edition by Stephen Kochan ISBN 9780321811905, 0321811909 download
53 pages
Code 2
No ratings yet
Code 2
5 pages
Multi-Core Computer Architecture: Review of Basic Computer Organization
No ratings yet
Multi-Core Computer Architecture: Review of Basic Computer Organization
26 pages
Cs Xii Preeti Arora Final
No ratings yet
Cs Xii Preeti Arora Final
89 pages
Ds&algoritms MCQ
No ratings yet
Ds&algoritms MCQ
14 pages
CS 5001 Syllabus
No ratings yet
CS 5001 Syllabus
6 pages
Preliminaries
No ratings yet
Preliminaries
45 pages
Chapter 1
No ratings yet
Chapter 1
73 pages
Aligning and Prompting Everything All at Once For Universal Visual Perception
No ratings yet
Aligning and Prompting Everything All at Once For Universal Visual Perception
5 pages
OOP Group C1
No ratings yet
OOP Group C1
7 pages
Discrete Mathematics (10B21MA211) : LTP Cr. 3 1 0 4
No ratings yet
Discrete Mathematics (10B21MA211) : LTP Cr. 3 1 0 4
40 pages
Jimma University Course Outline
50% (2)
Jimma University Course Outline
1 page
Chapter2 1
No ratings yet
Chapter2 1
26 pages
MCQ - Mobile Application Development
No ratings yet
MCQ - Mobile Application Development
4 pages
Pds Unit4 Notes
No ratings yet
Pds Unit4 Notes
12 pages
2017 - Tecm221 Group Game
No ratings yet
2017 - Tecm221 Group Game
4 pages
AI-Based Path Planning for Autonomous Robots
No ratings yet
AI-Based Path Planning for Autonomous Robots
3 pages
Program To Multiply Two 16 Bit Numbers ProjectsGeek
No ratings yet
Program To Multiply Two 16 Bit Numbers ProjectsGeek
5 pages
EN-7 Xe-145F Modbus Rev B
No ratings yet
EN-7 Xe-145F Modbus Rev B
1 page
3 Introduction To Arithmetic Sequence
No ratings yet
3 Introduction To Arithmetic Sequence
1 page
GATE 2023 CSE Question Paper PDF (Memory Based) General Aptitude
No ratings yet
GATE 2023 CSE Question Paper PDF (Memory Based) General Aptitude
8 pages
Anatomy of Mapreduce Job Run: Some Slides Are Taken From Cmu PPT Presentation
No ratings yet
Anatomy of Mapreduce Job Run: Some Slides Are Taken From Cmu PPT Presentation
73 pages
Class Management System
No ratings yet
Class Management System
65 pages
Lecture 1 Introduction
No ratings yet
Lecture 1 Introduction
66 pages
Aivp Paper 5837 15848 1 PB
No ratings yet
Aivp Paper 5837 15848 1 PB
12 pages
Exam2 Cheat Sheet PDF
No ratings yet
Exam2 Cheat Sheet PDF
10 pages
CS AI & ML
No ratings yet
CS AI & ML
178 pages
Exercise 02
No ratings yet
Exercise 02
12 pages

Datastructure Practical - 2

Uploaded by

Datastructure Practical - 2

Uploaded by

20SOECE13007_DURAGIYA HITESH V.

1. Design a data structure “stack” with necessary members (array,top,size). Also

printf("Enter the size of STACK : ");

printf("0.Without Function\n1.With Function\n-> ");

printf("\n STACK OPERATIONS USING ARRAY");

printf("\nEnter your choice : ");

printf("Enter value to push : ");

printf("Popped Element : %d",data);

printf("Top Element = %d",stack[top]);

printf("The elements in STACK -> ");

for(i=top; i>=0; i--)

printf("The STACK is empty");

printf ("\t Please Enter a Valid Choice(1/2/3/4/5)");

printf("\n STACK OPERATIONS USING ARRAY");

printf("\nEnter the Choice:");

printf ("\n\t Please Enter a Valid Choice(1/2/3/4/5)");

printf("\nSTACK is over flow");

printf("Enter a value to be pushed:");

printf("\nStack is under flow");

printf("\nThe popped elements is %d",stack[top]);

printf("Top Element = %d",stack[top]);

printf("\nThe elements in STACK -> ");

for(i=top; i>=0; i--)

printf("\nThe STACK is empty");

2. Design a data structure “stack” using “struct” with necessary members

struct node *ptr;

void push(int data);

int no, ch, e;

printf("\n 7 - Stack Count");

printf("\n 8 - Destroy stack");

printf("\n Enter choice : ");

printf("Enter data : ");

printf("No elements in stack");

printf("\n Top element : %d", e);

printf(" Wrong choice, Please enter correct choice ");

printf("\n No. of elements in stack : %d", count);

void push(int data)

top =(struct node *)malloc(1*sizeof(struct node));

temp =(struct node *)malloc(1*sizeof(struct node));

while (top1 != NULL)

printf("%d ", top1->info);

printf("\n Error : Trying to pop from empty stack");

printf("\n Popped value : %d", top->info);

printf("\n Stack is empty");

printf("\n Stack is not empty with %d elements", count);

while (top1 != NULL)

printf("\n All stack elements destroyed");

3. Develop the following stack application

a. Infix to postfix conversion

struct Stack* createStack( unsigned capacity )

struct Stack* stack = (struct Stack*)

stack->array = (int*) malloc(stack->capacity *

int isEmpty(struct Stack* stack)

char peek(struct Stack* stack)

char pop(struct Stack* stack)

void push(struct Stack* stack, char op)

int isOperand(char ch)

return (ch >= 'a' && ch <= 'z') ||

(ch >= 'A' && ch <= 'Z');

int Prec(char ch)

int infixToPostfix(char* exp)

struct Stack* stack = createStack(strlen(exp));

for (i = 0, k = -1; exp[i]; ++i)

else if (exp[i] == '(')

else if (exp[i] == ')')

while (!isEmpty(stack) && peek(stack) != '(')

if (!isEmpty(stack) && peek(stack) != '(')

while (!isEmpty(stack) &&

Prec(exp[i]) <= Prec(peek(stack)))

printf( "%s", exp );

char exp[] = "a+b+(c/d)*e/f";

b. Evaluation of postfix expression

struct Stack* createStack( unsigned capacity )

struct Stack* stack = (struct Stack*) malloc(sizeof(struct Stack));

if (!stack) return NULL;

stack->array = (int*) malloc(stack->capacity * sizeof(int));

top =(struct node )malloc(1sizeof(struct node));

temp =(struct node )malloc(1sizeof(struct node));

stack->array = (int) malloc(stack->capacity

stack->array = (int) malloc(stack->capacity sizeof(int));

case '': push(stack, val2 val1); break;