Write a program called final.cpp that takes numbers from the user and places corresponding numbers into an array, one by one. After each new entry from the user, the program prints out the current array of numbers. Several rules must be followed: • Each new number is checked and added to the array ONLY if it is larger than the number in the previous position in the array. This condition is not checked for the first number. In other words, the new number is rejected and nothing is added to the array if the entry is too-small. • The new number is added to the array EXCEPT: • If the user enters a number greater than 60, the number O is added to the array instead. • If the user enters a multiple of 5 (and less than or equal to 60), the number 5 is added to the array instead. The program exits after 7 numbers have been placed into the array. Programming requirements: • You must define and call at least one function. I recommend printArray(.) • You must use at least one array

Write a program called final.cpp that takes numbers from the user and places corresponding numbers into an array, one by one. After each new entry from the user, the program prints out the current array of numbers. Several rules must be followed: • Each new number is checked and added to the array ONLY if it is larger than the number in the previous position in the array. This condition is not checked for the first number. In other words, the new number is rejected and nothing is added to the array if the entry is too-small. • The new number is added to the array EXCEPT: • If the user enters a number greater than 60, the number O is added to the array instead. • If the user enters a multiple of 5 (and less than or equal to 60), the number 5 is added to the array instead. The program exits after 7 numbers have been placed into the array. Programming requirements: • You must define and call at least one function. I recommend printArray(.) • You must use at least one array

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

Write a program that declares an array of 15 integers and reads the values from the user. Make sure that the user doesn’t enter a value greater than 10 (if the user enters a value not in the allowed range, discard that value and read another to put into the array). Now tell the number that occur maximum number of times in the array. For example for the following 7 has maximum occurrence. 4,7,3,3,2,7,1,5,7,9,9,9,7,8,10 Use both linear and binary search.
You’re given an array of integers and another array of three distinct integers. The first array is guaranteed to only contain integers that are in the second array, and the second array represents a desired order for the integers in the first array. For example, a second array of [x, y, z] represents a desired order of [x, x,…,x, y, y,…,y, z, z,…,z] in the first array. Write a program that sorts the first array according to the desired order in the second array. The program should perform this in place (i.e.., it should mutate the input array), and it shouldn’t use any auxiliary space. Note that the desired order won’t necessarily be ascending or descending and that the first array won’t necessarily contain all three integers found in the second array-it might only contain one or two. Please Don't Use Chat GPT Answers Sample input array = [1,0,0,-1,-1,0,1,1] order = [0,1,-1] Sample output [0,0,0,1,1,1-1,-1] Requirements: 1. Implement the above problem statement using C Programming. 2.…
Write a program that first reads an integer for the array size, then reads numbers intothe array, and finally outputs how many numbers have values that are greater than theaverage. For practice reasons, try not to use the index notation of arrays (e.g. myarray[i])at all. Use pointers instead.
Write a Java program that will allow the user to play a hangman game repeatedly until theychoose to stop. The game should randomly choose a secret word from a pre-set list of wordsfor the user to guess. Store the list of words available for play in an array so you can randomlychoose them by index during game play.During a turn, the user will guess one letter at a time. Each letter in the secret word shoulddisplay as an asterisk until the letter is guessed by the user. When a correct letter is guessed,the letter should be displayed in the correct position in place of the asterisk. The user hangshimself with the 8th wrong guess and loses the game.Make a character array to hold the characters and asterisks representing the word beingguessed. You can change the contents of this array as the letters are guessed and revealed. Inother words, this array can be used to display the current state of the secret word each round.Here is the list of words the game should choose from for the secret…
Write a program that reads a list of integers, and outputs the two smallest integers in the list, in ascending order. The input begins with an integer indicating the number of integers that follow. You can assume that the list will have at least 2 integers and less than 20 integers. Ex: If the input is: 5 10 5 3 21 2 the output is: 2 3 To achieve the above, first read the integers into an array. Hint: Make sure to initialize the second smallest and smallest integers properly.
FOR JAVA Write a method that takes a one dimensional integer array and an integer, and returns the index of the integer in the array. If the integer is not in the array, your program must return -1. If there are multiple occurrences of that number, your program must return the smallest index. Repeat the second question, but if there are multiple occurrences of the number, your program must return the largest index instead of the small- est.
Write a program that reads an integer array a[] from the console and writes out the subsequence of the array that sums to the largest value. If there are more than one such subsequence, then the program should write out the subsequence that starts at the smallest position in the array and, if there are more than one subsequence of largest sum starting at the same smallest position, it should write out the shortest such subsequence.
Write a program in Java that reads integers, one per line, and displays their sum. Also, display all the numbers read, each with an annotation giving its percentage contribution to the sum. Use a method that takes the entire array as one argument and returns the sum of the numbers in the array. (Hint: Ask the user for the number of integers to be entered, create an array of that length, and then fill the array with the integers read.
Write a program that reads a list of integers, and outputs those integers in reverse. The input begins with an integer indicating the number of integers that follow. For coding simplicity, follow each output integer by a space, including the last one. Assume that the list will always contain fewer than 20 integers. Ex: If the input is: 5 2 4 6 8 10 the output is: 10 8 6 4 2 To achieve the above, first read the integers into an array. Then output the array in reverse. import java.util.Scanner; public class LabProgram { public static void main(String[] args) { Scanner scnr = new Scanner(System.in); int[] userList = new int[20]; // List of numElement integers specified by the user int numElements; // Number of integers in user's list// Add more variables as needed numElements = scnr.nextInt(); // Input begins with number of integers that follow/* Type your code here. */}}
Write a Java 7 program with proper whole code and Explatation too,,. & Dont use JAVA8... Shil got an array of N integers as a present on his birthday. But he didn't liked it. Shil wants to make this array beautiful. Shil considers an array A1,A2,A3 . . . AN beautiful if A1 > AN. Inorder to make it beautiful Shil can swap any two numbers in the array. Also Shil can perform this operation any number of times on any adjacent pairs of integers in the array A.Find the number of ways in which Shil can make this array beautiful.Two ways are considered same if resulting array after making all the swaps have same A1 and AN. Input First line of input contains an integer N denoting the number of elements in an array A. Next line of input contains N space separated integers denoting A1,A2,A3 . . . AN respectively. Output Number of ways in which you can make given array beautiful. Constraints 1 ≤ N ≤ 1061 ≤ Ai ≤ 106 SAMPLE INPUT 5 1 4 3 2 5 SAMPLE OUTPUT 10 Explanation…
Write a program in JAVA Your program inputs roll no gpa and marks of 100 students in a corresponding arrays in such a way that roll no 1 is stored in rno[0] and marks stored in marks [0] And so on it finally displays the marks of students with highest marks for this
Complete the implementation of scrabble.c, such that it determines the winner of a short scrabble-like game, where two players each enter their word, and the higher scoring player wins. Notice that we’ve stored the point values of each letter of the alphabet in an integer array named POINTS. For example, A or a is worth 1 point (represented by POINTS[0]), B or b is worth 3 points (represented by POINTS[1]), etc. Notice that we’ve created a prototype for a helper function called compute_score() that takes a string as input and returns an int. Whenever we would like to assign point values to a particular word, we can call this function. Note that this prototype is required for C to know that compute_score() exists later in the program. In main(), the program prompts the two players for their words using the get_string() function. These values are stored inside variables named word1 and word2. In compute_score(), your program should compute, using the POINTS array, and return the score…