Let assume we have a list of numbers contains even and odd numbers , so you need tobuild an algorithm to make the odd number in the beginning of the list and the evennumber at the end of the list. For example:List=[5,6,8,3,1,7,10] so after you build the algorithm the result will be as below:List=[5,3,1,7,6,8,10]I want thesolution onOUBuild scriptTo answer question 1, you need to do the following:1. Write an algorithm to do the above task.2. Implement the algorithm using OUBuild script following the algorithm.3. Provide 2 screenshots showing output using two different Lists.4. What is the most efficientgorithm to sort the List in question 1.

ANSWER: # Python program to segregate even and odd elements of array def segregateEvenOdd(arr):…

Let assume we have a list of numbers contains even and odd numbers, so you need to build an algorithm to make the odd number in the beginning of the list and the even number at the end of the list. For example: List=[5,6,8,3,1,7,10] so after you build the algorithm the result will be as below: List=[5,3,1,7,6,8,10] | so I want the solution on OUBuild script To answer question 1, you need to do the following: 1. Write an algorithm to do the above task. 2. Implement the algorithm using OUBuild script following the algorithm. 3. Provide 2 screenshots showing output using two different Lists. 4. What is the most efficient algorithm to sort the List in question 1.

Let assume we have a list of numbers contains even and odd numbers, so you need to build an algorithm to make the odd number in the beginning of the list and the even number at the end of the list. For example: List=[5,6,8,3,1,7,10] so after you build the algorithm the result will be as below: List=[5,3,1,7,6,8,10] | so I want the solution on OUBuild script To answer question 1, you need to do the following: 1. Write an algorithm to do the above task. 2. Implement the algorithm using OUBuild script following the algorithm. 3. Provide 2 screenshots showing output using two different Lists. 4. What is the most efficient algorithm to sort the List in question 1.

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

If the numbers are odd, the median is defined as the middle number after sorting them in order. If the number is even, it is the average of the middle two numbers. You begin with a blank number list. Then you may add new numbers to the list or remove existing ones. Output the median after each add or delete action. Example:The third value in the sorted list, which is, is the median for the given collection of integers. Similar to this, the median of a collection of numbers is equal to the average of the second and third element in the sorted set, or. Input:The first line of the input contains an integer, "," which represents the number of operations. The following lines are all either an x or r x. A x denotes an addition to the set, while a r x denotes a removal from the set. Output:For every action: If the operation is an addition, output the median on a single line following the addition. Output Wrong! on a single line if the operation is remove and the number is not in the list.…
PYTHON Suppose that I have a list A (list of list) A = [ [1, 3, 5], [2, 3, 4], [4, 6, 3] ] I want to add the first element of A[0] (which is 1) to the first element of A[1] (which is 2) to the first element of A[2] (which is 4) so I get 1 + 2 + 4 = 7 Now I want to do the same for the second element of A[0], A[1] and A[2] so I get 3 + 3 + 6 = 12 Similarly for the third element of A[0], A[1] and A[2] I get 5 + 4 + 3 = 12 The result is given as a list called 'sum': sum = [7, 12, 12] sum[0] is the total of first element of A[0], A[1] and A[2] sum[1] is the total of second element of A[0], A[1] and A[2] sum[2] is the total of third element of A[0], A[1] and A[2] Now write a function in python that returns the same results for a list of n elements. Each element in a list n has the same length. ls = [ [...], [...], [...], [...], ...., [...] ]
Given a singly linked list, reverse the list. This means you have to reverse every node. For example if there are 4 nodes, the node at position 0 will move to position 3, the node at 1 will move to position 2 and so on. You do not have to write the Node class just write what you have been asked to. You are NOT allowed to create a new list. In python language
Baby Names: Each year, the government releases a list of the 10,000 most common baby namesand their frequencies (the number of babies with that name). The only problem with this is thatsome names have multiple spellings. For example, "John" and ''.Jon" are essentially the same namebut would be listed separately in the list. Given two lists, one of names/frequencies and the otherof pairs of equivalent names, write an algorithm to print a new list of the true frequency of eachname. Note that if John and Jon are synonyms, and Jon and Johnny are synonyms, then John andJohnny are synonyms. (It is both transitive and symmetric.) In the final list, any name can be usedas the "real" name.EXAMPLEInput:Names: John (15), Jon (12), Chris (13), Kris (4), Christopher (19)Synonyms: (Jon, John), (John, Johnny), (Chris, Kris), (Chris, Christopher)Output: John (27), Kris (36)
Write a pyhton program that starts with an empty list. Your program must ask theuser for a positive integer n, generate n random integers in the range [1-10] (inclusive),store them in that list, and print it.Your program then must repeatedly ask the user to enter a number and a string to replaceall occurrences of that number in the list with that string (e.g., replace all 1’s with "hello",all 8’s with “hi”, etc.). At every iteration, print the updated list and the number of times anumber was replaced. Your program stops when the user enters ‘q’. Input validation isoptional. Hint: use a for (counter controlled) loop inside a while (event-controlled) loop. Sample output:n >> 13List: [1, 3, 3, 9, 5, 7, 8, 2, 10, 8, 4, 1, 1]Enter a number to change ['q' to quit]>> 1with string >> helloList: ['hello', 3, 3, 9, 5, 7, 8, 2, 10, 8, 4, 'hello', 'hello']The number 1 was replaced 3 timesEnter a number to change ['q' to quit]>> 8with string >> hiList: ['hello', 3, 3,…
. Each next problem is based on theprevious.1) Suppose we have a listlst = [1,2,3,4,9,0]What is a one-liner discussed in chapter 11 to get the length of said list?2) Assuming you are dealing with the same list, how can you mutate the list to be:lst = [1,2,3,4,9,6,0]3) Continuing with the new list, how do we find the position of 9?4) Now remove element at index 2 and return its value.5) We don’t like the first 4 numbers, delete them with a single command.6) We have a short list left, but the order is wrong, how do you reverse the list?
A user is going to enter numbers one at a time, entering 'q' when finished. Put the numbers in a list, sort it in numerical order, and print out the list. Then print out the middle element of the list. (If the list has an even number of elements, print the one just after the middle.) Remember that a list 1st of numbers can be sorted numerically by calling 1st.sort(), and can be printed with print(1st). You can assume that every entry is either a valid integer or is the letter 'q'. Examples: If the input is 4 3 6 7 3 q The output is [3, 3, 4, 6, 7] 4 If input is 4 3 6 7 3 2 q The output is [2, 3, 3, 4, 6, 7] 4
Implement the following method using the Fork/JoinFramework to assign random values to the list.public static void parallelAssignValues(double[] list)Write a test program that creates a list with 9,000,000 elements and invokesparallelAssignValuesto assign random values to the list. Also implement asequential algorithm and compare the execution time of the two. Note if you useMath.random(), your parallel code execution time will be worse than the sequentialcode execution time because Math.random() is synchronized and cannot beexecuted in parallel. To fix this problem, create a Random object for assigningrandom values to a small list.
IN python Given a list and an integer, determine if that integer is "everywhere" in the list. We define a value as being "everywhere" if, for every pair of adjacent elements in the list, at least one element in the pair is that value. Return true if the given value is "everywhere" in the list. Otherwise, return false. The first input is the comma delimited string (use .split() to turn it into a list). The next input is the integer that we are trying to determine is "everywhere". Sample Input 1 1,2,1,3 1 Sample Output 1 True There are three pairs in this list: (1,2), (2,1), and (1,3). Since 1 is in three of these pairs, it is "everywhere". Thus, we return true. Sample Input 2 1,2,1,3 2 Sample Output 2 False There are three pairs of adjacents in this list: (1,2), (2,1) and (1,3). Since 2 is NOT in all pairs, it is not "everywhere". Thus, we return false. Sample Input 3 1,2,1,3,4 1 Sample Output 3 False The input is not in all "pairs", e.g., not in (3, 4). Thus, we return false.
Write a method subsets that uses recursive backtracking to find every possible sub-list of a given list. A sub-list of a list L contains 0 or more of L's elements. Your method should accept a List of strings as its parameter and print every sub-list that could be created from elements of that list, one per line. For example, suppose a variable called list stores the following elements: [Janet, Robert, Morgan, Char]The call of subsets(list); would produce output such as the following: [Janet, Robert, Morgan, Char][Janet, Robert, Morgan][Janet, Robert, Char][Janet, Robert][Janet, Morgan, Char][Janet, Morgan][Janet, Char][Janet][Robert, Morgan, Char][Robert, Morgan][Robert, Char][Robert][Morgan, Char][Morgan][Char][][3:07 AM]The order in which you show the sub-lists does not matter, but the order of the elements of each sub-list DOES matter (Note: this requirement is a limitation of Practice-It testing code. The textbook version of the problem would accept an answer with the elements in…
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.
Implement the following method in parallel to sort a list usingquick sort: public static void parallelQuickSort(int[] list) Write a test program that times the execution time for a list of size 9,000,000 usingthis parallel method and a sequential method.