
Write java program that does the following steps.
Part 1: Array list implementation: array list implements list interface plus their own functions.
1. a. Create a ArrayList of type Integer and name it as Grades.
b. Create a ArrayList of type String and name it as Students.
c. Create a ArrayList of type Double and name it as Results.
2. Add the following values to the array List using add function 30, 40,80 ,100,70,100,10,100,10 Print the size of the array list using size () function.
3.Search for 100 in the array list, if you find it, print a message that “those grades are perfect”. Use only contains function.
4. Repeat the step 3 using equals function.
5. Check if array list is empty or not using isEmpty() function. Print a message if it’s empty and if it’s not empty also.
6. the grade is under 20 which is outlier, remove it from the array list.
7. Print array list using System.out.println()
8. Use indexOf to print index of 80.
9. Use get function.
10. What is the difference between get and index of?
11. Print the values of the array list using Iterator class.
12.. Delete all the values of the array list using clear function.
13. Print all the values of the array after you execute clear using System.out.println(). what is the result of using clear function?
14. What is the shortcoming of using array List?
Part2: LinkedList implementation: linked list implements list interface plus their own functions.
1. Create a linked list of type String Not Object and name it as StudentName.
2. Add the following values to linked list above Jack Omar Jason.
3. Use addFirst to add the student Mary.
4. Use addLast to add the student Emily.
5. Print linked list using System.out.println().
6. Print the size of the linked list.
7. Use removeLast.
8. Print the linked list using for loop for (String anobject: StudentName){…..} This question will not be in the quiz
9. Print the linked list using Iterator class.
10. Does linked list hava capacity function? Provide the answer in the comment.
11. Create another linked list of type String Not Object and name it as TransferStudent.
12. Add the following values to TransferStudent linked list Sara Walter.
13. Add the content of linked list TransferStudent to the end of the linked list StudentName
14. Print StudentName.
15. Print TransferStudent.
16. What is the shortcoming of using Linked List?
Part 3:
1. Create vector of default capacity 10 and name it v1.
2. Add NJ NY CA to v1.
3. Print the capacity and size of v1.
4. Create vector of default capacity 20 and name it v2.
5. Print the capacity and size of v2.
6. Create vector of default capacity 2 and increment is 2, name it v3.
7. Print the capacity and size of v3.
8. Add values 100 200 300 to v3.
9. Print the capacity and size of v3.

Trending nowThis is a popular solution!
Step by stepSolved in 2 steps with 2 images

- Please answer the question in the screenshot. The language used here is in Java.arrow_forward(a) Write a method public static void insert(int[] a, int n, int x) that inserts x in order among the first n elements of a, assuming these elements are arranged in ascending order. Do NOT use arraylists. x is the last element in a. n does not include x. (b) Using the insert method from Part (a), write a recursive implementation of Insertion Sort.arrow_forwardin haskell: Write a function sumNums that adds the items in a list and returns a list of the running totals. For example: sumNums [2,3,4,5] returns [2,5,9,14].arrow_forward
- I am new to Haskell and I need someone to explain the syntax of this function. The function is supposed to take a single integer parameter. It indicates the maximum value of Fibonacci numbers that will be in the list and it uses recursion to generate the list. fibList n = go n 1 1 where go n f s | (f+s) > n = [] | otherwise = (f+s) : go n s (f+s)arrow_forwardWrite a recursive Python function named initList to create a list containing the values from 0 to n-1. • The function takes two parameters, a reference to the list and an integer which is the value n. In the main program you must: - initialize a list (L = []) - call the recursive function initList with this list L, to modify it - and, ask the user to enter the value n from the keyboardarrow_forwardWrite code in assembly language Question 1: Construct a program using 2D array. Define a list of strings in the 2D arrays, the list should be only a string. Get a string from a user as input Search the user's string in the list of strings. If string is found print the string, and a message "String is Found". If string is not found print only a message "String is Not Found".arrow_forward
- Implement a function void printAll(void) to print all the items of the list.arrow_forwardWrite code in assembly language Question 1: Construct a program using 2D array. Define a list of strings in the 2D arrays, the list should be only a string. Get a string from a user as input Search the user's string in the list of strings. If string is found print the string, and a message "String is Found". If string is not found print only a message "String is Not Found".arrow_forwardUsing c++ Contact list: Binary Search 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 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). That list is followed by a name, and your program should output the phone number associated with that name. Define and call the following function. The return value of FindContact is the index of the contact with the provided contact name. If the name is not found, the function should return -1 This function should use binary search. Modify the algorithm to output the count of how many comparisons using == with the contactName were performed during the search, before it returns the index (or -1). int FindContact(ContactInfo contacts[], int size, string contactName) Ex: If the input is: 3 Frank 867-5309 Joe…arrow_forward
- Java - Elements in a Rangearrow_forwardin java pls and thank you!arrow_forwardYou will create two programs. The first one will use the data structure Stack and the other program will use the data structure Queue. Keep in mind that you should already know from your video and free textbook that Java uses a LinkedList integration for Queue. Stack Program Create a deck of cards using an array (Array size 15). Each card is an object. So you will have to create a Card class that has a value (1 - 10, Jack, Queen, King, Ace) and suit (clubs, diamonds, heart, spade). You will create a stack and randomly pick a card from the deck to put be pushed onto the stack. You will repeat this 5 times. Then you will take cards off the top of the stack (pop) and reveal the values of the cards in the output. As a challenge, you may have the user guess the value and suit of the card at the bottom of the stack. Queue Program There is a new concert coming to town. This concert is popular and has a long line. The line uses the data structure Queue. The people in the line are objects…arrow_forward
- Computer Networking: A Top-Down Approach (7th Edi...Computer EngineeringISBN:9780133594140Author:James Kurose, Keith RossPublisher:PEARSONComputer Organization and Design MIPS Edition, Fi...Computer EngineeringISBN:9780124077263Author:David A. Patterson, John L. HennessyPublisher:Elsevier ScienceNetwork+ Guide to Networks (MindTap Course List)Computer EngineeringISBN:9781337569330Author:Jill West, Tamara Dean, Jean AndrewsPublisher:Cengage Learning
- Concepts of Database ManagementComputer EngineeringISBN:9781337093422Author:Joy L. Starks, Philip J. Pratt, Mary Z. LastPublisher:Cengage LearningPrelude to ProgrammingComputer EngineeringISBN:9780133750423Author:VENIT, StewartPublisher:Pearson EducationSc Business Data Communications and Networking, T...Computer EngineeringISBN:9781119368830Author:FITZGERALDPublisher:WILEY





