Consider the following algorithm 1. count - 02. k n3. while k>14.5.6.7.8. end whilefor j - k to ncount - count +1end fork - k/2a) How many times step 5 is executed? (You must show your steps)b) What is the time complexity of the algorithm in 0-notation?

1. count 2. k n ← - 0 3. while k>1 4. 5. 6. 7. 8. end while for j k to n ← count end for k- k/2 - count +1 ← a) How many times step 5 is executed? (You must show your steps) b) What is the time complexity of the algorithm in O-notation?

1. count 2. k n ← - 0 3. while k>1 4. 5. 6. 7. 8. end while for j k to n ← count end for k- k/2 - count +1 ← a) How many times step 5 is executed? (You must show your steps) b) What is the time complexity of the algorithm in O-notation?

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

9. Voting Suppose that the votes of n people for different candidates (where there can be more than two candidates) for a particular office are the elements of a sequence. A person wins the election if this person receives a majority of the votes. * Devise a divide-and-conquer algorithm that determines whether the two candidates who received the most votes each received at least n/4 votes and, if so, determine who these two candidates are. (NOTE: Please elaborate and explain briefly and please do not provide or copy answer from the internet or from chegg.)
Recursion Practice Welcome back! In this lab, we will be reviewing recursion by practicing with some basic recursion problems. Objectives Increase familiarity with recursive logic by working through several recursive problems. Taking into consideration a few corner cases through analyzing the test cases. Using a regex expression that will remove punctuation. Getting Started This lab includes the following .java file: L4/└── Recursion.java└── Main.java**Main.java is a read-only file used for testing. It is not included in the starter jar.Here is the starter jar if you would like to code in a different environment: L4.jar. Please complete ALL functions. Make sure to read the description for each function carefully. Do not include any for or while loops in your methods. These can all be completed in a purely recursive style, so do it recursively! In the spirit of incremental development, implement each method one at a time, look at the test cases and take into consideration what is…
4. Remove the left recursion from the following production rule to obtain a new rule: A = A '0' | '1' | A '2' | '3' | A '4' | '5'
*Data Structures
NOTE: The algorithm should be written in pseudo code, (explanation of the algorithm rather than code)
Q2-Consider the following code fragment. i-m-1; j=n; v=a[n]; while (true) { do i=i+1; while( a[i] v); i(i >= j) break; x=a[i]; a[i]=a[j]; a[j]=x; } x=a[i]; a[i] = a[n]; a[n] =x; a) Translate the above code into three address statements: b) Construct a control flow graph of the three address statements generated in part a)
Computer Science Engineering:
4 No three in a row You are given n balls arranged in a row. Each ball i has a value v;. Give a polynomial time algorithm to pick a maxi- mum value subset S of the balls so that no three consecutive balls are in S. For example, say the ball values are 2 2 3 2 2 then, the maximum value subset has the first, second, fourth and the fifth ball, and their total value is 2+2+ 2+2 = 8. For this problem, you also need to write a proof of correctness of the recurrence.
- Do not add any imports, the ones that you need will be given to you.- Do not use recursion.- Do not use break/continue.- Do not use try-except statements, you should be able to anticipateor prevent any errors from happening at all!
f) (10 points) Assume that void some_fct2 (int N, int k); has time complexity (N²) for (k 1; k <= M; k++) { some_fct2(k,N); // = } Final answer: TCfor-k = O(_
Remaining Time: 17 minutes, 57 seconds. * Question Completion Status: O [0, N, M, AJ [0, M, A] QUESTION 2 What is the running-time in Big-Oh notation of the following chunk of code? for (int i-l;i<=n;i++) { for (j=1;j<=i;j++) System.out.println(i," ",j); O O(n log n) O O(n) O O(1) O O(n?) QUESTION 3 BOoudo code given below?
2, Towers of Hanoi Problem. (10 points) The Towers of Hanoi is a famous problem for studying recursion in computer science and searching in artificial intelligence. We start with N discs of varying sizes on a peg (stacked in order according to size), and two empty pegs. We are allowed to move a disc from one peg to another, but we are never allowed to move a larger disc on top of a smaller disc. The goal is to move all the discs to the rightmost peg (see figure). To solve the problem by using search methods, we need first formulate the problem. Supposing there are K pegs and N disk. Answer the following questions. (1) Determine a state representation for this problem. (4points) (2) What is the size of the state space? (3 points) (3) Supposing K=3, N=4, what is the start state by using your proposed state representation method and what is the goal state? (3 points)