f) Test the functionality of the implementation in the main method. First, create a new ArrayIntList object. Then, call its add method multiple times to fill the list with some values. Afterwards, print out the list (call println with the ArrayIntList reference as an actual parameter). Then, do call its remove method a few times and print out the list again. Afterwards, answer the following questions: 1) What is the time complexity of the add and remove methods? 2) What happens when we try to add more than 10 values to the list? How would you address the problem that could result? 3) If the problem in 2 is fixed, how would that change the time complexity?

f) Test the functionality of the implementation in the main method. First, create a new ArrayIntList object. Then, call its add method multiple times to fill the list with some values. Afterwards, print out the list (call println with the ArrayIntList reference as an actual parameter). Then, do call its remove method a few times and print out the list again. Afterwards, answer the following questions: 1) What is the time complexity of the add and remove methods? 2) What happens when we try to add more than 10 values to the list? How would you address the problem that could result? 3) If the problem in 2 is fixed, how would that change the time complexity?

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter17: Linked Lists

Section: Chapter Questions

Problem 5PE

See similar textbooks

Similar questions

1- Start by writing your choice from the list given above. Part a. Explain the important technical details about your choice. 2-(continued) Start by again writing your choice from the list given above. Part b. Most of the ADTs in this class were implemented using arrays and linked lists. If appropriate for the ADT you chose in part a., explain which one (an array or a linked list) you would choose to implement it and why. If it doesn’t make sense to implement your ADT using an array or a linked list, explain which other data structure you would use to implement your ADT.
I need following code in java Sorting with Lists In this exercise, we want to realize list versions of sorting algorithms that we know already for arrays. 1. Develop a version of Insertion Sort for linked lists. Realize it as a method void insertionsort() that turns the current list into a sorted list. Hint: The idea of Insertion Sort is to repeatedly insert nodes into a sorted list such that the order is preserved. Check out which of the methods defined for your linked list type contain ideas that can be used for implementing insertionsort. 2. Develop a version of Quicksort for head-tail lists. Realize it as a method void quicksort() that turns the current list into a sorted list. Hint: The idea of Quicksort is to repeatedly choose an element of the cur- rent list as pivot and to partition the current list into two lists, one with elements less or equal than the pivot value and another one with elements greater or equal than the pivot value. Then, the two new lists are each sorted…
Q.2. Implement a single linked list. Elements of this linked list should be of integer type, user would provide values as input for elements of this linked list. Which does not allow insertion of duplicate value to the list.
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
Q 4 Computer Science Write a Java generic Class with user-defined method(s) to exchange the positions of two different elements in an Array List.
(IntelliJ) 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 (Java) or either a reference or a pointer (C++) to the first node, as well as one to the last node. * 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. * Create a different method or function that iteratively explores the list, printing the int data values as…
Print the following List in the reversed order using lambda / arrow operator. var array = new List <int>{ 8,2,2,24,5,7,5,3,2,10};
Please do not copy from chegg. C++ Dividing a linked list into two sublists of almost equal sizes Add the operation divideMid to the class ListData in Chapter17.cpp on Canvas as follows: void divideMid(ListData &sublist); //This operation divides the given list into two sublists //of (almost) equal sizes. //Postcondition: first points to the first node and last // points to the last node of the first sublist. // sublist.first points to the first node // and sublist.last points to the last node // of the second sublist. Consider the following statements: ListData myList; ListData subList; Suppose myList points to the list with elements 34 65 27 89 12 (in this order). The statement: myList.divideMid(subList); divides myList into two sublists: myList points to the list with the elements 34 65 27, and subList points to the sublist with the elements 89 12. Write the definition of the function template to implement the operation divideMid. chapter 17.cpp #include…
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…
1)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. 2. Write a Java program which stores three values by using doubly linked list.- Node class4. stuID, stuName, stuScore, //data fields5. constructor6. update and…
Need java help 1) If myList is a declared ADT list and the front of the list is on the left, show the contents of the list after applying the following pseudo code? myList.add("goat") myList.add(1, "fish") myList.add("cat") myList.remove(2) myList.add(3, "dog") myList.replace(2, "frog") a) horse frog dog cat b) fish frog dog cat c) horse fish frog dog d) frog horse dog fish 2) You can add a new entry in a list a) at the beginning b) at the end c) in between items d) all of the above
Implements clone which duplicates a list. Pay attention, because if there are sublists, they must be duplicated as well. Understand the implementation of the following function, which recursively displays the ids of each node in a list Develop your solution as follows: First copy the nodes of the current list (self) Create a new list with the copied nodes Loop through the nodes of the new list checking the value field If this field is also a list (use isinstance as in the show_ids function) then it calls clone on that list and substitutes the value. Complete the code: def L4(*args,**kwargs): class L4_class(L): def clone(self): def clone_node(node): return <... YOUR CODE HERE ...> r = <... YOUR CODE HERE...> return r return L4_class(*args,**kwargs)