Skip to main content

The Fundamentals of Digital Marketing Certification

The Fundamentals of Digital Marketing Certification
Trying to make use of some spare time during these endless lockdowns. I completed The Fundamentals of Digital Marketing course on Google Digital Garage and got certified. This is not a great victory, nevertheless, I celebrate every small step towards a greater goal. #googlegarage #fundamentalsofdigitalmarketing #digitalmarketing

FDS 10

 Practical No: -10

Experiment No. 10: In any language program mostly syntax error occurs due to unbalancing

delimiter such as (), {}, []. Write a C++ program using stack to check whether given expression is

well parenthesized or not.

Code:

#include<iostream>

using namespace std;

const int MAX=20;

class Stack

{

 char expr[MAX];

 int top;

 public:

 Stack()

 {

 top=-1;

 }

 void push(char ch);

 char pop();

 bool isEmpty();

 bool isFull();

 void display();

 void checkParenthesis();

};

bool Stack::isEmpty()

{

 if(top==-1)

 return 1;


 else

 return 0;

}

bool Stack::isFull()

{

 if(top==MAX-1)

 return 1;


 else

 return 0;

}

void Stack::display()

{

 if(isEmpty()==1)

 cout<<"\n Stack is empty";


 else

 {

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

 {

 cout<<""<<expr[i];

 }

 }

}

void Stack::push(char ch)

{

 if(!isFull())

 {

 top++;

 expr[top]=ch;

 }

}

char Stack::pop()

{

 if(!isEmpty())

 {


 char ch=expr[top];

 top--;

 return ch;

 }

else

 {

 return '\0';

 }

}

void Stack::checkParenthesis()

{

 cout<<"\n Enter # as a deliminator after expression(At the end) \n";

 cout<<"\n Enter Expression:";

 cin.getline(expr,MAX,'#');

 char ch;

 bool flag=0;

 for(int i=0;expr[i]!='\0';i++)

 {

 if(expr[i]=='('||expr[i]=='['||expr[i]=='{')

 push(expr[i]);

 if(expr[i]==')'||expr[i]==']'||expr[i]=='}')

 {

 ch=pop();


 if((expr[i]==')'&& ch!='(')||(expr[i]==']'&& ch!='[')||(expr[i]=='}'&&ch!='{'))

 {

 cout<<"\n Expression is not parenthesized At"<<i<<"="<<expr[i];

 flag=1;

 break;

 }

 }

 }


 if(isEmpty()==1 && flag==0)

 cout<<"\n Given expression is Well Parenthesized.";

 else

 cout<<"\n Given expression is not Well Parenthesized.";

}

int main()

{

 char ch;

 do

 {

 Stack s;

 s.checkParenthesis();

 cout<<"\n Do you want to continue?(y/n):";

 cin>>ch;

 }

 while(ch=='y' || ch=='Y');

 return 0;

GALLERY

GALLERY
photos

ABOUT

HTML CSS, VB.net Developer and Java, C programming. With Loves Problem Solving and to Unreval the Mysteries behind the Magic of Computer Programming

Followers

MY PROJECTS

Popular posts from this blog

FDS 12

 Practical No: -12 Experiment No. 12: A double-ended queue(deque) is a linear list in which additions and deletions may be made at either end. Obtain a data representation mapping a deque into a one-dimensional array. Write C++ program to simulate deque with functions to add and delete elements from either end of the deque. Code: using namespace std; #include<iostream> #include<stdio.h> #include<process.h> #define MAX 30 typedef struct dequeue {  int data[MAX];  int rear,front; }dequeue; void initialize(dequeue *p); int isEmpty(dequeue *p); int isFull(dequeue *p); void enqueueRear(dequeue *p,int x); void enqueueFront(dequeue *p,int x); int dequeueFront(dequeue *p); int dequeueRear(dequeue *p); void display(dequeue *p); main() {  int i,x,choice,n;  dequeue q;  initialize(&q);  do  {  cout<<"\n 1.Create \n 2.Insert(rear) \n 3.Insert(front) \n 4.Delete(rear) \n 5.Delete(front)";  cout<<"\n 6.Display \n 7.Ex...

dsa

 https://drive.google.com/drive/folders/1xaWUPlioGjpK0WAmAD-mvlxAuA8eTK1c https://github.com/khan0003-py/SPPU-Computer-4th-Sem-Lab-Codes/tree/master/DSAL

FDS 11

 Practical No: -11 Experiment No. 11: Queues are frequently used in computer programming, and a typical example is the creation of a job queue by an operating system. If the operating system does not use priorities, then the jobs are processed in the order they enter the system. Write C++ program for simulating job queue. Write functions add job and delete job from queue. Code: using namespace std; #include<iostream> #include<stdio.h> #include<conio.h> #include<stdlib.h> #define SIZE 5 void enqueue(int x); void dequeue(); void display(); int FRONT=-1; int REAR=-1; int QUEUE[SIZE]; main() {  int x,ch;  while(1)  {  cout<<"\n 1:Add Job";  cout<<"\n 2:Delete Job";  cout<<"\n 3:Display";  cout<<"\n 4:Exit";  cout<<"\n Enter Your Choice:";  cin>>ch;  switch(ch)  {  case 1:  cout<<"Enter Job:";  cin>>x;  enqueue(x);  break;  case 2: ...

Contact us

Name

Email *

Message *