An initializer list can be used to create and store values in an array An initializer list is used whenever the values to be stored in the array are known beforehand. The code below creates the array, my List using an initializer list: double [] myList = 5.6, 4.5, 3.3, 13.2, 4.0, 34.33, 34.0, 45.45, 99.993, 11123}; myList reference my List[0] my List[1] 5.6 4.5 myList[2] 3.3 Аrray reference variable my List[3] 13.2 myList[4] 4.0 Array element at index 5 my List [5] Element value 34.33 myList[6] 34.0 my List[7] 45.45 myList[8] 99.993 myList[9] 11123 An array created using an initializer list is processed the same way as any other array The first element of the array,myList, is at index position 0, has the value 5.6 and is referenced by: myList [0] The 6th element of the myList Array is at index position 5. Its value is 34.33 and it is referenced by: myList [5] Please submit a screen print of the Eclipse editor showing your code and output with answers:

An initializer list can be used to create and store values in an array An initializer list is used whenever the values to be stored in the array are known beforehand. The code below creates the array, my List using an initializer list: double [] myList = 5.6, 4.5, 3.3, 13.2, 4.0, 34.33, 34.0, 45.45, 99.993, 11123}; myList reference my List[0] my List[1] 5.6 4.5 myList[2] 3.3 Аrray reference variable my List[3] 13.2 myList[4] 4.0 Array element at index 5 my List [5] Element value 34.33 myList[6] 34.0 my List[7] 45.45 myList[8] 99.993 myList[9] 11123 An array created using an initializer list is processed the same way as any other array The first element of the array,myList, is at index position 0, has the value 5.6 and is referenced by: myList [0] The 6th element of the myList Array is at index position 5. Its value is 34.33 and it is referenced by: myList [5] Please submit a screen print of the Eclipse editor showing your code and output with answers:

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter12: Points, Classes, Virtual Functions And Abstract Classes

Section: Chapter Questions

Problem 29SA

See similar textbooks

Similar questions

Print the following List in the reversed order using lambda / arrow operator. var array = new List <int>{ 8,2,2,24,5,7,5,3,2,10};
In the following code both myList and yourList are dynamic arrays of the same size. The code initializes the array myList to certain values. The value in each element of yourList should be twice the value in the corresponding element in myList. However, the output of this code would show that is not the case. Provide the correct code to accomplish the desired results. int *myList;int *yourList;myList = new int[5];myList[0] = 8;for (int i = 1; i < 5; i++)myList[i] = i * myList[i - 1];yourList = myList;for (int i = 0; i < 5; i++)yourList[i] = 2 * myList[i];
You are provided a 2 dimensional array is created by the statement: 2 3 5 7 11 13 17 19 23 29 31 37 41 43 47 53 59 61 67 71 What value is accessed by the following statements: num[1][7] = _________________ num[0][5] = __________________ num[1][4]= ___________________ num[0][9]= _____________________ num[1][0]=_____________________ Extra Credit: What is a common property of the values in the area? You are implementing a Stack of chars The following statements are issued: push (‘a’) push (‘b’) push (‘c’) push (‘d’) pop() push(‘z’) pop() push(‘e’) push(‘f’) push (‘g’) pop() Display a representation of the stack at the end of the operations above from top to bottom. You must label the top and bottom. You have a queue of numbers and you issue the following instructions: (10 pts.) add(33) add(57) add(75) add(12) remove() remove() add(101) add(99) remove() add(67) remove() add(33) remove() List…
Assume you have an array and a linked-list that each contain a list of 10 books. Which of the following is true? Group of answer choices 1. It is faster to access the 5th book in the array than to access the 5th book in the linked-list because arrays allow for directly accessing the appropriate spot in memory, while a linked list requires stepping through the previous 4 elements. 2. Shuffling the order of the Books in the linked-list will be easier than for the array. 3. It is faster to add a new book to the end of the linked list than to the array, because the entire array needs to be copied to a larger space in memory in order to add a new element. 4. All options are true.
When a list is implemented using an array, which of the following is FALSE? Select one: A.If the size of the array is insufficient, there is a need to copy the whole list to a new array B.The new node inserted might cause shifting of the existing elements C.The memory allocation can be very inefficient D.The insertion of a new element is proportional to the size of the list
java program: If in the ArrayStack, the first element that we push to the stack, is stored in location capacity – 1 (capacity is the capacity of the array theData) in the array theData and the subsequent elements that we push, we keep on adding before the last element added in the array. That is, in the constructor of class ArrayStack, we initialize the topOfStack to capacity and we write the push method as follows: public E push(E obj) { if (topOfStack == 0) reallocate(); topOfStack--; theData[topOfStack] = obj; return obj; } This push method can work but the if statement should be: if (topOfStack == theData.length - 1) reallocate(); This push method will work provided we modify the reallocate method. This push method can work, but topOfStack-- ; should come after theData[topOfStack] = obj; This push method can work, but topOfStack-- ; should be topOfStack++;
When a list is implemented using an array, which of the following is FALSE? Select one: A.If the size of the array is insufficient, it whole list will be automatically copied to a new array B.The new node inserted might cause shifting of the existing elements C.The insertion of a new element is proportional to the size of the list D.The memory allocation can be very inefficient
2. can you show me the screen shot of the out put please .JUst the screen shot INCLUDE Irvine32.inc strLen EQU 10 ; Declare a constant for the length of the array .data arr BYTE strLen DUP(?) ; Define the array of bytes .code main PROC call Clrscr mov esi, OFFSET arr mov ecx, 20 ; Call GenerateRandomString 20 times L1: push ecx ; Save ecx on the stack call GenerateRandomString pop ecx ; Restore ecx from the stack call Crlf loop L1 call WaitMsg exit main ENDP GenerateRandomString PROC USES ebx ecx esi ; Save registers on the stack push ebx push esi push ecx ; Get length of string mov ecx, lengthOf arr ; Get pointer to string mov esi, offset arr ; Generate random string mov ebx, esi ; Store starting address of string mov eax, 'A' ; Start with ASCII code for 'A' L2: call RandomRange ; Get random number between 0 and 25 add eax, 'A' ; Convert to capital letter ASCII code mov…
create a generic array stack and push/pop a million random ints using java.util.Random class. you also want to detect the time it takes to push and pop elements from the stack and you need to run the test multple times to see how the running time grows with increasing number of operations. use a outer loop that runs the program a million times (e.g. for(int i = 1; i<1000000; i+=1000000)).
Q2. Write a java program to perform the following task: a) Create a collection ArrayList<String> for Customer class b) Add 5 elements into ArrayList c) Display the element at index 4 d) Display all the elements in the ArrayList using for-each loop e) Remove the values at index 2 f) Add “cst2” in location 2. g) Check if st2 existing inside the collection.
1- Start by writing your choice from the list given above. Part a. Explain the important technical details about your choice. 2-(continued) Start by again writing your choice from the list given above. Part b. Most of the ADTs in this class were implemented using arrays and linked lists. If appropriate for the ADT you chose in part a., explain which one (an array or a linked list) you would choose to implement it and why. If it doesn’t make sense to implement your ADT using an array or a linked list, explain which other data structure you would use to implement your ADT.
Write method findZero, as started below. findZero should return the index of the first element of array A that contains the value zero, starting from position 0 up through position pos. If no element of A from position 0 to position pos contains the value zero, then findZero should return –1. For example: Array (A) Position (pos) Value returned by findZero(A, pos) 1 0 2 5 6 0 -1 1 0 2 5 6 1 1 1 0 2 5 6 2 1 1 0 2 0 6 2 1 1 0 2 0 6 4 1 1 2 3 4 5 4 -1 Complete method findZero below. Assume that it is called only with values that satisfy its assumptions as stated below. // Description: Returns smallest index k // such that (0 <= k <= pos) and (A[k] == 0) // Assumptions: 0 <= pos < A.length public int findZero(int[] A, int pos) {