dont dont dont answer if not 100% sure skip if dont know else strict action 1. In each row, four items are given: function to which runtime is proportional, original input size, originalruntime, new input size. You'll fill in the expected new runtime. Refer to Runtime Rules of Thumb tofigure out the answers.RuntimeOriginalproportional to input size1,00020lognnlognn³n²n²√nn√nn12n!n"41,000,00043,000,000 43,000,00010002012,0001,000100100OriginalRuntimein ms410044444444New Input Size New Runtime in ms1,000,0004002,000,0009,000,0006,000,000400018036,0001,000,000101101101

Answered: runtime, new input size. You'll fill in…

runtime, new input size. You'll fill in the expected new run figure out the answers. Runtime Original proportional to input size logn 1,000 Original Runtime in ms 4 New Input Size 1,000,000

Microsoft Visual C#

7th Edition

ISBN:9781337102100

Author:Joyce, Farrell.

Publisher:Joyce, Farrell.

Chapter5: Looping

Section: Chapter Questions

Problem 14E: In Chapter 4, you created a program that generates a random number, allows a user to guess it, and...

See similar textbooks

Similar questions

Please run this on linux, compile and look at the placement for row "Tangent". Match the numbers below tangent and make sure all the other row numbers are lining up with the other headings main.c #include <stdio.h>#include <math.h> #define M_PI 3.14159265358979323846 /** * Given a incrementVal value, this function will print a table of trigonometric values * from 0 to 360, in increments of the incrementVal value. * For example, if the incrementVal value is 90, the table will print values for 0, 90, 180, 270 and 360. * incrementVal - the degree value to use for the increment*/void displayTriTab(int incrementVal) { //Display the header for the table printf("\n\t--- TRIGONOMETRIC TABLE ---\n\n"); // Display the column headings for the table printf("%3s%10s%10s%10s%10s\n", "Degrees", "Radians", "sine", "cosine", "tangent"); printf("%3s%10s%10s%10s%10s\n", "-------", "-------", "------", "-------", "-------"); //Declare variables for radians, sine cosine,…
Transcribed Image Text - How many will the program write to the screen as a result of the following code? printf ("% d", (7-5) * 6-3 / 6); -Write the results of the functions below in the boxes next to them? log (abs (exp (1)) = sqrt (121) pow (4.3) = log10 (1000000) fmod (97.4) = fabs (-15.4) = sin (M_PI / 6) = cos (M_PI / 3) = 1/ tan (M_PI / 8) = floor (-11.8) = ceil (95.2)
You will have an orthogonal triangle input from a file and you need to find the maximum sum of the numbers according to given rules below; 1. You will start from the top and move downwards to an adjacent number as in below. 2. You are only allowed to walk downwards and diagonally. 3. You can only walk over NON PRIME NUMBERS. 4. You have to reach at the end of the pyramid as much as possible. 5. You have to treat your input as pyramid. According to above rules the maximum sum of the numbers from top to bottom in below example is 24. *1 *8 4 2 *6 9 8 5 *9 3 As you can see this has several paths that fits the rule of NOT PRIME NUMBERS; 1>8>6>9, 1>4>6>9, 1>4>9>9 1 + 8 + 6 + 9 = 24. As you see 1, 8, 6, 9 are all NOT PRIME NUMBERS and walking over these yields the maximum sum. According to RULES that you implemented what is the maximum sum of below input? It means please take this input (as file or constants directly inside the code) for your implementation and…
You will have an orthogonal triangle input from a file and you need to find the maximum sum of the numbers according to given rules below; 1. You will start from the top and move downwards to an adjacent number as in below. 2. You are only allowed to walk downwards and diagonally. 3. You can only walk over NON PRIME NUMBERS. 4. You have to reach at the end of the pyramid as much as possible. 5. You have to treat your input as pyramid. According to above rules the maximum sum of the numbers from top to bottom in below example is 24. *1 *8 4 2 *6 9 8 5 *9 3 As you can see this has several paths that fits the rule of NOT PRIME NUMBERS; 1>8>6>9, 1>4>6>9, 1>4>9>9 1 + 8 + 6 + 9 = 24. As you see 1, 8, 6, 9 are all NOT PRIME NUMBERS and walking over these yields the maximum sum. According to rules what is the maximum sum of below input? It means please take this input (as file or constants directly inside the code) for your implementation and solve by using it.…
You will have an orthogonal triangle input from a file and you need to find the maximum sum of the numbers according to given rules below; 1. You will start from the top and move downwards to an adjacent number as in below. 2. You are only allowed to walk downwards and diagonally. 3. You can only walk over NON PRIME NUMBERS. 4. You have to reach at the end of the pyramid as much as possible. 5. You have to treat your input as pyramid. According to above rules the maximum sum of the numbers from top to bottom in below example is 24. *1 *8 4 2 *6 9 8 5 *9 3 As you can see this has several paths that fits the rule of NOT PRIME NUMBERS; 1>8>6>9, 1>4>6>9, 1>4>9>9 1 + 8 + 6 + 9 = 24. As you see 1, 8, 6, 9 are all NOT PRIME NUMBERS and walking over these yields the maximum sum. Write code for below problem in C language
You will have an orthogonal triangle input from a file and you need to find the maximum sum of the numbers according to given rules below; 1. You will start from the top and move downwards to an adjacent number as in below. 2. You are only allowed to walk downwards and diagonally. 3. You can only walk over NON PRIME NUMBERS. 4. You have to reach at the end of the pyramid as much as possible. 5. You have to treat your input as pyramid. According to above rules the maximum sum of the numbers from top to bottom in below example is 24. *1 *8 4 2 *6 9 8 5 *9 3 As you can see this has several paths that fits the rule of NOT PRIME NUMBERS; 1>8>6>9, 1>4>6>9, 1>4>9>9 1 + 8 + 6 + 9 = 24. As you see 1, 8, 6, 9 are all NOT PRIME NUMBERS and walking over these yields the maximum sum. According to rules that you implemented what is the maximum sum of below input? It means please take this input (as file or constants directly inside the code) for your implementation and…
Create and build a software that plays the Hi-Lo guessing game with numbers. The software should pick a number at random between 1 and 100 (inclusive) and then ask the user to estimate it again. For each guess, inform the user if their estimate was right, high, or low. Accept guesses until the user decides to quit or makes the correct guess. Use a sentinel value to determine whether the user wishes to exit. When the user correctly guesses, count the number of guesses and give the total. When each game is completed (by leaving or a correct guess), ask the user whether they want to play again. Play video games till the user decides to discontinue.
(Please disregard my first similar question. This is the ammended version. Thanks) Hello. Please look at the following code. When I run it from the command line, I am supposed to get the following results: 1: I am 1: I am I need to add a mutex lock to it so that the functions 'print_i' and 'print_j' print all of their lines. Any ideas? Thank you. C source code: #include <stdio.h>#include <stdlib.h>#include <string.h>#include <pthread.h>#include <unistd.h> // These two functions will run concurrentlyvoid* print_i(void *ptr) { printf("1: I am \n");sleep(1);printf("in i\n");} void* print_j(void *ptr) {printf("2: I am \n");sleep(1);printf("in j\n");} int main() { pthread_t t1,t2;int rc1 = pthread_create(&t1, NULL, print_i, NULL);int rc2 = pthread_create(&t2, NULL, print_j, NULL); exit(0);}
(1) Prompt the user to enter two words and a number, storing each into separate variables. Then, output those three values on a single line separated by a space. Ex: If the input is: yellow, Daisy, 6 Output: You entered: yellow Daisy 6 (2) Output two passwords using a combination of the user input. Format the passwords as shown below. Ex: If the input is: yellow, Daisy, 6 Output: You entered: yellow Daisy 6 First password: yellow_Daisy Second password: 6yellow6 (3) Output the length of each password (the number of characters in the strings). Ex: If the input is: yellow, Daisy, 6 Output: You entered: yellow Daisy 6 First password: yellow_Daisy Second password: 6yellow6 Number of characters in yellow_Daisy: 12 Number of characters in 6yellow6: 8
Given list below: myNums = [-2, 28, 4, -2, 36, 2] Using the built-in functions, print the smallest value and the largest value in the list, myNums. Just make sure to precisely match the output format below.Write your code in the ANSWER area provided below (must include comments if using code is not covered in the course). Example OutputSmallest = -2Largest = 36
I need "comments" fo this whole code, for my better understanding. comment for every line. also i want this code to be separated in .cpp and. hpp files. thank you #include <iostream>#include <conio.h>#include <windows.h>#include <dos.h>#include <time.h>#include <graphics.h> #define MAXSNAKESIZE 100#define MAXFRAMEX 119#define MAXFRAMEY 29 using namespace std; HANDLE console = GetStdHandle(STD_OUTPUT_HANDLE);COORD CursorPosition; void gotoxy(int x, int y){CursorPosition.X = x;CursorPosition.Y = y;SetConsoleCursorPosition(console, CursorPosition);}void setcursor(bool visible, DWORD size) // set bool visible = 0 - invisible, bool visible = 1 - visible{if(size == 0){size = 20; // default cursor size Changing to numbers from 1 to 20, decreases cursor width}CONSOLE_CURSOR_INFO lpCursor;lpCursor.bVisible = visible;lpCursor.dwSize = size;SetConsoleCursorInfo(console,&lpCursor);} class Point{private:int x;int y;public:Point(){x = y = 10;}Point(int x,…
1)Write a shell scriptthat calculate electricity bill.The rates of electricity per unit are as follows: Consume-units>=300 then cost is Rs. 2 per unit Consume-units>300 and <=500 then cost is Rs. 5 per unit Consume-units>500 then cost is Rs. 7 per unit. 2)write a shell script that inputs Salary and Grade. It adds 50% bonus if the gradeis greater than 15. It adds 25% bonus if the grade is 15 or less and then display the total salary. 3)write a shell script that inputs three number and display the maximum number.E