Homework Help is Here – Start Your Trial Now!
Engineering
Computer Science
java code, my doublylinkedlist has a dummy head and tail, index 0 starts at element after the head and ends at before tail. size doesn't include dummy nodes

java code, my doublylinkedlist has a dummy head and tail, index 0 starts at element after the head and ends at before tail. size doesn't include dummy nodes

Database System Concepts
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
icon
Related questions
Question

java code, my doublylinkedlist has a dummy head and tail, index 0 starts at element after the head and ends at before tail. size doesn't include dummy nodes

 

Part 5 (EC) - Extending DoublyLinkedList In this part, you will implement two methods that work with the doubly-linked list. public void removeMultipleOf(int base) Remove nodes whose index is a multiple of base before removal. To check whether an index is a multiple of base, you can calculate whether index mod base equals to 0. For example, if the base is 3, you should remove all elements at index 0, 3, 6, 9, ... @throws IllegalArgumentException - base is less than 1 public void swapSegment(DoublyLinkedList other, int splitIndex) Given another linked list (other), swap the nodes (not just elements, which means you need to swap the references) between index 0 and splitlndex (inclusive) in both lists. Make sure you update the instance variables of both lists properly. Example: Before swap: this -> [0, 1, 2, 3, 4], other -> [9, 8, 7, 6, 5, 4, 3], splitlndex -> 2 After swap: this -> [9, 8, 7, 3, 4], other -> [0, 1, 2, 6, 5, 4, 3] You can assume other is not null, and the size of both lists is greater than splitlndex + 1 (e.g. if splitlndex is 2, you can assume the size of both lists greater than 3).
Transcribed Image Text:Part 5 (EC) - Extending DoublyLinkedList In this part, you will implement two methods that work with the doubly-linked list. public void removeMultipleOf(int base) Remove nodes whose index is a multiple of base before removal. To check whether an index is a multiple of base, you can calculate whether index mod base equals to 0. For example, if the base is 3, you should remove all elements at index 0, 3, 6, 9, ... @throws IllegalArgumentException - base is less than 1 public void swapSegment(DoublyLinkedList other, int splitIndex) Given another linked list (other), swap the nodes (not just elements, which means you need to swap the references) between index 0 and splitlndex (inclusive) in both lists. Make sure you update the instance variables of both lists properly. Example: Before swap: this -> [0, 1, 2, 3, 4], other -> [9, 8, 7, 6, 5, 4, 3], splitlndex -> 2 After swap: this -> [9, 8, 7, 3, 4], other -> [0, 1, 2, 6, 5, 4, 3] You can assume other is not null, and the size of both lists is greater than splitlndex + 1 (e.g. if splitlndex is 2, you can assume the size of both lists greater than 3).
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Knowledge Booster
Linked List Representation
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.
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
Database System Concepts
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)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education
SEE MORE TEXTBOOKS