Starting Out with Programming Logic and Design (5th Edition) (What's New in Computer Science)
5th Edition
ISBN: 9780134801155
Author: Tony Gaddis
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Videos
Textbook Question
Chapter 8, Problem 7AW
Assume the following declarations appear in a pseudocode program:
Constant Integer SIZE = 100
Declare Integer firstArray[SIZE]
Declare Integer secondArray[SIZE]
Also, assume that values have been stored in each element of firstArray. Design an
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
Computer Science
You need to create a small database that stores the information of 5 students.
It should store the name, age, gender, major, and credit hours earned for each student.
Whenever the user enters the name of the student, the program must print all the related information.
You may store the information for 5 group members or any imaginary students.
Hint: You may use the concept of arrays.
A Hide Time Remaining A
Geometric Progression Printer
As you might recall, a Geometric Progression (or GP) is a sequence of elements in which the next number in the sequence is obtained by multiplying the previous number by the
common ratio.
The next number in the sequence is obtained by using this formula:
a_n=a_1*r(n-1)
While the sum of all numbers in the sequence is obtained using any of these formulae:
If r= 1, sum=a*n
Ifr != 1 and r> 1, sum = a[(rª-1)/(r - 1)]
Ifr != 1 and r < 1, sum = a[(1-r)/(1-r)]
where a_n = next number in the sequence, a_1 = first number in the sequence, r = common ratio, n = number of terms
Your task is to write a Python program that
1: Accepts the necessary inputs from the user, i.e., start value (a_1), common ratio (r), and number of generate to generate (n).
2. Generates the Geometric Progression (GP) sequence starting from a_1 to n.
3. Prints out the GP HORIZONTALLY not VERTICALLY, e.g.
3, 9, 27, 81, 243, 729....
4. Calculates the sum of all numbers in…
An array is a collection of similar data elements stored at contiguous memory locations. It is the
simplest data structure where each data element can be accessed directly by only using its index
number. The following is an array of unsorted numbers called NumArr.
NumArr:
24
56
78
79
34
75
2
23
Chapter 8 Solutions
Starting Out with Programming Logic and Design (5th Edition) (What's New in Computer Science)
Ch. 8.1 - Prob. 8.1CPCh. 8.1 - Prob. 8.2CPCh. 8.1 - Prob. 8.3CPCh. 8.1 - Prob. 8.4CPCh. 8.1 - Prob. 8.5CPCh. 8.1 - Prob. 8.6CPCh. 8.1 - Prob. 8.7CPCh. 8.1 - What does array bounds checking mean?Ch. 8.1 - Prob. 8.9CPCh. 8.2 - Prob. 8.10CP
Ch. 8.2 - Prob. 8.11CPCh. 8.2 - What does the loop do in the sequential search...Ch. 8.2 - Prob. 8.13CPCh. 8.2 - How do you look for a partial string match when...Ch. 8.3 - Prob. 8.15CPCh. 8.3 - Prob. 8.16CPCh. 8.3 - Describe the algorithm for finding the highest...Ch. 8.3 - Prob. 8.18CPCh. 8.3 - Prob. 8.19CPCh. 8.4 - Prob. 8.20CPCh. 8.4 - Prob. 8.21CPCh. 8.5 - Prob. 8.22CPCh. 8.5 - Write a pseudocode statement that assigns the...Ch. 8.5 - Prob. 8.24CPCh. 8.5 - Prob. 8.25CPCh. 8.6 - Prob. 8.26CPCh. 8 - Prob. 1MCCh. 8 - Prob. 2MCCh. 8 - This is an individual storage location in an...Ch. 8 - Prob. 4MCCh. 8 - Prob. 5MCCh. 8 - Prob. 6MCCh. 8 - Prob. 7MCCh. 8 - Prob. 8MCCh. 8 - Prob. 9MCCh. 8 - Prob. 10MCCh. 8 - Prob. 1TFCh. 8 - Prob. 2TFCh. 8 - Prob. 3TFCh. 8 - Prob. 4TFCh. 8 - Prob. 5TFCh. 8 - Prob. 1SACh. 8 - Prob. 2SACh. 8 - Look at the following pseudocode: Constant Integer...Ch. 8 - Prob. 4SACh. 8 - Prob. 5SACh. 8 - Prob. 1AWCh. 8 - Prob. 2AWCh. 8 - Prob. 3AWCh. 8 - Prob. 4AWCh. 8 - Prob. 5AWCh. 8 - Prob. 6AWCh. 8 - Assume the following declarations appear in a...Ch. 8 - Design an algorithm for a function that accepts an...Ch. 8 - Write a pseudocode algorithm that uses the For...Ch. 8 - Total Sales Design a program that asks the user to...Ch. 8 - Lottery Number Generator Design a program that...Ch. 8 - Prob. 3PECh. 8 - Prob. 4PECh. 8 - Charge Account Validation Design a program that...Ch. 8 - Days of Each Month Design a program that displays...Ch. 8 - Phone Number Lookup Design a program that has two...Ch. 8 - Payroll Design a program that uses the following...Ch. 8 - Drives License Exam The local drivers license...Ch. 8 - Saddle Points Design a program that has a...Ch. 8 - Tic-Tac-Toe Game Design a program that allows two...Ch. 8 - Lo Shu Magic Square The Lo Shu Magic Square is a...
Additional Engineering Textbook Solutions
Find more solutions based on key concepts
Briefly describe what each of the following statements does. file.seekp(100L, ios::beg); file.seekp(-10L, ios::...
Starting Out with C++: Early Objects
What default value is assigned to each of the following variables? 1. Integer 2. Double 3. Boolean 4. Byte 5. D...
Starting Out With Visual Basic (8th Edition)
Write a function called m that takes as its argument a value of type e m (as defined in this chapter ) and retu...
Programming in C
Repeat Programming Project 8 in Chapter 1, but add yes-or-no dialogs to allow the user to make the following co...
Java: An Introduction to Problem Solving and Programming (7th Edition)
Suppose you define a class named NiceClass in a file. What name should the file have?
Absolute Java (6th Edition)
How do you determine the file that the user selected with either an open dialog or a save dialog?
Starting Out with Java: From Control Structures through Objects (7th Edition) (What's New in Computer Science)
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Similar questions
- A deque data structure implements the following functions: insertFront(int); //Insert at the front insertBack(int);//Insert at the back removeFront();//Remove and print front element eraseBack();//Remove and print last element first();//print first element last();//print last element Write the output of the following sequence of operations: insertFront(3), insertBack(8), insertBack(9), insertFront(5), removeFront(), eraseBack(), first(), insertBack(7), removeFront(), last(), eraseBack(). Write the sequence of numbers without space or comma.arrow_forwardData structures dict_contains_keys(items:set, example_dict:dict)->bool This function will have two parameters. The first is a set of numbers known as Number Set. The second is a dictionary known as Dictionary. Dictionary will have keys as integers and values as letters. The functions should return true if at least one of the numbers in the Number set is a key in Dictionary. It should return false otherwise. Example: Items: {8, 10, 5} Example: {9: 'F', 10: 'X'} Expected: True Items: {8, 9, 5, 1} Example: {6: 'i', 5: 'Y', 1: 'N', 0: 'E'} Expected: True Items: {9, 10, 4} Example: {5: 'i', 3: 'o', 1: 'N'} Expected: Falsearrow_forwardArrays are dynamic entities therefore their size changes throughout program execution. Select one: True OFalsearrow_forward
- Search Benchmarks Design an application in pseudocode that has an array of at least 20 integers. It should call a module that uses the sequential search algorithm to locate one of the values. The module should keep a count of the number of comparisons it makes until it finds the value. Then the program should call another module that uses the binary search algorithm to locate the same value. It should also keep a count of the number of comparisons it makes. Display these values on the screen.arrow_forwardProgramming Language: C Programming Write a program in C to input size of an array, input and store elements in an array and allow to delete particular elementarrow_forwardA deque data structure implements the following functions: insertFront(int); //Insert at the front insertBack(int);//Insert at the back removeFront();//Remove and print front element eraseBack();//Remove and print last element first();//print first element last();//print last element Write the output of the following sequence of operations: insertFront(3), insertBack(8), insertBack(9), insertFront(5), removeFront(), eraseBack(), first(), insertBack(7), removeFront(), last(), eraseBack().arrow_forward
- (Data processing) A bank’s customer records are to be stored in a file and read into a set of arrays so that a customer’s record can be accessed randomly by account number. Create the file by entering five customer records, with each record consisting of an integer account number (starting with account number 1000), a first name (maximum of 10 characters), a last name (maximum of 15 characters), and a double-precision number for the account balance. After the file is created, write a C++ program that requests a user-input account number and displays the corresponding name and account balance from the file.arrow_forward(File creation) Write a C++ program that creates an array containing the integer numbers 60, 40, 80, 90, 120, 150, 130, 160, 170, and 200. Your program should then write the data in the array to a text file. (Alternatively, you can create the file with a text editor.)arrow_forwardSubject: Basic Programming Platform: Java Array Data structure Perform the following data structure on arrays: CREATE AN Array with 5 in size and display the following: Data Structure operation: 1. display array content 2. insert element 3. delete element 4. search element CHOOSE OPERATION: // if option 1 is selected, then display all the elements of the array: //if option 2 is selected, display first all the elements, then input for the element to insert into the array //if option 3 is selected, display first all the elements, then input for the element to delete from the array //if option 4 is selected, input for the data/value to be search and display the element, the position and the index numberarrow_forward
- Data structures flip_matrix(mat:list)->list You will be given a single parameter a 2D list (A list with lists within it) this will look like a 2D matrix when printed out, see examples below. Your job is to flip the matrix on its horizontal axis. In other words, flip the matrix horizontally so that the bottom is at top and the top is at the bottom. Return the flipped matrix. To print the matrix to the console: print('\n'.join([''.join(['{:4}'.format(item) for item in row]) for row in mat])) Example: Matrix: W R I T X H D R L G L K F M V G I S T C W N M N F Expected: W N M N F G I S T C L K F M V H D R L G W R I T X Matrix: L C S P Expected: S P L C Matrix: A D J A Q H J C I Expected: J C I A Q H A D Jarrow_forwardSorting is a basic issue with arrays in which the goal is to find the target element in the array. Choose from the following options: Falsearrow_forwardHigh and Low Project Design a modular program which asks the user to enter a list of numbers. The numbers must be stored in an array. The program then finds the index of the first occurrence of the smallest element in the array and the last occurrence of the largest element in the array. The program displays the position and value of each of these items. Rather than processing items as they are read in as we have done so far, this program is asking you to read all the data into memory and then do the processing. Your design should contain a minimum of two functions. The first function takes as input the array and returns the indexof the location of the first occurrence of the smallest item. The second function takes the array as input and returns the index of the location of the last occurrence of the largest item in the array. Your functions do not need to return the highest and lowest data values since having the index is all that is needed to access the values. Do not display the…arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
C++ for Engineers and ScientistsComputer ScienceISBN:9781133187844Author:Bronson, Gary J.Publisher:Course Technology Ptr
C++ Programming: From Problem Analysis to Program...Computer ScienceISBN:9781337102087Author:D. S. MalikPublisher:Cengage Learning
Systems ArchitectureComputer ScienceISBN:9781305080195Author:Stephen D. BurdPublisher:Cengage Learning
C++ for Engineers and Scientists
Computer Science
ISBN:9781133187844
Author:Bronson, Gary J.
Publisher:Course Technology Ptr
C++ Programming: From Problem Analysis to Program...
Computer Science
ISBN:9781337102087
Author:D. S. Malik
Publisher:Cengage Learning
Systems Architecture
Computer Science
ISBN:9781305080195
Author:Stephen D. Burd
Publisher:Cengage Learning
1.1 Arrays in Data Structure | Declaration, Initialization, Memory representation; Author: Jenny's lectures CS/IT NET&JRF;https://www.youtube.com/watch?v=AT14lCXuMKI;License: Standard YouTube License, CC-BY
Definition of Array; Author: Neso Academy;https://www.youtube.com/watch?v=55l-aZ7_F24;License: Standard Youtube License