Below is a code segment for the Deleteltem function in an unsorted li.pdf

•

0 likes•3 views

Below is a code segment for the Deleteltem function in an unsorted list implemented using a static array Fill in the blank sections of code to successfully implement a deleted item void UnsortedType::DeleteItem(ListItemType& item) There is at most one list item with the same key as item; there may be none. Post: No list element has the same key as item. int location = 0; int index; bool moreToSearch; more search = bool found = false; while switch (item.CompardTo(info[location])) case LESS: location^++ moretosearch = break; case EQUAL:....= true break; if (found) {info [location] = leanth^-- What is the running time of the Deleteltem operation? Solution A) 1.) false 2.) moreToSearch 3) True 4) True 5) found 6) item B) Time Complexity T(N) = O(N) C) template void UnsortedType::InsertItem(ItemType item) // item is in the list; length has been incremented. { NodeType* location; location = new NodeType; location->info = item; location->next = listData; listData = location; length++; }.

Education

$Below is a code segment for the Deleteltem function in an unsorted list implemented using a static array Fill in the blank sections of code to successfully implement a deleted item void UnsortedType::DeleteItem(ListItemType& item) There is at most one list item with the same key as item; there may be none. Post: No list element has the same key as item. int location = 0; int index; bool moreToSearch; more search = bool found = false; while switch (item.CompardTo(info[location])) case LESS: location^++ moretosearch = break; case EQUAL:....= true break; if (found) {info [location] = leanth^-- What is the running time of the Deleteltem operation? Solution A) 1.) false 2.) moreToSearch 3) True 4) True 5) found 6) item B) Time Complexity T(N) = O(N) C) template void UnsortedType::InsertItem(ItemType item) // item is in the list; length has been incremented. { NodeType* location; location = new NodeType; location->info = item; location->next = listData; listData = location; length++; }$

Background: In many applications, the composition of a collection of data items changes over time. Not only are new data items added and existing ones removed, but data items may be duplicated. A list data structure is a member of the general category of abstract data types called containers, whose purpose is to hold other objects. In C++, lists are provided in the Standard Template Library. However, for this assignment you will design and write your own linked list implementation to support the ADT operations specified below. Objective: Design and implement the specifications for a List Abstract Data Type where the items in the list are unsorted. Requirements: Define a list and develop a set of operations for creating and manipulating a list that satisfies the list ADT specification. List ADT Specification Structure: The list elements are of ItemType. The list has a property called the current position which designates the position of the last element accessed by GetNextItem during an iteration through the list. Only ResetList and GetNextItem alter the current position. Definitions (provided by the user): MAX_ITEMS: A constant specifying the maximum capacity of items allowed on the list Item Type: Class encapsulating the type of items in the list RelationType: An enumeration type that consists of LESS, GREATER, EQUAL Member function of ItemType that must be included: RelationType ComparedTo(ItemType Item) Function: Determines the ordering of two ItemType objects based on their keys Precondition: Self and item have their key members initialized Postcondition: Function value = LESS if the key of self is less than the key of item = GREATER if the key of self is greater than the key of item = EQUAL if the keys are equal Operations (provided by Unsorted List ADT) Make Empty Function: Initializes list to empty state Preconditions: None Postcondition: List is empty Boolean IsFull Function: Determines whether list is full Preconditions: List has been initialized Postcondition: Function value = (list is full) int GetLength Function: Determines the number of elements in list Preconditions: List has been initialized Postcondition: Function value = number of elements in list ItemType GetItem(Item Typeitem, Boolean& found) Function: Get list element whose key matches item’s key (if present) Preconditions: List has been initialized Key member of item is initialized Postcondition: If there is an element someItem whose keymatches item’s key, then found = true and copy of someItemis returned; otherwise found = false and item is returned List is unchanged PutItem(ItemType item) Function: Puts item into list Preconditions: List has been initialized List is not full Item is not in list Postcondition: Item is in the list DeleteItem(ItemType item) Function: Deletes the element whose key matches item’s key Preconditions: List has been initialized Postcondition: One and only one element in list has a key matching item’s key ResetList Function: Initializes current p.

강의자료7Young Wook Kim

Searching

A. S. M. Shafi

DS Unit 1.pptx

chin463670

Write a program to find the number of comparisons using the binary se.docx

ajoy21

Pleae help me with this C++ task to the required result by edit or f.pdf

vinodagrawal6699

Pleae help me with this C++ task to the required result by edit or fixing, ill upvote thanks. Unordered Sets |As explained in this chapter, a set is a collection of distinct elements of the same type. Design the class unorderedSetType, derived from the class unorderedArrayListType, to manipulate sets. Note that you need to redefine only the functions insertAt, insertEnd, and replaceAt. If the item to be inserted is already in the list, the functions insertAt and insertEnd output an appropriate message, such as 13 is already in the set. Similarly, if the item to be replaced is already in the list, the function replaceAt outputs an appropriate message. Also, write a program to test your class. main.cpp ////////////////// unorderedArrayListTypeImp.cpp #include #include "unorderedArrayListType.h" using namespace std; void unorderedArrayListType::insertAt(int location, int insertItem) { if (location < 0 || location >= maxSize) cout << "The position of the item to be inserted " << "is out of range." << endl; else if (length >= maxSize) //list is full cout << "Cannot insert in a full list" << endl; else { for (int i = length; i > location; i--) list[i] = list[i - 1]; //move the elements down list[location] = insertItem; //insert the item at //the specified position length++; //increment the length } } //end insertAt void unorderedArrayListType::insertEnd(int insertItem) { if (length >= maxSize) //the list is full cout << "Cannot insert in a full list." << endl; else { list[length] = insertItem; length++; } } //end insertEnd int unorderedArrayListType::seqSearch(int searchItem) const { int loc; bool found = false; loc = 0; while (loc < length && !found) if (list[loc] == searchItem) found = true; else loc++; if (found) return loc; else return -1; } //end seqSearch void unorderedArrayListType::remove(int removeItem) { int loc; if (length == 0) cout << "Cannot delete from an empty list." << endl; else { loc = seqSearch(removeItem); if (loc != -1) removeAt(loc); else cout << "The item to be deleted is not in the list." << endl; } } void unorderedArrayListType::removeAll(int removeItem) { int loc; if (length == 0) cout << "Cannot delete from an empty list." << endl; else{ loc = seqSearch(removeItem); if (loc != -1) removeAt(loc); else cout << "The item to be deleted is not in the list." << endl; } // Set up a loop to find other occurrences and delete them as well while (loc != -1) { loc = seqSearch(removeItem); if (loc != -1) removeAt(loc); } } void unorderedArrayListType::replaceAt(int location, int repItem) { if (location < 0 || location >= length) cout << "The location of the item to be " << "replaced is out of range." << endl; else list[location] = repItem; } unorderedArrayListType::unorderedArrayListType(int size) : arrayListType(size) { } //////////////////////// unorderedArrayListType.h /////////////////// arrayListTypeImp.cpp #include #include "arrayListType.h" using namespace std; bool arrayListType::isEmpty() const { return (length == 0); } bool.

Here's a suggestion for a description to upload your document on a website: "Unlock the power of data structures with our comprehensive guide! Dive into the world of linked lists, Stack ADT (Abstract Data Type), and Queue ADT with our expertly curated document. Whether you're a seasoned programmer or just starting out, our resource provides clear explanations, insightful examples, and practical applications to help you master these fundamental concepts. Explore the intricacies of linked lists for efficient data storage, understand the versatility of Stack ADT for managing data in a Last-In, First-Out (LIFO) fashion, and delve into the functionality of Queue ADT for orderly data processing in a First-In, First-Out (FIFO) manner. Elevate your understanding of data structures and revolutionize your programming skills with our invaluable document. With clear explanations, illustrative examples, and practical exercises, our document equips you with the knowledge and skills needed to conquer data structure challenges with confidence. Whether you're a student embarking on your journey into computer science or a seasoned developer .Seeking to expand your repertoire, our resource is your roadmap to success. Download our document now and embark on a transformative learning experience that will elevate your programming prowess to new heights!"

searching in data structure.pptx

chouguleamruta24

Linear and binary search

JeoJoyA

Lecture07 the linked-list_as_a_data_structure_v3Hariz Mustafa

DATA STRUCTURE CLASS 12 COMPUTER SCIENCE

Arrays

Hash table

Stacks queues

How do I declare the following constructors in my .h file Below.pdf

Conint29

How do I declare the following constructors in my .h file? Below was the original code. \#include const int CAPACITY =1024; using namespace std; typedef int ElementType; // Now "ElementType" is "int" L//can change int to double, char,... class List \{ public: List(); //constructor unsigned size() const; bool empty() const; //check if empty void insert(ElementType item, int pos); //insertion void erase(int pos); //deletion void display(ostream\& out) const; //display every item ElementType get(unsigned pos) const; private: int mySize; // current \# of items in list int myArray[CAPACITY]; No issues found 4 Error List Entire Solution (i) 0 Messages Q7 Build + IntelliSense " Code Description abc E0135 class "List" has no member "removeAll" abc E0020 identifier "myArray" is undefined abc E0020 identifier "mySize" is undefined abc E0020 identifier "mySize" is undefined abc E0493 no instance of overloaded function "List::List" matches the specified type \#include \#include cstdlib> \#include "list.h" using namespace std; void List: : insert(ElementType item, int pos) \{ if (mySize == CAPACITY) exit(1); if (pos< 0|| pos > mysize) return; // shift array elements right to make room for for (int i= mysize; i> pos; i ) myArray[i]=myArray[i1]; // insert item at pos and increase list size myArray [pos] = item; mySize++; // don't forget this! \} void List: :erase(int pos) \{ if (pos<0 || pos >= mySize) return; // shift array elements left for (int i= pos; i < mysize-1; i++ ) myArray[i]=myArray[i+1]; \} mySize--; // don't forget this! List: : List( ) \{ mySize =0; \} bool List: :empty() const \{ return (mySize ==0 ); \} unsigned List::size() const \{ return mysize; \} ElementType List: :get(unsigned pos) const \{ if (pos >= mysize) \{ cerr "Invalid Index." endl; exit(1); \} return myArray[pos]; \} void List: : display(ostream \& out) const \{ for (int i=0; i.

Searching and Sorting Algorithms in Data Structures

poongothai11

강의자료10Young Wook Kim

data structures and algorithms Unit 3

infanciaj

CEN 235 4. Abstract Data Types - Queue and Stack.pdf

vtunali

java I am trying to run my code but it is not letting me .pdf

adinathassociates

java I am trying to run my code but it is not letting me i dont know what i should do or fix. Thank you so much for your help. This is the problem and my code will be on the bottom. Problem #1 and Only Dynamic Array of Integers Class Create a class named DynamicArray that will have convenient functionality similar to JavaScripts Array object and Javas ArrayList class. The class allows to store array of integers that can grow and shrink as needed, search for values, remove elements, etc. You are not allowed to use ArrayList object as well as any methods from java.util.Arrays class. Please see the list of required features and methods below. private int array[] You MUST store the data internally in a regular partially-filled array of integers. Please DO NOT USE ArrayList. The size of the allocated array is its capacity and will be discussed below. private int size. This variable stores the number of occupied elements in the array. Set to 0 in the constructor. Constructor with parameter. The parameter defines the capacity (length) of initial array. Allocates array of given capacity (length), sets size field to 0. In case the parameter given to constructor is 0 or negative, IllegalArgumentException is being thrown. No-argument constructor. Allocates array of length 3, assigns it to the array field, sets size field to 0. Copy constructor. The constructor takes an object of type DynamicArray as a parameter and copies it into the object it creates. The constructor throws IllegalArgumentException if the object that was passed to copy from is null. int getSize() returns the number of occupied elements in the array. int getCapacity() returns the actual size (length) of the partially-filled array int [] getArray() accessor returns the entire partially-filled array. Make sure you DO NOT return the private array field, make a copy of it. int [] toArray() accessor returns an occupied part of the partially-filled array. Make sure you DO NOT return the private array field. Instead, allocate memory for the new array, copy the occupied portion of the field into that new object, and return the new array. public void push(int num) adds a new element to the end of the array and increments the size field. If the array is full, you need to increase the capacity of the array: Create a new array with the size equal to double the capacity of the original one. Copy all the elements from the array field to the new array. Add the new element to the end of the new array. Use new array as an array field. Make sure your method works well when new elements are added to an empty DynamicArray. public int pop() throws RuntimeException removes the last element of the array and returns it. Decrements the size field. If the array is empty a RuntimeException with the message Array is empty must be thrown. At this point check the capacity of the array. If the capacity is 4 times larger than the number of occupied elements (size), it is time to shrink the array: Create a new array wi.

DSA - Array.pptx

11STEM2PGROUP1

Algorithmsultanarun

ARRAY in python and c with examples .pptx

abhishekmaurya102515

Implement the ListArray ADT-Implement the following operations.pdf

petercoiffeur18

Implement the ListArray ADT- *Implement the following operations: - constructor, assignment operator, destructor -insert, remove, replace, clear -isFull, isEmpty -gotoBeginning, gotoEnd, gotoNext, gotoPrior, getCursor #ifndef LISTARRAY_H #define LISTARRAY_H #include #include using namespace std; #pragma warning( disable : 4290 ) template < typename DataType > class List { public: static const int MAX_LIST_SIZE = 10; // Default maximum list size // Constructors List ( int maxNumber = MAX_LIST_SIZE ); // Default constructor List ( const List& source ); // Copy constructor // Overloaded assignment operator List& operator= ( const List& source ); // Destructor virtual ~List (); // List manipulation operations virtual void insert ( const DataType& newDataItem ) // Insert after cursor throw ( logic_error ); void remove () throw ( logic_error ); // Remove data item virtual void replace ( const DataType& newDataItem ) // Replace data item throw ( logic_error ); void clear (); // Clear list // List status operations bool isEmpty () const; // List is empty bool isFull () const; // List is full // List iteration operations void gotoBeginning () // Go to beginning throw ( logic_error ); void gotoEnd () // Go to end throw ( logic_error ); bool gotoNext () // Go to next data item throw ( logic_error ); bool gotoPrior () // Go to prior data item throw ( logic_error ); DataType getCursor () const throw ( logic_error ); // Return data item // Output the list structure -- used in testing/debugging virtual void showStructure () const; // In-lab operations void moveToNth ( int n ) // Move data item to pos. n throw ( logic_error ); bool find ( const DataType& searchDataItem ) // Find data item throw ( logic_error ); protected: // Data members int maxSize, size, // Actual number of data item in the list cursor; // Cursor array index DataType *dataItems; // Array containing the list data item }; #endif Solution #include \"ListArray.h\" Struct List List ::List(int maxNumber = MAX_LIST_SIZE) { size = cursor = 0; maxSize = maxNumber; dataItems = new DataType [maxNumber]; for(int i = 0; i < maxNumber; i++) dataItems[i] = NULL; } List ::List(const List& source) { maxSize = MAX_LIST_SIZE; dataItems = new DataType [MAX_LIST_SIZE]; for(int i = 0; i < MAX_LIST_SIZE; i++) dataItems[i] = source.dataItems[i]; size = source.size; cursor = source.cursor; } List ::operator= (const List &source) { this -> clear(); for(int i = 0; i < maxSize; i++) dataItems[i] = source.dataItems[i]; //return source; } List::~List() { delete [] dataItems; } void List_insert(const DataType &newDataItem) { if(size == 0) dataItems[cursor] = newDataItem; else { dataItems[cursor + 1] = newDataItem; } size++; cursor = size - 1; } void List_remove() { dataItems[cursor] = NULL; size-- ; if(dataItems[cursor + 1] == NULL) cursor = 0; else cursor++; } void List_replace(const DataType &newDataItem) { dataItems[cursor] = newDataItem; } void List_clear() { for(int i = 0; i < size; i++) dataItems[i] = NULL; size =.

Arrays in C++

Janpreet Singh

Describe two benefits of the industrial revolution and two proble.pdf

Below is a code segment for the Deleteltem function in an unsorted li.pdf

Recommended

Recommended

More Related Content

Similar to Below is a code segment for the Deleteltem function in an unsorted li.pdf

Similar to Below is a code segment for the Deleteltem function in an unsorted li.pdf (20)

More from shalins6

More from shalins6 (20)

Recently uploaded

Recently uploaded (20)

Below is a code segment for the Deleteltem function in an unsorted li.pdf