Give only the correct answer and don't copy 5. For each of the following, give the Big-Oh runtime in terms of n (if applicable) (not i).(a) Suppose bar(n) is an O(log n) function. Then, using Big-Oh notation, what is the runtime of the followingfunction? (You don't have to justify your answer.)void foo(int n){}int i;for (i = 0; i 0)i = 1 / 2;

Answered: Image /qna-images/answer/8889a615-90f4-46ec-aae7-0a27d3823960.jpg

Answered: void foo(int n) { } int i; for (i = 0;…

Engineering

Computer Science

void foo(int n) { } int i; for (i = 0; i 0) i = 1 / 2;

C++ for Engineers and Scientists

4th Edition

ISBN:9781133187844

Author:Bronson, Gary J.

Publisher:Bronson, Gary J.

Chapter5: Repetition Statements

Section5.5: A Closer Look: Loop Programming Techniques

Problem 12E: (Program) Write a program that tests the effectiveness of the rand() library function. Start by...

See similar textbooks

Related questions

Q: Write an e-mail as a follow-up to an on-site company interview. Assume that during the interview the…

A: The main important aspect of the email is subject in an email should state what your email is about.…

Q: Indices can speed up query processing, but it's usually a terrible idea to index every attribute,…

A: Answer : It decrease the performance on insertion and other operations of data.

Q: Give your own non-software example of the Mediator pattern.

A: One of the significant and popular behavioural design patterns is the mediator pattern. By placing a…

Q: 10A. Consider the following algorithm: g1 = 6 g2 = 7 for k > 2: gk = (k-1)·gk-1 - gk-2 What…

A: g3=2*g2-g1 = 2*7-6=8 g4= 3*g3-g2 = 3*8-7=17 g5= 4*g4 -g3 = 4*17-8 = 60 g6 = 5*g5-g4 = 5*60-17= 283

Q: Explain why TIME. WAIT is a somewhat more serious problem if the server initiates the close than if…

A: In comparison to the client, TIME_WAIT has problems getting the server into a close condition. The…

Q: in what ways do language lead to connection ?

A: Language is a vital part of mortal connection. Although all species have their ways of…

Q: The specifications for the Sorted List ADT state that the item to be deleted is in the list. •…

A: Sorted list: It is a combination of an array and a hash table. It contains a no.of list of items…

Q: Assume d is a dictionary with string keys, list values, and at least one key:value pair. Which of…

A: Dictionary in Python: It is an unordered collection of items in the form of key-value pair. Syntax…

Q: 1. (a) (b) DFS of an undirected graph G can be used to identify the connected com- ponents of G, and…

Q: thank you, c++ programming hello, c++, question and code thank you the goal is a problem that…

A: The question has been answered in step2

Q: Consider the following code snippet: int sum = 0; int mylist[] = {8, 12, 3, 4, 12, 9, 8}; for (int…

A: The given code snippet is: int sum = 0;int mylist[] = {8 , 12, 3, 4, 12, 9, 8};for (int row = 0; row…

Q: i. Member ii. Make ) Use the same tables to present any ONE (1) example of how database integrity…

A: Integrity Constraints in DBMS - It is a set of rules that take care of all operations (insertion,…

Q: What is the output produced by the following code? int a=2, b=4; for (int i=0; i<9; i++) a+=2; b+=4;…

A: Given Code public class Question{ public static void main(String []args){…

Q: where n = 1G (i.e., 4 x n uniquely addressable locations-n: row, 4:2 column/width), what is the…

A: The answer is

Q: The first line of HTTP request message is called a. Request line b. Header line c. Status line d.…

A: Introduction The first line of HTTP request message is calleda. Request lineb. Header line c. Status…

Q: Name at least three tasks performed by the WinMain (startup) procedure.

A: Answer:

Q: After establishing a connection with the local DNS server PC1 now knows the IP and MAC addresses of…

A: Please check the step 2 for solution

Q: Java VENDING MACHINE Write a program that simulates a vending machine. The program should display a…

A: Java Programming refers to the object oriented programming languages that are used to develop the…

Q: ain why TIME. WAIT is a somewhat r bus problem if the server initiates the if the client does.…

A: Introduction: Below describe the why TIME. WAIT is a somewhat more serious problem if the server…

Q: Given the grammar G with following production rules: ? → ?|??|?? determine whether the following…

A: According to the information given:- determine whether the following strings can be generated by the…

Q: C++ Problem 1 please

A: Given We know about the C++ programing.

Q: A micro instruction format has micro operation field which is divided into 2 subfields F1 and F2,…

A: Logic , if there are n micro- operation then we can represent it in form of 2n where n will…

Q: You have been asked to test a method called 'catWhiteSpace' in a 'Paragraph' object that, within the…

A: Cat whitespace is the method of the testing of the given paragraph or the sentences by using them we…

Q: A computer with 192.168.2.1 is not in the same network since it's "network" part is different, it's…

A: Introduction: Below describe computer with 192.168.2.1 is not in the same network since it's…

Q: Explain FIVE (5) approaches in developing secure systems in digital business.

A: 1) Protect with passwords:- This may seem like a no-brainer, but many cyber attacks succeed…

Q: Urgent solve using C++ Notes: The maximum size of any c-string in this lab is 100 characters and…

A: Here is the c++ program See below steps.

Q: You have been asked to test a method called 'catWhiteSpace' in a 'Paragraph' object that, within the…

Q: SELECT P.NAME, P. EMAIL FROM PASSENGER P WHERE P.ID NOT IN SELECT PASSENGER_ID FROM RIDE_PASSENGER;

A: SQL is the structured query languages. This is used to store, manipulate and to retrieve the datas…

Q: Discuss the three layers of the Database architecture with examples of each layer.

A: Answer:

Q: Given Four points: P1 = (1, 1), P2 = (1.5, 1), P3 = (5, 5), and P4 = (4, 6). Create two clusters…

A: Given four points: P1 = (1,1) P2 = (1.5,1) P3 = (5,5) P4 = (4,6) Number of clusters(K) = 2

Q: Suppose most of the Internet used some form of geographical but that a large organization has a…

A: Introduction An IP address is a remarkable address that distinguishes a gadget on the web or a…

Q: - The step function u (t) is integral of with respect to time t. * Sinusoidal function O Ramp…

A: ANSWER:

Q: Why is encapsulation called Data Hiding?

A: Introduction Data encapsulation, otherwise called data hiding, is the system by which the execution…

Q: What are the two main types of firewall? (select two) Private Firewall Public Firewall Corporate…

A: A host-based firewall is firewall software that is installed on a single computer or other networked…

Q: After your interviews at Google and Microsoft, you started getting comfortable with the in- terview…

A: It is given that, we need a data structure that could store all the words that are to be passed as a…

Q: 2. What are the main benefits of using encapsulation in Java?

A: Introduction: Encapsulation is one of the four pillars of Object-Oriented concepts along with…

Q: One of the purposes of TIME_WAIT is to handle the case of a data packet from a first incarnation of…

A: The question has been answered in step2

Q: Consult Request for Comments 793 to find out how TCP is supposed to respond if a FIN or an RST…

A: Consult Request for Comments 793 to find out how TCP is supposed to respond if a FIN or an RST…

Q: (c) Suppose bar (n) is an O(n) function. Then, using Big-Oh notation, what is the runtime of the…

A: An algorithm is a set of instructions and rules that are required to complete a task. It gives a…

Q: When TCP sends a (SYN, SequenceNum = x) or (FIN, SequenceNum = x), the consequent ACK has…

A: TCP is a network protocol of TCP/IP protocol suite that employ a three-way handshake technique to…

Q: Regular expressions are built recursively out of smaller regular expressions, using some rules…

A: As per our guidelines, we are supposed to answer only 1st three parts. Kindly repost the remaining…

Q: When TCP sends a (SYN, SequenceNum = x), the consequent ACK has Acknowledgment = x + 1; that is,…

A: For establishing a new connection, TCP sent SYN packet along with sequence number = x then the…

Q: Need help with this in Javascript Angular Generate Username We provided some simple Angular…

A: export class Hero { constructor( public id: number, public name: string, public power:…

Q: SELECT MAX(datediff(minute,start_time,end_time)) as "Longest_ride",…

A: Your SQL code contains error related to function datediff.

Q: (a) What is the probability that T(w) = 10100011 ? (b) What is the probability that T(w) = 10101011?…

A: Given : Probability of error = 0.002 Probability of no error = 0.002 w = 10100011

Q: (1) Use scnr.nextLine(); to get a line of user input into a string. Output that line. (1 pt) Ex…

A: Answer:

Q: Q2) Write a program that prompts the user to enter the number of students and each student's score,…

A: Executable Code: import java.util.*;import java.lang.*;public class Main {// Main Programpublic…

Q: Assume that our LastPass web server is configured to use port 7777 rather than the default HTTP…

A: The question has been answered in step2

Q: Suppose two hosts A and B are connected via a router R. The A-R link has infinite bandwidth; the R-B…

A: Introduction Networking is the trading of data and thoughts among individuals with a typical…

Q: Suppose two hosts A and B are connected via a router R. The A-R link has infinite bandwidth; the R-B…

Concept explainers

Computational Systems

The computation systems can be defined as the systems that are capable of solving a problem that includes calculations either mathematical or logical, and are able to produce the result as an output. For example, a simple calculator that is given a set of numbers and operators as input and produces the result as an output can be defined as a computational system. The above example is a simple illustration only, the computational systems range from simple devices to complex devices such as the systems that control the SpaceX companies, Starlink satellites which are being quite recently seen in the skies at many places globally.

Question

Give only the correct answer and don't copy

5. For each of the following, give the Big-Oh runtime in terms of n (if applicable) (not i).
(a) Suppose bar(n) is an O(log n) function. Then, using Big-Oh notation, what is the runtime of the following
function? (You don't have to justify your answer.)
void foo(int n)
{
}
int i;
for (i = 0; i<n; i++)
bar (n);
(b) Using Big-Oh notation, what is the runtime of this function? (You don't have to justify your answer.)
void foo(int n)
{
}
int i = n;
while (i > 0)
i = 1 / 2;

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

VIEW

Step 2

VIEW

Step 3

VIEW

Step by step

Solved in 3 steps with 3 images

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

Answer in C++, show example output please There are three buckets size X, Y, M (1<=X<=Y<=M). All three buckets are initiallyempty. Using these three buckets, we can perform any number of the following twotypes of operations. We can fill the smallest bucket (of size X) completely to the top with X units of water andpour it into the size-M bucket, as long as this will not cause the size-M bucket tooverflow. We can fill the medium bucket (of size Y) completely to the top with Y units of water andpour it into the size-M bucket, as long as this will not cause the size-M bucket tooverflow. Although we may not be able to completely fill the size-M bucket, but we can stilldetermine the maximum amount of milk we can possibly add to largest bucket. Sample input:17 25 77 Sample output:76 In this example, we fill the bucket of size 17 three times and then bucket of size 25once, accumulating a total of 76 units of water. You could use additional test case to test your program:Input: 52 791…
Give a tight bound of the nearest runtime complexity class for each of the following code fragments in Big-Oh notation, in terms of the variable N. In other words, write the code's growth rate as N grows. Write a simple expression that gives only a power of N using a caret ^character for exponentiation, such as O(N^2) to represent O(N2) or O(log N) to represent O(log2 N). Do not write an exact calculation of the runtime such as O(2N3 + 4N + 14).
Consider the following recursively defined function (in Lean):def foo : ℕ → ℕ| 0 := 1| 1 := 0| (succ (succ n)) := succ (succ (foo n))Can you describe what the function is doing in one short sentence? Which of the following propositions about foo are provable in Lean? For which ones can we prove their negation? Justify your answers.i) ∀ y:ℕ, ∃ x:ℕ, y = foo xii) ∀ x:ℕ, foo (foo x) = xiii) ∀ x : ℕ, foo (succ x) = succ (foo x)iv) ∃ x:ℕ, foo x = x
Analyze the following code fragment and provide an asymptotic (Θ) bound on the running time as a function of n. You do not need to give a formal proof, but you should justify your answer.
Please help. How to solve this on Java language by using only Dynamic Programming? Thank you. We are given a set A of integers. Check whether we can partition A into three subsets with equal sums. It is important to note that all elements should be included in the equally divided subsets; no element should be left out, and none of the elements should be repeated in the subsets.For example: A={4,7,6,2,10,7,10,2} has such a partition: {4,2,10}, {7,7,2},{6,10}Input: A set, A, of integersOutput: if we can partition A into three subsets with equal sums, print subsets otherwise present a suitable message.
Suppose that recursive function ???(?) calls itself twice within its body(assume ???(?−1) called 3 times). Also assume the recursion would end when n=0. How many function calls does foo initiates? (A) O(?) (B) O(3?) (C) O(?3) (D) O(3?) Which answer is right and please explain why
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.
Write the C equivalent “train” function #void train(int*A, int*B, int*C, int k) train: add $t4, $0, $0bus: add $t5, $t4, $a1 lw $t6, 0($t5) add $t5, $t4, $a2 lw $t7, 0($t5) add $t6, $t6, $t7 add $t5, $t4, $a0 sw $t6, 0($t5) addi $t4, $t4, 4 slt $t5, $t4, a3 bne $t5, $0, bus jr ra
Hello, Could you please help me elaborate on "Running Time Complexity", "Space Complexity", and "Big-Oh Notations"? The problem attached asks for both f (n) and g (n) which I have no idea what they are about. All I currently know is that since every "i" runs n. times as "j" iterates, and "i" itself runs for n times, the Big-Oh notation of the running time for the problem should be O (n * n) = O (n^2). However, how can I express the answer in f (n) and g (n) format? Could you please help me with this?
Consider the following block of code that computes A mod B. What would bethe runtime?
In C programming Mathematically, given a function f, we recursively define fk(n) as follows: if k = 1, f1(n) = f(n). Otherwise, for k > 1, fk(n) = f(fk-1(n)). Assume that there is an existing function f, which takes in a single integer and returns an integer. Write a recursive function fcomp, which takes in both n and k (k > 0), and returns fk(n). int f(int n);int fcomp(int n, int k){
The goal is to rewrite the function, below, such that passes in a different list of parameters, particularly eliminating the need to pass low and high for each recursive call to binary_search. defbinary_search(nums,low,high,item): mid=(low+high)//2iflow>high:returnFalse #The item doesn't exist in the list!elifnums[mid]==item:returnTrue# The item exists in the list!elifitem<nums[mid]:returnbinary_search(nums,low,mid-1,item)else:returnbinary_search(nums,mid+1,high,item) The new function should be prototyped below. The number of changes between the given version, and the one requested is not significant. defbinary_search(nums,item):pass# Remove this and fill in with your code Tip: If you consider that high and low are used to create a smaller version of our problem to be processed recursively, the version requested will do the same thing, just through a different, more Pythonic technique.