Guidelines The input and the output of the program will be from & to files.For the input file: o The program will take the file name as an argument (args [0]).For the output file: o The program will take the output file name as an argument (args [1]).You are free to explore the input and output methods as you develop the solution to the assignment; but before the submission, you have to prepare all the programs to take the input from a file in (args [0]) and print the output to the file in (args [1]).Attached to this assignment are sample input and output files for each question. Those files have the same format as the files that your program will be tested through. So, please adhere to the format in those files, and make sure that your code can read and write the data given in that format. Question 2 (20 + 20 = 40 Marks)You are asked to take as input a list of integers that went through several reverseoperations, and your task is to retrieve the original list, you may use java.util.Stack andjava.util.LinkedList as helpers.The operations were as follows:Select each subpart of the list that contain even integers only.For example, if the list was {5,20,8,7,12,18}, then the selected subparts willbe {20,8}, {12,18}.Reverse the selected subpart such as {8,20} and {18,12}.The output should be the original list.| Sample InputSample Output924 18 2 35 7 9 12 62 18 24 357 96 12As it is shown in the input sample, the first line will have an integer indicating thenumber of the elements in the list followed by the second line which has the list of items.In the sample input, 9 represents the number of items in the list.As you can see, the subparts that contains only even integers in the given list are{2,18,24} and {6,12}. The corresponding output (which is the original list) is shown inthe sample output section.

Q. The input and the output of the program will be from & to files. For the input file: o The…

will take the output file name as an argument (args [1]). You are free to explore the input and output methods as you develop the solution to the assignment; but before the submission, you have to prepare all the programs to take the input from a file in (args [0]) and print the output to the file in (args [1]).

will take the output file name as an argument (args [1]). You are free to explore the input and output methods as you develop the solution to the assignment; but before the submission, you have to prepare all the programs to take the input from a file in (args [0]) and print the output to the file in (args [1]).

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 16SA

See similar textbooks

Similar questions

** IN JAVA ** write code java to create a singly linked list, with inserting in different ways and deleting in different ways - please write the comment so that I can understand the code - the solution contains 3 codes: SLL SLL NODE LINKED LIST THANK YOU!
Using java, write an easier version of a linked list with only a couple of the normal linked list functions and the ability to generate and utilize a list of ints. The data type of the connection to the following node can be just Node, and the data element can be just an int. You will need a reference like (Java) or either a reference to the first node, as well as one to the last node. (Answer the following questions) 1) Create a method or function that accepts an integer, constructs a node with that integer as its data value, and then includes the node to the end of the list. If the new node is the first one, this function will also need to update the reference to the first node. This function will need to update the reference to the final node. Consider how to insert the new node following the previous last node, and keep in mind that the next reference for the list's last node should be null. 2) Create a different method or function that iteratively explores the list, printing…
JAVA please Given main() in the ShoppingList class, define an insertAtEnd() method in the ItemNode class that adds an element to the end of a linked list. DO NOT print the dummy head node. Ex. if the input is: 4 Kale Lettuce Carrots Peanuts where 4 is the number of items to be inserted; Kale, Lettuce, Carrots, Peanuts are the names of the items to be added at the end of the list. The output is: Kale Lettuce Carrots Peanuts Code provided in the assignment ItemNode.java:
Describe a situation where you may wish to create a link list of ITERATORS. Is it possible to create a link list of various types of iterators? For example a list with list iterators, map iterators, and set iterators?
Select true or false for the statements below. Explain your answers if you like to receive partial credit 4) Given a stack implemented as a standard linked list (only a head pointer) with O(1)push and O(1) pop, and the following functions are performed in sequence:Push(“Charmander”), Push(“Squirtle”), Push(“Bulbasaur”), Pop(), Push(“Larvitar”),Push(“Eevee”), Pop(), Pop()Which of the following is true after all the functions are executed?a. Charmander and Squirtle will be the only elements left on the stackb. The head node will be pointing to Charmanderc. If you Push(“Pikachu”), it will be the last node of the linked list
Hello. Please add a toString() function to the Java class implementation of the singly-linked list which returns the contents of the singly-linked list. Also, does Java have a built-in class that implements singly-linked lists? Thank you. public class SinglyLinkedList<E>{ private static class Node<E> { private E element; private Node<E> next; public Node(E e, Node<E> n) { element = e; next = n; } public E getElement() { return element;} public Node<E> getNext() { return next;} public void setNext(Node<E> n) { next = n;} } private Node<E> head = null; private Node<E> tail = null; private int size = 0; public SinglyLinkedList() {} public int size() { return size;} public boolean isEmpty() { return size == 0;} public E first() { if(isEmpty()) return null; return head.getElement(); } public E last() {…
Can anyone please solve this question asap ? Thank yoyuIn this question, you are required to implement singly linked list and its concepts to solve the problems of a departmental store described in the scenario given below:A departmental store has a variety of products to sell. Each product type has a unique ID and price associated with it (for example soaps can have an ID of 1 and price of 50 etc.). A customer comes to the store and starts putting items in his/her shopping cart. Once all theitems have been placed in the shopping cart, the customer then proceeds to checkout but before that, he/she will sort (in ascending order of IDs) the shopping cart’s items and proceed to remove all the duplicate items from the shopping cart, that is if two soaps have been added to the cart, only 1 will be kept. At the checkout counter, he/she will then remove items from the cart by removing from the end of the shopping cart (linked list). A bill for that customer is then generated and printed.You…
Please code this question in Java according to the function attached in picture. Given two numbers represented by a linked list, where each node contains a single digit. The digits are stored in reverse order, such that the 1's digit is at the head of the list. Write a function that adds the two numbers and return the sum as linked list: Example : Input : (7-> 1 -> 6) + (5-> 9-> 2). That is 617 + 295 = 912 Output : 2-> 1 -> 9 Expected time complexity : O(m+n), where m and n are no. of nodes in first and second linked list respectively.
Think about the following example: A computer program builds and modifies a linked list like follows:Normally, the program would keep tabs on two unique nodes, which are as follows: An explanation of how to use the null reference in the linked list's node in two common circumstances
JAVA PROGRAMMING Q4.1: You have two sequences of mutually-comparable items to sort: The sequences are identical in terms of their sizes, their items, and the current (unsorted) order of those items. One sequence is in an array and the other is in a linked list. For the array and the link list, make an argument for why the quick sort would be best for one and the merge sort for the other. In the identified situation, give a quantitative answer based on big-O and other technical factors, not just a qualitative answer. Address the specifics of the two algorithms -- their operations, time efficiency, money use, etc. Assume no optimization Q4.2: Explain and/or illustrate the specific changes made in each pass of an Insertion Sort on the following data: 47 4 22 13 9 12
Write your own functions to create, insert nodes (both from the front and the end of the list), delete nodes, count the number of nodes, display all the nodes, display a specific node for the linked list. C++ and Java
Java Given main() in the ShoppingList class, define an insertAtEnd() method in the ItemNode class that adds an element to the end of a linked list. DO NOT print the dummy head node. Ex. if the input is: 4 Kale Lettuce Carrots Peanuts where 4 is the number of items to be inserted; Kale, Lettuce, Carrots, Peanuts are the names of the items to be added at the end of the list. The output is: Kale Lettuce Carrots Peanuts Second image is ItemNode