Question in Java, please help thanks A function owl_and_rat() has been analyzed to run with O(n²) complexity toprocess a list of size n. Assuming this function takes 6 hours to process a list of size200, how many hours would you expect this function would need to process a list ofsize 400?Answer with a number like 2, 17, or 399. Do not put the word hours in your answer. A function chicken_and_egg() has been analyzed to run with 0(2) complexity toprocess a list of size n. Assuming this function takes 3 minutes to process a list ofsize 10, how many minutes would you expect this function would need to process alist of size 12 (that is, a list having TWO more items in it)?Answer with a number like 1, 2, or 499. Do not put the word minutes in youranswer.

As per the company policy, we are only allowed to solve the first given question among the two, So…

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.

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

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?
python code Write a recursive function such that, given a list of intergers (say v) and an integer value (say x), the function returns resulting subset if there is a subset of intergers in v that sum up to x. Otherwise the function returns an empty list; Also write a sample code that runs this function using an example list and value x, and state the expected result
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 javascript:// ENG 3:05 PM # CMS 2022-04-28
How can the following function be simplified so that it has a time complexity of O(n) or faster?For your information, the specifications of the functions are as follows: Using numbers ranging from 0 to 15 (inclusive), create all possible lists which sum up to K and have a length of N. Duplicated numbers are allowed as long as it fulfills the conditions above (this means [0,0,1], [0,1,0] and [1,0,0] are all correct outputs if K=1 and N=3). When instantiated with the list function, the list size of the function should be the number of all lists. For example, given K=23 and N=2, the expected list size is 8. The function must be able to accept N=10 and be finished before 9 seconds. Do not use itertools or external libraries.
The answer must be a Racket Code snapshot with output with the correct answer or a Downvote will be done and the answer Reported to Chegg for investigation Finish the Code bellow for Racket function named (n-list? obj) that takes one argument, returns true if and only if obj is an n-list. n-list? should be mutually recursive with the function num-expr?, which returns true if its argument is a number expression and false if not. (define n-list?(lambda (obj))) in Racket code
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.
Given a list of values l= a0, a1, a2, . .., an , we can construct a continued fraction: Python 1 ao + 1 a1 + 1 a2 + 1 an Write a function cont_frac (1) that accepts a non-empty list 1, and returns the value of the continued fraction generated by taking a = 1[i].
Your main task is to write a recursive function sierpinski() that plots a Sierpinski triangle of order n to standard drawing. Think recursively: sierpinski() should draw one filled equilateral triangle (pointed downwards) and then call itself recursively three times (with an appropriate stopping condition). It should draw 1 filled triangle for n = 1; 4 filled triangles for n = 2; and 13 filled triangles for n = 3; and so forth. Sierpinski.java When writing your program, exercise modular design by organizing it into four functions, as specified in the following API: public class Sierpinski { // Height of an equilateral triangle with the specified side length. public static double height(double length) // Draws a filled equilateral triangle with the specified side length // whose bottom vertex is (x, y). public static void filledTriangle(double x, double y, double length) // Draws a Sierpinski triangle of order n, such that the largest filled //…
Write pseudocode for a function Det-Quicksort(A, p, r) that receives array A[1..n], and indices p and r. The function should sort the subarray A[p..r] recursively (meaning you should call itself). You can also use a function LinearSearch(A, p, r, v) that searches subarray A[p..r] for an element of value v and return its index (in case it exists) in O(r − p) time. (Just to give you something to compare to, the solution has 8 lines.)
Write in python programming language: The Longest Subsequence Problem is a well-studied problem in Computer Science, where given a sequence of distinct positive integers, the goal is to output the longest subsequence whose elements appear from smallest to largest, or from largest to smallest. For example, consider the sequence S= [9,7,4,10,6,8,2,1,3,5]. The longest increasing subsequence of S has length three ([4,6,8] or [2,3,5]), and the longest decreasing subsequence of S has length five([9,7,4,2,1] or [9,7,6,2,1]). And if we have the sequence S = [531,339,298,247,246,195,104,73,52,31], then the length of the longest increasing subsequence is 1 and the length of the longest decreasing subsequence is 10. Question: Find a sequence with nine distinct integers for which the length of the longest increasing subsequence is 3, and the length of the longest decreasing subsequence is 3. Briefly explain how youconstructed your sequence. Let S be a sequence with ten distinct integers. Prove by…
Below is a Python function definition for a linear search of a list Ist 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(1st, element): i = 0 for item in 1st: 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.
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.