4.2.16 removeRepeats (mutating and nonmutating)EF D E F Qfrom cmu_cs3_utils import testFunction123 def mutatingRemoveRepeats (L):4return 425678910 def testMutatingRemoveRepeats():11L = [1, 5, 2, 2, 4, 4, 2112131415161718192021222324252627282930def nonmutatingRemoveRepeats (L):return 42@testFunction424344mutatingRemoveRepeats (L)assert (L == [1, 5, 2, 4])L = [-2, 15, -2, 3]mutatingRemoveRepeats (L)assert (L= [-2, 15, 3])L = [1, 1, 1]mutatingRemoveRepeats (L)assert (L [1])L = [1, 9, 5]mutatingRemoveRepeats (L)assert (L == [1, 9, 5])L = []mutatingRemoveRepeats (L)assert (L= [])assert (mutatingRemoveRepeats (L) == None)313233 @testFunction3435363738394041-def testNonmutatingRemoveRepeats():assert (nonmutatingRemoveRepeats ([1, 5, 2, 2, 4, 4, 2]) == [1, 5, 2, 4])assert (nonmutatingRemove Repeats([-2, 15, -2, 3]) == [-2, 15, 31)assert(nonmutatingRemoveRepeats([1, 1, 1]) == [1])assert (nonmutatingRemoveRepeats([1, 9, 5]) == [1, 9, 5])assert (nonmutatingRemoveRepeats([]) == [])#Verify that the function is nonmutating:L = [1, 2, 2, 3, 4, 4]nonmutatingRemoveRepeats (L)assert (L = [1, 2, 2, 3, 4, 4])4546 def main():47484950testMutatingRemoveRepeats()testNonmutatingRemoveRepeats()main()StopC ResetCheckCode HistoryRun● SavedWrite the function mutating RemoveRepeats (L) which takes a list L, and removes allthe repeated integers from L so only the first instance of each of those repeated integersremains. For example, if L = [1, 5, 2, 2, 4, 4, 2], then after a call tomutatingRemoveRepeats (L), then L == [1, 5, 2, 4].This is a mutating function, so it directly changes the provided list. You may assume that Lcontains only integers. As with most mutating functions, this function returns None.Also write the function nonmutatingRemoveRepeats (L), which works the same as theprevious function, only this version is non-mutating. It does not modify L, and it returns anew list without any repeated values.Note: You may not simply call mutatingRemoveRepeats (L) innonmutatingRemoveRepeats (L). Thus, instead of copying the list L and then mutatingthat copy to get the answer, you need to build up a new list from scratch, like we did in thenotes.

The Python code is given below. You can use those 2 functions given in your code

Write the function mutatingRemoveRepeats (L) which takes a list L, and removes all the repeated integers from L so only the first instance of each of those repeated integers remains. For example, if L = [1, 5, 2, 2, 4, 4, 21. then after a call to (L), then L == [1, 5, 2, 4]. mutatingRemoveRepeats This is a mutating function, so it directly changes the provided list. You may assume that L contains only integers. As with most mutating functions, this function returns None. Also write the function nonmutatingRemoveRepeats (L), which works the same as the previous function, only this version is non-mutating. It does not modify L., and it returns a new list without any repeated values. Note: You may not simply call mutatingRemoveRepeats (L) in nonmutatingRemoveRepeats (L). Thus, instead of copying the list and then mutating that copy to get the answer, you need to build up a new list from scratch, like we did in the notes.

Write the function mutatingRemoveRepeats (L) which takes a list L, and removes all the repeated integers from L so only the first instance of each of those repeated integers remains. For example, if L = [1, 5, 2, 2, 4, 4, 21. then after a call to (L), then L == [1, 5, 2, 4]. mutatingRemoveRepeats This is a mutating function, so it directly changes the provided list. You may assume that L contains only integers. As with most mutating functions, this function returns None. Also write the function nonmutatingRemoveRepeats (L), which works the same as the previous function, only this version is non-mutating. It does not modify L., and it returns a new list without any repeated values. Note: You may not simply call mutatingRemoveRepeats (L) in nonmutatingRemoveRepeats (L). Thus, instead of copying the list and then mutating that copy to get the answer, you need to build up a new list from scratch, like we did in the notes.

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

Implement a function countMultiples in Python that: accepts a single argument, a 2-dimensional list (e.g, list of lists) containing non-negative integers, and returns the count of those integers that are multiples of 5 but that are not not multiples of 10. (e.g., 65 should be counted, but 80 should not be counted) sample usage: >>> countMultiples( [[1,2,3],[4,5],[6,7,8,9]] ) # 5 counts1
Computer Science In Julia or Haskell
We have a list. For example [2,4,6,6,8,2,12,54,15]. Without repeating the elements in the list a new list that does not repeat its elements by creating and using the function that writes Create.
Does it hold for lists? :Write a function holds_for_lists : ’a list -> ’b list -> (’a -> ’b -> bool) -> bool = that takes an ’a list, an ’b list, a function f: ’ a -> ’b ->bool and returns true if and only if • The two list are of the same length, and • (f a b) is true for all pairs a, b such that a is from the first list, b is from the second list, and a and b appear in the same position in their lists. (oCaml)
Write a function removeRange() that takes a list of integer numbers and two integer numbers as parameters, returns a new list where the numbers between the 2nd and 3rd parameters (both inclusive) are removed from the 1st list. Assume 2nd parameter is less than the 3rd parameter.
Given a list of integers, implement a function that returns a list of all the subsets of the input list, where each subset is represented as a list of integers.
Please give me correct solution.
Write a function in Ocaml oddfirst : int list -> int list = that takes a int list and returns the same list, but where all odd numbers come before the even numbers
Python Please Define a function max_run(lst: list) -> int to find the maximum run in a list. A run is a subsequence with identifical values. For example, in [1, 1, 2, 2, 3, 4, 4, 4, 2, 4, 4], the runs are [1, 1], [2, 2], [3], [4, 4, 4], [2], and [4, 4]. The longest run is [4, 4, 4], which has 3 elements. max_run([1, 1, 2, 2, 3, 4, 4, 4, 2, 4, 4]) should return 3. max_run([]) == 0, max_run([1, 2, 3]) = 1, and max_run([1, 2, 1, 1]) = 2.
Implement a function pairsThatSum that accepts two arguments: 1. a target number2. a list of numbers the function then returns a list of tuple s that contains all pairs of numbers from the list that sum to the given target number. Note: the pair can be two numbers with the same value, e.g. (2,2) but these must be different items (have different locations) in the list. See the last example below. each pair should be reported only once (don't include a pair and its reverse), and each pair's values should be listed in the order that they occur in the list. E.g., the first example records the pair (0,3) instead of the pair (3,0) , because 0 occurs in the list before 4 . the list of pairs should be ordered by the order of the first value in the list, e.g., (0,3) comes before (1,2) because 0 comes before 1 in the list. (note: if you take the right approach, you won't have to do anything extra for this requirement) Below is an example of the output from the code: >>>…