EBK PROBLEM SOLVING WITH C++
9th Edition
ISBN: 9780133834505
Author: SAVITCH
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Question
Chapter 18.2, Problem 9STE
Program Plan Intro
STL Basic sequential containers:
“slist”:
- The template class for “slist” class is “<slist>”
- The template class for “slist” is “slist<T>::iterator”.
- This class uses mutable and forward iterator.
- The template class for constant iterator is “slist<T>::const_iterator”.
- This class uses constant and forward iterator.
“list”:
- The template class for “list” class is “<list>”
- The template class for “list” is “list<T>::iterator”.
- This class uses mutable and bidirectional iterator.
- The template class for constant iterator is “list<T>::const_iterator”.
- This class uses constant and bidirectional iterator.
- The template class for reverse iterator is “list<T>::reverse_iterator”.
- This class uses mutable and bidirectional iterator.
- The template class for constant reverse iterator is “list<T>::const_reverse_iterator”.
- This class uses constant and bidirectional iterator.
“
- The template class for “vector” class is “<vector>”
- The template class for “vector” is “vector<T>::iterator”.
- This class uses mutable, random, and access iterator.
- The template class for constant iterator is “vector<T>::const_iterator”.
- This class uses constant, random, and access iterator.
- The template class for reverse iterator is “vector<T>::reverse_iterator”.
- This class uses mutable, random, and access iterator.
- The template class for constant reverse iterator is “vector<T>::const_reverse_iterator”.
- This class uses constant, random, and access iterator.
“deque”:
- The template class for “deque” class is “<deque>”
- The template class for “deque” is “deque<T>::iterator”.
- This class uses mutable, random, and access iterator.
- The template class for constant iterator is “deque<T>::const_iterator”.
- This class uses constant, random, and access iterator.
- The template class for reverse iterator is “deque<T>::reverse_iterator”.
- This class uses mutable, random, and access iterator.
- The template class for constant reverse iterator is “deque<T>::const_reverse_iterator”.
- This class uses constant, random, and access iterator.
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
Write a short IO function, runTest, which runs your tests using quickCheck. (2 marks)
runTest = undefined
--Consider the following type which allows non-homogenous lists to be built.
data MkType a b = ElemA a (MkType a b) | ElemB b (MkType a b) | Emptyderiving Show
answer in haskell form.
thank you.
Write a generic class that stores two elements of the same type and can tell the user which one is the larger between the two. The type of the two elements should be parameterized and the class should have a function called “maxElement” that returns the larger element.
write this java code
Write a program to test various operations of the class doublyLinkedList.
Chapter 18 Solutions
EBK PROBLEM SOLVING WITH C++
Ch. 18.1 - If v is a vector, what does v.begin() return? What...Ch. 18.1 - If p is an iterator for a vector object v, what is...Ch. 18.1 - Suppose v is a vector of ints. Write a for loop...Ch. 18.1 - Suppose the vector v contains the letters 'A',...Ch. 18.1 - Suppose the vector v contains the letters 'A',...Ch. 18.1 - Suppose you want to run the following code, where...Ch. 18.2 - Prob. 7STECh. 18.2 - Prob. 8STECh. 18.2 - Prob. 9STECh. 18.2 - Prob. 10STE
Ch. 18.2 - Prob. 11STECh. 18.2 - Prob. 12STECh. 18.2 - Prob. 13STECh. 18.2 - Prob. 14STECh. 18.2 - Prob. 15STECh. 18.2 - Prob. 16STECh. 18.3 - Prob. 17STECh. 18.3 - Prob. 18STECh. 18.3 - Prob. 19STECh. 18.3 - Suppose v is an object of the class vectorint. Use...Ch. 18.3 - Prob. 21STECh. 18.3 - Can you use the copy template function with vector...Ch. 18.3 - Prob. 23STECh. 18 - Prob. 1PCh. 18 - Prob. 2PCh. 18 - Prob. 3PCh. 18 - Prob. 4PCh. 18 - Write a program that allows the user to enter any...Ch. 18 - Prob. 3PPCh. 18 - Prob. 5PPCh. 18 - Solution to Programming Project 18.6 In this...Ch. 18 - Prob. 7PPCh. 18 - You have collected a file of movie ratings where...Ch. 18 - Prob. 9PP
Knowledge Booster
Similar questions
- Write C++ program to give implementation of doubly linked list and should have the following functionality.-InsertFirst ( ? )-InsertLast ( ? )-InsertAfter ( ? )-DisplayList ( ? )-DeleteFirst ( ? )-DeleteLast ( ? )-DeleteSpecific( ? )arrow_forwardThere’s a somewhat imperfect analogy between a linked list and a railroad train, where individual cars represent links. Imagine how you would carry out various linked list operations, such as those implemented by the member functions insertFirst(), removeFirst(), and remove(int key) from the LinkList class in this hour. Also implement an insertAfter() function. You’ll need some sidings and switches. You can use a model train set if you have one. Otherwise, try drawing tracks on a piece of paper and using business cards for train cars.arrow_forwardWrite a class that maintains the top 10 scores for a game application, implementthe add and remove functions. use a singlylinked list instead of an array. C++ C++ C++arrow_forward
- Implement a LinkedList class that stores integers using dynamic memory and a proper main program to test it. The following member functions need to be properly implemented and tested: 1. Default constructor. 2. Parmetrized Constructor. 3. Sum. 4. Average. 5. InsertAtHead. 6. InsertAtTail. 7. Delete. 8. Pop. 9. Circular. 10. Display. Sample answer is also provided.arrow_forwardWrite the following two generic methods using insertionsort. The first method sorts the elements using the Comparable interface, andthe second uses the Comparator interface.public static <E extends Comparable<E>>void insertionSort(E[] list)public static <E> void insertionSort(E[] list,Comparator<? super E> comparator)arrow_forwardWhich of the following terms best describes the case where a Stack class is implemented using an internal instance of List? Choose only one option.(a) Association(b) Specialization(c) Genericity(d) Composition(e) Singularityarrow_forward
- Write Java code to create a generic class that stores two generic objects. Create an instance of this same generic class and store three objects of the String class in it.arrow_forwardI ASK THIS QUESTION HERE AND YOUR EXPERT SOLVE IT THIS WAY BUT CAN YOU WRITE THE main ( ) FOR THIS CODE Consider the following implementation of the node and doubly linked-list: template <class type>class node{public:type info;node<type> * next;// nextnode<type> * prev;//back }; template <class type>class doubly_linked_list{//data membersprivate:node<type> *head, *tail;int length;public:doubly_linked_list(){head = tail = NULL;length = 0;}bool isEmpty(){ // return (head==NULL);if (head == NULL)return true;elsereturn false;} void Append(type e){node<type> *newnode = new node<type>;newnode->info = e;if (isEmpty()){newnode->next = NULL;newnode->prev = NULL;head = newnode;tail = newnode;}else{tail->next = newnode;newnode->prev = tail;newnode->next = NULL;tail = newnode;}++length; } void Display(){if (isEmpty()) { cout << "The linked list is empty !!!!"; return; }cout << "list elements: ";node<type> *…arrow_forwardI'm trying to understand LargeIntList classes for lists, I was wondering these statements or True or False? either or, can you please explain your answers? Thank you. Uses the “by copy” approach with its elements. Implements the ListInterface interface. Keeps its data elements sorted. Allows duplicate elements. Uses the LLNode class of the support package. Throws an exception if an iteration “walks off ” the end of the list. Throws an exception if an element is added when it is "full". Supports addition of elements at the front of the list, the end of the list, and anywhere in between. Can hold objects of any Java class. Has only O(1) operations, including its constructor. Provides more than one Iterator.arrow_forward
- You are going to implement a program that creates an unsorted list by using a linked list implemented by yourself. NOT allowed to use LinkedList class or any other classes that offers list functions. It is REQUIRED to use an ItemType class and a NodeType struct to solve this. Use C++, please read instructions carefully and new solution only! The “data.txt” file has three lines of data 100, 110, 120, 130, 140, 150, 160 100, 130, 160 1@0, 2@3, 3@END You need to 1. create an empty unsorted list 2. add the numbers from the first line to list using putItem() function. Then print all the current keys to command line in one line using printAll(). 3. delete the numbers given by the second line in the list by using deleteItem() function. Then print all the current keys to command line in one line using printAll().. 4. putItem () the numbers in the third line of the data file to the corresponding location in the list. For example, 1@0 means adding number 1 at position 0 of the list. Then…arrow_forwardHow does the function insertFirst of the class unorderedLinkedList differ from the function insertFirst of the class orderedLinkedList.arrow_forwardAdd a new public member function to the LinkedList class named reverse() which reverses the items in the list. You must take advantage of the doubly-linked list structure to do this efficiently as discussed in the videos/pdfs, i.e. swap each node’s prev/next pointers, and finally swap headPtr/tailPtr. Demonstrate your function works by creating a sample list of a few entries in main(), printing out the contents of the list, reversing the list, and then printing out the contents of the list again to show that the list has been reversed. Note: your function must actually reverse the items in the doubly-linked list, not just print them out in reverse order! Note: we won't use the copy constructor in this assignment, and as such you aren't required to update the copy constructor to work with a doubly-linked list. This is what I have so far but its not working! template<class ItemType>void LinkedList<ItemType>::reverse(){ Node<ItemType>*curPtr,*prev,*next;…arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
C++ Programming: From Problem Analysis to Program...Computer ScienceISBN:9781337102087Author:D. S. MalikPublisher:Cengage Learning
C++ Programming: From Problem Analysis to Program...
Computer Science
ISBN:9781337102087
Author:D. S. Malik
Publisher:Cengage Learning