implement a method which takes two LinkedIntLists as input and returns a new list containing all the items of the first followed by all the items of the second. bon't modify the input lists; use the new keyword to create new objects instead. *Returns a list consisting of the integers of a followed by the integers. * of n. Does not modify items of A or B. */ public static LinkedIntList concatenate (LinkedIntList a, LinkedIntList b) { }

implement a method which takes two LinkedIntLists as input and returns a new list containing all the items of the first followed by all the items of the second. bon't modify the input lists; use the new keyword to create new objects instead. Returns a list consisting of the integers of a followed by the integers. of n. Does not modify items of A or B. */ public static LinkedIntList concatenate (LinkedIntList a, LinkedIntList b) { }

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

please follow instructions correctly. You are required to complete the LinkedList class. This class is used as a linked list that has many methods to perform operations on the linked list. To create a linked list, create an object of this class and use the addFirst or addLast or add(must be completed) to add nodes to this linked list. Your job is to complete the empty methods. For every method you have to complete, you are provided with a header, Do not modify those headers(method name, return type or parameters). You have to complete the body of the method. package chapter02;  public class LinkedList {  protected LLNode list;   public LinkedList()  {  list = null;  }   public void addFirst(T info)  {  LLNode node = new LLNode(info);  node.setLink(list);  list = node;  }   public void addLast(T info)  {  LLNode curr = list;   LLNode newNode = new LLNode(info);  if(curr == null)  {  list = newNode;  }  else…
Create a DeleteDuplicatesclass which consists of a deleteDuplicates method which takes the nums list as its parameter. Implement the deleteDuplicates method: Check if the input list is null or empty, and return an empty list if so. Initialize a pointer i to keep track of the unique elements. Use a for loop to Iterate through the list using another pointer j which starts at j=1 and goes until j=nums.size(); If the current element at j is not equal to the previous element at i using !nums.get(i).equals(nums.get(j), increment i and set the current element at j to the new position at i using nums.set(i, nums.get(j)). After the for loop ends, return the sublist from the beginning to i + 1, as this will contain all unique elements. Call the deleteDuplicates method with the sample list as argument: Call the deleteDuplicates method and pass the nums list as argument Store the result in a variable result Print the result to the console. Input: [1, 1, 2, 3, 3,…
Write a program that creates a linked list to represent details of students. • SID (for Student ID) • Name • Address • Age • Gender Your program must also display a menu to perform the following tasks: • Create a linked list. The method to create a linked list makes use of the method insertFirst() or insertLast() or insertOrdered() • Insert new nodes to the linked list. • Search for details pertaining to a particular student. • Delete details of a particular student. • Find number of nodes in the linked list. • Display information pertaining to all students. The menu options should be as follows: 1. Create linked list 2. Add new student 3. Search for a student 4. Delete a student 5. Find number of students 6. Print student details 7. Exit
Create an addToHead(int) method that inserts a new integer at the beginning of the linked list. In a class called IntReverse, read in numbers from the user (until end of file or until something other than a number is entered). Insert the numbers to the head of the linked list. Print the list out. Output: > java ListReverseEnter numbers: 1 2 3 4 5 6 7 8 9 doneList reversed: 9 8 7 6 5 4 3 2 1
2. Linked ListsCreate a class called OurLinkedList and implement the following methods:1- Write a method called add() that takes a linked list of integers along an integerand adds that integer to the list.2- Write a method called print() that takes a linked list of integers and prints all itselements.3- Write a method called deleteAll() that takes a linked list of integers along an integer which deletes all the occurrences of this number in the linked list. So if the item is 7 and the list is [1,3,7,4,3,7,2], the result is [1,3,4,3,2].4- Write a method called indexesOf() that takes a linked list of integers along withan integer and returns a list of the positions of all the occurrences of that integer.So if the integer is 5 and the list is [2,4,5,8,1,5,3], the result is [2,5].
Import the ArrayList and List classes from the java.util package to create a list of phone numbers and also import the HashSet and Set classes from the java.util package to create a set of unique prefixes. Create a class called PhoneNumberPrefix with a main method that will contain the code to find the unique prefixes. Create a List called phoneNumbers and use the add method to add several phone numbers to the list. List<String> phoneNumbers = new ArrayList<>(); phoneNumbers.add("555-555-1234"); phoneNumbers.add("555-555-2345"); phoneNumbers.add("555-555-3456"); phoneNumbers.add("444-444-1234"); phoneNumbers.add("333-333-1234"); Create a Set called prefixes and use a for-each loop to iterate over the phoneNumbers list. For each phone number, we use the substring method to extract the first 7 characters, which represent the prefix, and add it to the prefixes set using the add method. Finally, use the println method to print the prefixes set, which will contain all of…
You are going to implement a program that creates an unsorted list by using a linked list implemented by yourself. NOT allowed to use LinkedList class or any other classes that offers list functions. It is REQUIRED to use an ItemType class and a NodeType struct to solve this homework. The “data.txt” file has three lines of data 100, 110, 120, 130, 140, 150, 160 100, 130, 160 1@0, 2@3, 3@END You need to 1. create an empty unsorted list 2. add the numbers from the first line to list using putItem() function. Then print all the current keys to command line in one line using printAll(). 3. delete the numbers given by the second line in the list by using deleteItem() function. Then print all the current keys to command line in one line using printAll().. 4. putItem () the numbers in the third line of the data file to the corresponding location in the list. For example, 1@0 means adding number 1 at position 0 of the list. Then print all the current keys to command line in one…
Given main() in the ShoppingList class, define an insertAtEnd() method in the ItemNode class that adds an element to the end of a linked list. DO NOT print the dummy head node. Ex. if the input is: 4 Kale Lettuce Carrots Peanuts where 4 is the number of items to be inserted; Kale, Lettuce, Carrots, Peanuts are the names of the items to be added at the end of the list. The output is: Kale Lettuce Carrots Peanuts public class ItemNode { private String item; private ItemNode nextNodeRef; // Reference to the next node public ItemNode() { item = ""; nextNodeRef = null; } // Constructor public ItemNode(String itemInit) { this.item = itemInit; this.nextNodeRef = null; } // Constructor public ItemNode(String itemInit, ItemNode nextLoc) {…
Create an ordered link list to hold Strings. Name it OList.javaImplement only the following methods: Add( String value )*Adds the value in the list in the correct location. Remove( String value )*Removes the value from the list toString(), Display(), size(), a constructor method You may add some private “helper” methodsIn your test driver create a list add a few items in randomorder and display the list to see that the values are inascending alphabetic order.
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)
Using Java programming language create a linked list named Cars with four elements: "SUV cars", "Pickup cars", "Sport cars", and "Sedan cars". Apply the following activities on the code you’ve created and provide screen shot of each result: Add a new element “Classic car” at the beginning of the linked list using iterator. Add a new element “Economic cars" after the element "Sedan Cars" using iterator. Print the LinkedList backward from the last element to the first element using hasPrevious()
1- A new static method with one parameter which is a head node for a linked list of integers, the method should create a new linked list which is equivalent to the original list of integers but with all repetitions removed, the method's return value is a head reference for the new list. this is what I have but it's not removing repetitions. public static IntLinkedBag removeRepetition (IntLinkedBag b1) { IntNode next; IntNode head = null; LinkedList<Integer> s = new LinkedList<>(); IntNode new_list = new IntNode(0, null); IntNode now = head; IntNode prev = new_list; while (now!= null) { int x = now.data; if (s.contains(x)) { new_list = new_list.next; } else { s.add(x); new_list.next = new IntNode(x, now); new_list = new_list.next; } now = now.next; } return b1; } }…