Assume x and y are positive integers representing input size for the following pseudocodes. Determine a function T(n) (or T(x) or T(y) in the following cases) that relate input size x and y to number of runtime steps. (If you can't get the exact T(n), what does it roughly look like? e.g. T(n) = an^2 +k) What Big O set does this function belong to? Write down your whole thought process.The ellipsis (...) is meant to indicate a repetition until the pattern is finished. def function(n): t = 0 for a in range(n): for b in range(n): for c in range(b): t+= 1

Assume x and y are positive integers representing input size for the following pseudocodes. Determine a function T(n) (or T(x) or T(y) in the following cases) that relate input size x and y to number of runtime steps. (If you can't get the exact T(n), what does it roughly look like? e.g. T(n) = an^2 +k) What Big O set does this function belong to? Write down your whole thought process.The ellipsis (...) is meant to indicate a repetition until the pattern is finished. def function(n): t = 0 for a in range(n): for b in range(n): for c in range(b): t+= 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

Prompt: In python langauge, write a function that adds a random noise to all elements of a NumPy array Code: import numpy as np import math import matplotlib.pyplot as plt import pandas as pd def addNoise(inputArray): modifiedArray = np.zeros(len(inputArray)) #YOUR CODE HERE: return(modifiedArray) def test(): inputs = np.arange(-5, 5,0.2) outputs = addNoise(inputs) plt.figure(1) plt.plot(inputs) plt.title('Input') plt.xlabel('Index') plt.ylabel('Value') plt.show() plt.figure(2) plt.plot(outputs, 'black') plt.title('Output') plt.xlabel('Index') plt.ylabel('Value') plt.show() test()
Write a recursive function that accepts a number and returns its factorial. b. Write a recursive function that accepts an array, its size and the index of the initial element as arguments. The function fills the array with the elements of the following sequence: n1 = 3, nk+1 = nk+35 c. Write an iterative and a recursive versions of the binary search. In C++ coding
Please solve using C language The function get_tokens gets a string str, and a char delim, and returns the array with the tokens in the correct order. The length of the array should be the number of tokens, computed in count_tokens. char** get_tokens(const char* str, char delim); For example: ● get_tokens("abc-EFG--", '-') needs to return ["abc","EFG"] ● get_tokens("++a+b+c", '+') needs to return ["a","b","c"]. ● get_tokens("***", '*') needs to return either NULL or an empty array. Note that the returned array and the strings in it must all be dynamically allocated.
Mdt ɔɔ 9Create the matrix (M) below using as little code as possible. You should use multiple built-in functions. M= 6.0000 19.5000 33.0000 6.0000 19.5000 33.0000 9.0000 9.0000 9.0000 9.0000 9.0000 9.0000 5.0000 -1.0000 -7.0000 5.0000 -1.0000 -7.0000 6.0000 19.5000 33.0000 6.0000 19.5000 33.0000 9.0000 9.0000 9.0000 9.0000 9.0000 9.0000 5.0000 -1.0000 -7.0000 5.0000 -1.0000 -7.0000 Now within the script use MATLAB commands to make the following changes to the matrix. Include comments in your script to separate the parts. a. Change the four numbers in the center of matrix M to one. b. Divide the bottom half of the matrix by 4. c. Multiply the top half of the matrix by 4. d. Delete the last column of the matrix. e. Create a new matrix C from first, third, and fifth column of the second and fourth rows of M. f. Sort each column of C in descending order. Calculate the following equation: 45 C* + C D=-
Using “Def” keyword write a function that returns the Max element of the given array elements (The function name will be MaxofArrayElements) Not: Write some print functions to see the outputs inside each function. (Python programming language) (Solution must be like first image but max of arrays.it shouldnt be like second image)
Write a function to sort strings in dictionary order. Example: Giving 'C programming', 'Java', 'CIS-1007', 'University'. The output in dictionary order should be: "C programming" "CIS-1007" "Java" "University" Note: You might ask the user to give the number of the input strings. You might need to use multidimensional arrays to store these strings. Note: You are NOT ALLOWED to use any built-in library EXCEPT stdio.h.
Suppose you have a dictionary of survey responses: keys are student names values are favourite ice cream flavours (e.g. "chocolate", "vanilla", "strawberry", etc.) Write a function that takes a dictionary of survey responses and returns a new dictionary where: keys are ice cream flavours and values are number of students with that favourite flavour. For example: Test survey = {"Howlett": "vanilla", "Grey": "chocolate", "Munroe": "vanilla", "Summers": "strawberry", "Xavier": "strawberry", "Drake": "strawberry"} print (survey_results (survey)) Result {'vanilla': 2, 'chocolate': 1, 'strawberry': 3}
Write a function that receives a string consisting of several lines of text (paragraph) andreturns an array indicating the number of occurrences of each letter of the alphabet in thetext.void countLetters(char* str, int*& array, int & size) note: Do not use any String or math libraries (such as cmath, cstring, string etc) and also do notuse built-in function (such as strlen, strcmp etc).
i need the flowchartttt only for this program
Python code
C'ZT Write a function that takes one input, a matrix X. Your function should modify X and return the modified version of X as an output. Assuming that X has m rows and n columns: When m is equal to n, modified X should be the same as X. When m is greater than n, the modified version of X should be m x m. New columns should be added to the right of the original columns of X, with each new element having a value that is one less than the element in the column to the left. For example, the matrix: 2 3 4 6 Would become: 2321 4 65 4 8987 1210 When n is greater than m, the modified version of X should be n x n. New rows should be added to the bottom of the original rows of X, with each new element having a value that is one more than the element in the row above it. For example, the matrix: 2345 468 10 Would become 2345 4 6 1e 3791L G8 10 12
Python question Application: Big-O Notation (Q8-11) For each of the time complexities in this segment give the tightest bound in terms of a simple polylogarithmic function using big-O notation. Note: use the ‘^’ symbol to indicate exponents, i.e., write O(n^2) for O(n2). Question 8 (Big-O Notation 1) T(n) = n2+ log n + n Question 9 (Big-O Notation 2) T(n) = n/3 + 4 log n + 2n log(n) Question 10 (Big-O Notation 3) T(n) = 7n5 + 2n Question 11 (Big-O Notation 4) T(n) = (n%5) + 12,000