Search & Filtering
Two brackets are considered to be a matched pair if the an opening
bracket (i.e., (, [, or { ) occurs to the left of a closing bracket (i.e., ),
], or }) of the exact same type. There are three types of matched
pairs of brackets: [], {}, and (). A matching pair of brackets is not
balanced if the set of brackets it encloses are not matched. WAP to
determine whether the input sequence of brackets is balanced or not.
If a string is balanced, it print YES on a new line; otherwise, print
NO on a new line.
Example: Input: {[()]} and Output: YES
Input: {[(])} and Output: NO
WAP to convert an infix expression into its equivalent prefix
notation.
WAP to convert an infix expression into its equivalent postfix
notation.
Write a menu driven program to perform the following
operations of a stack using linked list by using suitable user defined
functions for each case.
Write a menu driven program to perform the following
operations of a stack using array by using suitable user defined
functions for each case.
a) Check if the stack is empty b) Display the contents of stack
c) Push d) Pop
Write an assembly language program that uses 3 byte variables, a, b, and c. The variable are initialized before the program starts with the values 2, 5, and 0, respectively. The program will add, sub, divide and multiply the contents of the variable a to that of b and store the result into c. Only c will change.
