2.1 Write a complete Java program called List for the Linked List pseudocode below: 1. Create mylist 2. add(44) 3. addLast(57) 4. addFirst(92) 5. add(3,52) 6. print mylist 7. remove(2) 8. removeFirst() 9. removeLast 10. Print mylist 2.2 Write a complete Java program called Display that includes a String array called names[]. The array names[] must store 5 names and this should be output using a loop structure.

2.1 Write a complete Java program called List for the Linked List pseudocode below: 1. Create mylist 2. add(44) 3. addLast(57) 4. addFirst(92) 5. add(3,52) 6. print mylist 7. remove(2) 8. removeFirst() 9. removeLast 10. Print mylist 2.2 Write a complete Java program called Display that includes a String array called names[]. The array names[] must store 5 names and this should be output using a loop structure.

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

import java.util.ArrayList;import java.util.Arrays;public class PS{/*** Write the method named mesh.** Start with two ArrayLists of String, A and B, each with* its elements in alphabetical order and without any duplicates.* Return a new list containing the first N elements from the two* lists. The result list should be in alphabetical order and without* duplicates. A and B will both have a size which is N or more.* Your solution should make a single pass over A and B, taking* advantage of the fact that they are in alphabetical order,* copying elements directly to the new list.** Remember, to see if one String is "greater than" or "less than"* another, you need to use the compareTo() method, not the < or >* operators.** Examples:* mesh(["a","c","z"], ["b","f","z"], 3) returns ["a","b","c"]* mesh(["a","c","z"], ["c","f","z"], 3) returns ["a","c","f"]* mesh(["f","g","z"], ["c","f","g"], 3) returns ["c","f","g"]** @param a an ArrayList of String in alphabetical order.* @param b an…
Create a Java program that collects 3 animal types from the user, stores them to an Linked List andthen outputs/displays the contents of the Linked List to the user after the third animal type isentered. (Capturing data, use of a loop, use of a linked list, 3 animal types, stringvalue).
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.
Write a Java class myLinkedList to simulate a singly linked list using arrays as the underlying structure. Include the following methods: 1. insert an element within the linked list.(this should also work for the front and the rear of the list) 2. Remove an element from the linked list 3. Display (print) the elements of the linked list in order. 4. A method to check if the list is "empty". Test your solution using a linked list that initially has the characters A, B, D, E, F, and G. Insert "C" between B and D. Remove element "F". [Hint: One solution (recommended) is to use 2 arrays. One for the data, and the other for the "next" pointer. Also, consider using dummy nodes for the front, and possibly the rear of the list] Extend the solution so that it simulates a doubly linked list! (hint: You will need a third array to represent the "backward" pointers)
in java language import java.util.ArrayList;import java.util.Arrays; Write the method named mesh.* * Start with two ArrayLists of String, A and B, each with * its elements in alphabetical order and without any duplicates. * Return a new list containing the first N elements from the two * lists. The result list should be in alphabetical order and without * duplicates. A and B will both have a size which is N or more. * Your solution should make a single pass over A and B, taking * advantage of the fact that they are in alphabetical order, * copying elements directly to the new list.* * Remember, to see if one String is "greater than" or "less than" * another, you need to use the compareTo() method, not the < or > * operators. * * Examples:* mesh(["a","c","z"], ["b","f","z"], 3) returns ["a","b","c"]* mesh(["a","c","z"], ["c","f","z"], 3) returns ["a","c","f"]* mesh(["f","g","z"], ["c","f","g"], 3) returns ["c","f","g"]* * @param a an ArrayList of String in alphabetical order.*…
2 Write a java program. call it sortWords. Read from the command line a list of words, any number, from 1 to as many as the user wants. Store the words (strings) in an arraylist. Sort the list in alphabetical order. Print the list with a comma and space between each word. Words should be output in the SAME case as the user gives them. For an A make the sort be case insensitive AND remove the , from after the last word. example: java sortWords book car tree apple house --> apple, book, car, house, tree (The already existing answer on Chegg failed the codePost tests)
Using Java, code the following 1. Create an empty linked list that prints out the value Null 2. Create a linked list with 2 nodes and prints out the values of those nodes 3. Create a method that reverses the linked list with 2 nodes Example of code output: Original list: Null Reverse list: Null Original list: 1 2 Reverse list: 2 1
create a class called Dwarf that has a name (String) and a height (int). In addition, when Dwarfs are placed in a LinkedList and sorted, they will be sorted from tallest to shortest. import java.util.*; public class Main{ public static void main(String[] args) { ArrayList<Dwarf> l = new ArrayList<Dwarf>(); l.add(new Dwarf("Sleepy", 14)); l.add(new Dwarf("Dopey", 17)); l.add(new Dwarf("Doc", 9)); l.add(new Dwarf("Happy", 22)); l.add(new Dwarf("Sneezy", 29)); l.add(new Dwarf("Bashful", 11)); l.add(new Dwarf("Grumpy", 4)); Collections.sort(l); for (Dwarf d : l) System.out.println(d.getName()); }} output Sneezy Happy Dopey Sleepy Bashful Doc Grumpy
Consider the interface below:import java.util.NoSuchElementException; public interface MyList<E> { public int getSize(); public void insert(E data) throws ListOverflowException; public E getElement(E data) throws NoSuchElementException; public boolean delete(E data); // returns false if the data is not deleted in the list public boolean search(E data); // returns index of data, else -1 is return}a. Use an array object to store the elements of the list object. The program should be able to show its size, get element, delete, and search from the array. b. This array object will have a fixed size of five (5) and that an attempt to insert an element into the array when full will result to a ListOverflowException.
Consider the interface below:import java.util.NoSuchElementException; public interface MyList<E> { public int getSize(); public void insert(E data) throws ListOverflowException; public E getElement(E data) throws NoSuchElementException; public boolean delete(E data); // returns false if the data is not deleted in the list public boolean search(E data); // returns index of data, else -1 is return}a. Use an array object to store the elements of the list object. The program should be able to show its size, get element, delete, and search from the array. b. If the array is full and an element is to be inserted, a new array object with a size that is twice than the “old” array will be created. All the elements of the “old” array will be copied to the new array before inserting the new element.
Computer Science Write a program in the Java language that includes: 1. A class for books, taking into account the encapsulation and getter, setter. 2. Entering books by the user using Scanner 3. LinkedList class for: (Adding a new book - Inserting a book- Searching for a book using the ISBN Number - Viewing all books,delete book). 4. Serial number increases automatically with each book that is entered. 5. Printing the names of books is as follows: Serial - ISBN - Name - PubYear - Price - Notes. 6-Design a main menu that includes: • Add Book • Insert Book • Delete Book • Search . Display . Exit
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…