1. Write two programs. The first should use traditional arrays to do each of the tasks listed below. The second should do all the same things with ArrayLists. Describe which structure - the Array or the ArrayList – has the advantage and why! a) Create a reference to a list b) Add elements to a list - at the end of the list: NOTE: really ADD them! Do not overwrite an existing value that is in the list already but ADD A NEW VALUE TO THE LIST. c) Add elements to the list in the middle d) Add elements to the list at the beginning e) Print a list f) Remove a specific item from the list: NOTE: really DELETE them! Do not just zero out an existing value that is in the list already but DELETE THE VALUE FROM THE LIST. e) Cempute the size of the list

1. Write two programs. The first should use traditional arrays to do each of the tasks listed below. The second should do all the same things with ArrayLists. Describe which structure - the Array or the ArrayList – has the advantage and why! a) Create a reference to a list b) Add elements to a list - at the end of the list: NOTE: really ADD them! Do not overwrite an existing value that is in the list already but ADD A NEW VALUE TO THE LIST. c) Add elements to the list in the middle d) Add elements to the list at the beginning e) Print a list f) Remove a specific item from the list: NOTE: really DELETE them! Do not just zero out an existing value that is in the list already but DELETE THE VALUE FROM THE LIST. e) Cempute the size of the list

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter16: Searching, Sorting And Vector Type

Section: Chapter Questions

Problem 1TF

See similar textbooks

Similar questions

Exercise1: Write C++ program binary searching for search value in array list and display its position on the screen? Exercise2: Write C++ program sequential searching for search value in array list that consist of 5 elements and display its position on the screen?
void mystery2(int list[], int length) { for (int i = 0; i < length - 1; i++) { if (i % 2 == 0) { list[i]++; } else { list[i]--; } }} For each array below, indicate what the array's contents would be after the function were called and passed that array as its parameter. use the following as input. {6, 3} {2, 4, 6} {1, 2, 3, 4} {2, 2, 2, 2, 2} {7, 3, 2, 0, 5, 1}
C7 Write a program that will take an integer array(A) and an integer value(v)as input and do the following task - If the value is present in the list,delete all the elements present before the value- if The value is not present in the list, enqueue it after 1st even number.//Comment per condition Must and explained the enqueue and code part with screenshot.I will up vote your answer immediatly. Kindly provide correct answer.
B1. Answer the following: a. Create an ArrayList named Employee of type String. b. Add Ahmed, Mohammed, and Amal to the list? c. Remove Mohammed from the list? d. Write a for loop to print the elements of array list?
1. Write a Java program to create a new array list, add some colors (string) and print out the collection. The list should contain color "green". 2. Change the previous program to insert an element into the array list at the first position. 3. Change the application to print out the index of color "green". 4. Change the previous application to replace "green" value with "yellow". 5. Change the previous application to remove the third element from the list. 6. Change the application to sort the list of colors. 7. Change the application to shuffle the list of colors. 8. Change the application such that it swaps colors "Orange" and "Red". 9. Change the application to copy the current list into a new list. 10. Change the application to trim the capacity of the initial array list to the current list size. 11. Change the application to empty the second list. 12. Change the application to test (print out a message) if the second list is empty. 13. Change the application to increase the…
Create a list of two vectors (dog, cat, mouse) and (True, True, False) called a.list. Name the vectors “animal” and “pet” respectively in your list. Access all the elements in the first vector of the list by name.
complete the following function. // It is the same as observeCounter except that f has a parameter of type List[Counter] not Counter. // f will insist that the List[Counter] has length 3. // You must return a List[Int] not an Int. // The first element of the result List[Int] must correspond to the number of times that increment/decrement were called on the first element of type List[Counter], similarly for the second and third elements. def observeCounterList (f : List[Counter] => Unit) : List[Int] = { // TODO: Provide definition here. List (-1, -1, -1) }
6.44 LAB: Contact list (JAVA) A contact list is a place where you can store a specific contact with other associated information such as a phone number, email address, birthday, etc. Write a program in java that first takes as input an integer N that represents the number of word pairs in the list to follow. Word pairs consist of a name and a phone number (both strings), separated by a comma. That list is followed by a name, and your program should output the phone number associated with that name. Output "None" if name is not found. Assume that the list will always contain less than 20 word pairs. Ex: If the input is: 3 Joe,123-5432 Linda,983-4123 Frank,867-5309 Frank the output is: 867-5309 Your program must define and call the following method. The return value of getPhoneNumber() is the phone number associated with the specific contact name.public static String getPhoneNumber(String[] nameArr, String[] phoneNumberArr, String contactName, int arraySize) Hint: Use two arrays: One for…
1. Write a Java program to create a new array list, add some colors (string) and print out the collection. The list should contain color "green". 2. Change the previous program to insert an element into the array list at the first position. Change the application to print out the index of color "green". Change the previous application to replace "green" value with "yellow". Change the previous application to remove the third element from the list. Change the application to sort the list of colors. Change the application to shuffle the list of colors. Change the application such that it swaps colors "Orange" and "Red". Change the application to close the current list into a new list. Change the application to trim the capacity of the initial array list to the current list size. Change the application to empty the second list. Change the application to test (print out a message) if the second list is empty. Change the application to increase the capacity of…
1-Let the list have a head and a tail. That is, a pointer (have a marker) to both the beginning (first Node) of the list and the last Node. What process does Tail facilitate? 2-insert(int index, int element): adds this element to the index position. For example, if index is 4, it adds this element between index 3 and 4 in the list. The size of the list has increased by one. 3-append(int elem): Adds the element to the end of the list. The size of the list has increased by one. 4-get(int index): Returns the element at the index position of the list, no change in the list. 5-remove(int index): Returns the element at the index position of the list. This element is removed from the list and the list size is reduced by one. 6-findMin(): returns the index of the smallest number in the list. 7-findMax(): returns the index of the largest number in the list. 8-search(int elem): searches elem in the list. It returns -1 when you can't find elem's index when you find it. 9-ToArray(): Return an…
1-Let the list have a head and a tail. That is, a pointer (have a marker) to both the beginning (first Node) of the list and the last Node. What process does Tail facilitate? 2-insert(int index, int element): adds this element to the index position. For example, if index is 4, it adds this element between index 3 and 4 in the list. The size of the list has increased by one. 3-append(int elem): Adds the element to the end of the list. The size of the list has increased by one. 4-get(int index): Returns the element at the index position of the list, no change in the list. 5-remove(int index): Returns the element at the index position of the list. This element is removed from the list and the list size is reduced by one. 6-findMin(): returns the index of the smallest number in the list. 7-findMax(): returns the index of the largest number in the list. 8-search(int elem): searches elem in the list. It returns -1 when you can't find elem's index when you find it. 9-ToArray(): Return an…
1-Let the list have a head and a tail. That is, a pointer (have a marker) to both the beginning (first Node) of the list and the last Node. What process does Tail facilitate? 2-insert(int index, int element): adds this element to the index position. For example, if index is 4, it adds this element between index 3 and 4 in the list. The size of the list has increased by one. 3-append(int elem): Adds the element to the end of the list. The size of the list has increased by one. 4-get(int index): Returns the element at the index position of the list, no change in the list. 5-remove(int index): Returns the element at the index position of the list. This element is removed from the list and the list size is reduced by one. 6-findMin(): returns the index of the smallest number in the list. 7-findMax(): returns the index of the largest number in the list. 8-search(int elem): searches elem in the list. It returns -1 when you can't find elem's index when you find it. 9-ToArray(): Return an…