Problem Statement: Create ADT that implements the SET concept using linked list or arrays. Background: A set is an abstract data type that can store unique values, without any particular order. The value of the element cannot be modified once it is added to the set, though it is possible to remove and add the modified value of that element. Unlike list type, rather than retrieving a specific element from a set, one typically tests a value for membership in a set. The type of sets we want to implement is dynamic sets. Dynamic sets allow to change after they are constructed. Sets allow query operations on their elements - such as checking whether a given value is in the set, or enumerating the values in some arbitrary order. Sets can be implemented using various data structures, which provide different time and space trade-offs for various operations. It can be implemented using arrays or linked list. In this assignment we have to use arrays to implement the SET data structure. We have to use template concept so that sets can be of any type. Following Basic Operations has to be implement in this assignment: 1) InsertItem(Item): Add Item to the SET. No duplicate elements can be inserted in any order. 2) Removeltem(Item): Remove the Item from SET. 3) FindItem(Item): Return true if Item is in SET. 4) Size(): Return number of elements in the SET. 5) Reset(): Resets the current position to the beginning of the SET which is used to loop over the SET elements using GetNextItem() function. 6) GetNextItem(): Returns the next element in the SET according to the current position. 7) IsLastltem(): Returns true of the current position is at the last element in the SET. 8) Intersection(aSet): Returns new SET object which represents the intersection of two sets. 9) Union(aSet): Returns new SET object which represents the union of two sets. 10) Difference(set): Returns new SET object which represents the intersection of two sets. 11) IsSubsetOf(aSet): return true if SET in subset of aSet. 12) ISEqual(aSet): returns true if two sets are equal. 13) MakeEmpty(): Deletes all elements in the SET. 14) ISEmpty(): Returns true if the SET is empty. 15) IsFull(): Returns true if the SET is full. 16) Print(): Print all elements in the SET.

Problem Statement: Create ADT that implements the SET concept using linked list or arrays. Background: A set is an abstract data type that can store unique values, without any particular order. The value of the element cannot be modified once it is added to the set, though it is possible to remove and add the modified value of that element. Unlike list type, rather than retrieving a specific element from a set, one typically tests a value for membership in a set. The type of sets we want to implement is dynamic sets. Dynamic sets allow to change after they are constructed. Sets allow query operations on their elements - such as checking whether a given value is in the set, or enumerating the values in some arbitrary order. Sets can be implemented using various data structures, which provide different time and space trade-offs for various operations. It can be implemented using arrays or linked list. In this assignment we have to use arrays to implement the SET data structure. We have to use template concept so that sets can be of any type. Following Basic Operations has to be implement in this assignment: 1) InsertItem(Item): Add Item to the SET. No duplicate elements can be inserted in any order. 2) Removeltem(Item): Remove the Item from SET. 3) FindItem(Item): Return true if Item is in SET. 4) Size(): Return number of elements in the SET. 5) Reset(): Resets the current position to the beginning of the SET which is used to loop over the SET elements using GetNextItem() function. 6) GetNextItem(): Returns the next element in the SET according to the current position. 7) IsLastltem(): Returns true of the current position is at the last element in the SET. 8) Intersection(aSet): Returns new SET object which represents the intersection of two sets. 9) Union(aSet): Returns new SET object which represents the union of two sets. 10) Difference(set): Returns new SET object which represents the intersection of two sets. 11) IsSubsetOf(aSet): return true if SET in subset of aSet. 12) ISEqual(aSet): returns true if two sets are equal. 13) MakeEmpty(): Deletes all elements in the SET. 14) ISEmpty(): Returns true if the SET is empty. 15) IsFull(): Returns true if the SET is full. 16) Print(): Print all elements in the SET.

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 13PE

See similar textbooks