Consider the following loop construct: X = 1 repeat Y = N while Y> 0 do Y = Y - 1 endwhile wwwwwwwwwwmmmmm X = X + X until X > N * N // something (the ellipsis) Categorize its Big-0 efficiency. Also, assume that the statements represented by the ellipsis take 2 milliseconds to execute. Express in milliseconds the amount of time to execute this construct for N = 1000.

Consider the following loop construct: X = 1 repeat Y = N while Y> 0 do Y = Y - 1 endwhile wwwwwwwwwwmmmmm X = X + X until X > N * N // something (the ellipsis) Categorize its Big-0 efficiency. Also, assume that the statements represented by the ellipsis take 2 milliseconds to execute. Express in milliseconds the amount of time to execute this construct for N = 1000.

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

The language must be in python. Just do numbers 5-7 Neural Network Units Implement a single sigmoid neural network unit with weights of [-1.2, -1.1, 3.3, -2.1] Calculate the outputs for two training examples:Example 1: [0.9, 10.0, 3.1, 1]Example 2: [0.9, 2.1, 3.7, 1] Note that you don't have to explicitly include a threshold or bias since the examples include a last element of 1 which means that the last weight effectively operates as a threshold. Assuming that a sigmoid unit response >0.5 denotes a positive class and <0.5 is negative class, is example 1 positive or negative? is example 2 positive or negative? Create a single ReLU unit and provide the outputs for those examples. Calculate the derivative of the sigmoid with respect to net input for both examples Calculate the derivative of the ReLU with respect to net input for both examples
The language for coding must be in python Neural Network Units Implement a single sigmoid neural network unit with weights of [-1.2, -1.1, 3.3, -2.1] Calculate the outputs for two training examples:Example 1: [0.9, 10.0, 3.1, 1]Example 2: [0.9, 2.1, 3.7, 1] Note that you don't have to explicitly include a threshold or bias since the examples include a last element of 1 which means that the last weight effectively operates as a threshold. Assuming that a sigmoid unit response >0.5 denotes a positive class and <0.5 is negative class, is example 1 positive or negative? is example 2 positive or negative? Create a single ReLU unit and provide the outputs for those examples. Calculate the derivative of the sigmoid with respect to net input for both examples Calculate the derivative of the ReLU with respect to net input for both examples
Java task Based on PercolationProbability.java (provided below), write a program that uses both versions of percolation (provided below) and compute the probability that a system percolates, but does not percolate directed downward, you need N and p from the command line. PercolationProbability: https://introcs.cs.princeton.edu/java/24percolation/PercolationProbability.java percolation: https://introcs.cs.princeton.edu/java/24percolation/Percolation.java
Write the Recurrent Neural Networks in Python for a csv file with product reviews. Ensure that the code is commented line by line. Use existing libraries to output the name of the algorithm, the accuracy precision, recall, F1 score, confusion matrix, means square error, train test split, and class report.
Assume that you were given N cents (N is an integer) and you were asked to break up the N cents into coins consisting of 1 cent, 2 cents and 5 cents. Write a dynamicprogramming based recursive algorithm, which returns the smallest (optimal) number of coins needed to solve this problem. For example, if your algorithm is called A, and N = 13, then A(N) = A(13) returns 4, since 5+5+2+1 = 13 used the smallest (optimal) number of coins. In contrast, 5+5+1+1+1 is not an optimal answer.
Your task is to implement Depth-first search algorithm to solve the problem of placing 8 Queens on a chess board so none can “take” each other.• A code framework, supporting videos and html documentation of the provided code-base will be provided via Moodle in assignments section.• The implementation should accept one command-line argument at the time it is invoked for the starting position of the first queen.o It will be tested with a range of values for that input.o If the input is not an integer in the range of 0-7 it should report “Invalid Input” and exit. • You will be supplied with a partially completed file ‘main.c’ which contains the code need to read the command line and sets up the initial working candidate within the code framework.o Your task is to complete the code to implement depth-first search. o Your code must finish with a call to the function PrintFinalSolutionAndExit(); when a valid final solution stored in the variable “workingCandidate”. please solve full…
Suppose that you want to implement an algorithm that will compete on a two-player deterministic game of perfect information. Your opponent is a supercomputer called DeepGreen. DeepGreen does not use Minimax. You are given a library function DeepGreenMove(S), that takes any state S as an argument, and returns the move that DeepGreen will choose for that state S (more precisely, DeepGreenMove (S) returns the state resulting from the opponent's move). Write an algorithm in pseudocode (following the style of the Minimax pseudocode) that will always make an optimal decision given the knowledge we have about DeepGreen. You are free to use the library function DeepGreenMove(S) in your pseudocode. What advantage would this algorithm have over Minimax? (if none, Justify).
In the famous dining philosophers problem, a bunch of philosophers aresitting around a circular table with one chopstick between each of them. A philosopher needsboth chopsticks to eat, and always picks up the left chopstick before the right one. A deadlockcould potentially occur if all the philosophers reached for the left chopstick at the same time. Usingthreads and locks, implement a simulation of the dining philosophers problem that prevents deadlocks.
Make a java program that facilitates addition, subtraction, multiplication, and division of mixed numbers but this time all of the inputs /outputs may involve fractions, mixed fractions, or a combination. PLEASE HELP ME BUILD THE FractionTester Class Points to consider: MixedFraction class must override the operations (add, subtract, multiplyBy, divideBy) inherited from Fraction class to have a different implementation if the MixedFraction object will have a Fraction object as parameter in performing the required operation, On top of that, the inherited operations must also be overloaded to allow a MixedFraction object to accept other parameters such as a whole number or another MixedFraction object. The toString method which is inherited must also be overridden by MixedFraction to have a more appropriate return value. Further formatting must also be considered such that if the result of the operation has a zero value for the whole part, the output should only show the fractional part…
Consider an undirected graph G = (V,E), in which each node u 2 V may be colored with some color between 1 and C. Your task is to write a program that determine the colors for the uncolored nodes in the graph such that • For all edges (u, v) 2 E, u and v have different colors. • The number of additional colors needed is minimum. Input (Standard input): Includes multiples lines. The first line contains two integers 1 n 1000, 1 m 100000 that correspond to the number of nodes and edges, respectively. Each of the following m lines contain two integers u and v, separated by one space, to denote an edge from u to v. Nodes are numbered from 1 to n. The last line contains n integers that are the colors of the nodes. Uncolored nodes are indicated with color 0. Output (Standard output): The first line contains an integer 0 D n that is the number of additional colors needed to color all the uncolored nodes in the graph. The next line contains n positive integers that are colors of the nodes. Your…
Write a pseudocode and draw a timeline diagram for the sliding window algorithm with SWA = RWS = 4 and SWS = 3 and RWS = 1 frames in the following two situations. Assume the receiver sends a duplicate acknowledgment if it does not receive the expected frame. For example, it sends DUPACK[2] when it expects to see Frame[2) but receives Frame[3] instead. Also, the receiver sends a cumulative acknowledgment after it receives all the outstanding frames. For example, it sends ACK (5) when it receives the lost frame Frame(2) after it already received Frame(3), Frame(4), and Frame[5]. Show the start timer and stop timer wherever necessary. Use a timeout interval of about 2 x RTT.
Construct a memoized algorithm for this algorithm and and derive its time complexity: Assume that you were given N cents (N is an integer) and you were asked to break up the N cents into coins consisting of 1 cent, 2 cents and 5 cents. Write a dynamicprogramming based recursive algorithm, which returns the smallest (optimal) number of coins needed to solve this problem. For example, if your algorithm is called A, and N = 13, then A(N) = A(13) returns 4, since 5+5+2+1 = 13 used the smallest (optimal) number of coins. In contrast, 5+5+1+1+1 is not an optimal answer. You do not need to prove the complexity bound formally, just derive it by analyzing each component in your algorithm.