A palindrome is a string that reads the same forwards as backward. Using only a fixed number of stacks and queues, the stack and queue ADT functions, and a fixed number of int and char variables, write a code to determine if a string is a palindrome. Assume that the string is read from standard input one character at a time. The code should output true or false as appropriate.

04. Let E = {0, 1} and A, B be the list of three strings each. Verify below PCP has a solution or not? List A List B W, X, 1 00 001 11 1000 011 -18(R16), Q10(b)

Using c++ Contact list: Binary Search   A contact list is a place where you can store a specific contact with other associated information such as a phone number, email address, birthday, etc. Write a program that first takes as input an integer N that represents the number of word pairs in the list to follow. Word pairs consist of a name and a phone number (both strings). That list is followed by a name, and your program should output the phone number associated with that name. Define and call the following function. The return value of FindContact is the index of the contact with the provided contact name. If the name is not found, the function should return -1 This function should use binary search. Modify the algorithm to output the count of how many comparisons using == with the contactName were performed during the search, before it returns the index (or -1). int FindContact(ContactInfo contacts[], int size, string contactName) Ex: If the input is: 3 Frank 867-5309 Joe…

Create one program that lets the user enter multiple digits in base 10 and the program will display it in all basses From base (2) to Base (36).

1. Write a program that reads two strings from the keyboard using a while loop A.Terminate the loop when both strings have the same content, done B.Display both strings if the contents are different C.For strings with the same contents, display if they are at the same address 2.Demonstrate a situation in which the JVM will use garbage collection 3.Given the following strings: Middlesex CollegeDemonstrate the use of the following String methodsconcat(), length(), trim(), charAt(), both substring()

A sequential search of a sorted list can halt when the target is less than a given element in the list. Modify the program to stop when the target becomes less than the current value being compared. In a sorted list, this would indicate that the target is not in the list and searching the remaining values is unnecessary.   -----------------------------------------------------------------------------------   """ File: search.py Project 11.1 """ def sequentialSearch(target, lyst):     """Returns the position of the target item if found,     or -1 otherwise.     The lyst is assumed to be sorted in ascending order."""     position = 0     while position < len(lyst):         if target == lyst[position]:             return position         position += 1     return -1 def main():     """Tests with three lists."""     print(sequentialSearch(3, [0, 1, 2, 3, 4]))     print(sequentialSearch(3, [0, 1, 2]))     # Should stop at second position.     print(sequentialSearch(3, [0, 4, 5, 6])) if…

Simple Python Coding Exercise   Code your program according to the following algorithm 1. Prompt the user for a string of words on one line separated by spaces.2. Convert the input string a list of words called input_list. (Hint: use split())3. Create a new empty list called output_list (i.e., output_list=[])4. Scan input_list to find the smallest word.    When the smallest word is found, append that word to output_list and remove it from input_list.5. If input_list still has words in it, go to step 4.6. When input_list is empty, convert output_list into a string of words separated by spaces. (Hint: use join())7. Print the string.

String doctor_names is read from input. Split doctor_names into tokens using a vertical bar ('|') as the separator and assign patients_list with the result. Ex: If the input is Harry|Suki|Maria, then the output is: ['Harry', 'Suki', 'Maria']