State True or false, for each of the following statements, and briefly explain why no points will be given even for a correct solution if no justification is presented. 1. For all asymptotically positive f(n).f(n) + 0(f(n)) = 8 (f(n)) 2. The worst-case running time and expected running time are equal to within constant factors for any randomized algorithm. 3. There exists a data structure to maintain a dynamic set with operations Insert (x,S), Delete(x,S). and member? (x,S) that has an expected running time of O(1) per operation. 4. Let A₁, A₂ and A3 be three sorted arrays of n-real numbers (all distinct). In the comparison model constructing a balanced binary search tree of the set A₁ U A2 U A3 requires (nlogn) time. 5. If dynamic programming problem satisfies the optimal-substructure property, then a locally optimal solution is globally optimal.

State True or false, for each of the following statements, and briefly explain why no points will be given even for a correct solution if no justification is presented. 1. For all asymptotically positive f(n).f(n) + 0(f(n)) = 8 (f(n)) 2. The worst-case running time and expected running time are equal to within constant factors for any randomized algorithm. 3. There exists a data structure to maintain a dynamic set with operations Insert (x,S), Delete(x,S). and member? (x,S) that has an expected running time of O(1) per operation. 4. Let A₁, A₂ and A3 be three sorted arrays of n-real numbers (all distinct). In the comparison model constructing a balanced binary search tree of the set A₁ U A2 U A3 requires (nlogn) time. 5. If dynamic programming problem satisfies the optimal-substructure property, then a locally optimal solution is globally optimal.

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

Particle filters are a good way of keeping track of a set of hypotheses when performing SLAM. With regards to the FastSLAM algorithm discussed in the video, select all the true statements in the following set. Select one or more: ✔a. Each particle must keep a hypothesis of the noise in the motion model * ✓b. Each particle must keep a hypothesis of the robot's observations* ✓c. Each particle must keep a hypothesis of the position of the robot d. Particles do not keep a hypothesis of the variance in landmark positions e. Particles do not keep a hypothesis of the robot's sensor model ✔f. Each particle must keep a hypothesis of the positions of landmarks g. Particles do not keep a hypothesis of the variance in the robot's positon ✔h. Each particle must keep a hypothesis of the path followed by the robot* Your answer is incorrect. The correct answers are: Each particle must keep a hypothesis of the position of the robot, Each particle must keep a hypothesis of the positions of landmarks,…
You are given a N*N maze with a rat placed at maze[0][0]. Find whether any path exist that rat can follow to reach its destination i.e. maze[N-1][N-1]. Rat can move in any direction ( left, right, up and down).Value of every cell in the maze can either be 0 or 1. Cells with value 0 are blocked means rat cannot enter into those cells and those with value 1 are open.Input FormatLine 1: Integer NNext N Lines: Each line will contain ith row elements (separated by space)Output Format :The output line contains true if any path exists for the rat to reach its destination otherwise print false.Sample Input 1 :31 0 11 0 11 1 1Sample Output 1 :trueSample Input 2 :31 0 11 0 10 1 1Sample Output 2 : false Solution: //// public class Solution { public static boolean ratInAMaze(int maze[][]){ int n = maze.length; int path[][] = new int[n][n]; return solveMaze(maze, 0, 0, path); } public static boolean solveMaze(int[][] maze, int i, int j, int[][] path) {//…
Correct answer will be upvoted else Multiple Downvoted. Don't submit random answer. Computer science. You are given a variety of n integers a1, a2, ..., an, and a set b of k unmistakable integers from 1 to n. In one activity, you might pick two integers I and x (1≤i≤n, x can be any integer) and allocate ai:=x. This activity should be possible provided that I doesn't have a place with the set b. Compute the base number of tasks you ought to perform so the cluster an is expanding (that is, a1<a2<a3<⋯<an), or report that it is inconceivable. Input The principal line contains two integers n and k (1≤n≤5⋅105, 0≤k≤n) — the size of the exhibit an and the set b, individually. The subsequent line contains n integers a1, a2, ..., an (1≤ai≤109). Then, at that point, if k≠0, the third line follows, containing k integers b1, b2, ..., bk (1≤b1<b2<⋯<bk≤n). On the off chance that k=0, this line is skipped. Output In case it is difficult to make the exhibit…
Running Time Analysis: Give the tightest possible upper bound for the worst case running time for each of the following in terms of N. You MUST choose your answer from the following (not given in any particular order), each of which could be reused (could be the answer for more than one of a) – f)): O(N2), O(N3 log N), O(N log N), O(N), O(N2 log N), O(N5), O(2N), O(N3), O(log N), O(1), O(N4), O(NN), O(N6)
Simulated annealing is an extension of hill climbing, which uses randomness to avoid getting stuck in local maxima and plateaux. a) As defined in your textbook, simulated annealing returns the current state when the end of the annealing schedule is reached and if the annealing schedule is slow enough. Given that we know the value (measure of goodness) of each state we visit, is there anything smarter we could do? (b) Simulated annealing requires a very small amount of memory, just enough to store two states: the current state and the proposed next state. Suppose we had enough memory to hold two million states. Propose a modification to simulated annealing that makes productive use of the additional memory. In particular, suggest something that will likely perform better than just running simulated annealing a million times consecutively with random restarts. [Note: There are multiple correct answers here.] (c) Gradient ascent search is prone to local optima just like hill climbing.…
Imagine there are N teams competing in a tournament, and that each team plays each of the other teams once. If a tournament were to take place, it should be demonstrated (using an example) that every team would lose to at least one other team in the tournament.
Imagine a collection of nuts and bolts that are all together in one pile on a table. Describe, in pseudocode, how you would find all matching pairs of nuts and bolts. You need to find one solution for each of the problem-solving approaches given below. For each of your solution, determine how many comparisons of pairs of nuts and bolts you might have to make in the best- and worst- case scenario. You can assume that there are complete pairs, no single nuts or bolts, and that for each bolt, there is exactly one nut that fits. Describe a solution to the nuts and bolts problem (in pseudocode) using a Divide and Conquer Approach.
A certain cat shelter has devised a novel way of making prospective adopters choose their new pet. To remove pet owners’ biases regarding breed, age, or looks, they are led blindfolded into a room containing all the cats up for adoption and must bring home whichever they pick up. Suppose you are trying to adopt two cats, and the shelter contains a total of N cats in one of only two colors: black or orange. is it still possible to pick up two black cats with probability ½, given that there is an even number of orange cats in the room? If so, how many cats should be in the room? How many black, how many orange?
Correct answer will be upvoted else Multiple Downvoted. Don't submit random answer. Computer science. You have a knapsack with the limit of W. There are likewise n things, the I-th one has weight wi. You need to place a portion of these things into the knapsack so that their all out weight C is half of its size, however (clearly) doesn't surpass it. Officially, C ought to fulfill: ⌈W2⌉≤C≤W. Output the rundown of things you will place into the knapsack or establish that satisfying the conditions is unimaginable. In case there are a few potential arrangements of things fulfilling the conditions, you can output any. Note that you don't need to expand the amount of loads of things in the knapsack. Input Each test contains various experiments. The principal line contains the number of experiments t (1≤t≤104). Depiction of the experiments follows. The main line of each experiment contains integers n and W (1≤n≤200000, 1≤W≤1018). The second line of each experiment…
Correct answer will be upvoted else downvoted. Computer science. Positive integer x is called divisor of positive integer y, in case y is distinguishable by x without remaining portion. For instance, 1 is a divisor of 7 and 3 isn't divisor of 8. We gave you an integer d and requested that you track down the littlest positive integer a, to such an extent that a has no less than 4 divisors; contrast between any two divisors of an is essentially d. Input The primary line contains a solitary integer t (1≤t≤3000) — the number of experiments. The primary line of each experiment contains a solitary integer d (1≤d≤10000). Output For each experiment print one integer a — the response for this experiment.
Implement an algorithmic solution, indicating which states are valid and which are not, and model the space of the following problem: An interest group from a small town decided to sue a company for commercial abuse. For this, the people have organized themselves and decided to send 3 representatives, who will have to travel in a Van to the city where the lawsuit will be filed. The company to be sued, upon learning of these actions, has decided to send 3 lawyers to persuade the representatives, who will also travel in the same Van for that purpose. The community must file the class action suit under these conditions: - The three applicants must reach the destination city; - Only two people can travel per trip in the Van (small town - city, city - small town); - There can never be more lawyers than plaintiffs in any one place (either in the small town or city) because the lawyers can persuade the plaintiffs and as a consequence, the lawsuit would not be made; - The Van cannot be…
Correct answer will be upvoted else downvoted. Computer science. positive integer is the gcd of that integer with its amount of digits. Officially, gcdSum(x)=gcd(x, amount of digits of x) for a positive integer x. gcd(a,b) means the best normal divisor of an and b — the biggest integer d to such an extent that the two integers an and b are detachable by d. For instance: gcdSum(762)=gcd(762,7+6+2)=gcd(762,15)=3. Given an integer n, track down the littlest integer x≥n to such an extent that gcdSum(x)>1. Input The primary line of input contains one integer t (1≤t≤104) — the number of experiments. Then, at that point, t lines follow, each containing a solitary integer n (1≤n≤1018). All experiments in a single test are unique. Output Output t lines, where the I-th line is a solitary integer containing the response to the I-th experiment.