Problem Solving with C++ (9th Edition)
9th Edition
ISBN: 9780133591743
Author: Walter Savitch
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Videos
Textbook Question
Chapter 9.2, Problem 14STE
What is the output of the following code fragment? The code is assumed to be embedded in a correct and complete
int arraySize = 10;
int *a;
a = new int[arraySize];
int i;
for (i = 0; i < arraySize; i++)
* (a + i) = i;
for (i = 0; i < arraySize; i++)
cout << a[i] << “ ”;
cout << endl;
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
Program in C language (Please solve part 2)
Part one :
Write a program that does the following:
Creates int array array_1 of length 10.
Creates int array array_2 of length 10.
Takes int values from the user of for 10 values for array_1 and array_2, each.
Creates a new int array array_3 which copies the values of array_1 and array_2, in interleaved order, into it.
Prints out the contents of Prints out the contents of array_1, array_2 and array_3.
Part two :
Repeat Part one, but this time use arrays of char (instead of int), and stop receiving input into array_1 and array_2 when the user hits Enter / newline and insert a Null character into the array
Write a function that gets an array as a parameter (address and size) and a number and checks to see if that number exists in the array. The function should report every single occurrence of the number in the array. It should also report how many occurrences were detected in total (use c code)Suggested prototype:
void findnReport(int* ar, int size, int num)
Example of function output:
If array = {2,5,3,5,12,13,14,15,0,5,-1,11,5} and num = 5,
Number 5 found in array index 1
Number 5 found in array index 3
Number 5 found in array index 9
Number 5 found in array index 12
Total of 4 occurrences of number 5
One dimension array in C:Create an array of 100 integer elements and initialize the array elements to zero.Populate the array (using a for loop) with the values 10,20,30,..., 990,1000.Write code (using for loops) to sum all the elements and output the sum to the screen.
without using #define
Chapter 9 Solutions
Problem Solving with C++ (9th Edition)
Ch. 9.1 - Prob. 1STECh. 9.1 - Prob. 2STECh. 9.1 - Give at least two uses of the operator. State...Ch. 9.1 - Prob. 4STECh. 9.1 - Prob. 5STECh. 9.1 - Suppose a dynamic variable were created as...Ch. 9.1 - Write a definition for a type called NumberPtr...Ch. 9.1 - Prob. 8STECh. 9.2 - Write a type definition for pointer variables that...Ch. 9.2 - Suppose your program contains code to create a...
Ch. 9.2 - Prob. 11STECh. 9.2 - Prob. 12STECh. 9.2 - What is the output of the following code fragment?...Ch. 9.2 - What is the output of the following code fragment?...Ch. 9.2 - What is the output of the following code fragment?...Ch. 9 - Prob. 1PCh. 9 - Write a program that asks the user to input an...Ch. 9 - Palindrome testing with pointers This Practice...Ch. 9 - Do Programming Project 3 in Chapter 7 in this...Ch. 9 - Do Programming Project 11 in Chapter 7 using a...Ch. 9 - Write a function that takes a C string as an input...Ch. 9 - Prob. 5PPCh. 9 - One problem with dynamic arrays is that once the...Ch. 9 - Prob. 7PPCh. 9 - Write a program that outputs a histogram of...
Additional Engineering Textbook Solutions
Find more solutions based on key concepts
Modify your printDetai 1 s method to include printing the reference number. However, the method should print th...
Objects First with Java: A Practical Introduction Using BlueJ (6th Edition)
List the specific functions of a DBMS.
Database Concepts (8th Edition)
How are relationships between tables expressed in a relational database?
Modern Database Management (12th Edition)
Write the function htoi(s), which converts a suing of hexadecimal digits (including an optional 0x or 0X) into ...
C Programming Language
Define the three types of recursive binary relationships, and give an example of each, other than the ones show...
Database Concepts (7th Edition)
Look at the following class: public class Checkpoint { public void message(int x) { System.out.print(This is th...
Starting Out with Java: From Control Structures through Data Structures (3rd Edition)
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
- Write a C++ program that reads 6 real numbers from the user (negative and positivenumbers) into an array, then it does the following: Display all the values of array in reverse order. Find the sum and average of positive numbers of the array and display them. Count negative numbers of the array and display it. Find the minimum value of the array and display it. Find the index of the minimum value of the array and display it.arrow_forwardDo the following in the most efficient way possible in C Language: 1. Take an Array of 10 integer values (automatically should be converted to ascending order). 2. Insert Values - Value should be inserted automatically as per the ascending order. If array is {1,7,28,45,67,81} and the user inserts 31; the program should automatically insert at the 3rd index and array size should increase by 1. 3. Delete Values by Range - the user will be asked to two indexes (<sizeofArray) and all values in between those indexed should be deleted. E.g. If array is {1, 7, 28, 45, 67,81} and user enters the indexes 2,4. Then the values 28, 45, 67 should be deleted. Note: If at any time, the array becomes unsorted, then; some values need to be deleted at runtime to make the array sorted again. At any given time, the array shouldn't be unsorted. Please do not use Pointers and only use Array as a Data Structure.arrow_forwardDo the following in the most efficient way possible in C Language: 1. Take an Array of 10 integer values (automatically should be converted to ascending order). 2. Insert Values - Value should be inserted automatically as per the ascending order. If array is {1,7,28,45,67,81} and the user inserts 31; the program should automatically insert at the 3rd index and array size should increase by 1. 3. Delete Values by Range - the user will be asked to two indexes (<sizeofArray) and all values in between those indexed should be deleted. E.g. If array is {1, 7, 28, 45, 67,81} and user enters the indexes 2,4. Then the values 28, 45, 67 should be deleted.arrow_forward
- Write a function void switchEnds(int *array, int size);that is passed the address of the beginning of an array and the size of the array. The function swaps the values in the first and last entries of the array.arrow_forwardin c++ also explain the working of each line of the code Carry out the following tasks with an array: Allocate an array of ten integers. Put the number 17 as the initial element of the array. Put the number 29 as the last element of the array. Fill the remaining elements with –1. Add 1 to each element of the array. Print all elements of the array, one per line. Print all elements of the array in a single line, separated by commas. Count how many elements are less than a given value (entered by user). Delete all elements that are less than a given value (entered by user). Place all elements that are less than a given value (provided by user) in another array.arrow_forwardStudy the two functions given below. Both use the same array declared as: static int data[256*256*8]; void function1(){ int i; int j; for (i = 0; i < 32; i++) for (j = 0; j < 256; j++) data[j] = i;}void function2(){ int i; int j; for (i = 0; i < 32; i++) for (j = 0; j < 256; j++) data[j*2048] = i;} Instructions:Assume the following behaviors in a virtual memory system. Reading or writing physical memory requires 50 nanoseconds. Reading or writing disk writing 10 milliseconds. Page size is 8 kilobytes. Presume that the program has 1 megabyte of physical memory available. You may consider everything except the array access itself to take no time. You should also assume that the first 1 megabyte of the array is in physical memory ini-tially. You may ignore any memory used by the program or stack to execute these func-tions. Using this information, answer the following questions. In each case, show the work you use to…arrow_forward
- One dimension array in C:Create an array of 100 integer elements and initialize the array elements to zero.Populate the array (using a for loop) with the values 10,20,30,..., 990,1000.Write code (using for loops) to sum all the elements and output the sum to the screen.arrow_forwardWrite a program in C++ to find the transpose of a 3x3 matrix input by the user, store it in another array and display it. instructions: 1.avoid void function in the program. 2. use int function. 3. avoid copy-pasting and plagiarism 4. write a self-written code 5. give comments with each step. 6. write code with easy and basic steps as I am just a student.arrow_forwardTwo dimension array in C:Create a two dimension array of integers that is 5 rows x 10 columns.Populate each element in the first 2 rows (using for loops) with the value 5.Populate each element of the last three rows (using for loops) with the value 7.Write code (using for loops) to sum all the elements of the first three columns and output thesum to the screen.arrow_forward
- True/FalseIndicate whether the statement is true or false. 1. When you pass an array to a function, the computer passes the address of each of the array elements. 2. When an array is sorted in descending order, the first element in the array contains the smallest value and the last element contains the largest value. 3. The variables in an array are referred to as elements of the array. 4. Assigning initial values to an array is not required, but considered good programming practice. 5. Parallel arrays are two or more arrays whose elements are related by their position in the arrays. 6. You should not pass a one-dimensional array to a function. 7. Passing an array by reference is more efficient than passing it by value. 8. The quick sort algorithm provides a quick and easy way to sort the items stored in an array, as long as the number of items is relatively small—for example, fewer than 50. 9.…arrow_forwardCreate a dynamic array that contains an int array. dynamic array, array inside when the existing array is full and a new element needs to be added will double its size, make all the elements of the old array the same will copy the indexes and add the element to the new array. Use the following functions. Write in C language. 1.append(dynamic array, new element): function sent to itself Adds the element sturct to the end of the array inside DynamicArray. Place If not, it behaves in accordance with the dynamic array definition given above. 2. get(index): The element in the index sent to it by the function takes it from the array it hosts and sends it back. ATTENTION ! : Please use a dynamic array and this array with struct structure. I don't want a link list. Do not post wrong or copied codes. Be sure to use the append and get functions given above Please do not solve the question I asked with the same code and copy and paste the code, my right to the question is running out. Solve the…arrow_forwardCreate a dynamic array that contains an int array. dynamic array, array inside when the existing array is full and a new element needs to be added will double its size, make all the elements of the old array the same will copy the indexes and add the element to the new array. Use the following functions. Write in C language. 1.append(dynamic array, new element): function sent to itself Adds the element sturct to the end of the array inside DynamicArray. Place If not, it behaves in accordance with the dynamic array definition given above. 2. get(index): The element in the index sent to it by the function takes it from the array it hosts and sends it back.arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
C++ Programming: From Problem Analysis to Program...Computer ScienceISBN:9781337102087Author:D. S. MalikPublisher:Cengage Learning
C++ Programming: From Problem Analysis to Program...
Computer Science
ISBN:9781337102087
Author:D. S. Malik
Publisher:Cengage Learning
Definition of Array; Author: Neso Academy;https://www.youtube.com/watch?v=55l-aZ7_F24;License: Standard Youtube License