We have been working on a software where we use a class which can hold collections of valus of arbitray data types, and we started to implement a generic colle ction with linked ist. Now, we newd to add more functionality as explained in the comments of methods below You are given the code skeleton below. fn the blanks to make the code achieve the expected functionality Note: The methods.and varables from the finol exam (count/InsertAt. /RemoveFrom./GetPreviousNode/etc.) do notexist.belowthe.code below bove work on its own as it is with the given voriables. Keep all variables consistent public class GenericCollection { private Node first; private Node last; private int count; // this is the number of Nodes in the collection private class Node { T data; Node next; public GenericCollection clone() { //this method is used to create a copy //of the GenericCollection object; it //returns a new GenericCollection //object with exactly the same values //on its nodes as the current one. //You must create new Node objects //for the new GenericCollection.
We have been working on a software where we use a class which can hold collections of valus of arbitray data types, and we started to implement a generic colle ction with linked ist. Now, we newd to add more functionality as explained in the comments of methods below You are given the code skeleton below. fn the blanks to make the code achieve the expected functionality Note: The methods.and varables from the finol exam (count/InsertAt. /RemoveFrom./GetPreviousNode/etc.) do notexist.belowthe.code below bove work on its own as it is with the given voriables. Keep all variables consistent public class GenericCollection { private Node first; private Node last; private int count; // this is the number of Nodes in the collection private class Node { T data; Node next; public GenericCollection clone() { //this method is used to create a copy //of the GenericCollection object; it //returns a new GenericCollection //object with exactly the same values //on its nodes as the current one. //You must create new Node objects //for the new GenericCollection.
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
Related questions
Question
Please write the codes in Java about the instructions.
![We have been working on a software where we use a class which can hold collections of values of arbitrary
data types, and we started to implement a genericcolle ction with linked ist. Now, we nesd to add more
functionality as explained in the comments of methods below You are given the code skeleson below, fl in
the blanks to make the code achieve the expected functionality. Note: The methods and variahles from the
final exam (count/InsertAt/RemoveFrom. /GetPreviousNode/etc.) do notexistbelow, he.code below shovt
work on its own as it is with the given variables. Keep all variables consistent
public class Genericcollection<T> {
private Node first;
private Node last;
private int count;
// this is the number of Nodes in the collection
private class Node {
T data;
Node next;
public GenericCollection<T> clone() {
//this method is used to create a copy
//of the Genericcollection object; it
//returns a new Generi CCollection
//object with exactly the same values
//on its nodes as the current one.
//You must create new Node objects
//for the new GenericCollection.](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2Fe4ca2a29-b559-4db7-b2e7-025a5cd5277e%2F45f09ea3-d179-4916-9b88-d657d6181f4f%2F0x4bck_processed.jpeg&w=3840&q=75)
Transcribed Image Text:We have been working on a software where we use a class which can hold collections of values of arbitrary
data types, and we started to implement a genericcolle ction with linked ist. Now, we nesd to add more
functionality as explained in the comments of methods below You are given the code skeleson below, fl in
the blanks to make the code achieve the expected functionality. Note: The methods and variahles from the
final exam (count/InsertAt/RemoveFrom. /GetPreviousNode/etc.) do notexistbelow, he.code below shovt
work on its own as it is with the given variables. Keep all variables consistent
public class Genericcollection<T> {
private Node first;
private Node last;
private int count;
// this is the number of Nodes in the collection
private class Node {
T data;
Node next;
public GenericCollection<T> clone() {
//this method is used to create a copy
//of the Genericcollection object; it
//returns a new Generi CCollection
//object with exactly the same values
//on its nodes as the current one.
//You must create new Node objects
//for the new GenericCollection.
![public GenericCollection<T> cut(int k) {
//this method cuts the current
//GenericCollection object such
//that only the first k Nodes from
//the start remains in this object
//and the rest is returned as a new
//Genericcollection object in the
// same order. You don't need to
//create new Node objects, you can
//reuse the objects from the former
//for the latter. Error checking for
//the number of nodes is not needed.
//
llestion<T> otherObj) {
//this method is used
Collection o](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2Fe4ca2a29-b559-4db7-b2e7-025a5cd5277e%2F45f09ea3-d179-4916-9b88-d657d6181f4f%2F1yggv57_processed.jpeg&w=3840&q=75)
Transcribed Image Text:public GenericCollection<T> cut(int k) {
//this method cuts the current
//GenericCollection object such
//that only the first k Nodes from
//the start remains in this object
//and the rest is returned as a new
//Genericcollection object in the
// same order. You don't need to
//create new Node objects, you can
//reuse the objects from the former
//for the latter. Error checking for
//the number of nodes is not needed.
//
llestion<T> otherObj) {
//this method is used
Collection o
Expert Solution
![](/static/compass_v2/shared-icons/check-mark.png)
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 4 steps with 1 images
![Blurred answer](/static/compass_v2/solution-images/blurred-answer.jpg)
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Recommended textbooks for you
![Database System Concepts](https://www.bartleby.com/isbn_cover_images/9780078022159/9780078022159_smallCoverImage.jpg)
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
![Starting Out with Python (4th Edition)](https://www.bartleby.com/isbn_cover_images/9780134444321/9780134444321_smallCoverImage.gif)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
![Digital Fundamentals (11th Edition)](https://www.bartleby.com/isbn_cover_images/9780132737968/9780132737968_smallCoverImage.gif)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
![Database System Concepts](https://www.bartleby.com/isbn_cover_images/9780078022159/9780078022159_smallCoverImage.jpg)
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
![Starting Out with Python (4th Edition)](https://www.bartleby.com/isbn_cover_images/9780134444321/9780134444321_smallCoverImage.gif)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
![Digital Fundamentals (11th Edition)](https://www.bartleby.com/isbn_cover_images/9780132737968/9780132737968_smallCoverImage.gif)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
![C How to Program (8th Edition)](https://www.bartleby.com/isbn_cover_images/9780133976892/9780133976892_smallCoverImage.gif)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
![Database Systems: Design, Implementation, & Manag…](https://www.bartleby.com/isbn_cover_images/9781337627900/9781337627900_smallCoverImage.gif)
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
![Programmable Logic Controllers](https://www.bartleby.com/isbn_cover_images/9780073373843/9780073373843_smallCoverImage.gif)
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education