A function owl_and_rat() has been analyzed to run with O(n²) complexity to process a list of size n. Assuming this function takes 6 hours to process a list of size 200, how many hours would you expect this function would need to process a list of size 400? Answer with a number like 2, 17, or 399. Do not put the word hours in your answer.

A function owl_and_rat() has been analyzed to run with O(n²) complexity to process a list of size n. Assuming this function takes 6 hours to process a list of size 200, how many hours would you expect this function would need to process a list of size 400? Answer with a number like 2, 17, or 399. Do not put the word hours in your answer.

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter18: Stacks And Queues

Section: Chapter Questions

Problem 16PE: The implementation of a queue in an array, as given in this chapter, uses the variable count to...

See similar textbooks

Similar questions

A function owl_and_cat () has been analyzed to run with O(n) complexity to process a list of size n. Assuming this function takes 2 hours to process a list of size 300, how many hours would you expect this function to process a list of size 900?
Write a Python function peaksIndex() that takes a list as parameter, returns a list that contains the indexes of peak values in the list.A peak value is greater than its predecessor and its successor.Assume that the list contains numbers.Example: [4, 2, 5, 7, 6, 6, 4, 3, 5, 2, 6, 7] has 2 peaks, the first 7 (index 3) and the second 5 (index 8). Both of these values are greater than their predecessor and their successor. So the function will return [3, 8] for this list.Write only the answer of what is asked.
Implement this algorithm: Implement a function cross_out_multiples that takes as arguments a list of boolean values (true/false) called is_prime and a number n. The function sets the boolean values at all multiples of n (2*n, 3*n, 4*n ...) that are in the list to false. Implement a function sieve(n) which gives back a list of all primes below n.
write a Python function that takes in a list of integers (elements), checks whether the list is sorted or not, and returns True of False accordingly. You MUST provide the most efficient algorithm in terms of its time and space complexity. What is the time and space complexity of your algorithm/function? def is_sorted(my_list)
Write a Python function peaksIndex() that takes a list as parameter, returns a list that contains the indexes of peak values in the list.A peak value is greater than its predecessor and its successor.Assume that the list contains numbers.Example: [4, 2, 5, 7, 6, 6, 4, 3, 5, 2, 6, 7] has 2 peaks, the first 7 (index 3) and the second 5 (index 8). Both of these values are greater than their predecessor and their successor. So the function will return [3, 8] for this list.Write only the answer of what is asked. Unnecessary statements may result in loss of points.
The implementation of a queue in an array, as given in this chapter, uses the variable count to determine whether the queue is empty or full. You can also use the variable count to return the number of elements in the queue. On the other hand, class linkedQueueType does not use such a variable to keep track of the number of elements in the queue. Redefine the class linkedQueueType by adding the variable count to keep track of the number of elements in the queue. Modify the definitions of the functions addQueue and deleteQueue as necessary. Add the function queueCount to return the number of elements in the queue. Also, write a program to test various operations of the class you defined.
Please write a function PythQuad(n) in python that generates a list of pythagorean quadruples (x,y,z,w) such that x <= y <= z <= w < n. Please do not use a triply nested loop, use the properties of a pythagorean quadruple to write the function.
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
A run is a sequence of adjacent repeated values. Write a Python script to generate a sequence of 20 random die tosses and then print the die values, marking the runs by including them in parentheses, like this: 12 (5 5) 31243 (2222) 36 (55) 6 3 1 Use the functions: - generate_list(n,max): returns a list of n random numbers between 1, and max. - print_runs(values): this function prints the desired output sequence using the following pseudocode: Set a boolean variable inRun to false. For each valid index i in the list If inRun If values[i] is different from the preceding value Print ). inRun = false. If not inRun If values[i] is the same as the following value Print (. inRun = true. %3D Print values[i]. If inRun, print ). Insert the code here: def main(): #function to print the desired output
In python, the function countWordsOfLength takes a list of words L and an integer n, and returns the total number of words of length n that appear in the list. For example, countWordsOfLength(["yes", "no", "maybe", "NNOOO"], 5)would return 2 because the given list has two words of length 5. Hint: Use the accumulator pattern to solve this problem. Inside the for loop, use an if statement to only update the accumulator when the current word has length n. Hint: Instead of using a for loop with a range, you can iterate directly over the elements of L. For example: Test Result L = ['a', 'b', 'c', 'de', 'fgh', 'i', 'jkl'] print(countWordsOfLength(L, 1)) 4 L = ['a', 'b', 'c', 'de', 'fgh', 'i', 'jkl'] print(countWordsOfLength(L, 5)) 0 L = ['bacon', 'onion', 'pepper', 'garlic', 'paprika', 'chipotle chili powder', 'salt', 'black pepper', 'vinegar', 'bbq sauce', 'ketchup', 'mustard', 'brown sugar', 'beans'] print(countWordsOfLength(L, 5)) 3
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)
please code in pythonWrite a function that takes in a number and returns the sum of all primes less than or equal to that number. You'll need your answer to the previous problem to answer this.Example: sum_primes(11) == 2 + 3 + 5 + 7 + 11 == 28Bonus: Can you do this in one line with a list comprehension?