Time complexity of the following loop 2 1. count = 1 while count < 100: print(count) count *= 2 O( n) a) O( n^2) b) O(log n) c) O(Vn) d) The number of characters in “x" and the value of "y" for this program: x = '1' for i in range(0, 30): %3D while j < len (x): while k < len(x) and x[k] y += str(k-j) + j = k x[j]: k += 1 =D%3D x[j] y a) 30, 0 b) 900, null c) 5808, (space) d) 5808,(new line)

Time complexity of the following loop 2 1. count = 1 while count < 100: print(count) count *= 2 O( n) a) O( n^2) b) O(log n) c) O(Vn) d) The number of characters in “x" and the value of "y" for this program: x = '1' for i in range(0, 30): %3D while j < len (x): while k < len(x) and x[k] y += str(k-j) + j = k x[j]: k += 1 =D%3D x[j] y a) 30, 0 b) 900, null c) 5808, (space) d) 5808,(new line)

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 is the time complexity of this 2 nested for loop for(int i = 0; i < num.length; i++) { for(int j = i + 1; j < num.length; j++) { if(num[i] == num[j]) System.out.print(num[j]);
Simple Computer Science 3 question: Determining the big-O runtimes of a loop? void X(int n){ for(int i=0; i<n; i++) for(int j=0; j<n; j++) for(int k=0; k<n; k++) for(int w=1; w<n; w=2*w) time++;} My answer: n x logn x log n = O(n log n^2) I am not sure if that is correct though.
Design a type of sieve algorithm that would (1) Create a list of consecutive integers from 1 to n. (2) Initially, let k=2. (3) Consider each of the multiples of k less than or equal to n and either place or remove a mark on it as follows: - If you encounter an unmarked multiple, mark it with a zero. - If you encounter a multiple that has already been marked, remove the mark by restoring to its original value. (4) Increase k by one. (5) Repeat steps (3) and (4) as long as k <= n.
Rewrite the following loops, using the enhanced for loop construct. Here, values is an array of floating - point numbers. a. for (int i = 0; i < values.length; i++) { total = total + values[i]; } b. for (int i = 1; i < values.length; i++) { total = total + values[i]; } c. for (int i = 0; i < values.length; i++) { if (values[i] == target) { save = i; }.
Describe the running time in terms of the variable n. it would be better to say that loop will run 2*n + 1 times instead of That loop will run O(n) times for this; private int mystery(int n) { int sum = 1; for (int i = 0; i < n; i++){ sum = sum*2; } for (int i = 0; i < n; i++){ for (int j = n; j > 0; j=j/2) { sum = sum + n; } } return sum; }
What would be the complexity of given loop.
complete the following pseudo coded algorithm for computing the factorial of n if n equals 0 n! is 1. else n! = ______. a) n*(n-1) b) n*(n+1) c) (n-1)! d) n*(n-1)!
What is the return value if B = {1, 3, 5}? Algorithm Ex5(A): Input: Arrays A and B each storing n ≥ 1 integers. Output: The number of elements in B equal to the sum of the prefix sums in A. c ← 0 for i ← 0 to n - 1 do s ← 0 for j ← 0 to i do s ← s + A[0] for k ← 1 to j do s ← s + A[k] if B[i] = s then c ← c + 1 return c
Both Quicksort and Insertionsort have the time complexity O (n2) in the worst case. Which of the following statements is correct? A. Place of insertion is faster than average Quicksort, regardless of the value of 'n'. B. Choosing the first element as a pivot is a very effective strategy for Quicksort. C. Both Quicksort and Insertion sort are usually implemented as recursive algorithms. D. Insertion sort is generally faster than Quicksort for smaller values of n (<20 elements).
Create an algorithm that prints all possible arrangements for eight queens on an 8x8 chess board so that no two queens share the same row, column, or diagonal. In this example, "diagonal" refers to all diagonals, not simply the two that cut the board in half.
Write an algorithm that asks the user to enter a positive integer n and prints the sum of the divisors of n.
Here is my question that my professor gave to me as a homework from my algorithm's class. Use asymptotic notations to describe the running times of the nested loops below. You may assume that n is a power of 2. i =1 while i <= n j =i while j >= 1 <body of the inner while loop> // Needs Θ(1) time. j =j / 2 i= i * 2