Parenthesis Matching program in C programming
In this tutorial post, we will write a Parenthesis matching program in a c programming language with practical program code examples and complete a full explanation with the output.
Tower of Hanoi Non-Recursive Using Stack program in C programming
In this post tutorial, we will write a Tower of Hanoi Non-recursive using a stack program in a c programming language with practical program code examples and a complete full explanation with output.
Tower of Hanoi Recursive program in C Programming
In this tutorial post, we will write a Tower of Hanoi Recursive program in the c programming language in which the user will enter the number of disks.
Check the Palindrome number program in c programming
In this tutorial, we are going to write a program in a c programming language that will get the string as input from the user and then check if the equation/string is a palindrome number or not.
Print the reverse of a string using Stack program in c
In this tutorial post we are going to write a Print the Reverse of a string program in c programming.
Evaluate a Postfix and Prefix equation program in c
In this tutorial post, we are going to write to evaluate a postfix and prefix equation program in c programming.
Infix to Postfix and Prefix Equation program in c
In this tutorial post we will write a Infix to postfix and prefix equation program in c programming language.
Stack Operations program in c Programming
In this tutorial, we are going to write a C program to perform stack operations like push, pop, and peep. before we start with the program please read about the stack.
Tower of Hanoi (Recursive & Non-recursive)
Algorithm – Tower of Hanoi (recursive) TOWER(N,BEG,AUX,END)This procedure gives a recursive solution to the Towers of Hanoi problem for N disks. 1. If N = 1, then: (a) Write: BEG -> END. (b) Return. [End of If structure.] 2. [Move N – 1 disks from BEG to AUX.] […]
Parenthesis matching using stack
Parenthesis matching algorithm PARENTHESIS_MATCHING (EQ, VALID) This algorithm checks whether the expression EQ written in infix notation is valid or not and assigns TRUE or FALSE to VALID. 1. Scan EQ from left to right until the end of the equation is encountered: 2. If”(“is encountered then: put it in the STACK. 3. […]