What gets printed if the function: lastFun() is called with n = 10?%3Ddef lastFun(n):sequence = [n]while n!= 1:%3Dif n %2 == 0:=D%=n =n/2else:n = 3* n+ 1sequence.append(n)print(sequence)(10, 10, 10, 10, 10][10, 31, 15, 7, 3, 1)[10, 1, 2, 3, 4, 5, 1][10, 5, 16, 8, 4, 2, 1]

Given that, What gets printed if the function: IastFun() is called with n = 10? def lastFun(n):…

What gets printed if the function: lastFun() is called with n = 10? %3! def lastFun(n): sequence = [n] while n!= 1: if n %2 == 0: n =n/2 else: n = 3* n+ 1 sequence.append(n) print(sequence) [10, 10, 10, 10, 10] [10, 31, 15, 7, 3, 1) [10, 1, 2, 3, 4, 5, 1] [10, 5, 16, 8, 4, 2, 1]

What gets printed if the function: lastFun() is called with n = 10? %3! def lastFun(n): sequence = [n] while n!= 1: if n %2 == 0: n =n/2 else: n = 3* n+ 1 sequence.append(n) print(sequence) [10, 10, 10, 10, 10] [10, 31, 15, 7, 3, 1) [10, 1, 2, 3, 4, 5, 1] [10, 5, 16, 8, 4, 2, 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 the following function to sort a list of points on their y-coordinates. Each point is a list of two values for x- and y- coordinates. # Returns a new list of points sorted on the y-coordinatesdef sort(points):For example, the points [[4, 2], [1, 7], [4, 5], [1, 2], [1, 1], [4, 1]] will be sortedto [[1, 1], [4, 1], [1, 2], [4, 2], [4, 5], [1, 7]]. Write a test program that displaysthe sorted result for points [[4, 34], [1, 7.5], [4, 8.5], [1, -4.5], [1, 4.5],[4, 6.6]] using print(list).
Write a function little_sum (number_list, limit) that returns the sum of only the numbers in number_list that are less than or equal to the given limit. In this question you must use a for loop and you are not allowed to use the sum function. For example: Test Result numbers = [1, 2, 3, 4, 5, 6] total = little_sum(numbers, 3) print(total) values = [6, 3, 4, 1, 5, 2] 10 total = little_sum(values, 4) print(total)
Part (a) Write a python function that computes the binomial coefficient ("). The function should return the correct answer for any positive integer n and k where k=m pass Part (c) Suppose that the number of people in the trial is 100. Then: • Plot a curve that shows how the probability of type 1 error changes with the choice of m, for m = 1,...n assuming that the null hypothesis holds (in red), • On the same picture, plot the probability of type 2 error vs the value of m in the case in which the new drug is effective with proability 0.68 (in blue). You can plot the two curves using matplotlib.pyplot. You can select the color by passing color='r' or color='b' to the plt.plot() function. [4]: n - 100 # your code here def plot_curve (): pass [5]: plot_curve() Part (d) Based on the picture above, what value of m do you think would be suitable to keep both type 1 and type 2 error small at the same time? (You may assume that the company claims the new drug has 68% accuracy) [6]: # your…
Write a function count_evens(nums) that takes a list of ints called nums and returns the number of even ints in the given list. Note: the % "mod" operator computes the remainder, e.g. 5 % 2 is 1.
2. code locations Consider the following C code and the corresponding assembly code: void baz(int a, int * p) { pushq %rbp movq %rsp,%rbp subq $16,%rsp int c; C = a-*p; movl %ecx,16(%rbp) movq %rdx, 24(%rbp) movq 24(%rbp), %rax movl (%rax),%eax movl 16(%rbp),%edx subl %eax,%edx movl %edx,%eax movl %eax,-4(%rbp) cmpl $0, -4(%rbp) je L2 if (c) { int d = c*2; movl -4(%rbp),%eax addl %eax,%eax movl %eax,-8(%rbp) *p -= d; movl 24(%rbp),%rax movl (%rax),%eax subl -8(%rbp),%eax movl %eax,%edx movq 24(%rbp), %rax movl %edx, (%rax) jmp L4: (continued on next page)
The function sum_evens in python takes a list of integers and returns the sum of all the even integers in the list. For example: Test Result print(sum_evens([1, 5, 2, 5, 3, 5, 4])) 6 print(sum_evens([5, 5, -5, -5])) 0 print(sum_evens([16, 24, 30])) 70
Question 2 For each of the following, fill in the appropriate initial accumulator value: let rec tail_sum_list lst acc = match 1st with I (] -> acc i h::t -> tail_sum_list t (h+acc) Correct initial accumulator: 0 let rec tail_strdup n str acc - if n = 0 then acc else tail_strdup (n-1) str (str^acc) Correct initial accumulator: = match 1st with let rec floatmul lst acc I [] -> acc I h::t -> floatmul t (h *. acc) Correct initial accumulator:
The function should be written in python language. Write a function called "zero_triples" to return all triples in a list of integers that sum to zero. You can assume the list won't contain any duplicates, and a triple should not use the same number more than once. [In]: zero_triples([1, 2, 4]) [Out]: [] [In]: zero_triples([-3, 1, 4, 2]) [Out]: [[1, 2, -3]] [In]: zero_triples([-9, 1, -3, 2, 4, 5, -4, -1]) [Out]: [[-9, 4, 5], [1, -3, 2], [-3, 4, -1], [5, -4, -1]]
Here is a function that is supposed to return True if word (any string) ends with "s" and False otherwise: def ends_with_s(word):if len(word) < 1:return False return word[-1] == "s" Here is the test function I am using to test ends_with_s: def test_ends_with_s(): assert(ends_with_s("cats")) # option 1 assert(ends_with_s("") is False) # option 2 assert(ends_with_s("apple") is False) # option 3 assert(ends_with_s("S")) # option 4 Rewrite ends_with_s so that the test passes
PYTHON Complete the function below, which takes two arguments: data: a list of tweets search_words: a list of search phrases The function should, for each tweet in data, check whether that tweet uses any of the words in the list search_words. If it does, we keep the tweet. If it does not, we ignore the tweet. data = ['ZOOM earnings for Q1 are up 5%', 'Subscriptions at ZOOM have risen to all-time highs, boosting sales', "Got a new Mazda, ZOOM ZOOM Y'ALL!", 'I hate getting up at 8am FOR A STUPID ZOOM MEETING', 'ZOOM execs hint at a decline in earnings following a capital expansion program'] Hint: Consider the example_function below. It takes a list of numbers in numbers and keeps only those that appear in search_numbers. def example_function(numbers, search_numbers): keep = [] for number in numbers: if number in search_numbers(): keep.append(number) return keep def search_words(data, search_words):
In c++, please! Thank you! Write a void function SelectionSortDescendTrace() that takes an integer array and sorts the array into descending order. The function should use nested loops and output the array after each iteration of the outer loop, thus outputting the array N-1 times (where N is the size). Complete main() to read in a list of up to 10 positive integers (ending in -1) and then call the SelectionSortDescendTrace() function. If the input is: 20 10 30 40 -1 then the output is: 40 10 30 20 40 30 10 20 40 30 20 10 The following code is given: #include <iostream> using namespace std; // TODO: Write a void function SelectionSortDescendTrace() that takes// an integer array and the number of elements in the array as arguments,// and sorts the array into descending order.void SelectionSortDescendTrace(int numbers [], int numElements) { } int main() { int input, i = 0; int numElements = 0; int numbers [10]; // TODO: Read in a list of up to 10 positive…
The function 'CountWords' is given below to find the number of words in a sentence. Which of the following is the missing code line? int CountWords(char *P) { int count3D0,words3D0,i; while(P[count]!='\0') count++;for (i=0;i<=count;i++) { a. if ((P[i=" "&&P[I]I="')||P[i]=="\0') b. if ((P[i+1]==' '&&P[i+1]!=' ')||P[i)=='\0') E. if ((P[i+1]==' '&&P[i]!=' ')||P[i+1]=="\0') words++; } return words; } d. if ((P[i]==' '&&P[i+1]1=' ')||P[]=D%='\0')