Write a method called swapPairs that swaps pairs in a Linked List of numbers, constructing a Linked List that contains the values swapped. For example, suppose that a variable called list stores the following values: [1, 2, 3, 4, 5, 6, 7, 8] This list has four pairs: [1, 2, 3, 4, 5, 6, 7, 8] If the following call is made: list.swapPairs (); then after the call, the list would store the following values: list: [2, 1,4,3,6,5,8,7] For this question you do not have access to already-written methods in the LinkedList class other than getHead(), getNext(), setHead(ListNode n), and setNext(ListNode n)

Write a method called swapPairs that swaps pairs in a Linked List of numbers, constructing a Linked List that contains the values swapped. For example, suppose that a variable called list stores the following values: [1, 2, 3, 4, 5, 6, 7, 8] This list has four pairs: [1, 2, 3, 4, 5, 6, 7, 8] If the following call is made: list.swapPairs (); then after the call, the list would store the following values: list: [2, 1,4,3,6,5,8,7] For this question you do not have access to already-written methods in the LinkedList class other than getHead(), getNext(), setHead(ListNode n), and setNext(ListNode n)

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

Attach screenshot as need to creating a oddIterator method that returns elements at odd indices. I it.
n most personal computers, the largest integer is 32,767 and the largest long integer is 2,147,483,647. Some applications, such as the national debt, may require an unbounded integer. One way to store and manipulate integers of unlimited size is by using a linked list. Each digit is stored in a node of the list. For example, the figure below shows how we could store a five-digit number in a linked list.39While the linked list in the figure is represented as moving from right to left, remember that there is no physical direction in a linked list. We represent it this way to assist us inunderstanding the problem.To add two numbers, we simply add the corresponding digit in the same location in their respective linked lists with the carry from the previous addition. With each addition, if the sum is greater than 10, then we need to subtract ten and set the carry to one. Otherwise, the carry is set to zero.Write a program to add two integer linked lists. Design your solution so that the…
19. Given the following linked list: LinkedList list = new LinkedList(); And this code: 1. list.add(1.5); 2. list.addFirst(11.3); 3. list.add(6.2); 4. list.add(3.4); 5. list.addLast(4.8); 6. list.add(7.4); 7. list.remove(1.5); 8. list.remove(3.4); 9. list.removeFirst); 10. System.out.println(list.getFirst(); Answer the following questions regarding the code: a) What is the list after line 6? b) What is the list after line 9? c) Line 10 gives what value?
JAVA plese Implement the indexOf method in the LinkedIntegerList class public int indexOf(int value); /** * Returns whether the given value exists in the list. * @param value - value to be searched. * @return true if specified value is present in the list, false otherwise. */ } public static void main(String[] args) { // TODO Auto-generated method stub SimpleIntegerListADT myList = null; System.out.println(myList); for(int i=2; i<8; i+=2) { myList.add(i); } System.out.println(myList.indexOf(44));
java In this assignment you will swap a position in an array list with another. swap() gets 3 arguments, an Arraylist, a position, and another position to swap with. Example swap(["one","two","three"],0,2) returns:["three","two","one"] public static ArrayList<String> swap(ArrayList<String> list,int pos1,int pos2) public static void main(String[] args) { Scanner in = new Scanner(System.in); int size = in.nextInt(); int pos1 = in.nextInt(); int pos2 = in.nextInt(); ArrayList<String> list = new ArrayList<>(); for(int i=0; i < size; i++) { list.add(in.next()); } System.out.println(swap(list, pos1, pos2)); } }
Java
Write a function in C++ that takes a pointer to an array as one parameter, and the length of the array as the second parameter. The function shall calculate the longest contiguous streak of odd numbers present in the array. You do not need to handle negative length arrays. Use Example: int. main(){ int array[] = {1,2,3,4,5,7,9}; std::cout << "Number Odd: << numOdd(array, 7); std::cout << std::endl; } Output: 3
Java's LinkedList provides a method listlterator(int index) returning a Listlterator for a list. Declare a variable of LinkedList of integer numbers and write a fragment of Java code to compute and print the sum of the numbers on the list. Do not write code to insert elements to the list and assume that the list already has elements on it. You must only use an iterator obtained from the list (you can not use the get(int index) method) .
Examine the following code: ArrayList<String> list = new ArrayList<String>(10) ; list.add("A"); list.add("B"); list.add("C"); list.add(0, "E" ); What element will be at index 2 of the list? What list will be printed after executing the method list.remove(2);
The following procedure removes the first half of the list passed as a parameter: public static void foo( List myList) { int theSize = myList.size( ) / 2; for( int i = 0; i < theSize; i++ ) myList.remove( 0 ); } What is the running time of foo if myList is a LinkedList? e(1) O e(n Ig n) O(n) O e(n³) e(n?)
Assume you have a method (shown below) inside the single linked list class, what does this method do? private E remove () { Node temp = head; if (head != nulI) { head = head.next; size--; return temp.data } else return null; } (A Remove the first node in the list and return the data of the deleted node or null if the list is empty. Remove the node after the node referenced by temp and return the data of the deleted node or null if the list is (в empty. Remove all the nodes of the linked list and return the data of the last node deleted or null if the list is empty.