Apply algorithm 4.3.3 in P.158 with n=6 and A=(3,5,4,1,3,2). Draw the corresponding walkthrough as shown in P.158. Algorithm 4.3.3: BubbleSort// the standard versionBeginFor k + 1 To (n – 1) Do// the kh pass through AFor j+1 To (n – k) DoIf (A[j] > A[j + 1]) Thenx- A[j];A[j] + A[j + 1] ;A[j+ 1] + x;End; // the ifEnd; // the for-j loop// the for-k loopEnd;End.Walkthrough of BubbleSort with n = 11 and A = (5, 7, 6, 0, 9, 8, 2, 1, 5, 7, 8)// showing the contents of A after each pass.After pass kA5 7 6 0 9 8 2 15 7 85 6 0 7 8 2 1 5 7 8 95 0 6 7 2 1 57 8 80 5 6 2 1 5 7 7 80 5 2 1 5 6 7 70 2 1 5 5 6 70 1 2 5 5 60 1 2 5 58134+ // we're done!70 1 2 50 1 20 19.10o 0 = : = : : : :H n7N r: : : : : :

Answered: Image /qna-images/answer/faea31d8-43c3-498b-b9d4-6988f03fbe39.jpg

Algorithm 4.3.3: BubbleSort // the standard version Begin For k + 1 To (n – 1) Do For j + 1 To (n – k) Do If (A[j] > A[j+1]) Then x+ A[j]; A[j] + A[j + 1]; A[j +1] + x; End; // the if End; |/ the for-j loop // the for-k loop // the kh pass through A End; End. Walkthrough of BubbleSort with n = 11 and A = (5, 7, 6, 0, 9, 8, 2, 1, 5, 7, 8) // showing the contents of A after each pass. After pass k A 5 7 6 0 9 8 2 1 5 7 8 5 6 0 7 8 2 15 7 8 9 5 0 6 7 2 1 5 7 8 8 0 5 6 2 1 5 7 7 8 2 05 2 1 5 6 7 7 0 2 1 5 5 67 0 1 2 5 5 6 0 1 2 5 5 0 1 25 0 1 2 0 1 " 4 %3D + // we're done! %3D 7 8. %3D 10 %3D 3D %3D Cr: : : : :

Algorithm 4.3.3: BubbleSort // the standard version Begin For k + 1 To (n – 1) Do For j + 1 To (n – k) Do If (A[j] > A[j+1]) Then x+ A[j]; A[j] + A[j + 1]; A[j +1] + x; End; // the if End; |/ the for-j loop // the for-k loop // the kh pass through A End; End. Walkthrough of BubbleSort with n = 11 and A = (5, 7, 6, 0, 9, 8, 2, 1, 5, 7, 8) // showing the contents of A after each pass. After pass k A 5 7 6 0 9 8 2 1 5 7 8 5 6 0 7 8 2 15 7 8 9 5 0 6 7 2 1 5 7 8 8 0 5 6 2 1 5 7 7 8 2 05 2 1 5 6 7 7 0 2 1 5 5 67 0 1 2 5 5 6 0 1 2 5 5 0 1 25 0 1 2 0 1 " 4 %3D + // we're done! %3D 7 8. %3D 10 %3D 3D %3D Cr: : : : :

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

a. Translate with a three-address statement, the following expression: n = f((x+2), y) – 5; b. If A is an array of integers with width = 4; Translate with three-address statement, the following expression: x = a[i] + 2;
Given a positive integer, N, the ’3N+1’ sequence starting from N is defined as follows:If N is an even number, then divide N by two to get a new value for NIf N is an odd number, then multiply N by 3 and add 1 to get a new value for N.Continue to generate numbers in this way until N becomes equal to 1For example, starting from N = 3 the complete ’3N+1’ sequence would be:3, 10, 5, 16, 8, 4, 2, 1Write code to ask the user to enter a positive integer (N) in the main() function. Write a function sequence()that receives the integer value N and display the ‘3N+1’ sequence starting from the integer value that wasreceived (entered by the user). The function must also count and return the numbers that the sequenceconsists of. The returned value must be displayed from the main() function.
Suppose a Genetic Algorithm uses chromosomes of the form x=abcdef with a fixed length of six genes.Each gene can be any digit between 0 and 9 . Let the fitness of individual x be calculated as : f(x) =(a+b)-(c+d)-(e+f) And let the initial population consist of four individuals x1, ... ,x4 with the following chromosomes : x1 = 3 5 3 2 6 5, x2 = 9 8 0 1 2 2, x3 = 1 2 2 1 2 3, x4 = 7 9 2 3 1 1 1. 1.Evaluate the fitness of each individual, showing all your workings, and arrange them in order with the fittest first and the least fit last. 2. calculate the average fitness. 3. Perform the following crossover operations:a- Cross the fittest two individuals using one point crossover at the middle point.b- Cross the second and third fittest individuals using a two point crossover (points b and e). Suppose the new population consists of the four offspring individuals received by the crossover operations in the above question. Evaluate the fitness of the new population, showing all your…
Practice 3: Let’s compile following C sequence for MIPS and run on the emulator: int divide(int N, int M) { // map q and i to $s2 and $s3 int q = 0; int i = N; while(i > 0) { q += 1; i = i - M; } return q; } int multiply(int N, int M) { // map sum and i to $s0 and $s1 int sum = 0; for(int i = 0; i < N; ++i) { sum += M; } return sum; } int main() { // map a, b, c, k, and j to $s0, $s1, $s2, $s3, and $s4 int a = 4; int b = 5; int c = 120; int k = multiply(a, b); int j = divide(c, k); } Make sure multiply procedure properly gets backup of $s0 to $s4. Verify that after running this sequence: • value of S0 is (4)10 • value of S1 is (5)10 • value of S2 is (120)10 • value of S3 is (20)10 • value of S4 is (6)10 When ready, copy your MIPS assembly code from emulator and save as a text file.
Given a positive integer, N, the ’3N+1’ sequence starting from N is defined as follows: If N is an even number, then divide N by two to get a new value for N. If N is an odd number, then multiply N by 3 and add 1 to get a new value for N. Continue to generate numbers in this way until N becomes equal to 1. For example, starting from N = 3 the complete ’3N+1’ sequence would be:3, 10, 5, 16, 8, 4, 2, 1 Do the following: Write a code in C++ to ask the user to enter a positive integer (N) in the main() function. Write a function sequence() that receives the integer value N and display the ‘3N+1’ sequence starting from the integer value that wasreceived (entered by the user). The function must also count and return the numbers that the sequence consists of. The returned value must be displayed from the main() function. Example input and output is given in the following image.
Suppose that two matrices A and B with dimension n x n are stored on a 2D mesh of n2 processors such that P_(i,j) holds A[I,j] and B[j,i] . Write C-style pseudocode for an asynchronous algorithm that computes the product of A and B in O(n) time. (10 points) (WRITE THE PSEUDOCODE! IF YOU DON'T WRITE PSEUDOCODE, YOU WILL BE WRONG!! C-STYLE ONLY!!!)
1. Given an unsorted list of N numbers, how many list elements will be checked to find a value K using linear search in the worst case? A. O(1) B. O(N) C. O(log N) D. O(N log N) E. O(N * N) 2. Given a sorted list of N numbers, how many list elements will be checked to find a value K using binary search in the worst case? A. O(1) B. O(N) C. O(log N) D. O(N log N) E. O(N * N) 3. For the linear/sequential/serial search, which is the time complexity in its best case? A. O(1) Constant running time B. O(N) Linear running time C. O(log N) Logarithmic running time 4. For the linear/sequential/serial search, which is the time complexity in its worst case? A. O(1) Constant running time B. O(N) Linear running time C. O(log N) Logarithmic running time 5. Which of the following statements is correct? A. Binary search has a logarithmic running time B. Binary search has a constant running time for the best case…
In the cellular automata, some cells are filled while others are empty. Assume having a Boolean array of values corresponding to filled and empty cells, develop a Java code segment to plot the updated cellular automata assuming cell width and height is c, and the number of cells per row is n and the number of cells per column is n. solve it using Java2d and implement thread or timer in solution
implement a function for finding the nth Fibonacci number using the MIPS assembly language. Following gives the definition of the Fibonacci Sequence.Let F be the Fibonacci function:F(0) = 0F(1) = 1For n > 1 F(n) = F(n-1) + F(n-2)Example Output of Execution:Enter the sequence number: 6F(6) = 8 A - Loop ImplementationIn a file named FiboLoop.asm, implement the above function using a loop. B - Recursive ImplementationIn a file named FiboRec.asm, implement the above function using a loop.
Write a GO program to read an positive integer n>4, and then run the Fermat primality test for at least k rounds. The program should be able to read a positive integer n>4 and a positive integer k, then output if n is probably a prime number. *cannot use use array, string or slice *the program should operates well with with different n (4 < n < 1024) and k (0 < k <20)
Computer Science you are given a string X of length n and another string Y of length m ≤n. Say,the indexes p1, p2, p3, p4 and q1, q2, q3, q4 form two sub-sequences, i.e., 0 ≤ p1 < p2 < p3 < p4 < nand 0 ≤q1 < q2 < q3 < q4 < n; then, they are non-overlapping if p4 < q1.The task is to count the maximum number of non-overlapping sub-sequences of X that are thesame as Y . Thus, if X = GAXTYAWBGTAUGBTABGRGTAXB and Y = GTAB, then the answer is3 as shown by the red fonts. We cannot select the underlined GTAB as it overlaps with a red GTAB(i.e., among overlapping sub-sequences, you can select only one of them).Describe an O(m + n) time algorithm to obtain the count. Write a pseudo-code.
2022-02-14 20:52:35 Write the primitive counting results for your 40 sheep: 40= For example, the answer for "14" would be (1,1,1,0), meaning that the first division of sheep had none left over, but every other division of sheep had a leftover sheep. Include the commas and the parentheses in your answer.