Stack - Implementation. You will be able to use the push, pop and peek of Stack concept.

Post-Fix calculator - When an arithmetic expression is presented in the postfix form, you can use a stack to evaluate the expression to get the final value. For example: the expression 3 + 5 * 9 (which is in the usual infix form) can be written as 3 5 9 * + in the postfix. More interestingly, post form removes all parentheses and thus all implicit precedence rules.

Use the stack concept to create a post-fix calculator.

Queue - Implementation.

Palindrome Checker - A palindrome is a string that is the same forwards as backwards. For example, the following strings are palindromes:

" ", "a", "aa", "bb", "aba", "bab", "bob"

These are not:

"ab", "ba", "bba", "abb"

Use the Queue concept to create a palindrome checker.