The following recursive function is supposed to return a list that is the reverse of the list it was given. But it has a bug.What is the bug? (Line numbers are not part of the code.)1. def revlist(Ist):2.if len(Ist) == 0:3.return Ist4.else:5.return revlist(lst[1:]) + [Ist[0]O Line 5 should use Ist.append() instead of concatenation.O Line 4 should be elif:, not else:O Line 2 should be: if Ist == []:O The parameter Ist should be list.O The base case should be: if len(Ist)== 0 or len(Ist) == 1:Question 7What is the output of running the following program?def showme(arg):if arg < 10:

Given: Condition in Python Program

The following recursive function is supposed to return a list that is the reverse of the list it was given. But it has a bug What is the bug? (Line numbers are not part of the code.) 1. def revlist(Ist): 2. if len(Ist) == 0: 3. return Ist 4. else: 5. return revlist(Ist[1:]) + [Ist[0]] Line 5 should use Ist.append( instead of concatenation. O Line 4 should be elif:, not else: Line 2 should be: if Ist == []: O The parameter Ist should be list. O The base case should be: if len(Ist) == 0 or len(Ist) == 1:

The following recursive function is supposed to return a list that is the reverse of the list it was given. But it has a bug What is the bug? (Line numbers are not part of the code.) 1. def revlist(Ist): 2. if len(Ist) == 0: 3. return Ist 4. else: 5. return revlist(Ist[1:]) + [Ist[0]] Line 5 should use Ist.append( instead of concatenation. O Line 4 should be elif:, not else: Line 2 should be: if Ist == []: O The parameter Ist should be list. O The base case should be: if len(Ist) == 0 or len(Ist) == 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

Write a recursive function in Python which should take a nested/embedded list and return us the number of string elements present in it (also counting the strings present in inner lists). Sample calls are shown below; >>> countstr([10,'abc',20,'hello']) 2 >>> countstr([10,'abc',2,'20']) 2 >>> countstr([10,'abc',20,['20','fahad',100], None, 10.5]) 3
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
Write and test a recursive function max to find the largest number in a list.The max is the larger of the first item and the max of all the other items.
Write a function in a racket code that takes as input a list of elements and returns a list with elements and their position after. For example, if the input to the function is (list ’a ’b ’c) then it will return (list a 1 b 2 c 3). Make sure to use recursion
The task is to get input (n) and make a list from 2 to n and remove its multiples from the list by applying recursive functions. Example: Input: 6 Output: [2, 3, 4, 5, 6] How to apply this python code in the task? def createList(n): #Base Case/s #TODO: Add conditions here for your base case/s #if <condition> : #return <value> #Recursive Case/s #TODO: Add conditions here for your recursive case/s #else: #return <operation and recursive call> #remove the line after this once you've completed all the TODO for this function return [] def removeMultiples(x, arr): #Base Case/s #TODO: Add conditions here for your base case/s #if <condition> : #return <value> #Recursive Case/s #TODO: Add conditions here for your recursive case/s #else: #return <operation and recursive call> #remove the line after this once you've completed all the TODO for this function return []
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.
The Binary Search algorithm works by testing a mid-point, then eliminating half of the list. In this exercise, you are going to take our binary search algorithm and add print statements so that you can track how the search executes. Inside of the recursive binary search function, add print statements to print out the starting, ending, and midpoint values each time. Then as you test a value, print out the results, either too high, too low, or a match. Sample Output Starting value: 0 Ending value: 9 Testing midpoint value: 4 Too high! Starting value: 0 Ending value: 3 Testing midpoint value: 1 Too low! Starting value: 2 Ending value: 3 Testing midpoint value: 2 Match!
How can I create a list by asking for input (x) and create a list from 1 to x using recursion? Example: Input: 12 Output: [1,2,3,4,5,6,7,8,9,10,11,12] def newlist(n): #Base Case/s #Add conditions here for your base case/s #if <condition> : #return <value> #Recursive Case/s #Add conditions here for your recursive case/s #else: #return <operation and recursive call> function return []
Code in python Use the fact that either the first element of a list is the largest or the largest is somewhere in the rest of the list to get a recursive function for computing the maximum element in a list. DO NOT use the max built in function
Construct recursive versions of the library functions that: a. calculate the "sum" of a list of numbers. b. "take" a given number of elements from the beginning of a list. c. select the "last" element of a non-empty list .
Code in python Use the fact that either the first element of a list is the largest or the largest is somewhere in the rest of the list to get a recursive function for computing the maximum element in a list. DO NOT use the max built in function def maximum(L): """ returns the largest element in a non-empty list L."""
Written in Dr Racket: Write a recursive function that takes a list of numbers as input and returns a list of the numbers in ascending order.Use the quicksort algorithmUse ( 20 13 74 5 12 9 22 95 22 6 101 72 3 53 33 21 96) as input. To do that, calculate the average value of a sublist before dividing it.(quicksort ‘( 20 13 74 5 12 9 22 95 22 6 101 72 3 53 33 21 96))returns ‘(3 5 6 9 12 13 20 21 22 22 33 53 72 74 95 96 101) Do not use sort, quicksort, set!, or mean.