Consider the following algorithm segment. if x · y > 0 then do y :=4 · x x:=x +1 end do z := x• y Find the value of z if prior to execution x and y have the values given below. (a) x = 3, y = 4 z = (b) x = 1, y = 1 z =

Consider the following algorithm segment. if x · y > 0 then do y :=4 · x x:=x +1 end do z := x• y Find the value of z if prior to execution x and y have the values given below. (a) x = 3, y = 4 z = (b) x = 1, y = 1 z =

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: (a) Design an algorithm for performing multiplication of two polynomials. (b) Then analyze its time…

A: a) Algorithm: multiply(A[0..m-1], B[0..n-1]) Create a product array prod[] of size m+n-1…

Q: Find the correct asymptotic complexity of an algorithm with runtime T(n, n) where T(x, y) = O(x * y)…

A: The equation is T(x, y) = O(x * y) + T(x/2, y) So , T(n, n) = O(n*n) + T(n/2, n)…

Q: Compute the time complexity for the following algorithm Algorithm ABC2(X,p,m) { if (I==m) then…

A: Please upvote. I am providing you the correct answer below. The loop runs from p to m (i.e. m-p…

Q: Choose an algorithm of minimum 15 lines, then calculate the complexity (Big O)(show the details of…

A: Consider a C++ program to print half pyramid using *: #include<iostream> int main() { int n;…

Q: Computer Science Find the correct asymptotic complexity of an algorithm with runtime T(n) and…

A: Upper bounds The number of steps an algorithm requires to solve a specific problem is denoted as the…

Q: Assume that the time to execute an algorithm with input size k is given as follows. Express the time…

A: ANSWER:-

Q: 3. Draw the Flow Graph and then determine the Cyclomatic complexity of the following program. int…

A: Here we draw the flow graph: ==========================================================

Q: An analysis of an algorithm's complexity divides its behavior into what three types of cases? Select…

A: An analysis of an algorithm's complexity divides its behavior into what three types of cases

Q: Create an algorithm for the given case: A store owner wants to give a 10% discount to the purchases…

A: ALGORITHM:- 1. Take the bill amount from the user as input. 2. Take the age of the user as input. 3.…

Q: Draw a flow chart diagram for an algorithm that print ten numbers in ascending orders

A: A flowchart is a type of diagram that represents a workflow or process. A flowchart can also be…

Q: Select the asymptotic worst-case time complexity of the following algorithm: Algorithm Input: a1,…

A: Big O notation is a maths notation which helps in describing the limiting behaviour of a given…

Q: Consider the problem of finding the distance between the two closest and y is computed as x - y.)…

A: Pseudocode is an artificial and informal language that helps programmers develop algorithms. Writing…

Q: 1. Write the running time of given algorithm: Procedure fun (N, Q, M) while N > 0 do for j = 1 to Q…

A: There are 3 loops which will contribute in running time: While loop of N For loop of Q For loop of…

Q: uppose a Genetic Algorithm uses chromosomes of the form x=abcdef with a fixed length of six genes.…

A: Genetic Algorithm It is a search-primarily based totally optimization approach primarily based…

Q: In a string, we can have repeated pattern. Example: Input abc Output none abaa none (a) 4 (ab) 2…

A: Here we need to print the pattern and their repeating count, consider statement 3 i.e. aaaa here we…

Q: performs 10 n2 basic operations, while algorithm B does 300ln(n) basic operations, resulting in a…

A: Given : A performs 10*n^2 basic operations A performs 300*ln(n) basic operations

Q: uppose three algorithms A, B, and C, can be implemented to perform a task. The ilgorithms have the…

A: Answer:- C < A < B explanation:- first, we will know, what is Time Complexity?…

Q: Design an algorithm to read the bus rapid transit system routes list and print the number of tickets…

A: To find a SCC(strongly connected Components) in a graph KOSARAJU ALGORITHM is used. This algorithm…

Q: Identify the the task of the following algorithm. 1. Input r, h 2. V=1/3r?h 3. output V Select one:…

A: From given algorithm, User inputs r,h values where r is radius and h is height Using r,h values, we…

Q: Suppose a genetic algorithm uses chromosomes of the form X = abcdefgh with a fixed length of eight…

A: a) Evaluate the fitness of each individual, showing all your workings, and arrange them in order…

Q: 2. Given the following recursive algorithm: procedure sum(x, y) Input: x: nonnegative integer, y:…

A: As only question 2 is asked . So i am solving for question 2 . procedure sum(x,y) Hence the method…

Q: From programming point of view, an algorithm is a step-by-step procedure to? copy any problem…

A: correct answer is :- resolve any problem Explanation: From programming perspective, an algorithm…

Q: Write the results of the algorithms given below by filling the table. 1. Start 2. A=0 3. B=1 4. If…

A: C++ code: #include <iostream>using namespace std; int main(){ int A = 0; int B = 1;…

Q: We define a tomato sandwich as two slices bread (toasted) with inward sides of bread buttered. The…

A: Below is the required algorithm:

Q: Compute the order of the following algorithm segment: for i := 1 to n for j:= 1 to 2i X:= (n - i) ·…

A: As per the requirement program is developed. Algorithm: Step 1: Write the main() method Step 2:…

Q: Algorithm Analysis Start with 102 coins on a table, 98 showing heads and 4 showing tails. There are…

A: Answer: I have given answer in handwritten format.

Q: (a) What is the actual number of elementary operations (additions, subtractions, multiplications,…

A: for odd numbers of operations value is calculted below.

Q: I. Compute for the running time for each algorithm/code and give its complexity 1. for i = 1 to n do…

Q: Following are the various algorithms time complexities expressions. Find the dominant terms and…

A: Solutions:

Q: Select the asymptotic worst-case time complexity of the following algorithm: Algorithm Input: a1,…

A: Θ(n2) The third option is the correct answer.

Q: Consider the following scenario: What will be the final location and direction of the robot after…

A: explanation: movement according to code F R F F F F F F

Q: ist Of Integer: X(Integer: number) List Of Integer: Y Integer: i = 2 While (i 1)…

A: Z algorithm : Z algorithm finds all occurrences of a pattern in a text in linear time . Let length…

Q: Q # 1: Perform bottom up analysis on the given Algorithm? NESTED-LOOPS(0 1 for i +1 ton 2 do for j…

A: Task :- Write the time complexity analysis for given algorithm.

Q: Design an algorithm in pseudocode/code to print the total number of unique steps using a…

A: Task:- Design an algorithm code to print the total number of unique steps using a backtracking…

Q: Following are the various algorithms time complexities expressions. Find the dominant terms and…

A: Calculate: Find the dominant terms and specify the Big-Oh complexity of each algorithm.

Q: Write the results of the algorithms given below by filling the table. 1. Start 2. Н-0 3. I=1 4. If…

A: Solution Old H New H Old I New I H=0 1 1 4 H=1 5 4 7 H=5 12 7 10 H=12 22 10 13 Display…

Q: Following are the various algorithms time complexities expressions. Find the dominant terms and…

A: Answer: 1. Dominant Term: n1.3 O(..)=O(n) 2. Dominant Term:50n log10 n O(..)=O(nlog(n)) 3. Dominant…

Q: Design an algorithm which takes a compressed string C having characters from a fixed alphabet A and…

A: For a given string C and alphabet A, need to trace complete string, and also determine the time and…

Q: Q1: consider the algorithm below, Step 1: Input the two line endpoints, storing the left endpoint in…

Q: Consider the following algorithm segment. Assume that n is a positive integer such that n 2 6. for i…

Q: Suppose that you have five different algorithms (A, B, C, D and E) for solving a problem. To solve a…

A: An algorithm (pronounced AL-go-rith-um) is a procedure or formula for solving a problem, based on…

Q: Construct a trace table to trace the action of the algorithm below for the input variables given. a…

A: Given program contains, four variables a, d, q, r. The initial values of these variables are a=53,…

Q: The travel time function of an algorithm has the form: f(n) = 3n^2 + 4n + 8 Prove that Big Oh is…

A: Let g and f be functions, the function f is said to be O(g), if there is a constant c > 0 and a…

Q: Determine the frequency counts for all statements in the following two algorithm segments and…

A: We need to find time complexity.

Q: Write a simple algorithm (ex: If it rains, I will take my umbrella, otherwise I will take my…

A: A Simple Example of an Algorithm - To Find the Greater among two Integers and if the greater Number…

Q: Make a trace table to trace the action of the algorithm below for the input variables given. a := 46…

Q: 1.Find the exact step counts (growth function) and time complexity for following algorithms - i. ii.…

A: GIven two code snippet the time complexity of both is discussed below.

Q: For the digraph below, use the decreasing time list algorithm to create a priority list, then…

A: The priority list is created using decreasing time list algorithm. The priority list is created…

Q: Algorithm 4.3.3: BubbleSort // the standard version Begin For k + 1 To (n – 1) Do For j + 1 To (n –…

Question

100%

Consider the following algorithm segment.
if x · y > 0 then do y := 4 · x
X:=x + 1 end do
z := x• y
Find the value of z if prior to execution x and y have the values given below.
(a) x = 3, y = 4
z =
(b) x = 1, y = 1
z =

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

Compute for the time complexity (in milliseconds) of each letter of the given program segment below, then get the total time complexity. int main( ) { int a, b, c, d; for (a=0;a<10;a++) for (b=0;b<10;b++) for (c=0;c<10;c++) for (d=0;d<10;d++) { If ((a==0)&&(b==0)&&(c==0)&&(d==0)) { a=1, b=2,c=3,d=4; } cout<<a<<b<<c<<d; } }
Computer Science Find the correct asymptotic complexity of an algorithm with runtime T(n) and step-by-step workings where T(x) = O(n) + T((2*x)/8) Assume x and n are the same. If it is different, how will the working be like?
Suppose we have a group of proposed talks with preset start and end times. Students of CSE340 were asked to design an algorithm to schedule as many of these talks as possible in a lecture hall, under the assumptions that once a talk starts, it continues until it ends, no two talks can proceed at the same time, and a talk can begin at the same time another one ends. Assume that talk j begins at time sj (where s stands for start) and ends at time ej (where e stands for end). One student proposed the algorithm shown in Algorithm 1 on the next page, which simply adds talks in order of earliest start time (smallest sj ). (a) Prove, using a counter example, that the proposed algorithm does not always produce an optimal schedule (i.e., a schedule with most possible talks). (b) Another student proposed adding talks in order of shortest duration (ej - sj ). Prove, using a counter example, that even with this new criteria, the algorithm does not always produce an optimal schedule.
Could you please explain and compare time complexity for each algorithm ClustalW, ClustalOmega, MAFFT, MUSCLE, TCOFFE?
Suppose that we reach a point in algorithm where we then to decide to execute one of set of steps if the variable x has a value greater than or equal to zero or another set of steps if x has a value less than 0. In pseudo-code, show how one would address this situation in an algorithm.
Consider an algorithm that contains a loop that can be expressed with the following pseudocode: for( i = 1 through n ){Task T} If Task T requires t time units, how many time units (in terms of t) does the entire loop require? options: a) i b) n c) n * t d) n^2 e) n^2 * t
q10) Analysis of an Algorithm with respective CPU time taken by algorithm to execute is called ______________. a. memory complexity b. time complexity c. space complexity d. execution complexity.
Design an algorithm for testing if a given number belongs to the following sequence or not, compute its time complexity. u(0)=1, u(1)=1, u(N)=u(N-1)+N.u(N-2)+N
Design an algorithm to read the bus rapid transit system routes list and print the number of tickets we need to purchase if we want to visit all places minimal twice. The complexity of the algorithm must be O(V+E). V is the number of places. E-> is the number of transits. PS: Use Tarjan’s or Kosaraju’s strongly connected component algorithm.
Following are the various algorithms time complexities expressions. Find the dominant terms and specify the Big-Oh complexity of each algorithm. S. No. Expression Dominant term(s) O (. . .) 1. 75 + 0.001n1.3 + 0.025n + (1000)4 2. 500n + 100n + 50n log10 n 3. (10n1.5)4 + 0.3n + 5n6.5 + 2.5 · n2.75 4. 150n3 + n2 log2 n + n(log2 n)4 5. 3 log10 n + log2 log2 n 6. 100n4 + 0.01n2 + 200(log2 n)4 7. n3 + 0.01n + 100n2 + 5n3 8. 2n0.5 + n0.35 + 0.5n0.25 9. 0.01n2 log2 n + n(log2 n) 10. 50n3 log3 n + n5 log3 n + 100n4
Which assertion is false? CPU cycles are needed for time's complexity. Less memory is needed for space's complexity. Time complexity is measured by operations. An algorithm's worst-case scenario is the most operations.
Construct a memoized algorithm for this algorithm and and derive its time complexity: Assume that you were given N cents (N is an integer) and you were asked to break up the N cents into coins consisting of 1 cent, 2 cents and 5 cents. Write a dynamicprogramming based recursive algorithm, which returns the smallest (optimal) number of coins needed to solve this problem. For example, if your algorithm is called A, and N = 13, then A(N) = A(13) returns 4, since 5+5+2+1 = 13 used the smallest (optimal) number of coins. In contrast, 5+5+1+1+1 is not an optimal answer. You do not need to prove the complexity bound formally, just derive it by analyzing each component in your algorithm.