Question 1Consider the following segment of an algorithm:i = 1Loop while (i Question 4Given the recurrence relations T(n) = ₁complexity in big-theta?A. 0(√n log10 √n)B. 0(n² log₂ n)C. 0(√n log₂n)D. (n¹og₂n)E. (n log₂ √n)Question 5Consider a Queue ADT with the following standard operations: create Queue () andenqueue (Queue Q, int x), and a Stack ADT with the similar standard operations: createStack(),pushStack (Stack s, int n), and popStack (Stack S, int x) have been created. With the followingalgorithm and data file:) = √2T (²) + √ñ and T(1)=1, what is the run-timeAlgorithm: DoSomething (String filename)Q1 = createQueue ()S1 = createStack()Open filenameloop (not end of file)read numberif (number not 0)elsepushStack (S1, number)popStack (S1, x)popStack (S1, x)loop (not empty S1)popStack (S1, x)enqueu (Q1, x)end loopend ifend loopThe data are 8, 30, 53, 14, 0, 66, 38, 19, 45, 29, 39, 7, 0, 29, 29, 8, 39, 18, 0What would be the contents of queue Q1 after the above-describe code is executedwith the associated data file input to the algorithm?A. 53, 30, 8, 39, 29, 45, 19, 38, 66, 39, 8, 29, 29B. 30, 8, 29, 45, 19, 38, 66, 8, 29, 29C. 53, 14, 19, 45, 29, 39, 7, 8, 39, 18D. 8, 30, 33, 38, 19, 45, 29, 29, 8E. 8, 30, 66, 38, 19, 45, 29, 29, 29,8

Question 1 Consider the following segment of an algorithm: i = 1 Loop while (i < n) print("Hello World!") i - i * 3 Which one of the following options about the runtime R(n) is true? A. R(n) = 0(n³) B. R(n) = 0(log³n) C. R(n)= 0(3") D. R(n)= 0(log3 n) E. R(n) = 0(³√n) Question 2 Which of the following is NOT true? A. n2 € 0(n3) E B. log(n!) € O(n) C. log(n!) E (logn) D. 4¹ € 0(2) E. n² € (nlgn) Question 3 Suppose T is a binary search tree storing n entries. Which one of the following statements is true? A. Inserting into T is 0(1) in the best case and 0(log n) in the worst case. B. Inserting into T is 0(1) in the best case and 0(n) in the worst case. C. Inserting into T is 0(log n) in the best case and 0(log n) in the worst case. D. Inserting into T is 0(log n) in the best case and 0(n) in the worst case. E. Inserting into T is O(n) in the best case and 0(n) in the worst case.

Question 1 Consider the following segment of an algorithm: i = 1 Loop while (i < n) print("Hello World!") i - i * 3 Which one of the following options about the runtime R(n) is true? A. R(n) = 0(n³) B. R(n) = 0(log³n) C. R(n)= 0(3") D. R(n)= 0(log3 n) E. R(n) = 0(³√n) Question 2 Which of the following is NOT true? A. n2 € 0(n3) E B. log(n!) € O(n) C. log(n!) E (logn) D. 4¹ € 0(2) E. n² € (nlgn) Question 3 Suppose T is a binary search tree storing n entries. Which one of the following statements is true? A. Inserting into T is 0(1) in the best case and 0(log n) in the worst case. B. Inserting into T is 0(1) in the best case and 0(n) in the worst case. C. Inserting into T is 0(log n) in the best case and 0(log n) in the worst case. D. Inserting into T is 0(log n) in the best case and 0(n) in the worst case. E. Inserting into T is O(n) in the best case and 0(n) in the worst case.

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

Python
3. Write a JAVA program to find the number of iterations of the given loop when n is: a) 10 b) 20 Loop: for(int i=0; i
None
43
Calculate the run time for the code below: int x=6, y=9 int z; Z=x + y; z++; cout << z; O a. O( log n) O b. O(n logn) O c. O(n) O d. O(1)
Find the values of n and m to solve this puzzle int n = ? int m = ? int t = 76; int s = 0; char *msg = "Do you like spaghetti? Try some spaghetti! It's good, right?\n" "What, you prefer structured loops? How mundane.\n"; goto LTOP; LEND: failure(msg); LOM1: n = (n<<2) - n + 1; LCHK: if(s == t && m == t){ goto LAFT; } s++; goto LTOP; LOC1: if(n & 1){ goto LOM1; } goto LEM1; LTOP: if(!(n>1)){ goto LEND; } goto LOC1; LEM1: n = n >> 1; goto LCHK; LAFT: return;
How can I apply this python code wherein I have an input n. Then create a list from 2, n and remove the multiples of n. Example: Input: 10 Output: 2, 3, 4, 5, 6, 7, 8, 9 def createList(n): #Base Case/s #TODO: Add conditions here for your base case/s #if <condition> : #return <value> #Recursive Case/s #TODO: Add conditions here for your recursive case/s #else: #return <operation and recursive call> #remove the line after this once you've completed all the TODO for this function return [] def removeMultiples(x, arr): #Base Case/s #TODO: Add conditions here for your base case/s #if <condition> : #return <value> #Recursive Case/s #TODO: Add conditions here for your recursive case/s #else: #return <operation and recursive call> #remove the line after this once you've completed all the TODO for this function return []
Choose the Big-O for the following statements. { int n=10, count-0, i=0; While (i<=10){ count++; itt; }} O(n) O(1) O(n²) O(log n)