Compulsory Task 1 Answer the following questions: Dev What is the Big-O notation of the following algorithm (assume that all variables have been declared): for (int i=1;i<= n; i++) sum = sum + 1* (i + 1); What is the Big-O notation of the following algorithm (assume that all variables have been declared): for (int i = 5; i <= 2 * n; i++) System.out.println(2 * n + i - 1); • What is the Big-O notation of the following algorithm: for (int i = 1; i <= 2 * n; i++) for (int j = 1; j <= n; j++) System.out.println(2* i + j); System.out.println(" "); • What is the Big-O notation of the following algorithm: for (int i = 1; i <= n; i++) for (int j = 1; j <= n; j++) Copyright © 2021 Hyperion Dev. All rights for (int k = 1; k <= n; k++) System.out.println(i + j + k); Each of the following expressions represents the number of inputs for certain algorithms. Write them in Big O notation (eg, n+2+ O(n)); on² + 6n + 4 5n² + 2n + 8 (n² + 1) (3n+ 5) o 5(6n + 4) O n+ 2logn - 6 o4nlogin + 3n + 8

Compulsory Task 1 Answer the following questions: Dev What is the Big-O notation of the following algorithm (assume that all variables have been declared): for (int i=1;i<= n; i++) sum = sum + 1* (i + 1); What is the Big-O notation of the following algorithm (assume that all variables have been declared): for (int i = 5; i <= 2 * n; i++) System.out.println(2 * n + i - 1); • What is the Big-O notation of the following algorithm: for (int i = 1; i <= 2 * n; i++) for (int j = 1; j <= n; j++) System.out.println(2* i + j); System.out.println(" "); • What is the Big-O notation of the following algorithm: for (int i = 1; i <= n; i++) for (int j = 1; j <= n; j++) Copyright © 2021 Hyperion Dev. All rights for (int k = 1; k <= n; k++) System.out.println(i + j + k); Each of the following expressions represents the number of inputs for certain algorithms. Write them in Big O notation (eg, n+2+ O(n)); on² + 6n + 4 5n² + 2n + 8 (n² + 1) (3n+ 5) o 5(6n + 4) O n+ 2logn - 6 o4nlogin + 3n + 8

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

Correct answer will be upvoted else Multiple Downvoted. Don't submit random answer. Computer science. Sasha likes exploring diverse mathematical articles, for instance, wizardry squares. However, Sasha comprehends that enchanted squares have as of now been examined by many individuals, so he sees no feeling of concentrating on them further. All things considered, he designed his own kind of square — a superb square. A square of size n×n is called prime if the accompanying three conditions are held all the while: all numbers on the square are non-negative integers not surpassing 105; there are no indivisible numbers in the square; amounts of integers in each line and every segment are indivisible numbers. Sasha has an integer n. He requests you to view as any great square from size n×n. Sasha is certain beyond a shadow of a doubt such squares exist, so help him! Input The principal line contains a solitary integer t (1≤t≤10) — the number of experiments. Every one…
Algorithm problem w/ recurrence: Frying pancakes: a small pan can only hold two pancakes at a time. Each pancake needs to be fried on both sides. Frying one side takes 1 minute, no matter how many pancakes are on the pan. Consider this recursive algorithm: If n <= 2, fry the pancakes or the two pancakes together on each side. If n > 2, fry any two pancakes together on each side and then apply the same process recursively to the remaining n-2 pancakes. a. Set up and solve the recurrence for the amount of time this algorithm needs to fry n pancakes. b. Explain why this algorithm does not fry the pancakes in the minimum time for all n > 0. c. Give a correct recursive algorithm that executes the task in the minimum amount of time. > I was not sure how to start this. I have had trouble with recurrence in the past. Also from the work that I did do, I didn't know how there could be a better algorithm. Thanks in advance
1. A certain computer algorithm executes four times as many operations when it is run with an input of size n as when it is run with an input of size n – 1. Here, n > 1 is an integer. When the algorithm is run with an input of size 1, it executes 12 operations. How many operations does the algorithm execute when it is run with an input of size 5? How many operations does the algorithm execute when it is run with an input of size n?
Q: What are the correct objectives of implementing the algorithm? Start J=1, 10 No If (0=2ل k-1, 10 Print F طباعة مضروب الاعداد من 1 إلى 10 O طباعة مضروب الاعداد الزوجية فقط طباعة مضروب الاعداد الفردية فقط طباعة مضروب الاعداد الزوجية و الفردية O طباعة جدول الضرب ل لأعداد الزوجية طباعة جدول الضرب للأعداد الفردية O لا يوجد خيار صحیح O
%3B for ( int i = 0; i < n; ++i ) { for ( int j= 0; j< n; ++j) { sum += f( j, 10 ); } } iii. int sum = 0; %3D Assume f(n, m) runs in O( n + m) time.
Algorithm Prime2 (n: integer):{T,F}; prime = F; d=2; while d < n/2 and prime = F do if n mod d = 0 then prime = T else d = d+1 return prime; How many times is the operation "n mod d" performed, when the input for Algorithm Prime 2 is n=17? Group of answer choices 7 4 None of these. 8 6
calculate number of operations in this algorithm void my_dgemv(int n, double* A, double* x, double* y) { double alpha=1.0, beta=1.0; int lda=n, incx=1, incy=1; cblas_dgemv(CblasRowMajor, CblasNoTrans, n, n, alpha, A, lda, x, incx, beta, y, incy); }
sum= 0; for (int i = 0; i 1) { sum++; i= 1/2; } = 2*log2 (n) We denote by Ta(n), Tb (n), Te(n) the running time of the three fragments. 1. Give evaluations for Ta(n), Tb (n), Te(n). 2. Is T(n) = O(Ta(n)) ? Answer YES or NO and justify your answer. 3. Is Te(n) = (Ta(n)) ? Answer YES or NO and justify your answer.
Q2. The following algorithm returns the product of two numbers, a and b. The parameters x and y are natural numbers. First, prove the correctness of the algorithm. Then, analyze the time complexity of the algorithm in the worst case scenario. function mult (a, b) if b = 0: return 0 else if b is odd: return (mult (2a, b/2 ) +a) else: return (mult (2a, b/2 ) )
Algorithm Prime2 (n: integer):{T,F}; prime = T; d=2; while d < n/2 and prime = T do if n mod d = 0 then prime = F else d = d+1 return prime; How many times is the operation "n mod d" performed, when the input for Algorithm Prime2 is n=343? Group of answer choices 170 171 None of these. 7 6
Personal project Q5. This question is concerned with the design and analysis of recursive algorithms. You are given a problem statement as shown below. This problem is concerned with performing calculations on a sequence A of real numbers. Whilst this could be done using a conventional loop-based approach, your answer must be developed using a recursive algorithm. No marks will be given if your answer uses loops. FindAverageAndProduct(a1, ...., an) such that n > 1 Input: A sequence of real values A = (a1, ...., an) Output:, A 2-tuple (average, product) containing the average (average) of all the values and the product (product) of all the values of the elements in A. Your recursive algorithm should use a single recursive structure to find the average and product values, and should not use two separate instances of a recursive design. You should not employ any global variables. (a) Produce a pseudo code design for a recursive algorithm to solve this problem. (b) Draw a call-stack…
Do not use static variables to implement recursive methods. USING JAVA 1. Using Big Oh notation, indicate the time requirement for each of the following tasks in the worst case. Describe which operations are assumed to take constant time to. After arriving at a party, you shake hands with each person there. n is the number of persons in the party. Each person in a room shakes hands with everyone else in the room. n is the number of persons in the room. You climb a flight of stairs. n is the number of stairs After entering an elevator, you press a button to choose a floor. n is the number of floors You ride the elevator from the ground floor up to the nth floor. You read a book twice. n is the number of pages in the book Using Big Oh notation, indicate the time requirement of each of the following tasks in the worst case. Display all the integers in an array of integers. Display all the integers in a chain of linked nodes. Display the nth integer in an array of integers. Compute…