Using the function provided, write a function that decides whether two lists are "identical". That is, if cycling by any number N makes the lists identical, the function should return True, otherwise, it should return False. for example identical([1,2,3,4,5], [5,4,1,2,3,]) should give True and identical([1,2,3,4,5,6], [1,2,3,5,4]) should give False

Using the function provided, write a function that decides whether two lists are "identical". That is, if cycling by any number N makes the lists identical, the function should return True, otherwise, it should return False. for example identical([1,2,3,4,5], [5,4,1,2,3,]) should give True and identical([1,2,3,4,5,6], [1,2,3,5,4]) should give False

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

What is the time complexity and complexity analysis. of the code below and why? n=int(input("Enter number of elements in list: "))l=[]index=[]m=int(input("Enter number of smallest numbers: "))print("Enter elements: ")for i in range(n): # print("enter") a=int(input()) l=l+[a] index=index+[i] zips = zip(l, index)s = sorted(zips) sorts = zip(*s)l, index = [ list(tuple) for tuple in sorts] print(l[:m])print("index of smallest numbers are:" ,index[:m])
7) Implement counting sort over a list of keys that lie within the range (a, b),where a and b are small positive integers input by the user.8) Implement bucket sort with an array of lists data structure to sort i) a list ofstrings, ii) a list of floating point numbers and iii) a list of integers, which areuniformly distributed over a range, for an appropriate choice of the number ofbuckets.
def longest_chain(lst: List[int]) -> int: """ Given a list of integers, return the length of the longest chain of 1's that start from the beginning. You MUST use a while loop for this, and are not allowed to use a for loop. >>> longest_chain([1, 1, 0]) 2 """ Don't use any imports, or any dictionaries or dictionary methods and also try-except statements.
def find_missing(input_list): sum_of_elements = sum(input_list) # There is exactly 1 number missing n = len(input_list) + 1 actual_sum = (n * ( n + 1 ) ) / 2 return int(actual_sum - sum_of_elements)list_1 = [1,5,6,3,4] find_missing(list_1)# 2.
Write a program in Java programming language that reads an array of strings! Program should write the shortest string from the array.
Array List: Write a program that reads in words and prints them out in reverse order. Complete this code.
Write a program in Java programming language that reads an array of strings!The program should write all the strings from array that have at least one letter 'a'.
Java 1. Make an insertion sort with a random number generator. Print the lists of both the sorted and random values.
Single number (use XOR): Given a non-empty array of integers nums, every element appears twice except for one. Find that single one. You must implement a solution with a linear runtime complexity and use only constant extra space. Code in Java A brief explanation of how and why your code works and how it relates to the concepts learned (for example, it uses bitwise operation, stack, or takes into account a word size).
import java.util.Scanner;import java.util.ArrayList; public class UserIDSorting {// TODO: Write the partitioning algorithm - pick the middle element as the // pivot, compare the values using two index variables l and h (low and high), // initialized to the left and right sides of the current elements being sorted,// and determine if a swap is necessarypublic static int partition(ArrayList<String> userIDs, int i, int k) {} // TODO: Write the quicksort algorithm that recursively sorts the low and // high partitionspublic static void quicksort(ArrayList<String> userIDs, int i, int k) {} public static void main(String[] args) {Scanner scnr = new Scanner(System.in); ArrayList<String> userIDList = new ArrayList<String>(); String userID; userID = scnr.next();while (!userID.equals("-1")) {userIDList.add(userID);userID = scnr.next();}// Initial call to quicksort quicksort(userIDList, 0, userIDList.size() - 1); for (int i = 0; i < userIDList.size(); ++i)…
2. The quick-sort algorithm presented in the book and covered in this course selects the first element in the list as the pivot. We can revise it by selecting the median among the first, middle, and last elements in the list. Implement your algorithm in java and upload your .java file.
10. Given a list of unsorted integers, find the pair of elements that have the smallest absolute differencebetween them. If there are multiple pairs, find them all.Input FormatThe first line contains a single integer , the length of the list.The second line contains space-separated integers, .Output FormatOutput the pairs of elements with the smallest difference. If there are multiple pairs, Output any one of them.Sample Input 010-20 -3916237 -357920 -3620601 7374819 -7330761 30 6246457 -6461594 266854Sample Output 0-20 30Explanation 0(30) - (-20) = 50, which is the smallest difference.Sample Input 112-20 -3916237 -357920 -3620601 7374819 -7330761 30 6246457 -6461594 266854 -520 -470Sample Output 1-520 -470Explanation 1(-470) - (-520) = 30 - (-20) = 50, which is the smallest difference. Only the first pair is given as output.Sample Input 245 4 3 2Sample Output 22 3