Exercise 2:Consider the following class:public class Sequence{private ArrayList values;public Sequence() { values = new ArrayList(); }public void add(int n) { values.add(n); }public String toString() { return values.toString(); }}Add a methodpublic Sequence merge(Sequence other)that merges two sequences, alternating ele-ments from both sequences. If one sequence is shorter than the other, then alternateas long as you can and then append the remaining elements from the longersequence. For example, if a is1 4 9 16and b is9 7 4 9 11then a.merge(b) returns the sequence1 9 4 7 9 4 16 9 11without modifying a or b.

Given Exercise 2: Consider the following class: public class Sequence private…

sider the following class: blic class Sequence private ArrayList values; public Sequence() { values new ArrayList(); } public void add(int n) { values.add(n); } public String toString() { return values.toString(); }

sider the following class: blic class Sequence private ArrayList values; public Sequence() { values new ArrayList(); } public void add(int n) { values.add(n); } public String toString() { return values.toString(); }

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter18: Stacks And Queues

Section: Chapter Questions

Problem 16PE: The implementation of a queue in an array, as given in this chapter, uses the variable count to...

See similar textbooks

Similar questions

Java programming Please implement the Book search(Object e). This method returns the object being search if not found return null Initial code to be completed: public class CollectionBooks { private ArrayList<Book> books; public CollectionBooks() { books = new ArrayList<Book>(); } public void add(String book,int bookId) { Book b=new Book(book,bookId); books.add(b); } public void printAll() { for(Book b:books){ System.out.println("Book Id: "+b.getId()); System.out.println("Book Name: "+b.getName()); } } public int count(){ return books.size(); } public Book search(Object e){ //your code here } public void remove(int index) { books.remove(index); }}
public class ShoppingListDriver{ public static void main(String[] args){ ShoppingList sl=new ShoppingList(3);sl.insert(null);sl.insert(new Item("Bread", "Carb Food", 2, 2.99));sl.insert(new Item("Seafood","Sea Food", -1, 10.99));sl.insert(new Item("Rice", "Carb Food",2, 19.99));sl.insert(new Item("Salad Dressings","Dessing", 2, 19.99));sl.insert(new Item("Eggs", "Protein",2, 3.99));sl.insert(new Item("Cheese","Protein", 2, 1.59));sl.insert(new Item("Eggs", "Protein",3, 3.99));sl.printNames();sl.print(); System.out.println("After removing Eggs:");sl.remove(new Item("Eggs","Protein",0,0));sl.printNames();sl.print(); }}
class Solution(object): def longestCommonPrefix(self, strs): result ="" for i in strs[0]: for j in strs[1]: for k in strs[2]: if i == j and i == k: result+=i if len(result) >0: return result else: return result IndexError: list index out of range for j in strs[1]: Line 5 in longestCommonPrefix (Solution.py) ret = Solution().longestCommonPrefix(param_1) Line 31 in _driver (Solution.py) _driver() Line 41 in <module> (Solution.py) can someone explain why this is wrong?
This class stores an ArrayList of Tile objects, sorts them, and returns them via .toString() import java.util.ArrayList; class Rack{ private ArrayList<Tile> tiles; public Rack() { tiles = new ArrayList<Tile>(); } public void addTile(Tile t) { tiles.add(t); } DO NOT CHANGE THE CODE ABOVE. ADD THE FOLLOWING METHODS: .toString() .sortHighToLow() You may also add any helper methods you want, such as swapvalues. Make sure to write the Selection Sort algorithm like in the class example, but using the Tile object's .compareTo method.
Java programming language I have to create a remove method that removes the element at an index (ind) or space in an array and returns it. Thanks! I have to write the remove method in the code below. i attached the part where i need to write it. public class ourArrayList<T>{ private Node<T> Head = null; private Node<T> Tail = null; private int size = 0; //default constructor public ourArrayList() { Head = Tail = null; size = 0; } public int size() { return size; } public boolean isEmpty() { return (size == 0); } //implement the method add, that adds to the back of the list public void add(T e) { //HW TODO and TEST //create a node and assign e to the data of that node. Node<T> N = new Node<T>();//N.mData is null and N.next is null as well N.setsData(e); //chain the new node to the list //check if the list is empty, then deal with the special case if(this.isEmpty()) { //head and tail refer to N this.Head = this.Tail = N; size++; //return we are done.…
The implementation of a queue in an array, as given in this chapter, uses the variable count to determine whether the queue is empty or full. You can also use the variable count to return the number of elements in the queue. On the other hand, class linkedQueueType does not use such a variable to keep track of the number of elements in the queue. Redefine the class linkedQueueType by adding the variable count to keep track of the number of elements in the queue. Modify the definitions of the functions addQueue and deleteQueue as necessary. Add the function queueCount to return the number of elements in the queue. Also, write a program to test various operations of the class you defined.
sortsearchassigncodeex1.java sort, search for a specific student package sortsearchassigncodeex1; import java.util.Scanner; import java.io.*; // // public class Sortsearchassigncodeex1 { // public static void fillArray(Scanner inputFile, int[] arrIn){ int indx = 0; //Complete code { arrIn[indx] = inputFile.nextInt(); indx++; } } //=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=- public static void displayArray(int[] arrIn){ for(int indx=0; indx<arrIn.length;indx++) System.out.printf("student %2d sID: %5d\n",(indx+1),arrIn[indx]); } //=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=- public static int searchArray(int[] arrIn, int sValue){ int retValue = -1; // if the value is not found method will return -1 for(int indx=0; //Complete code ;indx++) if(arrIn[indx] == sValue) retValue = indx; return retValue; }…
Computer Science Below there are 4 different ways of computing list reversal. One method does not work, why not? Comment each line of the reverse functions. Where does the reversal take place clearly indicate in your comments. #define reverse_method 3 #if reverse_method == 1 void DLinkedList::reverse() { DLinkedList temp; while (!empty()) { Elem s = front(); removeFront(); temp.addFront(s); } swap(*this, temp); } #elif reverse_method == 2 void DLinkedList::reverse() { DLinkedList temp; while (!empty()) { Elem s = front(); removeFront(); temp.addBack(s); } while (!temp.empty()) { Elem s = temp.front(); temp.removeFront(); addFront(s); } } #elif reverse_method == 3 void DLinkedList::reverse() { DLinkedList* temp = new DLinkedList; while (!empty()) { Elem s = front(); removeFront(); temp->addFront(s); } swap(*this, *temp); } #elif reverse_method == 4 void DLinkedList::reverse() { DLinkedList temp; while (!empty()) { Elem s = front(); removeFront(); temp.addFront(s); } while…
public class CustomLinkedList { public static int findMax(IntNode headObj) { /* Type your code here */ } public static void main(String[] args) { IntNode headObj; IntNode currObj; IntNode lastObj; int i; int max; // Create head node headObj = new IntNode(-1); lastObj = headObj; // Add nodes to the list for (i = 0; i < 20; ++i) { currObj = new IntNode(i); lastObj.insertAfter(currObj); lastObj = currObj; } max = findMax(headObj); System.out.println(max); }}
Find the index of the first negative numberIntegerListUtils.java import java.util.ArrayList; public class IntegerListUtils { /** * Finds the index of the first negative number in the list. * * @param numbers a list of integers * @return the index of the first negative number, or -1 if no negative number found */ public static int findIndexOfFirstNegative(ArrayList<Integer> numbers) { // complete this method }}
Enhanced selection sort SelectionSortDemo.java package chapter7; /** This program demonstrates the selectionSort method in the ArrayTools class. */ public class SelectionSortDemo { public static void main(String[] arg) { int[] values = {5, 7, 2, 8, 9, 1}; // Display the unsorted array. System.out.println("The unsorted values are:"); for (int i = 0; i < values.length; i++) System.out.print(values[i] + " "); System.out.println(); // Sort the array. selectionSort(values); // Display the sorted array. System.out.println("The sorted values are:"); for (int i = 0; i < values.length; i++) System.out.print(values[i] + " "); System.out.println(); } /** The selectionSort method performs a selection sort on an int array. The array is sorted in ascending order. @param array The array to sort. */ public static void selectionSort(int[] array) { int startScan, index, minIndex, minValue; for (startScan = 0; startScan < (array.length-1); startScan++) { minIndex = startScan; minValue =…
PROBLEM STATEMENT: In this problem you will need to return the first elementfrom the ArrayList. import java.util.ArrayList;public class RetrieveSpecifiedElement{public static int solution(ArrayList<Integer> list){// ↓↓↓↓ your code goes here ↓↓↓↓return 0; Can you help me with this question The language is Java