1) Give the big O characterization of the following operations, assuming m and n arevariables (21%).a. int i=0;for(int i=100*n; i>=1; i--)j=j+i*i;b. int x=0;int t=0;for (int i=1; i*2<=m; i=i*5){}X=X*X:

Time complexity is usually represented with the help of the iterations being performed in the loops.…

1) Give the big O characterization of the following operations, assuming m and n are variables (21%). a. int j=0; for(int i=100*n; i=1; i--) j-j+i*i; b. int x=0; int t=0; for (int i=1; i*2<=m; i-i*5){ X=X*X:

1) Give the big O characterization of the following operations, assuming m and n are variables (21%). a. int j=0; for(int i=100n; i=1; i--) j-j+ii; b. int x=0; int t=0; for (int i=1; i2<=m; i-i5){ X=X*X:

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

Related questions

Q: Question 3: Rewrite the program in Question 2 part a in Java and C#, run them, and compare the…

A: Given: Rewrite the program in Question 2 part a in java and c#, run them and compare the results.

Q: Cs10 Quiz 1 100% Name Login 27. Implement the following RECURSIVE function named starString: //…

A: Given: To write a recursive function to print the function starString.

Q: 1. Given the following function: int Fn (int N) { } if (N == 0) return 2; else return N + Fn (N/3);…

A: a) The given function is a recursive function. This is because the function calls itself in the…

Q: Write a recursive function definition for the following function: int squares(int n);…

A: The algorithm for the function would be Function squares (int n) Start if(n<=1) return 1, go to…

Q: ▾ Part A - The effect of an arithmetic shift on signed numbers Let's look at see what happens to…

A: signed integer is an integer with a positive "+" sign or a negative "-" sign.checking that the shift…

Q: 7. We usually write numbers in decimal form (or base 10), meaning numbers are composed using 10…

A: a) S = set of 2 digit hexadecimal in which first digit is E or F Then where A is the set of 2 digit…

Q: What is the value of x after the code segment has run?

A: Option b is correct.Answer is 42.

Q: *Computer Science (lambda calculus)* Reduce the lambda terms shown below: a) (λ x. (x+y)) 3 b) (λ…

A: a) To reduce the lambda term (λx. (x+y)) 3, we need to apply the function to the argument by…

Q: Write a program that recursively and iteratively counts down from n. a) Create a void recursive…

A: Since the programming language is not mentioned, we'll do it in c++ a) The programming methodology…

Q: 3. Define a function to count how many 1's in an integer number. Return this count: int…

A: Based on the given syntax, the required function is in C or C++ programming language. For this…

Q: Let a, b, and e be integers simultaneously satisfying the equations 4abc + a + b+c= 2018 and ab + bc…

A: Python program to linear equation 4abc+a+b+c=2018 ab+bc+ca=-507

Q: Euler's totient function, also known as phi-function ϕ(n), counts the number of integers between 1…

A: 1. Start the function euler_totient(n) with the input parameter n.2. Initialize the variable…

Q: int f(int &k) { k++; return k * 2; } int main() { int i = 1, j = -1; int a, b, c; a = f(i) + i/2; b…

A: The provided C++ code presents a concise illustration of function calls and variable assignments,…

Q: *19. A recursive function f (x), is defined as follows: if (x>100) return (x-10) else return (f (f…

A: The function f(x) is defined recursively as follows: If x>100, return x−10. Otherwise, return…

Q: Write a function that takes in an integer n and computes n!. Do this without recursion. In [ ]:…

A: In this question we have to write a python code for finding the factorial of a number without using…

Q: [Unbalanced kod] Given a set of n weights {w₁,..., w} and a rod of length n - 1 inches, we can…

A: Greedy Algorithm A greedy algorithm is an algorithmic approach that follows the heuristic of making…

Q: X15: inOrder Write a function in Java that implements the following logic: Given three ints, a, b,…

A: Given : To Write a function in Java that implements the following logic: Given three ints, a, b,…

Q: Let p(x), q(x), and r(x) denote the following open statements. p(x): x^2-8x+15=0; q(x): x is odd;…

A: Solution-: Given, We have from given question-: p(x) => x2 -8x +15=0…

Q: Q3) Write a menu driven program in python to evaluate the following recursive functions. Also define…

A: Answer: Algorithms Step1: We have create a function as f1 and takes as input n and check if n is 0…

Q: #13. Let the function fun be defined as int fun (int k) *k + 4; return 3 (*k) - 1; Suppose fun is…

A: a. if the operands in the expressions are evaluated left to the right? given i = 10 then, sum1 =…

Q: Write a nToArray function which does the following: 1. Accepts an empty partially filled array, the…

A: Programs: The programs are mainly used for problem-solving. It contains the instructions to solve…

Q: Fill in the blanks below. Assume user supplies the value of n. Line Code 1 2 do { 3. print x 4 X=x+1…

Q: (b) This code has a problem. What is it? How is it called? double x = 1.5, y = 3.4; double* p =…

A: The given code is a C++ code snippet that contains some operations involving pointers and dynamic…

Q: CodeWorkout X265: Recursion PIogramming Exercise:

A: Lets see the solution.

Q: 4. Langauge concatentation (a) Let L = {X, a}. Characterize L20. (b) Let L E*. {aa, bb} E*.…

A: Here we are going to find out L20 using given language L. We have to concatenate Language L 20 times…

Q: The following recursive function takes three positive integer arguments: def compute(n,x,y) :…

A: The screenshot of the Python program for the given problem along with the output is as follows: In…

Q: int p =5 , q =6; void foo ( int b , int c ) { b = 2 * c ; p = p + c ; c = 1 + p ; q = q * 2;…

A: When programming, the process of calling a function involves the necessity to provide data. There…

Q: Consider the following recursive function: void exercise(int x){ if (x >0 8& x < 10){ cout <<x <<"".…

A: The solution to the given problem is below.

Q: main.cpp include 2 using namespace std; 3 int maxResult() 4-( int maxVal 6. for (int i = { for (int…

A: code is

Q: Write the definition of a recursive function int simpleSqrt(int n) The function returns the integer…

A: Here,we know about recursive function.And Also know about how recursive algorithm work. Int…

Q: Write a recursive function that displays the number of even and odd digits in an integer using the…

A: C++ Code: #include<iostream>using namespace std; void evenAndOddCountHelper(int value,…

Q: 5. (a) Calculate the total computing time of the following code fragment using O notation. void…

A: (a) Calculate the total computing time of the following code fragment using O notation. (b)…

Q: a) function func(A,n) if n ≤ 5 then return A(1) else for i=1 to n for j = i to n-1 Ail(i) + A/i) + 2

A: a) Let T(n) be the worst case running time of the function func(A, n). We can see that when n <…

Q: Which of the following is not true of communications software? Select one: a. Some communications…

A: We will discuss about communications software in this problem.

Q: Digital Sum The digital sum of a number n is the sum of its digits. Write a recursive function…

A: Since the programming language is not mentioned, I have done the code using JavaScript.

Q: Q1) Define each of the following terms: 1) Fault 2) Error 3) Failure

A: Note: As per company guidelines we are allowed to solve the first question please post the other…

Q: 3. Observe the following formulae: fin) = 1 fin) = 3 + fln-1) fin) = 2+ fln-1) if n =0 if n is even…

A: a. If a function calls itself, it’s known as direct recursion. Function code: int f(int n){…

Q: Modified coin-row problem: If we modified the coin-row problem, so that you cannot take the adjacent…

Q: Refer to Code Segment 1 and Code Segment 2. Assume variables have been declared accordingly with…

A: Question 1. Answer: True. Explanation: Because we use 2 loops which are and every value I it will…

Concept explainers

Topological Sort

Topological sort is a sorting technique that sets up a hierarchy in a process. In this technique, when a directed network has nodes connected by arrows, the root node is placed before the successor node.

Question

1) Give the big O characterization of the following operations, assuming m and n are
variables (21%).
a. int i=0;
for(int i=100*n; i>=1; i--)
j=j+i*i;
b. int x=0;
int t=0;
for (int i=1; i*2<=m; i=i*5){
}
X=X*X:

Expert Solution

This question has been solved!

Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.

SEE SOLUTION Check out a sample Q&A here

Step 1: A ( first question )

VIEW

Step 2: B ( Second question )

VIEW

Solution

VIEW

Step by step

Solved in 3 steps

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions

Let the function fun be defined as int fun(int *k) { *k += 5; return 3 * (*k) - 1; Suppose fun is used in a program as follows: void main() { int i = 12, j = 12, sum1, sum2; sum1 = (i / 2) + fun(&i); sum2 = fun(&j) + (j / 2); } What are the values of sum1 and sum2 if the operands in the expressions are evaluated left to right /right to left? O 46-48 / 48-46 O 56-58 / 58-56 O 46-48 / 56-58 O 56-58 / 48-48
Consider the following recursive function:void recEx11(int x){if (x > 0)if (x % 2 == 0){recEx11((x - 3) / 2);cout << x << " ";}else{recEx11((x - 4) / 2);cout << x << " ";}}What is the output of the following statements? a. recEx11(28); b. recEx11(148); c. recEx11(98); d. recEx11(-30)
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…
a) Implement a function start( ) that takes as input a positive number a, rounds its logarithm base 4 to the nearest integer n, and returns the value of 1.0 x 2^n.
5. What is wrong with the following function and why? int *setup(int n){ int a[n); for(int i=0; i
Consider the following recursive function: void exercise(int x) { if (x > 0 && x < 10) { cout << x << " "; exercise(x + 1); } } What is the output of the following statements? a. exercise(0); b. exercise(5); c. exercise(10); d. exercise(-5);
Problem 7 [Algorithms integers m and k such that n = m × 24, where m is the smallest integer. For any even integer n, it is always possible to find a pair of 1. Write an algorithm that finds a factorization of any even integer n as stated above. For instance, we have the following two factorizations: 48 = 3 × 24 instead of 48 = 12 × 22 52 = 13 x 22 instead of 52 = 26 × 2. 2. Analyze the time of your algorithm by computing the number of its multiplications. Show your work step by step. Otherwise, your solution is incorrect.
Midterm Practice Problems 1. Use recursion to write a function count_ones that returns how many Is there are in a number n when represented in decimal (base 10). For example, 1231 has two 1s. You can assume that n is nonnegative and at most 9 digits long. Do not use global (or static) variables. In main perform at least three tests of count_ones and use assert to check that the returned value is correct. Your function should have the following prototype: // count_ones (n) returns the number of is in the decimal representation of n // requires: 0 <= n < 10^9 int count_ones (int n);
Homework 5 CMP 167: Programming Methods I Lehman College, City University of New York Homework 5-1 I Write a program with a loop that iterates as long as an int variable called num is less or equal to 50. Num must be initialized with a value of 1 and incremented by 1 with each iteration. Each iteration of the loop must print all appropriate sentences for that number according to the following 1. If num is odd, output: num is an odd number 2. If num is even, output: num is an even number output: num is divisible by 2 3. If num is divisible by 2, 4. If num is divisible by 5, output: num is divisible by 5 5. If num is divisible by 8, output: num is divisible by 8 6. If num is divisible by 11, output: num is divisible by 11 Please note that your class should be named FirstLoop.
Write a recursive function that takes as a parameter a nonnegative integer and generates the following pattern of stars. If the nonnegative integer is 4, the pattern generated is as follows: **** *** ** * * ** *** **** Also, write a program that prompts the user to enter the number of lines in the pattern and uses the recursive function to generate the pattern. For example, specifying 4 as the number of lines generates the preceding pattern.