QUESTION 25What is the time complexity function of the following algorithm?1. Input strings 1,..., In and y1,...,Yn, and length n.2. For i = 1 to n do2.1 For j = 1 to n do2.1.1 If r; = Y; then2.1.1.1 Return "Element in common to both strings."3. Return "No elements in common to both strings."n2f(n) =a.-nOb.f(n) =n?O c. f(n) =nС.O d. f(n) = 2n

Please refer below for your reference: According to above algorithm : there are two for loops , n…

What is the time complexity function of the following algorithm? 1. Input strings 1,..,In and y1,...,Yn, and length n. 2. For i = 1 to n do %3D 2.1 For j = 1 to n do 2.1.1 If r = Y; then 2.1.1.1 Return "Element in common to both strings." %3D 3. Return "No elements in common to both strings." n2 -n f(n) = a. %3D Ob. f(n) =n? O c. f(n) =n O d. f(n) = 2n

What is the time complexity function of the following algorithm? 1. Input strings 1,..,In and y1,...,Yn, and length n. 2. For i = 1 to n do %3D 2.1 For j = 1 to n do 2.1.1 If r = Y; then 2.1.1.1 Return "Element in common to both strings." %3D 3. Return "No elements in common to both strings." n2 -n f(n) = a. %3D Ob. f(n) =n? O c. f(n) =n O d. f(n) = 2n

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

What does the ff. algorithm return? (Note: indentation is important) algorithm foo(f: function, a1, a2, . an, b1, b2, ..., bm : integers) .... for i + 1 to m hit(b;) + 0 k e true for je1 to n if hit(fla) ) == 0 then hit(f(a; )) – 1 else k e false return k Note: the array hit keep track of which elements of the codomain B have already been found to be images of elements of the domain A. O determines whether a function is bijective O determines whether a function is one-to-one O None of the choices determines whether a function is onto
Trace the following code and write the output and mention what the code does int algorithm(int arr[], int I, int r, int x) { if (r >= 1) { int mid = |+ (r - I) / 2 if (arr[mid] == x) return mid if (arr[mid] > x) return algorithm(arr, I, mid - 1, x) return algorithm(arr, mid + 1, r, x) } return -1 } int main(void) { int arr[] = { 2, 3, 4, 10, 40, 7, 9, 11} int n = sizeof(arr) / sizeof(arr[0]) int x = 11 int output = algorithm(arr, 0, n - 2, x) (output == -1) ? printf(" 11 is not found in the list") : printf("11 is found at index %d", output) return 0
Subject - Design & Anal algorithms Please complete all the questions together. Thank you in Advance. Consider the following pseudocode for bubblesort:bubblesort(A, n)for i from 1 to n − 1for j from n to i + 1if A[j] < A[j − 1]swap(A[j], A[j − 1])(a) What is the loop invariant for bubblesort?(b) State briefly a proof of correctness.(c) Derive concisely the worst-case running time of bubblesort as a function of the input array sizen? Show your work!(d) Derive concisely the best-case running time as a function of n. Show your work!
The following is a high level description for a luring machine M. List the first four elements of L(M) in lexicographic order (shortest first, then alphabetically if same length). 1. Move right. 2. Loop: 2.1. If the current symbol is x, change it to $ and move right. Otherwise exit loop. 2.2. Scan rightwards, past x's and #'s to find y. 2.3. If y found, change it to # and move right. Otherwise reject. 2.4. Scan rightwards, past y's and %'s to find z. 2.5. If z found, change it to % and move left. Otherwise reject. 2.6. Scan leftwards, past x's, y's, #'s and %'s to find $. 2.7. When finding the first $, move right, and go back to 2.1. 3. If the current symbol is #, more right. Otherwise reject. 4. Scan rightwards, past #'s and %'s, to find the blank symbol. 5. When finding the first blank symbol, move right and accept. €, xyz, xxyyzz, xxxyyyzzz xyz, xxyyzz, xxxyyyzzz, xxxxyyyyzzzz €, ZyX, ZZYYXX, ZZZYYYXXX zYX, ZZYYXX, ZZZYYYXXX, ZZZZYYYYXXXX
sum = 0 for j in range(1,12): sum = sum + (9*j + 3) print(sum) What is printed as a result of executing this algorithm?
Detailed answer please. Thank you
Question Time complexity calculation 1. Suppose there is an ordered list of 128 names. You need to use binary search to find one of them. How many steps does it take to find it? 2. After doubling the length of the above list, how many steps are required at most? 3. Analyze the program and find the time complexity of the algorithm 2) ( 3 ) for(i=1;i<=n;i++) (1) i=l;k=0; while(i
The following code is used to derive Fibonacci algorithm with this sequence: (0, 1, 1, 2, 3, 5, 8, 13, 21, …) where each number is “add” of two previous ones. int fib(int n){ if (n==0) return 0; else if (n == 1) return 1; else return fib(n−1) + fib(n−2); } Explain why the following RISC-V assembly code works, you need to explain all the details using the comments as hints? # IMPORTANT! Stack pointer must remain a multiple of 16!!!! addi x10,x10,8 # fib(8), you can change it fib: beq x10, x0, done # If n==0, return 0 addi x5, x0, 1 beq x10, x5, done # If n==1, return 1 addi x2, x2, -16 # Allocate 2 words of stack space sd x1, 0(x2) # Save the return address sd x10, 8(x2) # Save the current n addi x10, x10, -1 # x10 = n-1 jal x1, fib # fib(n-1) ld x5, 8(x2) # Load old n from the stack sd x10, 8(x2) # Push fib(n-1) onto the stack addi x10, x5, -2 # x10 = n-2 jal x1, fib # Call fib(n-2)…
Can u solve it using functions and please solve part 2 and 3 also, not only part 1.