Create a sequence function (the result of a space machine) and restore the truth when all the elements in the list are the same, and not false in some way. The list will contain 4 elements. Examples "@", "@", "@"]) → true "abc", "abc", "abc"]) →> true "SS", "SS", "SS"]) →> true "&", "&&&", "&&&&"]) → false "SS", "SS", "Ss"]) → false test_jackpot(["@", test_jackpot(["abc", test_jackpot(["SS", test_jackpot(["&&", test_jackpot(["SS",

Create a function that compares two lists of integer values to see whether they are identical (i.e. contain the same values). If the lists are not identical, the procedure must give the maximum value for each list.

Complete the function that computes the length of a path that starts with the given Point. The Point structure = point on the plane that is a part of a path. The structure includes a pointer to the next point on the path, or nullptr if it's the last point.   I'm not sure how to fill in the '?'; especially the while loop I'm not sure how to implement the condition for that.

Suppose Arr is a very large array of integer elements. The size of Arr is unknown. The first k elements are positive integers, greater than 0 and less than 1000, in increasing sorted order. The rest of the elements are greater than 1000.Write a function that determines whether a given positive integer, key, of value less than 1000 is an element in Arr or not. If the key is present in Arr, it returns its index otherwise it returns -1. The Time Complexity of the function shall be O(log(n)).(Note: It is to be remembered that both the size of Arr and k are unknown.)Array index is starting from 1 not 0 [pseudo code needed]Example:Arr: 4 5 7 12 15 24 67 221 233 430 500 1100 1200 1150 1050 1200 …key: 15returned value: 5Arr: 5 9 9 12 19 29 67 67 120 220 330 400 700 1001 1100 1150 1050 11250 1200 …key: 900returned value: -1

Suppose a list contains marks earned in the courses CSE110, PHY111, and MAT110 of each student consecutively in a nested list form. Your task is to take a course name as input and sort the list based on the marks obtained in that course to finally print the names of the students in descending order of marks obtained i.e. from the student who earned the highest marks to the student who earned the lowest. For example, the list may look like stu_lst = [ ["Alan", 95, 87, 91], ["Turing", 92, 90, 83], ["Elon", 87, 92, 80], ["Musk", 85, 94, 90] ] where for each nested list, 1st index holds the name of the student, 2nd index is total marks earned in the CSE110 course, 3rd index is PHY111 marks and 4th index is MAT110 marks. [You cannot use python build-in sort() function, you can call your own sort function or copy your code from previous tasks instead] =============================================================== Sample Input 1 MAT110 Sample Output 1 ['Alan', 'Musk', 'Turing', 'Elon']…

in #lang scheme

page WITH Write a function swap() that takes as input a list of items. If the list is not empty, it swaps its first and last elements. The function does not return anything. Sample result with list1= ['all', 'good', 'things', 'must', 'end', 'here'] after the function call list1 becomes: ['here', 'good', 'things', 'must', 'end', 'all'] Write 2 assert statements. www def swap(...): param: ... returns None if_name__ == "__main__": assert ... #TODO: complete your own assert

A for construct is used to build a loop that processes a list of elements in programming. To do this, it continues to operate forever as long as there are objects to process. Is this assertion truthful or false? Explain your response.

Implement a function void printAll(void) to print all the items of the list.

Implement the following function which compares two strings without using the library function. Prototype: int compare(char *str1, char *str2). The compare function returns 0 if str1 is equal to str2, returns 1 if str1 is greater than str2, and returns -1 if str2 is greater than str1. Then print the information in the main function.