137. In mathematics, a perfect number is a type of integer. The procedure IsPerfect (num) returns true if num is a perfect number and returns false otherwise. The following program is intended to count and display the number of perfect numbers between the integers start and end, inclusive. Assume that start is less than end. The program does not work as intended. Line 1: currentNum + start Line 2: count e0 Line 3: REPEAT UNTIL (currentNum > end) Line 4: Line 5: count + count + 1 Line 6: IF (IsPerfect (currentNum)) Line 7: Line 8: count + count + 1 Line 9: currentNum e currentNum + 1 Line 10: Line 11: currentNum + currentNum Line 12: Line 13: DISPLAY (count) Which two lines of code should be removed so that the program will work as intended? Select two answers. (A) Line 5 (B) Line 8 (C) Line 9 (D) Line 11

137. In mathematics, a perfect number is a type of integer. The procedure IsPerfect (num) returns true if num is a perfect number and returns false otherwise. The following program is intended to count and display the number of perfect numbers between the integers start and end, inclusive. Assume that start is less than end. The program does not work as intended. Line 1: currentNum + start Line 2: count e0 Line 3: REPEAT UNTIL (currentNum > end) Line 4: Line 5: count + count + 1 Line 6: IF (IsPerfect (currentNum)) Line 7: Line 8: count + count + 1 Line 9: currentNum e currentNum + 1 Line 10: Line 11: currentNum + currentNum Line 12: Line 13: DISPLAY (count) Which two lines of code should be removed so that the program will work as intended? Select two answers. (A) Line 5 (B) Line 8 (C) Line 9 (D) Line 11

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

Consider printing neatly the silly text “This week has seven datesin it ok” in a column with width M = 11. This is represented as the printing neatlyinstance M;l1, ... , ln=11; 4, 4, 3, 5, 5, 2, 2, 2. (a) Fill in the birdAdvice[0..n] andcost[0..n] tables for this example. The original instance, its solution, and its cost arein the bottom row. (b) When filling in this last row, give solutions and costs associatedwith each of the possible bird answers
Rohan, the bookworm plans on reading 8 books by next week. But he only reads novels,poetry, short stories or science fiction. Interestingly he says, "My love for novels is twicethe love for the rest altogether ". He also claims, "Love for short stories = 3 x Love forscience fiction = 3 x Love for poetry". Taking these into account, determine theprobability that he reads 4 novels, 3 poetry and 1 short story or science fiction?
Player Team W L ERA SO/IP HR/IP R/IP Verlander, J DET 24 5 2.40 1.00 0.10 0.29 Beckett, J BOS 13 7 2.88 0.91 0.11 0.33 Wilson, C TEX 16 7 2.93 0.92 0.07 0.39 Sabathia, C NYY 19 8 2.99 0.96 0.06 0.37 Haren, D LAA 16 10 3.17 0.81 0.07 0.37 McCarthy, B OAK 9 9 3.31 0.71 0.05 0.42 Santana, E LAA 11 12 3.37 0.78 0.10 0.41 Lester, J BOS 15 9 3.46 0.94 0.10 0.39 Hernandez, F SEA 14 14 3.47 0.95 0.07 0.41 Buehrle, M CWS 13 9 3.58 0.52 0.09 0.44 Pineda, M SEA 9 10 3.74 1.00 0.10 0.43 Colon, B NYY 8 10 4.00 0.81 0.12 0.52 Tomlin, J CLE 12 7 4.25 0.54 0.14 0.47 Pavano, C MIN 9 13 4.29 0.46 0.10 0.54 Danks, J CWS 8 12 4.33 0.79 0.11 0.51 Guthrie, J BAL 9 17 4.32 0.62 0.12 0.54 Lewis, C TEX 14 10 4.39 0.83 0.16 0.51 Scherzer, M DET 15 9 4.42 0.89 0.14 0.52 Davis, W TB 11 10 4.44 0.57 0.13 0.51 Porcello, R DET 14 9 4.75 0.56 0.09 0.57 Major League Baseball (MLB) consists of teams that play in the American League and the National League. MLB collects a wide…
Player Team W L ERA SO/IP HR/IP R/IP Verlander, J DET 24 5 2.40 1.00 0.10 0.29 Beckett, J BOS 13 7 2.88 0.91 0.11 0.33 Wilson, C TEX 16 7 2.93 0.92 0.07 0.39 Sabathia, C NYY 19 8 2.99 0.96 0.06 0.37 Haren, D LAA 16 10 3.17 0.81 0.07 0.37 McCarthy, B OAK 9 9 3.31 0.71 0.05 0.42 Santana, E LAA 11 12 3.37 0.78 0.10 0.41 Lester, J BOS 15 9 3.46 0.94 0.10 0.39 Hernandez, F SEA 14 14 3.47 0.95 0.07 0.41 Buehrle, M CWS 13 9 3.58 0.52 0.09 0.44 Pineda, M SEA 9 10 3.74 1.00 0.10 0.43 Colon, B NYY 8 10 4.00 0.81 0.12 0.52 Tomlin, J CLE 12 7 4.25 0.54 0.14 0.47 Pavano, C MIN 9 13 4.29 0.46 0.10 0.54 Danks, J CWS 8 12 4.33 0.79 0.11 0.51 Guthrie, J BAL 9 17 4.32 0.62 0.12 0.54 Lewis, C TEX 14 10 4.39 0.83 0.16 0.51 Scherzer, M DET 15 9 4.42 0.89 0.14 0.52 Davis, W TB 11 10 4.44 0.57 0.13 0.51 Porcello, R DET 14 9 4.75 0.56 0.09 0.57 Due to a recent change by Microsoft you will need to open the XLMiner Analysis ToolPak add-in manually from the home ribbon.…
How can I change my flower colors My code n=800;r=linspace(0,1,n);theta=linspace(0,2*pi,n);[R,THETA]=ndgrid(r,theta);% define the number of petals we want per cycle. Violets have 5!petalNum=5;x = 1 - (1/2)*((5/4)*(1 - mod(petalNum*THETA, 2*pi)/pi).^2 - 1/4).^2;% update the formula for phi to stop the spiralling effectphi = (pi/2)*exp(-2*pi/(8*pi));y = 1.95653*(R.^2).*(1.27689*R - 1).^2.*sin(phi);R2 = x.*(R.*sin(phi) + y.*cos(phi));X=R2.*sin(THETA);Y=R2.*cos(THETA);Z=x.*(R.*cos(phi)-y.*sin(phi));% color code for blueviolet RGB 138,43,226% Indigo rgb value (75,0,130)mapSize=20;blue_map=linspace(138,75,mapSize)';blue_map(:,2)=linspace(43,0,mapSize)';blue_map(:,3)=linspace(226,130,mapSize)';% and a pretty bit in the middlegold_map=[255 215 0; 250 210 0];% combine to form a full flower mapviolet_map=[gold_map; blue_map];% Now lets plot it and try and pick an attractive anglesurf(X,Y,Z,'LineStyle','none')colormap(violet_map/255)view([-12.700 81.200])
dont post existing oen sure strict compiant skip if odnt know
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.
dont answer without knwoledge answer only 100% sure
Q1. Prove by definition f(n)=O(g(n)). Example T(n)=5n^3+100logn is O(n^5) please explain in detail and clearly i dont understand big o properly so i need extra clarifcation and please label the each step and explain each step
a. Develop a Caesar cipher-type encryption algorithm with a little more complexity in it. For example, the algorithm could alternatively shift the cleartext letters positive and negative by the amount of the key value. Variations on this are limitless. b. Select a single-digit key. c. Code a short message using the algorithm and key. d. Give your instructor the algorithm, key, cleartext, and ciphertext. e. Optional: Your instructor will randomly redistribute to the class the ciphertext messages completed in part d above. You are to decode the message you receive as an additional assignment.
PLEASE ANSWER THEM. JUST GIVE THE OPTIONS! 1- Consider the following sets consisting of only two kinds of items. Choose the item with the highest entropy: Select one a) aaaaaaab , b) aaaabbbb , c) aab , d) abaaaaab, e) aaaaaaaa 2- Consider an association rule eypressed as follows: {Bagels, ...) -> (Potato Chips) Choose all which is true for this rule: select one or more. Bagels is the antecedent Bagels is the consequent The rule indicates that people who buy bagels would like to buy potato chips afterwards Potato chips is the consequent The rule indicates that people who buy potato chips would like to buy bagels afterwards 3- Choose all of the following which is true about "support of association rules Select one or more is defined as support(A -> B) = P(A U B) For practical reasons one must favor rules with support value less than a threshold Measures now commonly seen are the events in the rule Support is a measure of the strenght of the rule A treshold for support is…
Computer Science Please finish the template that i provide. #includeclass Nurikabe{public:/*n is the size of the Nurikabe, n >= 5, n <= 20game is the result from some playerhere is one examplen: 5game = { {'W', 'W', 'W', '1', 'W'},{'W', '.', 'W', 'W', 'W'},{'W', '2', 'W', '.', '3'},{'3', 'W', 'W', '.', 'W'},{'.', '.', 'W', 'W', 'W'} };W represent wall*/Nurikabe(char game[20][20], int n){}/*return 1 if result fit the rule.return 0 if result not fit the rule.*/int isCorrect(){}private://請設計你自己的資料結構來儲存遊戲的結果//Please design your own data structure to keet the result};int main() {int n, j, l, k;char game[20][20] = { {'W', 'W', 'W', '1', 'W'},{'W', '.', 'W', 'W', 'W'},{'W', '2', 'W', '.', '3'},{'3', 'W', 'W', '.', 'W'},{'.', '.', 'W', 'W', 'W'} };std::cin>>n;for(j = 0;j < n;j ++)for(k = 0;k < n;k ++)std::cin>>game[j][k];Nurikabe *a = new Nurikabe(game, n);std::cout<iscorrect();return 0;}