Write a function, to be included in an unsorted linked list class, called replace_item, that will receive two parameters, one called olditem, the other called newitem. The function will replace all occurrences of olditem with newitem ( if olditem exists !! ) and it will return the number of replacements done.

Write a template-based class that implements a set of items. A set is a collection of items in which no item occurs more than once. Internally, you may represent the set using the data structure of your choice (for example, list, vector, arrays, etc.). However, the class should externally support the following functions: a. Add a new item to the set. If the item is already in the set then nothing happens. b. Remove an item from the set. c. Return the number of items in the set. d. Determine if an item is a member of the set. e. Return a pointer to a dynamically created array containing each item in the set. The caller of this function is responsible for deallocating the memory. Test your class by creating different sets of different data types (for example, strings, integers, or other classes). If you add objects to your set, then you may need to overload the == and != operators for the object’s class so your template-based set class can properly determine membership.

The two classes you will create will implement the operations defined in the interface as shown in the UML class diagram above. In addition, BinarySearchArray will implement a static method testBinarySearchArray() that populates the lists, and lets the user interactively test the two classes by adding and removing elements. The parameter BinarySearch can represent either class and tells testBinarySearchArray which class to test. Steps to Implement: 1) To get started create a new project in IntelliJ called BinarySearch. Add a class to your project called BinarySearchArray. Then add another class BinarySearchArrayList and an interface called BinarySearch. The interface BinarySearch includes public method stubs as shown in the diagram. You are allowed to add BinarySearchArrayList to the same file as BinarySearch but don't add an access modifier to this class, or for easier reading, you can declare the classes in separate files with public access modifiers. Only the class...

Assume that, you have a Linked List class "LL" with a function named "fun1". You can assume that "value" is the value of the nodes and "Next" is the next pointer of the node. You created an instance of the LL class, named "L1", where "head" is the head node. And you inserted the following numbers: 31 -> 32 -> 43 -> 17 -> 34 -> 57 ->91. What will be the output of the linked list L1 after the "fun1" operation to it?* 31 -> 32 -> 43 -> 17 -> 34 -> 57 ->91 31 -> 32 -> 17 -> 34 -> 57 ->91 31 -> 32 -> 43 -> 17 -> 57 ->91 31 -> 32 -> 43 -> 17 -> 34 -> 57 31 -> 32 -> 43 -> 57 ->91 31 -> 32 -> 43 -> 34 -> 57 ->91

Consider the following class that inherits from the built-in list class: class BoundedList (list): def _init_(self, bound): list._init_(self) self.bound = bound Suppose that we want this class to act like a list, except that when append is called, if there are self.bound items in the list already, the first item in the list gets removed. Which of the following methods will properly overload append to work this way? def append(self, item): if len(self)>= self.bound: self.pop(0) list.append(self, item) def append (self, item): if len(self)>= self.bound: self.remove (0) list. append (self, item) def append(self, item): if len(self)>= self.bound: self.pop(0) self.append (item) def append(self, item): list. append (self,item) if len(self)> self.bound: self.pop(0)

Instruction: To test the Linked List class, create a new Java class with the main method, generate Linked List using Integer and check whether all methods do what they’re supposed to do. A sample Java class with main method is provided below including output generated. If you encounter errors, note them and try to correct the codes. Post the changes in your code, if any. Additional Instruction: Linked List is a part of the Collection framework present in java.util package, however, to be able to check the complexity of Linked List operations, we can recode the data structure based on Java Documentation https://docs.oracle.com/javase/8/docs/api/java/util/LinkedList.html package com.linkedlist; public class linkedListTester { public static void main(String[] args) { ListI<Integer> list = new LinkedList<Integer>(); int n=10; for(int i=0;i<n;i++) { list.addFirst(i); } for(int...

Write a template function that takes as parameter a vector of a generic type and reverses the order of elements in the vector, and then add the function to the program you wrote for Programming Challenge 5. Modify the driver program to test the new function by reversing and outputting vectors whose element types are char, int, double, and string.

create a driver program, CarTestDriver that uses a Garage object to store Cars. The Garage object is an instantiation of a Garage class that contains "parking", an array of Car types. You must use a Car[] not an ArrayList<Car> for the "parking" in the garage. I suggest setting up the Car class with a default constructor that generates random values to create each new Car object. The rules for driving the cars from the garage are: The size of the garage is specified by the user. The user may only use cars from the garage A Car is removed from the Garage when a user retrieves a Car from the Garage. The Car is returned to the Garage, after it is driven if it does not run out of fuel. The user interacts with the Car object after the Car object is retrieved from the garage. The program should not fail due to a user selection. A car may only be refueled when the user selects the Car for use, prior to being removed from the Garage The user may select to drive any car that is currently...

Add the function min as an abstract function to the class arrayListType to return the smallest element of the list. Also, write the definition of the function min in the class unorderedArrayListType and write a program to test this function. I have 5 tabs: I have tried every solution I can think of with no luck. These are the guides: arrayListType.h arrayListTypeImp.cpp: main.cpp unorderedArraryListType.h unorderedArrayListTypeImp.cpp I am needing these in order to pass the assignment in Cengage Mindtap, please help with codes for each one if possible.

Write a function, to be included in an unsorted linked list class, called getLargest, that will return the largest item in the list.

in C++ Write a method ‘void addBack(double x)’ that adds value x to the back of a linked list. Assume you have access to a ‘head’ pointer pointing to the first node in the list. Please note that you do NOT have a tail pointer. Be sure to check for any special cases.

Create a linked list class called Catering. Beside, other functions that are relevant to to this program, your class will have a constructor that will initialize all member variables to 0 (Zero). You class will also call a destructor. Your program is going to calculate customer bill for Casewell Catering Convention Service. The Casewell Catering and Convention Service have asked you to write a computer program to produce customer's bill. The program should read in the following data. a. The number of adults to be served. b. The number of children to be served. c. The cost per adult's meal. d. The cost per child's meal (60% of the cost of adult's meal). e. The cost for dessert (same for adults and children). f. The room fee. g. A percentage for tip and tax (not applicable to room fee). h. Any deposit should be deducted from the room fee. You program will produce following output: (Numbers are to be used as a reference only) Casewell Catering and Convention Service Final Bill Number of...

Write a template for a function that has parameters for a list of items and for a possible item on the list. If the item is on the list, then the function returns the position of the first occurrence of that item. If the item is not on the list, the function returns −1. The first position on the list is position 0, the next is position 1, and so forth. The type of the items on the list is a type parameter. Use the class template GenericList that you defined in Project 1. Write a suitable program(main function) to test this function template.