BY USING PYTHON You will have an orthogonal triangle input from a file and you need to find the maximum sum of thenumbers according to given rules below; 1. You will start from the top and move downwards to anadjacent number as in below. 2. You are only allowed to walk downwards and diagonally. 3. You canonly walk over NON PRIME NUMBERS. 4. You have to reach at the end of the pyramid as much aspossible. 5. You have to treat the input as pyramid.215193 124117 237 442218 935 347 235320 804 522 417 345229 601 723 835 133 124248 202 277 433 207 263 257359 464 504 528 516 716 871 182461 441 426 656 863 560 380 171 923381 348 573 533 447 632 387 176 975 449223 711 445 645 245 543 931 532 937 541 444330 131 333 928 377 733 017 778 839 168 197 197131 171 522 137 217 224 291 413 528 520 227 229 928223 626 034 683 839 053 627 310 713 999 629 817 410 121924 622 911 233 325 139 721 218 253 223 107 233 230 124 2331. 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 the input as pyramid.By using these numbers and rules, find the maximum sum and numbers which you use.

Code : #function to check number is prime or nor def isPrime(num): flag = True if num > 1:…

sum of the will have an orthogonal triangle input from a file and you need to find the max 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 the input as pyramid. 215 193 124 117 237 442 218 935 347 235 320 804 522 417 345

sum of the will have an orthogonal triangle input from a file and you need to find the max 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 the input as pyramid. 215 193 124 117 237 442 218 935 347 235 320 804 522 417 345

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

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…
Three employees in a company are up for a special pay increase. You are given a file, say Ch3_Ex5Data.txt, with the following data:Miller Andrew 65789.87 5Green Sheila 75892.56 6Sethi Amit 74900.50 6.1 Each input line consists of an employee’s last name, first name, current salary, and percent pay increase. For example, in the first input line, the last name of the employee is Miller, the first name is Andrew, the current salary is 65789.87, and the pay increase is 5%. Write a program that reads data from the specified file and stores the output in the file Ch3_Ex5Output.dat. For each employee, the data must be output in the following form: firstName lastName updatedSalary. Format the output of decimal numbers to two decimal places.
If the user chooses to generate a Pentagon o This is a combination of a triangular shape and a square shape -- a symmetric triangle sits on top of a rectangle. o The triangular shape must be symmetric about the vertical axis. There must be exactly one character in the first line, and the number of characters increases by 2 in every successive lineo The rectangle shape must have LENGTH lines of height and all lines are 13 characters wide. o Make sure to add delay to view a progressively growing pentagon, otherwise you will just see the final shape. Code for triangle: for (int i = 1; i <= length; i++) { sleep (1); for (int j = length - i; j > 0; j--) cout << " "; for (int b = 1; b <= i; b++) cout << char(rdm) << " "; cout << endl; } Code for square: for (int row = 1; row <= length; row++)…
Write code for below problem. The input below is just an example and you should implement independent from the input. 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.
Three employees in a company are ups for a special pay increase. You are given a file; ABCompany.txt, with the following data: Miller Andrew 65789.87 5 Green Sheila 75892.56 6 Sethi Amit 74900.50 6.1 Each input line consists of an employee’s last name, first name. Current salary and percent pay increase. For example, in the first input line, the last name of the employee is Miller, the first name is Andrew, the current salary is 65789.87 and the pay increase is 5%. Write a JAVA program that reads the data from the specified file and stores the output in the file ABCoutput.dat. For each employee, the data must be output in the following form: firstname lastname updated salary. Format the output of decimal numbers to two decimal places. Send a copy of the following: Softcopy of the running code Screenshot of the code input file output file
Three employees in a company are ups for a special pay increase. You are given a file; ABCompany.txt, with the following data: Miller Andrew 65789.87 5 Green Sheila 75892.56 6 Sethi Amit 74900.50 6.1 Each input line consists of an employee’s last name, first name. Current salary and percent pay increase. For example, in the first input line, the last name of the employee is Miller, the first name is Andrew, the current salary is 65789.87 and the pay increase is 5%. Write a program that reads the data from the specified file and stores the output in the file ABCoutput.dat. For each employee, the data must be output in the following form: firstname lastname updated salary. Format the output of decimal numbers to two decimal places. Send a copy of the following: Softcopy of the running code Screenshot of the code input file output file
1- Given an input consisting of one or more sets of strings, followed by a final line containing only the value 0. Each set starts with a line containing an integer, k, which is the number of strings in the set, followed by k strings, one per line. For example, if your input is: Input = { "7", "Bo", "Jean", "Marybeth", "Kevin", "Claude", "William", "Pat", "6", "Jim", "Ben", "Annabelle", "Zoe", "Joey", "Frederick", "5", "John", "Billy", "Fran", "Stant", "Cece", "2", "Jones", "Bibi", "0" } Your output should look like that: 2- Given the sorted input from question 1, write a new code such that the shorter strings go on the top and bottom and the longer strings sit in the middle. In other words, each pair of names belongs on opposite ends of the list, and the first name in the pair is always in the top part of the list. For example, in Set 1 below, Bob and Joe are the first pair, Jean and Kevin the second pair, etc. Your output should look like the sample below.…
Summary Three employees in a company are up for a special pay increase. You are given a file, say Ch3_Ex5Data.txt, with the following data: Miller Andrew 65789.87 5 Green Sheila 75892.56 6 Sethi Amit 74900.50 6.1 Each input line consists of an employee’s last name, first name, current salary, and percent pay increase. For example, in the first input line, the last name of the employee is Miller, the first name is Andrew, the current salary is 65789.87, and the pay increase is 5%. Instructions Write a program that reads data from a file specified by the user at runtime (i.e. your program should accept the filename as user input) and stores the output in the file Ch3_Ex5Output.dat. To test your program, use the Ch3_Ex5Data.txt file. Your program will not pass all checks if it does not accept a filename as input from the user. For each employee, the data must be output in the following form: firstName lastName updatedSalary. Format the output of decimal numbers to two decimal places.…
Write a program that creates the multi-panel plot shown below, for Planck curves at 4 different temperatures Planck Curves Use embedded noninteractive plotting and set the figure size to be 10x5 inches. • You may write your program in a single cell, or break it over multiple cells. Use a logarithmic x axes, and the logspace() function for generating the axes values. You will have to be careful with units on this one. For 50% extra credit have your program use a loop over the four axes, with all the plotting code contained within the loop (except for any subplot adjustments). 0.030 12 300K 1000K 0.025 10 0.020 FBBX (Wm-nm-1) FBBA (Wm-2nm-¹) 0.015 10 0.010 0.005 2 0.000 A (nm) λ (nm) 100000 3000 3000K 6000K 2500 80000 2000 60000 FBBA (Wm-2nm-¹) FBBX (Wm-2nm-1) 1500 40000 1000 20000 500 0 101 102 0 101 103 104 105 106 102 103 104 105 106 X (nm) λ (nm) python language