Write a static method named negListFromQueue that takes two parameters: an array-based unbounded queue of integers and an array-based unsorted list of integers. The method should move all negative integers from the queue, if any exist, into the list. Example: if the parameter queue contains: -2 -7 3 8 -10 14 After calling the method negListFromQueue, the content of queue and list became: queue: 3 8 14 list: -2 -10 -7

Write a static method named negListFromQueue that takes two parameters: an array-based unbounded queue of integers and an array-based unsorted list of integers. The method should move all negative integers from the queue, if any exist, into the list. Example: if the parameter queue contains: -2 -7 3 8 -10 14 After calling the method negListFromQueue, the content of queue and list became: queue: 3 8 14 list: -2 -10 -7

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

Please Use Java language Write a method “mergeQueueStack” that takes a queue as a parameter of type: Queue of integers and a stack as a second parameter of type: Deque of integers Remove all the items from the queue and remove all the items from the stack then add them to a LinkedList by alternating between an item from queue then an item from stack. Don’t assume initially both the queue and the stack have the same number of items. The method should return the linked list of type integers. Example: If queue has : 1,2,3,4,5 and stack has 10, 20, 30 (where 10 is at top of the stack) then the linkedList should contain: 1,10,2,20,3,30,4,5
7. Given a Queue Q, write a non-generic method that finds the maximum element in the Queue. You may use only queue operations. No other data structure can be used other than queues. The Queue must remain intact after finding the maximum value. Assume the class that has the findMax method implements Comparable. The header of the findMax method: public Comparable findMax(Queue q)
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.
In Java and C++ create a Generic ArrayList where all elements in the ArrayList must be of the same type. In every node of the linked list the size of the array it contains must be at least double the size of the previous node’s array. Between O(1) time and O(n) time. add(int index, E e) clear() contains(E e) ensureCapacity(int minCapacity) isEmpty() get(int index) remove(int index) size()
In python. Write a LinkedList class that has recursive implementations of the add and remove methods. It should also have recursive implementations of the contains, insert, and reverse methods. The reverse method should not change the data value each node holds - it must rearrange the order of the nodes in the linked list (by changing the next value each node holds). It should have a recursive method named to_plain_list that takes no parameters (unless they have default arguments) and returns a regular Python list that has the same values (from the data attribute of the Node objects), in the same order, as the current state of the linked list. The head data member of the LinkedList class must be private and have a get method defined (named get_head). It should return the first Node in the list (not the value inside it). As in the iterative LinkedList in the exploration, the data members of the Node class don't have to be private. The reason for that is because Node is a trivial class…
Write a static method named SmallestEvenStackQueueToList that takes two parameters: an array-based unbounded queue of integers as its first parameter and an array-based bounded stack of integers as its second parameter. The method should find the smallest even integers from all corresponding values in the stack and queue and save them into an object of type ArrayUnsortedList and return this object from the method. If two corresponding elkments in the stack and queue are odd integers, then add the value -1 to the unsorted list. Assume that stack and queue have the same size. Examplel: if the queue has: 1 5 4 4 9 8 10 If the stack has: 4 3 10 9 5 20 Then the unsorted list has: 4 -1 4 4 -1 10 The stack and queue must become empty after calling the method. //-----Paste SmallestEvenStackQueueToList code below this line 2.
Java Only Do Method, I will give LinkedList Implementation Write a method checkForEquality to be included in class KWLinkedList that does not have any parameter. Assume the list is having even number of nodes. The method returns true if the first half of the list is equal to the second half of the list in the reverse order, otherwise it returns false. If the list is empty, the method returns false; import java.util.NoSuchElementException;/** Implementation of the interface StackInt using a linked list. The* top element of the stack is in the first (front) node of the linked list.*/public class LinkedStack<E> implements StackInt<E>{ /** Node: inner class to create nodes for linked list based stack. */private static class Node<E>{// Data Fieldsprivate E data;private Node<E> next; // The reference to the next node. // Constructors/*** Creates a new node with a null next field.* @param dataItem The data to be stored in the node*/private Node(E dataItem){data =…
If an array of size 6 is used to implement a circular queue, and the current values of rear and front are O and 3 respectively, when one element is removed from the queue and two more elements are added, what are the values of rear and front, respectively? O 1, 5 O 4, 2 5, 1 O 2, 3 None of the above
The regular queue is a FIFO structure, meaning that you can only enqueue at the rear and dequeue at the front. Suppose that the dequeue operation can also be performed at the rear (so you can remove and return the last element on the queue), which of the following describes the correct and efficient way of using a linked list to implement this queue? OUsing a singly linked list with a reference to the head only, the dequeue method traverses it, stops at the last node and removes it. O Using a singly linked list with a reference to the head only, the dequeue method traverses it, stops at the second to last node and removes the last node. O Using a singly linked list with references that point to the first and the last nodes respectively, the dequeue method removes the last node via the corresponding reference. OUsing a doubly linked list with references that point to the first and the last nodes respectively, the dequeue method can remove the last node via the corresponding reference. O…
Write a Java program which stores three values by using doubly linked list.- Node class4. stuID, stuName, stuScore, //data fields5. constructor6. update and accessor methods- Singly linked list class which must has following methods:4. head, tail, size// data fields5. constructor6. update and accessor methodsa. getSize() //Returns the number of elements in the list.b. isEmpty( ) //Returns true if the list is empty, and false otherwise.c. getFirstStuID( ), getStuName( ), getFirstStuScore( )d. addFirst (stuID, stuName, stuScore)e. addLast(stuID, stuName, stuScore)f. removeFirst( ) //Removes and returns the first element of the list.g. removeLast( ) //Removes and returns the first element of the list.h. displayList( ) //Displays all elements of the list by traversing the linked list.- Test class – initialize a doubly linked list instance. Test all methods of doubly linked list class.
Write a Java program which stores three values by using singly linked list.- Node class1. stuID, stuName, stuScore, //data fields2. constructor3. update and accessor methods- Singly linked list class which must has following methods:1. head, tail, size// data fields2. constructor3. update and accessor methodsa. getSize() //Returns the number of elements in the list.b. isEmpty( ) //Returns true if the list is empty, and false otherwise.c. getFirstStuID( ), getStuName( ), getFirstStuScore( )d. addFirst(stuID, stuName, stuScore)e. addLast(stuID, stuName, stuScore)f. removeFirst ( ) //Removes and returns the first element of the list.g. displayList( ) //Displays all elements of the list by traversing the linked list.- Test class – initialize a singly linked list instance. Test all methods of singly linked list class
This is a java data structures question Given a Queue Q, write a non-generic method that finds the maximum element in the Queue. You may use only queue operations. No other data structure can be used other than queues. The Queue must remain intact after finding the maximum value. Assume the class that has the findMax method implements Comparable. The header of the findMax method: public Comparable findMax(Queue q) {