20. Consider an algorithm intending to store all prime numbers between 2 and 20 (inclusive) in a list prime_list. There exists a helper function called is_prime(n) which returns True if n is prime and False if n is not prime. i = 1 prime_list = 0| while i <= 10: #missing code Which of the following can be used replace the missing code? (a) if is_prime(2*i): prime_list.append(2*i) i = i+ 1 (b) if is_prime(2*i): prime_list.append(2*i) i =i+ 1 (c) if is_prime(i): prime_list.append(2*i) i =i+ 1 (d) prime_list.append(is_prime(2*i)) i = i+1

20. Consider an algorithm intending to store all prime numbers between 2 and 20 (inclusive) in a list prime_list. There exists a helper function called is_prime(n) which returns True if n is prime and False if n is not prime. i = 1 prime_list = 0| while i <= 10: #missing code Which of the following can be used replace the missing code? (a) if is_prime(2i): prime_list.append(2i) i = i+ 1 (b) if is_prime(2i): prime_list.append(2i) i =i+ 1 (c) if is_prime(i): prime_list.append(2i) i =i+ 1 (d) prime_list.append(is_prime(2i)) i = i+1

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter17: Linked Lists

Section: Chapter Questions

Problem 18PE

See similar textbooks

Similar questions

Please answer it in Python Write a function extrait_pairs that takes as an argument a list l1 and returns the list obtained from l1 keeping only the even integers (and without changing their order). Be careful, l1 must not be modified by the function. Example: extrait_pairs([4, 7, 12, 0, 3]) is [4, 12, 0] and extrait_pairs([21, 17, 3]) is [ ].
That's enough for you! def first_preceded_by_smaller(items, k=1): Given a list of items, find and return the value of the first element for which at least k smaller elements precede that element in items. If no such element exists inside the list, this function should return None. The required k smaller items do not need to be consecutive immediate predecessors of the current item, but can be any k items positioned before the current element. items k Expected result [4, 4, 5, 6] 2 5 [42, 99, 16, 55, 7, 32, 17, 18, 73] 3 18 [42, 99, 16, 55, 7, 32, 17, 18, 73] 8 None ['bob', 'carol', 'tina', 'alex', 'jack', 'emmy', 'tammy', 'sam', 'ted'] 4 'tammy' [9, 8, 7, 6, 5, 4, 3, 2, 1, 10] 1 10 [42, 99, 17, 3, 12] 2 None
The function interleave_lists in python takes two parameters, L1 and L2, both lists. Notice that the lists may have different lengths. The function accumulates a new list by appending alternating items from L1 and L2 until one list has been exhausted. The remaining items from the other list are then appended to the end of the new list, and the new list is returned. For example, if L1 = ["hop", "skip", "jump", "rest"] and L2 = ["up", "down"], then the function would return the list: ["hop", "up", "skip", "down", "jump", "rest"]. HINT: Python has a built-in function min() which is helpful here. Initialize accumulator variable newlist to be an empty list Set min_length = min(len(L1), len(L2)), the smaller of the two list lengths Use a for loop to iterate k over range(min_length) to do the first part of this function's work. On each iteration, append to newlist the item from index k in L1, and then append the item from index k in L2 (two appends on each iteration). AFTER the loop…
Implement the following function def maxValue(alist: list)->int. alist contains integers only. This function finds and returns the largest numbr in the list. for example, alList-(1,5, 2), calling maxValue(alist) should return 5. Because 5 is the largest number in the list.
Using Binary Search, write a function in Python named length_of_line, which takes two inputs: points_lists – The list containing nested lists of starting and ending x and y coordinates of different lines. For e.g: [[(x1, y1), (x2, y2)], [(x1, y1), (x2, y2)], [(x1, y1), (x2, y2)], [(x1, y1), (x2, y2)]]. length – The length of a line. Now determine, if any line present in the points_lists has a same length as that of required length.Return the index of that line. If the line is not found, return -1. Hint: Estimate the length of a line with the help of the distance formula. test cases below: >>> length_of_line([[(2,4),(4,6)], [(1,2),(4,6)], [(4,0),(6, 6)]], 5.0) 1 >>> length_of_line([ [(2,4),(4,6)], [(1,2),(4,6)],[(4,0),(6, 6)]], 6.32) 2 >>> length_of_line([ [(2,4),(4,6)], [(1,2),(4,6)],[(4,0),(6, 6)]], 1.0) -1
Below is a Python function definition for a linear search of a list lst for element. It returns the first index at which element can be found in the list (or None) if element is not in the list. def linearSearch(lst, element): i = 0 for item in lst: if element == item: return i else: i += 1 return None Write a similar MATLAB function linearSearch.m. Your MATLAB function should take as parameters an unsorted list of non-negative integers, and an integer value, and returns the index where that value is first located in the list. (No argument testing is required.) Unlike the Python code which returns None if the value is not in the array, your MATLAB function should return the value -1 if the value is not found.
Implement a function void printAll(void) to print all the items of the list.
Write a Python Code for the given function and conditions: Given function: def insert(self, newElement) Pre-condition: None. Post-condition: This method inserts newElement at the tail of the list. If an element with the same key as newElement already exists in the list, then it concludes the key already exists and does not insert the key.
Computer Science In Julia or Haskell
Write a function find_max_tuple() that gets a list of tuples as parameter, finds and returns the tuple with maximum sum inside the list. Write Python statements that create a sample list that has tuples inside (you can use the list of tuples in the sample run below), then use find_max_tuple() function to get the tuple with maximum sum and print it. Sample tuples=[(3,4,360,6),(1,2),(12,),(132,244,64),(72,71,70)] The maximum tuple is (132,244,64)
Suppose, you are given a doubly linked list of student marks. Write down a function that checks whether the list is sorted in descending order or not. If the list is sorted, it will return true. Otherwise, it will return false. You must use the following structure to implement the function. 10 struct node double marks; node* next; node* prev; node* head, tail; For the following list, the function will return false. head tail 2.5 3.8 4.5 6.78 10
Solve this problem in java programming