his program is about identifying palindromes. A palindrome is a list that reads the same forward as backward. For example, [2, 5, 2] is a palindrome. [2, 5, 2, 2] is not a palindrome. Write a prolog function, is_palindrome(X), that returns true if the list X is a palindrome, otherwise it returns false. Note that an empty list is a palindrome. Examples: is_palindrome([1,1,3,1,1]) should return true. is_palindrome([1,3,1,1]) should return false. is_palindrome([1,3,3,1]) should return true. is_palindrome([a,b,l,e,w,a,s,i,e,r,e,i,s,a,w,e,l,b,a]) should return true.

his program is about identifying palindromes. A palindrome is a list that reads the same forward as backward. For example, [2, 5, 2] is a palindrome. [2, 5, 2, 2] is not a palindrome. Write a prolog function, is_palindrome(X), that returns true if the list X is a palindrome, otherwise it returns false. Note that an empty list is a palindrome. Examples: is_palindrome([1,1,3,1,1]) should return true. is_palindrome([1,3,1,1]) should return false. is_palindrome([1,3,3,1]) should return true. is_palindrome([a,b,l,e,w,a,s,i,e,r,e,i,s,a,w,e,l,b,a]) should return true.

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter18: Stacks And Queues

Section: Chapter Questions

Problem 16PE: The implementation of a queue in an array, as given in this chapter, uses the variable count to...

See similar textbooks

Similar questions

The function swap_list_ends in python takes one parameter, L, which is a list. The function then swaps the first and last items in L and returns the object None. Notice that since L is mutable, the changes the function makes to L are visible back in the calling program. SPECIAL CASE: If the list 'L' is empty, then the function does nothing to L and returns None. For example: Test Result L = [1, 3, 9, 2] if not(swap_list_ends(L) is None): print("Error: function should return None") print(L) [2, 3, 9, 1] L = ['super', 'awesome', 'excellent'] if not(swap_list_ends(L) is None): print("Error: function should return None") print(L) ['excellent', 'awesome', 'super'] L = [True, False] if not(swap_list_ends(L) is None): print("Error: function should return None") print(L) [False, True]
The for construction is a loops that iteratively processes a given list. Consequently, it works so long even though there are objects to process. What about this claim: true or false?
The function interleave_lists in python takes two parameters, L1 and L2, both lists. Notice that the lists may have different lengths. The function accumulates a new list by appending alternating items from L1 and L2 until one list has been exhausted. The remaining items from the other list are then appended to the end of the new list, and the new list is returned. For example, if L1 = ["hop", "skip", "jump", "rest"] and L2 = ["up", "down"], then the function would return the list: ["hop", "up", "skip", "down", "jump", "rest"]. HINT: Python has a built-in function min() which is helpful here. Initialize accumulator variable newlist to be an empty list Set min_length = min(len(L1), len(L2)), the smaller of the two list lengths Use a for loop to iterate k over range(min_length) to do the first part of this function's work. On each iteration, append to newlist the item from index k in L1, and then append the item from index k in L2 (two appends on each iteration). AFTER the loop…
In Python: Write a recursive function named Multiply2 that multiples by 2 and prints each element in a given list. For example: mylist=[1,2,3,4] Multiply2(mylist) prints: 2 4 6 8 Note: the function takes only one parameter, which is the list on which the operation will be performed. It's ok if the list becomes empty after calling the function.
Write a program that prompts the user to input a string and then outputs the string in the pig Latin form. The rules for converting a string into pig Latin form are described in Programming Example: Pig Latin Strings Your program must store the characters of a string into a linked list and use the function rotate, as described in Programming rotate the string.
Create a program that removes duplicate integer values from a list. For example if a list has these valuesList = [5, 7, 8, 10, 8, 5, 12, 15, 12]. After applying the removal function, you should have List = [5, 7, 8,10, 12, 15]. In your case you will get the numbers of list from the user.
In python, remove_from_list(my_list, indices): Takes two lists as input. Creates a new list from the first input list by removing the elements at indices given by the integers in the second input list, then return the new list. The indices in the second input list may have any order. For example, if the first input list is [4, 8, 12, 16], and the second input list is [0, 2], then the new list returned from the function should have the 4 and the 12 removed, because they were at indices 0 and 2 of the original list. Note: You do not need to consider negative indices for this function. >>> remove_from_list(['abc', 'def', 'ghi'], [1]) ['abc', 'ghi'] >>> strs = ['The', 'quick', 'brown', 'fox'] >>> remove_from_list(strs, [0, 3]) ['quick', 'brown'] >>> strs ['The', 'quick', 'brown', 'fox'] # original list is unchanged >>> remove_from_list(['The', 'quick', 'brown', 'fox'], [3, 0]) ['quick', 'brown']
A loop that iteratively processes a given list is called a for construct. So long as there are things to process, it will keep running. To what extent is this statement accurate or false?
Java Program A proper divisor of a positive integer, n, is a positive integer less than n whichd dividesevenly into n. Write a function that computes all of the proper divisors of ap positiveinteger. The integer will be passed to the function as its only parameter. Thef functionwill return a list containing all of the proper divisors as its only result.Complete this exercise by writing a main program that demonstrates the function byr readinga value from the user and displaying the list of its proper divisors. Ensuret thatyour main program only runs when your solution has not been imported into anotherf file
Implement a function void printAll(void) to print all the items of the list.
The implementation of a queue in an array, as given in this chapter, uses the variable count to determine whether the queue is empty or full. You can also use the variable count to return the number of elements in the queue. On the other hand, class linkedQueueType does not use such a variable to keep track of the number of elements in the queue. Redefine the class linkedQueueType by adding the variable count to keep track of the number of elements in the queue. Modify the definitions of the functions addQueue and deleteQueue as necessary. Add the function queueCount to return the number of elements in the queue. Also, write a program to test various operations of the class you defined.
scheme: Q7: No Repeats Implement no-repeats, which takes a list of numbers s as input and returns a list that has all of the unique elements of s in the order that they first appear, but no repeats. For example, (no-repeats (list 5 4 5 4 2 2)) evaluates to (5 4 2). Hints: To test if two numbers are equal, use the = procedure. To test if two numbers are not equal, use the not procedure in combination with =. You may find it helpful to use the filter procedure. (define (no-repeats s) 'YOUR-CODE-HERE ) ;;; Tests (no-repeats (list 5 4 5 4 2 2)) ; expect (5 4 2)