Q3. Compute the complexity (O-big notation) of the following algorithms and explain the result mathematically. a. while (n> 1) { if (ODD(n)) //function ODD(n) of constant complexity that returns true if n is odd, // otherwise returns false i = 3 * n + 1; else for (i=1;i

Q3. Compute the complexity (O-big notation) of the following algorithms and explain the result mathematically. a. while (n> 1) { if (ODD(n)) //function ODD(n) of constant complexity that returns true if n is odd, // otherwise returns false i = 3 * n + 1; else for (i=1;i

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: Q.5 How firewalls are configured and managed?

A: We need to discuss how firewalls are configured and managed.

Q: Explain if scatter chart visual and bubble chart visual are effective or ineffective ways to depict…

A: Data visualization charts are graphical representations of data that use symbols to tell a story,…

Q: 1. Design a C++ program named (permu_combi.cpp), that presents a menu to select to calculate…

A: The C++ program is given below:

Q: In Java Create a class DoWhileEvent3, write code that ask the user to enter a positive or negative…

A: We need to write a Java code for the given scenario.

Q: Therapy Groups Recreation Groups Socialization Groups Education Groups These groups are gener…

A: Therapy groups: Who is group therapy for?Anyone can participate in group therapy. However, group…

Q: Explain working of AES in detail.

A: Introduction In this question, we are asked to explain the working of the Advanced Encryption…

Q: 1. Rewrite the Sorting class so that both sorting algorithms put the values in descending order. 2.…

A: The modified java classes are given below:

Q: Q. 12 Explain TLS.

A: Introduction In this question, we are asked to explain TLS (Transport Layer Securities)

Q: What is a function of SNMP? Explai

A: Introduction In this question, we are asked about the function of Simple Network Management Protocol…

Q: 23 A team is planning for a date-driven projects. The team's expected velocity is 8 story points,…

A: This is correct.

Q: program and evaluation, are used at the top level to interact with the Python code. If we would like…

A: In order to modify the current class design so that changes would be minimal.

Q: Please convert this C++ code to Java code. REMINDER: The output MUST match the picture.

A: Updated program in Java language.

Q: 4. The following 16-bit hexadecimal values are stored in two's complement code. What are the…

A: Note: As per our company guidelines we are supposed to answer only first 3 sub-parts. Kindly repost…

Q: security

A: Solution - In the given question, we have to tell about the three technologies should be included in…

Q: Q2: Write C++ program to read four integer numbers and determines the maximum number among them…

A: The above question is solved in step 2 :-

Q: polynomial of degree n as follows: 1 Here is a sample run: x = 0.900000 n = 5 2 1 2 x + 4 In(1+x)≈x-…

A: include <stdio.h>#include <stdlib.h>#include<math.h> int main(){ float…

Q: Find out some merits and demerits of moving average method? Find out some merits and demerits of…

A: Some of the advantages of using moving averages include: Moving average is used for forecasting…

Q: 5. Consider the following Knowledge Base and use resolution to derive the conclusion: "Every coyote…

A: The question has been answered in step2

Q: Q.11 State security measure applied by VPN for security.

A: In order to protect state security, VPNs are commonly used by individuals and businesses in order to…

Q: Comment on the current status of IPv4 and identify the major emerging problems

A: The answer is

Q: Starting with this grammar: ::= + | - | () | a | b | c Add the % (modulus) operator to the…

A: Given Grammar: <exp> :: = <exp> +<exp>…

Q: Find the best match for the following Python codes and their corresponding paradigms. def…

A: 1. This python program contains a function find_word(). Inside this function, a for loop and then if…

Q: Synopsis In this assignment, you will have a parent process that will create children processes to…

A: SynopsisIn this assignment, you will have a parent process that will create children processes to…

Q: Implement a class Stack that manages an array list of elements of type E. Provide methods push,…

A: Implement a class Stack <E> that manages an array list of elements of type E. Provide…

Q: Mother is the most loved person. She wants to surprise his son on his birthda irthday cake for one…

A: Input for the value which decide the total iteration After that run the value loop according to…

Q: Write a short note on the short read alignment problem.

A: Introduction : Understanding the location of a sequence in the genome is done by short-read…

Q: Assuming this code has already run Item *potatoChips = new Item("Potato Chips", 1.99); Will this…

A: Note: Due to company policies I am compelled to solve only one question and that is the first…

Q: Select which network to which each IP address is a part of, either Network A or Network B. Network…

A: For Network A - Number of IP address assignable is found by subtracting 24 from 32 which is 232-24 =…

Q: Let's suppose there is an organization with two departments with each department requiring 120 host…

A: As given, there is a company with two departments, each of which needs 120 host addresses. Both the…

Q: Q.30 Explain advantages and disadvantages of DES.

Q: 7 2 1 2 4 5 4 3 10 -8 4

A: Here From question we are needed to answer the first one.

Q: Compare and contrast the various scaling methods. Explain why scalability is a key business issue…

A: Let's see the answer: If you use a scalable hosting option, you can expand. Downtime must be…

Q: class String ( private: int size; // the actual size of the string (number of characters) char* str;…

A: the code is an given below :

Q: o automatically a

A: Solution - In the given question, we have to complete the given sentence.

Q: Q. 12 Explain TLS.

A: Communication is process of exchanging data among devices. Security is important in order to protect…

Q: firewalls are

A: Solution - In the given question, we have to tell how firewalls are configured and managed.

Q: Given an arithmetic equation consisting of positive integers,+,-,* and/ (no parentheses), compute…

A: The above question is solved in step 2 :-

Q: C. Draw a circle 25 pixels in diameter that moves with the mouse. When the program is first run, the…

A: Dear student, Here is your step-by-step solution --->

Q: Let's suppose there is an organization with two departments

A: The answer is

Q: get the 10 out of the tree.

A: To find the number 10 in the tree

Q: Define a function distance that consumes a point (i.e. 2 integers say x1, y1) and displays the…

Q: *""*A***.

A: By the seeing the series we can under stand n must be odd value Algorithm: 1)Start 2)Read n value…

Q: Based on the following scenario, specify the suitable Architectural Pattern for the application with…

A: Building software follows a design known as software architecture. While concealing the…

Q: How to TodoDataService - Connecting to the Backend?

A: Here we have given a brief note on DataService- Connecting to the backend. You can find the solution…

Q: Suppose that a 64 Mega x 16 bits main memory is built using 16M x 8 bits chips of RAM and memory is…

A: Given: Suppose that a 64 Mega x 16 bits main memory is built using 16M x 8 bits chips of RAM and…

Q: question 3 ( A) Using the CRC polynomial 1011, compute the CRC code word for the information word,…

A: The above question is solved in step 2 :-

Q: Identify a mobile app in healthcare area Describe how you can apply agile software development in…

A: The above question is solved in step 2 :-

Q: To disambiguate the grammar E → E+E | EE | E^E |id| (E).

A: So for the given grammar we have to make grammar ambiguous

Q: Explain the operation of Secure Socket Layer (SSL) protocol in detail.

Q: 5. Fill in the answers to the following questions directly. (No explanation needed) (1) Convert a…

A: We need to convert the given real numbers into floating numbers and find run length encoding of…

Question

Q3. Compute the complexity (O-big notation) of the following algorithms and explain the result
mathematically.
a. while (n> 1) {
if (ODD(n)) //function ODD(n) of constant complexity that returns true if n is odd,
// otherwise returns false
i = 3 * n + 1;
else
for (i=1;i<n;i*=2)
func1(i);
n--; }//end while
Complexity
// complexity of func1 is constant
Why?

Expert Solution

This question has been solved!

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

This is a popular solution!

SEE SOLUTION Check out a sample Q&A here

Step 1

VIEW

Step 2

VIEW

Trending now

This is a popular solution!

Step by step

Solved in 2 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

Euclid’s algorithm (or the Euclidean algorithm) is an algorithm that computes thegreatest common divisor, denoted by gcd, of two integers. Below are the original versions ofEuclid’s algorithm that uses repeated subtraction and another one that uses the remainder.int gcd_sub(int a, int b){ if (!a) return b; while (b) if (a > b) a = a – b; else b = b – a; return a;}int gcd_rem(int a, int b){ int t; while (b) { t = b; b = a % b; a = t; } return a;}1. Trace each of the above algorithm using specific values for a and b.2. Compare both algorithms.
4. Consider the following recursive algorithm. ALGORITHM Q(n) //Input: A positive integer n if n = 1 return 1 else return Q(n – 1) + 2 * n – 1 a. Set up a recurrence relation for this function's values and solve it to deter- mine what this algorithm computes. b. Set up a recurrence relation for the number of multiplications made by this algorithm and solve it. c. Set up a recurrence relation for the number of additions/subtractions made by this algorithm and solve it.
Compute f(6) for the recursive function below. def f(n): if n == 0: return 1 if n == 1: return 2 else: return f(n-1)+n*f(n-2)-n
sum = 0; for (k=1; k<=n; k*=2) for (j=1; j<k; j++) sun++ What is the time complexity of the above code snippet? Is it O(2n) or O(nlogn)
int BinDig (int n){ if (n == 1) return 1;else return (1 + BinDig(n/2)); } Find T(n) = number of arithmetic operations. Calculate the complexity of this algorithm.
The complexity of the following code is void f(int n) { if (n > 0) { DoSomething (n); // O (n) f (n-1); } Select one: a. O(nlgn) b. O(n) c. O(gn) d. O(n)
*Find a non-recursive formula for f (n) : f (0) = 7, f (n) = 4f (n − 1)/9 for n ≥ 1 *Define the sequence: an = 1+ (n+3)2 for n = 1,2,3, ... recursively.
1. Consider the following program: Algorithm recursive (int n){ IF n<= 3 then return (0); ELSE recursive(n/3); recursive(n/3); recursive(n/3); FOR i=1 to n do something; ENDFOR ENDIF a. What is the recurrence relation? b. Solve the recurrence relation from (a) in terms of n and show the O(). Attach File Browse My Computer Browse Content Collection A Moving to the next question prevents changes to this answer. O Type here to search
The following code segment has ______ time complexity?for(int i = 0; i < n; i++){ for(int j = 0; j < n: j = j * 2){ int val = (j * i); System.out.println(val) }} O(1) O(n) O(n2) O(nlogn)
Question 3: What is the time complexity of following code. Show the time complexity of each statement below and the final running time. For computing the running time, you must show an example of tracing the algorithm as we did in the lecture. int a, b, c 0; for (a= n/2; a<= n; a++){ for (b = 2; b <= n; b= b* 2) { C= C+ n/ 2;
Consider the following algorithm: int f(n) /* n is a positive integer */ if (n <=3) return n int sum = f(n-1) if (n is even) return sum + f(n-2) else return sum + f(n-3) Trace execution of f(6) by drawing the recursion tree. Show all function calls (callers and called functions), and intermediate results; and show what f(6) returns. Make sure that you draw all subtrees even if some are identical.
function recursion(B[0..n − 1], i) if n == 0 then return False if n == 1 then return (B[0] == i)x ← recursion(B[0........n/2 − 1], i) y ← recursion(B[n/2..........4 × n/2 − 1], i) z ← recursion(B[4 × n/2..........n − 1], i) return (x OR y OR z) input array is of length n = 2^p, p is a positive integer Write the recursive formula for above algorithm as of worst case inputs.