Homework Help is Here – Start Your Trial Now!
Engineering
Computer Science
solve the attached question  class is given    template class ABList{ private: int max_size; int actual_size; T* list_array; public: ABList(int Size); ~ABList(); int getLength(); Page 2 of 3 T getItem(int); void insertItem(T value); int findAndRemoveItem(T); void displayList(); void MergeList(ABList); void ReducetoHalf(); };

solve the attached question  class is given    template class ABList{ private: int max_size; int actual_size; T* list_array; public: ABList(int Size); ~ABList(); int getLength(); Page 2 of 3 T getItem(int); void insertItem(T value); int findAndRemoveItem(T); void displayList(); void MergeList(ABList); void ReducetoHalf(); };

Database System Concepts
Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
See similar textbooks
icon
Related questions
Question

solve the attached question 

class is given 

 

template <class T>
class ABList{
private:
int max_size;
int actual_size;
T* list_array;
public:
ABList(int Size);
~ABList();
int getLength();

Page 2 of 3

T getItem(int);
void insertItem(T value);
int findAndRemoveItem(T);
void displayList();
void MergeList(ABList);
void ReducetoHalf();
};

Q #1. Apply concepts of Advanced Data Structures to implement a template class for array based list with following attributes and functionalities: template class I> class ABListi private: int max_sise: int actual_sise: I* list_array: public: ABList (int Sise): ABList (): int getlength () : Page 1 of 3 I getItem (int): void insertItem (T value): int findandRemove Item (T) : void displayList (): void Mergelist (ABList): void ReducetoHalf (): Constructor will dynamically allocate the list of size 'Size'. • insertitem() function will insert new item at the end of the list, only if item is not present in the list already. If item is already present, it will display a message, 'Item already in the list. • FindAndRemoveltem) will search an item in the list, if found, item will be removed from the list. If item is not found, function will retum -1. ReducetoHalf) will reduce the size of the List to half and copy all the items from the old list to the new list and destroy the old list. • MergeLists() will combine two array based lists into one. • n main(), define two array based lists of type String and size 10. Ask user to enter 5 names in each of the lists. Merge both the lists and display the resultant merged list on the screen.
Transcribed Image Text:Q #1. Apply concepts of Advanced Data Structures to implement a template class for array based list with following attributes and functionalities: template class I> class ABListi private: int max_sise: int actual_sise: I* list_array: public: ABList (int Sise): ABList (): int getlength () : Page 1 of 3 I getItem (int): void insertItem (T value): int findandRemove Item (T) : void displayList (): void Mergelist (ABList): void ReducetoHalf (): Constructor will dynamically allocate the list of size 'Size'. • insertitem() function will insert new item at the end of the list, only if item is not present in the list already. If item is already present, it will display a message, 'Item already in the list. • FindAndRemoveltem) will search an item in the list, if found, item will be removed from the list. If item is not found, function will retum -1. ReducetoHalf) will reduce the size of the List to half and copy all the items from the old list to the new list and destroy the old list. • MergeLists() will combine two array based lists into one. • n main(), define two array based lists of type String and size 10. Ask user to enter 5 names in each of the lists. Merge both the lists and display the resultant merged list on the screen.
Expert Solution
steps

Step by step

Solved in 3 steps with 2 images

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Knowledge Booster
Array
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education
SEE MORE TEXTBOOKS