1-  Write a Python function that takes a user input of a word and returns True if it is a Palindrome and returns False otherwise (Your function should use a Stack data structure). A palindrome is a word that can be read the same backward as forward. Some examples of palindromic words are noon, civic, radar, level, rotor, kayak, reviver, racecar, redder, madam, and refer. 2-  Write a Python function that takes a stack of integer numbers and returns the maximum value of the numbers in the stack. The stack should have the same numbers before and after calling the function. 3-  Write a main function that tests the functions you wrote in 1 and 2 above and make sure that your code is well documented.

Scala programming

{JAVA data structure set} Suppose you have a list of numbers: numbers = [1, 2, 13, 4, 4, 5, 5, 6, 6, 7, 7, 12] Convert this list into a set and assign it to a new variable called unique_numbers. Print unique_numbers to see the result.

Programming Assignment # 3 Objective: To use stacks to solve a programming problem Write a Java program to evaluate infix expression (not necessarily fully parenthesized) using stacks. The priority of operators shall be taken into account. See https://en.wikipedia.org/wiki/Infix_notation for an example of an infix notation. Tip: You would probably need two stacks (a stack for numbers and stack for characters).  Input: The program should ask the user to input the infix expression Output: The result of the calculation Assumptions: • You can use the Stack implementation of the Java API, or use one of the ones we have covered in class. • Assume that the input expressions contain only positive integer values, and that the output is always an integer.  • The input that the user types can contain any string with the following characters: ( , ) , numbers operators, where numbers is any positive integer and operators are any of +, -, * , / • Your program assumes that the expression is…

C++ language

The destination of a function's return value may be represented as a sequence of instructions. When making modifications to the stack, keep in mind that they must not prevent the method from returning to its caller.

When you move the pointer too quickly, a phenomena known as submarineing happens when the cursor vanishes.

What do you need to know to dereference a pointer?

language = python