Pleae help me with this C++ question, ill upvote thanks.Write the .pdf
•
0 likes•6 views
Pleae help me with this C++ question, ill upvote thanks. Write the definitions of the functions of the class orderedArrayListType that are not given in this chapter. please write a main.cpp and orderedArrayListTypeImp.cpp file and all the file that is given is everything i have for this task main.cpp #include #include "unorderedArrayListType.h" using namespace std; int main() { // Write your main here return 0; } //////////// orderedArrayListType.h #ifndef H_orderedArrayListType #define H_orderedArrayListType #include "arrayListType.h" class orderedArrayListType: public arrayListType { public: void insertAt(int location, int insertItem); void insertEnd(int insertItem); void replaceAt(int location, int repItem); int seqSearch(int searchItem) const; void insert(int insertItem); void remove(int removeItem); orderedArrayListType(int size = 100); //Constructor }; #endif ///////////////// orderedArrayListTypeImp.cpp ///////////////////////////// arrayListType.h #include #include "orderedArrayListType.h" using namespace std; void orderedArrayListType::insert(int insertItem) { if (length == 0) //list is empty list[length++] = insertItem; //insert insertItem //and increment length else if (length == maxSize) cout << "Cannot insert in a full list." << endl; else { //Find the location in the list where to insert //insertItem. int loc; bool found = false; for (loc = 0; loc < length; loc++) { if (list[loc] >= insertItem) { found = true; break; } } for (int i = length; i > loc; i--) list[i] = list[i - 1]; //move the elements down list[loc] = insertItem; //insert insertItem length++; //increment the length } } //end insert int orderedArrayListType::seqSearch(int searchItem) const { int loc; bool found = false; for (loc = 0; loc < length; loc++) { if (list[loc] >= searchItem) { found = true; break; } } if (found) { if (list[loc] == searchItem) return loc; else return -1; } else return -1; } //end seqSearch void orderedArrayListType::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 { cout << "This is a sorted list. Inserting at the proper place." << endl; insert(insertItem); } } //end insertAt void orderedArrayListType::insertEnd(int insertItem) { if (length == maxSize) //the list is full cout << "Cannot insert in a full list." << endl; else { cout << "This is a sorted list. Inserting at the proper " << "place." << endl; insert(insertItem); } } //end insertEnd void orderedArrayListType::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 { removeAt(location); insert(repItem); } } //end replaceAt void orderedArrayListType::remove(int removeItem) { int loc; if (length == 0) cout << "Cannot delete from an empty list." << endl; else { loc = s.
Report
Share
Report
Share
Download to read offline
![arrayListType.h
#include
#include "orderedArrayListType.h"
using namespace std;
void orderedArrayListType::insert(int insertItem)
{
if (length == 0) //list is empty
list[length++] = insertItem; //insert insertItem
//and increment length
else if (length == maxSize)
cout << "Cannot insert in a full list." << endl;
else
{
//Find the location in the list where to insert
//insertItem.
int loc;
bool found = false;
for (loc = 0; loc < length; loc++)
{
if (list[loc] >= insertItem)
{
found = true;
break;
}
}
for (int i = length; i > loc; i--)
list[i] = list[i - 1]; //move the elements down
list[loc] = insertItem; //insert insertItem
length++; //increment the length
}
} //end insert
int orderedArrayListType::seqSearch(int searchItem) const
{
int loc;
bool found = false;](data:image/gif;base64,R0lGODlhAQABAIAAAAAAAP///yH5BAEAAAAALAAAAAABAAEAAAIBRAA7)
Recommended
Pleae help me with this C++ task to the required result by edit or f.pdf
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.
(Unordered Sets) As explained in this chapter, a set is a collection.pdf
(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. Similarly, if the item to be replaced is already in the list, the
function replaceAt outputs an appropriate message.Include the set operations of union and
intersection in your class. Also write a program to test your class. (C++)
#ifndef UNORDEREDARRAYLISTTYPE_H
#define UNORDEREDARRAYLISTTYPE_H
#include \"arrayListType.h\"
class unorderedArrayListType : public arrayListType {
public:
void insertAt(int location, int insertItem);
// Function to insert an item at a particular location
// Postcondition: The item has been added to the list and the length has
// been increased by 1.
void insertEnd(int insertItem);
// Function to insert an item at the end of the list
// Postcondition: The item has been added at the end of the list and the
// length has been increased by 1.
void replaceAt(int location, int repItem);
// Function to replace an item in the list.
// Postcondition: repItem overrwrites the item at the specified location
// in the list. The length of the list is unchanged.
int seqSearch(int searchItem) const;
// Function to search the list for searchItem. Note that this is an
// abstract function.
//Postcondition: If the item is found, returns the location in the array
// where the item is found; otherwise, returns -1.
void remove(int removeItem);
// Function to remove an item from the list
// Postcondition: If the item is found in the list, it is removed and the
// length of the list is decreased by 1; if the item is not in the list
// an appropriate message is displayed.
void removeAll(int removeItem);
// Function to remove all occurrences of an item from the list
// Postcondition: If the item is found in the the list, all occurrences are
// removed and the length of the list is decreased accordingly. If the
// item is not in the list an appropriate message is displayed.
unorderedArrayListType(int size = 100);
//Constructor.
};
#endif // UNORDEREDARRAYLISTTYPE_H
#include \"UnorderedArrayListType.h\"
#include
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.\"<= 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.\.
In C++Add the function min as an abstract function to the classar.pdf
In C++:
Add the function min as an abstract function to the classarrayListTypeto return the smallest
element of the list.
Also, write the definition of the function min in the classunorderedArrayListTypeand write a
program to test this function.
arrayListType.h
#ifndef H_arrayListType
#define H_arrayListType
class arrayListType
{
public:
bool isEmpty() const;
//Function to determine whether the list is empty
//Postcondition: Returns true if the list is empty;
// otherwise, returns false.
bool isFull() const;
//Function to determine whether the list is full
//Postcondition: Returns true if the list is full;
// otherwise, returns false.
int listSize() const;
//Function to determine the number of elements in
//the list.
//Postcondition: Returns the value of length.
int maxListSize() const;
//Function to determine the maximum size of the list
//Postcondition: Returns the value of maxSize.
void print() const;
//Function to output the elements of the list
//Postcondition: Elements of the list are output on the
// standard output device.
bool isItemAtEqual(int location, int item) const;
//Function to determine whether item is the same as
//the item in the list at the position specified
//by location.
//Postcondition: Returns true if list[location]
// is the same as item; otherwise,
// returns false.
// If location is out of range, an
// appropriate message is displayed.
virtual void insertAt(int location, int insertItem) = 0;
//Function to insert insertItem in the list at the
//position specified by location.
//Note that this is an abstract function.
//Postcondition: Starting at location, the elements of
// the list are shifted down,
// list[location] = insertItem; length++;
// If the list is full or location is out of
// range, an appropriate message is displayed.
virtual void insertEnd(int insertItem) = 0;
//Function to insert insertItem at the end of
//the list. Note that this is an abstract function.
//Postcondition: list[length] = insertItem; and length++;
// If the list is full, an appropriate
// message is displayed.
void removeAt(int location);
//Function to remove the item from the list at the
//position specified by location
//Postcondition: The list element at list[location] is
// removed and length is decremented by 1.
// If location is out of range, an
// appropriate message is displayed.
void retrieveAt(int location, int& retItem) const;
//Function to retrieve the element from the list at the
//position specified by location
//Postcondition: retItem = list[location]
// If location is out of range, an
// appropriate message is displayed.
virtual void replaceAt(int location, int repItem) = 0;
//Function to replace the elements in the list
//at the position specified by location.
//Note that this is an abstract function.
//Postcondition: list[location] = repItem
// If location is out of range, an
// appropriate message is displayed.
void clearList();
//Function to remove all the elements from the list
//After this operation, the size of t.
Write a program to find the number of comparisons using the binary se.docx
Write a program to find the number of comparisons using the binary se
JAVALAB #8 - ARRAY BASED LISTSThe next exercise is based on this.pdf
JAVA
LAB #8 - ARRAY BASED LISTS
The next exercise is based on this implemetation for an UnorderedArrayList of integers:
//Interface: ArrayListADT
//works for int
public interface ArrayListADT {
public boolean isEmpty(); //Method to determine whether the list is empty.
public boolean isFull(); //Method to determine whether the list is full.
public int listSize(); //Method to return the number of elements in the list.
public int maxListSize(); //Method to return the maximum size of the list.
public void print(); //Method to output the elements of the list.
public boolean isItemAtEqual(int location, int item); //Method to determine whether item is
the same as the item in the list at location.
public void insertAt(int location, int insertItem); //Method to insert insertItem in the list at
the position
public void insertEnd(int insertItem); //Method to insert insertItem at the end of the list.
public void removeAt(int location); //Method to remove the item from the list at location.
public int retrieveAt(int location); //Method to retrieve the element from the list at location.
public void replaceAt(int location, int repItem); //Method to replace the element in the list at
location with repItem.
public void clearList(); //Method to remove all the elements from the list.
public int search(int searchItem); //Method to determine whether searchItem is in the list.
public void remove(int removeItem); //Method to remove an item from the list.
}
//Class: ArrayListClass implements
//Interface: ArrayListADT
public abstract class ArrayListClass implements ArrayListADT {
protected int length; //to store the length of the list
protected int maxSize; //to store the maximum size of the list
protected int[] list; //array to hold the list elements
//Default constructor
public ArrayListClass() {
maxSize = 100;
length = 0;
list = new int[maxSize];
}
//Alternate Constructor
public ArrayListClass(int size) {
if(size <= 0) {
System.err.println(\"The array size must be positive. Creating an array of size 100.\");
maxSize = 100;
}
else
maxSize = size;
length = 0;
list = new int[maxSize];
}
public boolean isEmpty() {
return (length == 0);
}
public boolean isFull() {
return (length == maxSize);
}
public int listSize() {
return length;
}
public int maxListSize() {
return maxSize;
}
public void print() {
for (int i = 0; i < length; i++)
System.out.print(list[i] + \" \");
System.out.println();
}
public boolean isItemAtEqual(int location, int item) {
if (location < 0 || location >= length) {
System.err.println(\"The location of the item to be compared is out of range.\");
return false;
}
return list[location]== item;
}
public void clearList() {
for (int i = 0; i < length; i++)
list[i] = 0;
length = 0;
System.gc(); //invoke the Java garbage collector
}
public void removeAt(int location) {
if (location < 0 || location >= length)
System.err.println(\"The location of the item to be removed is out of range.\");
else {
for(int i = location; i < length - 1; i++)
list[i] = list[i + 1.
C++ detyrat postim_slideshare
Tirana Center of Technology,qender kursesh IT,trajnim profesional,kurse baza programimi,c++
This is the main file include itemh include itemList.pdf
//This is the main file
#include "item.h"
#include "itemList.h"
int main()
{
//create a list of items
ItemList groceryList;
//create temp variables
Item anItem;
int count = 0, newNum = 0;
char newName[MAXCHAR], findName[MAXCHAR];
//read from user and add to list
cin >> count;
cin.ignore(100, 'n');
for(int i = 0; i < count; i++)
{
cin >> newName;
cin >> newNum;
cin.ignore(100, 'n');
anItem.setItemName(newName);
anItem.setNumItems(newNum);
groceryList.InsertAtFront(anItem);
}
groceryList.showList();
cin >> findName;
if(!groceryList.findItem(findName))
{
cout << "Item not found!";
}
return 0;
}
item.h
//Item header file
//
#pragma once
#include <iostream>
#include <cstring>
using namespace std;
//constant for char arrays
const int MAXCHAR = 101;
//class definition
class Item {
private:
char *itemName;
int numberOfItems;
public:
//Constructors
Item();
Item(char *, int);
//copy constructor
Item(const Item &anItem);
//destructor
~Item();
//mutators
void setItemName(char *);
void setNumItems(int);
//accessors
void getItemName(char *);
int getNumItems();
//print item
void printItem();
//assignment op overloading
Item& operator= (const Item& anItem);
};
item.cpp
//This is the implementation file for item.h (the Item class)
#include "item.h"
//default constructor
Item::Item()
{
//allocate memory for itemName
itemName = new char[MAXCHAR];
strcpy(this->itemName, "no name");
numberOfItems = 0;
}
//constructor with parameters
Item::Item(char tempItemName[], int tempNumItems)
{
//allocate memory for itemName
itemName = new char[strlen(tempItemName) + 1];
strcpy(itemName, tempItemName);
numberOfItems = tempNumItems;
}
//Copy Constructor
Item::Item(const Item &anItem)
{
//allocate memory for itemName
itemName = new char[strlen(anItem.itemName) + 1];
strcpy(itemName, anItem.itemName);
numberOfItems = anItem.numberOfItems;
}
//destructor
Item::~Item()
{
//deallocate the memory for itemName
if(itemName)
{
delete [] itemName;
itemName = NULL;
}
}
//mutator functions
void Item::setItemName(char *newItemName)
{
if(itemName)
{
delete [] itemName;
}
itemName = new char[strlen(newItemName) + 1];
strcpy(itemName, newItemName);
}
//for numberofitems
void Item::setNumItems(int newNum)
{
numberOfItems = newNum;
}
//accessor functions
void Item::getItemName(char *returnItemName)
{
strcpy(returnItemName, itemName);
}
int Item::getNumItems()
{
return numberOfItems;
}
//print the item
void Item::printItem()
{
cout << numberOfItems << ' ' << itemName << endl;
}
//assignment operator overload
Item& Item::operator= (const Item& anItem)
{
//if it is a self copy, don't do anything
if (this == &anItem)
return *this;
//make current object *this a copy of the passed in item
else
{
this->setItemName(anItem.itemName);
this->numberOfItems = anItem.numberOfItems;
return *this;
}
}
itemList.h
//This is the itemList header file.
//Class for a list of items
#pragma once
#include "item.h"
//define class for a list of items
class ItemList
{
private:
//struct for each Node
struct Node
{
Item d.
Implement the ListArray ADT-Implement the following operations.pdf
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 =.
Recommended
Pleae help me with this C++ task to the required result by edit or f.pdf
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.
(Unordered Sets) As explained in this chapter, a set is a collection.pdf
(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. Similarly, if the item to be replaced is already in the list, the
function replaceAt outputs an appropriate message.Include the set operations of union and
intersection in your class. Also write a program to test your class. (C++)
#ifndef UNORDEREDARRAYLISTTYPE_H
#define UNORDEREDARRAYLISTTYPE_H
#include \"arrayListType.h\"
class unorderedArrayListType : public arrayListType {
public:
void insertAt(int location, int insertItem);
// Function to insert an item at a particular location
// Postcondition: The item has been added to the list and the length has
// been increased by 1.
void insertEnd(int insertItem);
// Function to insert an item at the end of the list
// Postcondition: The item has been added at the end of the list and the
// length has been increased by 1.
void replaceAt(int location, int repItem);
// Function to replace an item in the list.
// Postcondition: repItem overrwrites the item at the specified location
// in the list. The length of the list is unchanged.
int seqSearch(int searchItem) const;
// Function to search the list for searchItem. Note that this is an
// abstract function.
//Postcondition: If the item is found, returns the location in the array
// where the item is found; otherwise, returns -1.
void remove(int removeItem);
// Function to remove an item from the list
// Postcondition: If the item is found in the list, it is removed and the
// length of the list is decreased by 1; if the item is not in the list
// an appropriate message is displayed.
void removeAll(int removeItem);
// Function to remove all occurrences of an item from the list
// Postcondition: If the item is found in the the list, all occurrences are
// removed and the length of the list is decreased accordingly. If the
// item is not in the list an appropriate message is displayed.
unorderedArrayListType(int size = 100);
//Constructor.
};
#endif // UNORDEREDARRAYLISTTYPE_H
#include \"UnorderedArrayListType.h\"
#include
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.\"<= 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.\.
In C++Add the function min as an abstract function to the classar.pdf
In C++:
Add the function min as an abstract function to the classarrayListTypeto return the smallest
element of the list.
Also, write the definition of the function min in the classunorderedArrayListTypeand write a
program to test this function.
arrayListType.h
#ifndef H_arrayListType
#define H_arrayListType
class arrayListType
{
public:
bool isEmpty() const;
//Function to determine whether the list is empty
//Postcondition: Returns true if the list is empty;
// otherwise, returns false.
bool isFull() const;
//Function to determine whether the list is full
//Postcondition: Returns true if the list is full;
// otherwise, returns false.
int listSize() const;
//Function to determine the number of elements in
//the list.
//Postcondition: Returns the value of length.
int maxListSize() const;
//Function to determine the maximum size of the list
//Postcondition: Returns the value of maxSize.
void print() const;
//Function to output the elements of the list
//Postcondition: Elements of the list are output on the
// standard output device.
bool isItemAtEqual(int location, int item) const;
//Function to determine whether item is the same as
//the item in the list at the position specified
//by location.
//Postcondition: Returns true if list[location]
// is the same as item; otherwise,
// returns false.
// If location is out of range, an
// appropriate message is displayed.
virtual void insertAt(int location, int insertItem) = 0;
//Function to insert insertItem in the list at the
//position specified by location.
//Note that this is an abstract function.
//Postcondition: Starting at location, the elements of
// the list are shifted down,
// list[location] = insertItem; length++;
// If the list is full or location is out of
// range, an appropriate message is displayed.
virtual void insertEnd(int insertItem) = 0;
//Function to insert insertItem at the end of
//the list. Note that this is an abstract function.
//Postcondition: list[length] = insertItem; and length++;
// If the list is full, an appropriate
// message is displayed.
void removeAt(int location);
//Function to remove the item from the list at the
//position specified by location
//Postcondition: The list element at list[location] is
// removed and length is decremented by 1.
// If location is out of range, an
// appropriate message is displayed.
void retrieveAt(int location, int& retItem) const;
//Function to retrieve the element from the list at the
//position specified by location
//Postcondition: retItem = list[location]
// If location is out of range, an
// appropriate message is displayed.
virtual void replaceAt(int location, int repItem) = 0;
//Function to replace the elements in the list
//at the position specified by location.
//Note that this is an abstract function.
//Postcondition: list[location] = repItem
// If location is out of range, an
// appropriate message is displayed.
void clearList();
//Function to remove all the elements from the list
//After this operation, the size of t.
Write a program to find the number of comparisons using the binary se.docx
Write a program to find the number of comparisons using the binary se
JAVALAB #8 - ARRAY BASED LISTSThe next exercise is based on this.pdf
JAVA
LAB #8 - ARRAY BASED LISTS
The next exercise is based on this implemetation for an UnorderedArrayList of integers:
//Interface: ArrayListADT
//works for int
public interface ArrayListADT {
public boolean isEmpty(); //Method to determine whether the list is empty.
public boolean isFull(); //Method to determine whether the list is full.
public int listSize(); //Method to return the number of elements in the list.
public int maxListSize(); //Method to return the maximum size of the list.
public void print(); //Method to output the elements of the list.
public boolean isItemAtEqual(int location, int item); //Method to determine whether item is
the same as the item in the list at location.
public void insertAt(int location, int insertItem); //Method to insert insertItem in the list at
the position
public void insertEnd(int insertItem); //Method to insert insertItem at the end of the list.
public void removeAt(int location); //Method to remove the item from the list at location.
public int retrieveAt(int location); //Method to retrieve the element from the list at location.
public void replaceAt(int location, int repItem); //Method to replace the element in the list at
location with repItem.
public void clearList(); //Method to remove all the elements from the list.
public int search(int searchItem); //Method to determine whether searchItem is in the list.
public void remove(int removeItem); //Method to remove an item from the list.
}
//Class: ArrayListClass implements
//Interface: ArrayListADT
public abstract class ArrayListClass implements ArrayListADT {
protected int length; //to store the length of the list
protected int maxSize; //to store the maximum size of the list
protected int[] list; //array to hold the list elements
//Default constructor
public ArrayListClass() {
maxSize = 100;
length = 0;
list = new int[maxSize];
}
//Alternate Constructor
public ArrayListClass(int size) {
if(size <= 0) {
System.err.println(\"The array size must be positive. Creating an array of size 100.\");
maxSize = 100;
}
else
maxSize = size;
length = 0;
list = new int[maxSize];
}
public boolean isEmpty() {
return (length == 0);
}
public boolean isFull() {
return (length == maxSize);
}
public int listSize() {
return length;
}
public int maxListSize() {
return maxSize;
}
public void print() {
for (int i = 0; i < length; i++)
System.out.print(list[i] + \" \");
System.out.println();
}
public boolean isItemAtEqual(int location, int item) {
if (location < 0 || location >= length) {
System.err.println(\"The location of the item to be compared is out of range.\");
return false;
}
return list[location]== item;
}
public void clearList() {
for (int i = 0; i < length; i++)
list[i] = 0;
length = 0;
System.gc(); //invoke the Java garbage collector
}
public void removeAt(int location) {
if (location < 0 || location >= length)
System.err.println(\"The location of the item to be removed is out of range.\");
else {
for(int i = location; i < length - 1; i++)
list[i] = list[i + 1.
C++ detyrat postim_slideshare
Tirana Center of Technology,qender kursesh IT,trajnim profesional,kurse baza programimi,c++
This is the main file include itemh include itemList.pdf
//This is the main file
#include "item.h"
#include "itemList.h"
int main()
{
//create a list of items
ItemList groceryList;
//create temp variables
Item anItem;
int count = 0, newNum = 0;
char newName[MAXCHAR], findName[MAXCHAR];
//read from user and add to list
cin >> count;
cin.ignore(100, 'n');
for(int i = 0; i < count; i++)
{
cin >> newName;
cin >> newNum;
cin.ignore(100, 'n');
anItem.setItemName(newName);
anItem.setNumItems(newNum);
groceryList.InsertAtFront(anItem);
}
groceryList.showList();
cin >> findName;
if(!groceryList.findItem(findName))
{
cout << "Item not found!";
}
return 0;
}
item.h
//Item header file
//
#pragma once
#include <iostream>
#include <cstring>
using namespace std;
//constant for char arrays
const int MAXCHAR = 101;
//class definition
class Item {
private:
char *itemName;
int numberOfItems;
public:
//Constructors
Item();
Item(char *, int);
//copy constructor
Item(const Item &anItem);
//destructor
~Item();
//mutators
void setItemName(char *);
void setNumItems(int);
//accessors
void getItemName(char *);
int getNumItems();
//print item
void printItem();
//assignment op overloading
Item& operator= (const Item& anItem);
};
item.cpp
//This is the implementation file for item.h (the Item class)
#include "item.h"
//default constructor
Item::Item()
{
//allocate memory for itemName
itemName = new char[MAXCHAR];
strcpy(this->itemName, "no name");
numberOfItems = 0;
}
//constructor with parameters
Item::Item(char tempItemName[], int tempNumItems)
{
//allocate memory for itemName
itemName = new char[strlen(tempItemName) + 1];
strcpy(itemName, tempItemName);
numberOfItems = tempNumItems;
}
//Copy Constructor
Item::Item(const Item &anItem)
{
//allocate memory for itemName
itemName = new char[strlen(anItem.itemName) + 1];
strcpy(itemName, anItem.itemName);
numberOfItems = anItem.numberOfItems;
}
//destructor
Item::~Item()
{
//deallocate the memory for itemName
if(itemName)
{
delete [] itemName;
itemName = NULL;
}
}
//mutator functions
void Item::setItemName(char *newItemName)
{
if(itemName)
{
delete [] itemName;
}
itemName = new char[strlen(newItemName) + 1];
strcpy(itemName, newItemName);
}
//for numberofitems
void Item::setNumItems(int newNum)
{
numberOfItems = newNum;
}
//accessor functions
void Item::getItemName(char *returnItemName)
{
strcpy(returnItemName, itemName);
}
int Item::getNumItems()
{
return numberOfItems;
}
//print the item
void Item::printItem()
{
cout << numberOfItems << ' ' << itemName << endl;
}
//assignment operator overload
Item& Item::operator= (const Item& anItem)
{
//if it is a self copy, don't do anything
if (this == &anItem)
return *this;
//make current object *this a copy of the passed in item
else
{
this->setItemName(anItem.itemName);
this->numberOfItems = anItem.numberOfItems;
return *this;
}
}
itemList.h
//This is the itemList header file.
//Class for a list of items
#pragma once
#include "item.h"
//define class for a list of items
class ItemList
{
private:
//struct for each Node
struct Node
{
Item d.
Implement the ListArray ADT-Implement the following operations.pdf
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 =.
helpInstructionsAdd the function max as an abstract function to .pdf
help
Instructions
Add the function max as an abstract function to the class arrayListType to return the largest
element of the list.
Also, write the definition of the function max in the class unorderedArrayListType and write a
program to test this function.
files:
main.cpp:
//Data: 18 42 78 22 42 5 42 57
arrayListType.h:
#ifndef H_arrayListType
#define H_arrayListType
class arrayListType
{
public:
bool isEmpty() const;
//Function to determine whether the list is empty
//Postcondition: Returns true if the list is empty;
// otherwise, returns false.
bool isFull() const;
//Function to determine whether the list is full
//Postcondition: Returns true if the list is full;
// otherwise, returns false.
int listSize() const;
//Function to determine the number of elements in
//the list.
//Postcondition: Returns the value of length.
int maxListSize() const;
//Function to determine the maximum size of the list
//Postcondition: Returns the value of maxSize.
void print() const;
//Function to output the elements of the list
//Postcondition: Elements of the list are output on the
// standard output device.
bool isItemAtEqual(int location, int item) const;
//Function to determine whether item is the same as
//the item in the list at the position specified
//by location.
//Postcondition: Returns true if list[location]
// is the same as item; otherwise,
// returns false.
// If location is out of range, an
// appropriate message is displayed.
virtual void insertAt(int location, int insertItem) = 0;
//Function to insert insertItem in the list at the
//position specified by location.
//Note that this is an abstract function.
//Postcondition: Starting at location, the elements of
// the list are shifted down,
// list[location] = insertItem; length++;
// If the list is full or location is out of
// range, an appropriate message is displayed.
virtual void insertEnd(int insertItem) = 0;
//Function to insert insertItem at the end of
//the list. Note that this is an abstract function.
//Postcondition: list[length] = insertItem; and length++;
// If the list is full, an appropriate
// message is displayed.
void removeAt(int location);
//Function to remove the item from the list at the
//position specified by location
//Postcondition: The list element at list[location] is
// removed and length is decremented by 1.
// If location is out of range, an
// appropriate message is displayed.
void retrieveAt(int location, int& retItem) const;
//Function to retrieve the element from the list at the
//position specified by location
//Postcondition: retItem = list[location]
// If location is out of range, an
// appropriate message is displayed.
virtual void replaceAt(int location, int repItem) = 0;
//Function to replace the elements in the list
//at the position specified by location.
//Note that this is an abstract function.
//Postcondition: list[location] = repItem
// If location is out of range, an
// appropriate message is displayed.
void clearList();
//Function to remove all th.
2.(Sorted list array implementation)This sorted list ADT discussed .pdf
2.(Sorted list: array implementation)This sorted list ADT discussed in class should be extended
by the addition of two new methods:
//Interface: ArrayListADT
//works for int
public interface ArrayListADT {
public boolean isEmpty(); //Method to determine whether the list is empty.
public boolean isFull(); //Method to determine whether the list is full.
public int listSize(); //Method to return the number of elements in the list.
public int maxListSize(); //Method to return the maximum size of the list.
public void print(); //Method to output the elements of the list.
public boolean isItemAtEqual(int location, int item); //Method to determine whether item is
the same as the item in the list at location.
public void insertAt(int location, int insertItem); //Method to insert insertItem in the list at
the position
public void insertEnd(int insertItem); //Method to insert insertItem at the end of the list.
public void removeAt(int location); //Method to remove the item from the list at location.
public int retrieveAt(int location); //Method to retrieve the element from the list at location.
public void replaceAt(int location, int repItem); //Method to replace the element in the list at
location with repItem.
public void clearList(); //Method to remove all the elements from the list.
public int search(int searchItem); //Method to determine whether searchItem is in the list.
public void remove(int removeItem); //Method to remove an item from the list.
}
//Class: ArrayListClass implements
//Interface: ArrayListADT
public abstract class ArrayListClass implements ArrayListADT {
protected int length; //to store the length of the list
protected int maxSize; //to store the maximum size of the list
protected int[] list; //array to hold the list elements
//Default constructor
public ArrayListClass() {
maxSize = 100;
length = 0;
list = new int[maxSize];
}
//Alternate Constructor
public ArrayListClass(int size) {
if(size <= 0) {
System.err.println(\"The array size must be positive. Creating an array of size 100.\");
maxSize = 100;
}
else
maxSize = size;
length = 0;
list = new int[maxSize];
}
public boolean isEmpty() {
return (length == 0);
}
public boolean isFull() {
return (length == maxSize);
}
public int listSize() {
return length;
}
public int maxListSize() {
return maxSize;
}
public void print() {
for (int i = 0; i < length; i++)
System.out.print(list[i] + \" \");
System.out.println();
}
public boolean isItemAtEqual(int location, int item) {
if (location < 0 || location >= length) {
System.err.println(\"The location of the item to be compared is out of range.\");
return false;
}
return list[location]== item;
}
public void clearList() {
for (int i = 0; i < length; i++)
list[i] = 0;
length = 0;
System.gc(); //invoke the Java garbage collector
}
public void removeAt(int location) {
if (location < 0 || location >= length)
System.err.println(\"The location of the item to be removed is out of range.\");
else {
for(int i = location; i < length - 1; i++)
list[i] .
Using the C++ programming language1. Implement the UnsortedList cl.pdf
Using the C++ programming language
1. Implement the UnsortedList class to store a list of numbers that are input into the list from
data.txt.
- create a main.cpp file that gets the numbers from the file
- insert the number 7 into the list
- insert another number 300 into the list
- delete the number 6 from the list
- print out the following:
--the entire list
- the greatest
- the least
2. Attach the main.cpp, UnsortedList.cpp, the ItemType.h, and the output file two called
outfile2.txt
Use the files below:
// listDriver.cpp
// Test driver
#include
#include
#include
#include
#include
#include \"unsorted.h\"
using namespace std;
void PrintList(ofstream& outFile, UnsortedType& list);
int main()
{
ifstream inFile; // file containing operations
ofstream outFile; // file containing output
string inFileName; // input file external name
string outFileName; // output file external name
string outputLabel;
string command; // operation to be executed
int number;
ItemType item;
UnsortedType list;
bool found;
int numCommands;
// Prompt for file names, read file names, and prepare files
cout << \"Enter name of input command file; press return.\" << endl;
cin >> inFileName;
inFile.open(inFileName.c_str());
cout << \"Enter name of output file; press return.\" << endl;
cin >> outFileName;
outFile.open(outFileName.c_str());
cout << \"Enter name of test run; press return.\" << endl;
cin >> outputLabel;
outFile << outputLabel << endl;
if (!inFile)
{
cout << \"file not found\" << endl;
exit(2)
}
inFile >> command;
numCommands = 0;
while (command != \"Quit\")
{
if (command == \"PutItem\")
{
inFile >> number;
item.Initialize(number);
list.PutItem(item);
item.Print(outFile);
outFile << \" is in list\" << endl;
}
else if (command == \"DeleteItem\")
{
inFile >> number;
item.Initialize(number);
list.DeleteItem(item);
item.Print(outFile);
outFile << \" is deleted\" << endl;
}
else if (command == \"GetItem\")
{
inFile >> number;
item.Initialize(number);
item = list.GetItem(item, found);
item.Print(outFile);
if (found)
outFile << \" found in list.\" << endl;
else outFile << \" not in list.\" << endl;
}
else if (command == \"GetLength\")
outFile << \"Length is \" << list.GetLength() << endl;
else if (command == \"IsFull\")
if (list.IsFull())
outFile << \"List is full.\" << endl;
else outFile << \"List is not full.\" << endl;
else if (command == \"MakeEmpty\")
list.MakeEmpty();
else if (command == \"PrintList\")
PrintList(outFile, list);
else
cout << command << \" is not a valid command.\" << endl;
numCommands++;
cout << \" Command number \" << numCommands << \" completed.\"
<< endl;
inFile >> command;
};
cout << \"Testing completed.\" << endl;
inFile.close();
outFile.close();
return 0;
}
void PrintList(ofstream& dataFile, UnsortedType& list)
// Pre: list has been initialized.
// dataFile is open for writing.
// Post: Each component in list has been written to dataFile.
// dataFile is still open.
{
int length;
ItemType item;
list.ResetList();
length = list.GetLength();
for .
#ifndef LINKED_LIST_ #define LINKED_LIST_ templateclass It.pdf
#ifndef LINKED_LIST_
#define LINKED_LIST_
template
class LinkedList {
private:
std::shared_ptr> headPtr; // Pointer to first node in the chain;
// (contains the first entry in the list)
int itemCount; // Current count of list items
std::shared_ptr> getNodeAt(int position) const;
public:
LinkedList();
LinkedList(const LinkedList& aList);
virtual ~LinkedList();
bool isEmpty() const;
int getLength() const;
bool insert(int newPosition, const ItemType& newEntry);
bool remove(int position);
void clear();
/** throw PrecondViolatedExcept if position < 1 or
position > getLength(). */
ItemType getEntry(int position) const throw(PrecondViolatedExcept);
/** throw PrecondViolatedExcept if position < 1 or
position > getLength(). */
void replace(int position, const ItemType& newEntry)
throw(PrecondViolatedExcept);
// Operator Overloading
void operator = (const LinkedList& arg);
friend std::ostream& operator << (std::ostream& os, const LinkedList& arg)
{
os << \"There are \" << arg.getLength() << \" values in the list:\" << std::endl;
for (int i{ 1 }; i <= arg.getLength(); i++) {
os << arg.getEntry(i) << std::endl;
}
os << std::endl << std::endl << std::endl << std::endl;
return os;
}
};
// Returns a pointer to the Node at the given position.
template
std::shared_ptr> LinkedList::getNodeAt (int position) const {
std::shared_ptr> currPtr{ headPtr };
for (int i{ 1 }; i < position; i++)
currPtr = currPtr->getNext();
return currPtr;
}
// Default constructor.
template
LinkedList::LinkedList() {
headPtr = nullptr;
itemCount = 0;
}
// Copy constructor.
template
LinkedList::LinkedList(const LinkedList& aList) {
itemCount = aList.getLength();
auto currPtr{ aList.headPtr };
auto newNodePtr{ headPtr = std::make_shared>(currPtr->getItem()) };
auto prevNodePtr{ newNodePtr };
currPtr = currPtr->getNext();
for (int i{ 2 }; i <= itemCount; i++) {
newNodePtr = std::make_shared>(currPtr->getItem());
prevNodePtr->setNext(newNodePtr);
prevNodePtr = newNodePtr;
currPtr = currPtr->getNext();
}
}
// Destructor.
template
LinkedList::~LinkedList() {
headPtr = nullptr;
itemCount = 0;
}
// Accessor/Info Functions.
template
bool LinkedList::isEmpty() const {
return (itemCount > 0)?0:1;
}
template
int LinkedList::getLength() const {
return itemCount;
}
// Places a Node at a given position (element at the same position is now pos+1).
template
bool LinkedList::insert(const int newPosition,
const ItemType& newEntry)
{
bool ableToInsert{ (newPosition >= 1) &&
(newPosition <= itemCount + 1) };
if (ableToInsert)
{
// Create a new node containing the new entry
auto newNodePtr{ std::make_shared>(newEntry) };
// Attach new node to chain
if (newPosition == 1)
{
// Insert new node at beginning of chain
newNodePtr->setNext(headPtr);
headPtr = newNodePtr;
}
else
{
// Find node that will be before new node
auto prevPtr{ getNodeAt(newPosition - 1) };
// Insert new node after node to which prevPtr points
newNodePtr->setNext(prevPtr->getNext());
prevPtr->setNext(newNodePtr);
} // end if
itemCount++; // .
AnswerNote LinkedList.cpp is written and driver program main.cpp.pdf
Answer:
Note: LinkedList.cpp is written and driver program main.cpp is also given.
//ListInterface.h
#ifndef _LIST_INTERFACE
#define _LIST_INTERFACE
template
class ListInterface
{
public:
virtual bool isEmpty() const = 0;
virtual int getLength() const = 0;
virtual bool insert(int newPosition, const ItemType& newEntry) = 0;
virtual bool remove(int position) = 0;
virtual void clear() = 0;
virtual ItemType getEntry(int position) const = 0;
virtual void replace(int position, const ItemType& newEntry) = 0;
}; // end ListInterface
#endif
//Node.h
#ifndef NODE_
#define NODE_
template
class Node
{
private:
ItemType item; // A data item
Node* next; // Pointer to next node
public:
Node();
Node(const ItemType& anItem);
Node(const ItemType& anItem, Node* nextNodePtr);
void setItem(const ItemType& anItem);
void setNext(Node* nextNodePtr);
ItemType getItem() const ;
Node* getNext() const ;
}; // end Node
#endif
//Node.cpp
#include \"Node.h\"
template
Node::Node() : next(nullptr)
{
} // end default constructor
template
Node::Node(const ItemType& anItem) : item(anItem), next(nullptr)
{
} // end constructor
template
Node::Node(const ItemType& anItem, Node* nextNodePtr) :
item(anItem), next(nextNodePtr)
{
} // end constructor
template
void Node::setItem(const ItemType& anItem)
{
item = anItem;
} // end setItem
template
void Node::setNext(Node* nextNodePtr)
{
next = nextNodePtr;
} // end setNext
template
ItemType Node::getItem() const
{
return item;
} // end getItem
template
Node* Node::getNext() const
{
return next;
} // end getNext
//PrecondViolatedExcept.h
#ifndef PRECOND_VIOLATED_EXCEPT_
#define PRECOND_VIOLATED_EXCEPT_
#include
#include
class PrecondViolatedExcept : public std::logic_error
{
public:
PrecondViolatedExcept(const std::string& message = \"\");
}; // end PrecondViolatedExcept
#endif
//PrecondViolatedExcept.cpp
#include \"PrecondViolatedExcept.h\"
PrecondViolatedExcept::PrecondViolatedExcept(const std::string& message)
: std::logic_error(\"Precondition Violated Exception: \" + message)
{
} // end constructor
//LinkedList.h
#ifndef LINKED_LIST_
#define LINKED_LIST_
#include \"ListInterface.h\"
#include \"Node.h\"
#include
#include \"PrecondViolatedExcept.h\"
template
class LinkedList : public ListInterface
{
private:
Node* headPtr; // Pointer to first node in the chain;
// (contains the first entry in the list)
int itemCount; // Current count of list items
// Locates a specified node in this linked list.
Node* getNodeAt(int position) const;
public:
LinkedList();
LinkedList(const LinkedList& aList);
virtual ~LinkedList();
bool isEmpty() const;
int getLength() const;
bool insert(int newPosition, const ItemType& newEntry);
bool remove(int position);
void clear();
ItemType getEntry(int position) const;
void replace(int position, const ItemType& newEntry);
}; // end LinkedList
#endif
//LinkedList.cpp
#include \"LinkedList.h\"
#include
#include
#include
#include
//Default constructor
template
LinkedList::LinkedList() : headPtr(nullptr), itemCount(0)
{
.
Complete the provided partial C++ Linked List program. Main.cpp is g.pdf
Complete the provided partial C++ Linked List program. Main.cpp is given and Link list header
file is also given. The given testfile listmain.cpp is given for demonstration of unsorted list
functionality. The functions header file is also given. Complete the functions of the header file
linked_list.h below.
=========================================================
// listmain.cpp
#include \"Linked_List.h\"
int main(int argc, char **argv)
{
float f;
Linked_List *theList;
cout << \"Simple List Demonstration\ \";
cout << \"(List implemented as an Array - Do not try this at home)\ \ \";
cout << \"Create a list and add a few tasks to the list\";
theList = new Linked_List(); // Instantiate a list object
theList->Insert(5, 3.1f); // Note: The argument to the funtion should be a float
theList->Insert(1, 5.6f); // A constant real number like 3.1 is interpreted as
theList->Insert(3, 8.3f); // a double unless it is explicitly defined as a float
theList->Insert(2, 7.4f); // by adding an \'f\' to the end of the number.
theList->Insert(4, 2.5f);
// Show what is in the list
theList->PrintList();
// Test the list length function
cout << \"\ List now contains \" << theList->ListLength() << \"items.\ \ \";
// Test delete function
cout << \"Testing delete of last item in list.\ \";
theList->Delete(4);
theList->PrintList();
// Test delete function
cout << \"Testing delete of first item in list.\ \";
theList->Delete(5);
theList->PrintList();
// Test delete function
cout << \"Testing delete of a middle item in list.\ \";
theList->Delete(3);
theList->PrintList();
// Test delete function with a known failure argument
cout << \"Testing failure in delete function.\ \";
if(theList->Delete(4))
cout << \"Oops! Should not have been able to delete.\ \";
else
cout << \"Unable to locate item to delete.\ \";
// Test search (known failure)
cout << \"Testing Search function. Search for key 3\ \";
if(theList->Search(3, &f))
cout << \"Search result: theData = %f\ \", f;
else
cout << \"Search result: Unable to locate item in list\ \";
// Test search (known success)
cout << \"Testing Search function. Search for key 2\ \";
if(theList->Search(2, &f))
cout << \"Search result: theData = \" << f << \"\ \";
else
cout << \"Search result: Unable to locate item in list\ \";
cout << \"\ \ End list demonstration...\";
return 0;
}
=====================================================================
===================
// linked_list.h functions
#include
using namespace std;
// Define a structure to use as the list item
struct ListItem
{
int key;
float theData;
ListItem *next;
};
class Linked_List
{
private:
ListItem *head; // Pointer to head of the list
public:
Linked_List(); // Class constructor
~Linked_List(); // Class destuctor
void ClearList(); // Remove all items from the list
bool Insert(int key, float f);// Add an item to the list
bool Delete(int key); // Delete an item from the list
bool Search(int key, float *retVal); // Search for an item in the list
int ListLength(); // Return numb.
How do I declare the following constructors in my .h file Below.pdf
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.
lab08build.bat@echo offclsset DRIVE_LETTER=1s.docx
lab08/build.bat
@echo off
cls
set DRIVE_LETTER=%1:
set PATH=%DRIVE_LETTER%\MinGW\bin;%DRIVE_LETTER%\MinGW\msys\1.0\bin;%DRIVE_LETTER%\MinGW\gtkmm3\bin;%DRIVE_LETTER%\MinGW\gtk\bin;c:\Windows;c:\Windows\system32
set PROJECT_PATH=.
make DRIVE_LETTER="%DRIVE_LETTER%" PROJECT_DIR="%PROJECT_PATH%"
lab08/CSC2110/CD.h
#if !defined CD_H
#define CD_H
#include "Song.h"
#include "Text.h"
using CSC2110::String;
#include "ListArray.h"
using CSC2110::ListArray;
namespace CSC2110
{
class CD
{
private:
String* artist;
String* title;
int year;
int rating;
int num_tracks;
ListArray<Song>* songs;
public:
CD(String* artist, String* title, int year, int rating, int num_tracks);
virtual ~CD();
String* getKey();
void addSong(String* title, String* length);
void displayCD();
static ListArray<CD>* readCDs(const char* file_name);
static int compare_items(CD* one, CD* two);
static int compare_keys(String* sk, CD* cd);
static char getRadixChar(CD* cd, int index); //1-based
};
}
#endif
lab08/CSC2110/Double.h
#if !defined (DOUBLE_H)
#define DOUBLE_H
namespace CSC2110
{
class Double
{
private:
double value;
public:
Double(double val);
~Double();
double getValue();
};
}
#endif
lab08/CSC2110/HighPerformanceCounter.h
#if !defined (HIGHPERFORMANCECOUNTER_H)
#define HIGHPERFORMANCECOUNTER_H
namespace CSC2110
{
class HighPerformanceCounter
{
private:
double micro_spt; //micro_seconds per tick
HighPerformanceCounter();
static HighPerformanceCounter* hpc;
static int getTicksPerSecond();
public:
virtual ~HighPerformanceCounter();
static HighPerformanceCounter* getHighPerformanceCounter();
int getCurrentTimeInTicks();
double getTimeDifferenceInMicroSeconds(int start_time, int end_time);
};
}
#endif
lab08/CSC2110/Integer.h
#if !defined (INTEGER_H)
#define INTEGER_H
namespace CSC2110
{
class Integer
{
private:
int value;
public:
Integer(int val);
virtual ~Integer();
int getValue();
};
}
#endif
lab08/CSC2110/Keyboard.h
#if !defined KEYBOARD_H
#define KEYBOARD_H
#include "Text.h"
using CSC2110::String;
#include <string>
using namespace std;
namespace CSC2110
{
class Keyboard
{
private:
Keyboard();
public:
virtual ~Keyboard();
static Keyboard* getKeyboard();
//pre: the string (character literal) that will prompt the user for input
//post: the input read from the keyboard interpreted as an int is returned
int readInt(string prompt);
int getValidatedInt(string prompt, int min, int max);
//pre: the string that will prompt the user for input
//post: the input read from the keyboard interpreted as a double is returned
double readDouble(string prompt);
double getValidatedDouble(string prom ...
Below is a given ArrayList class and Main class Your Dreams Our Mission/tuto...
FOR MORE CLASSES VISIT
www.tutorialoutlet.com
Below is a given ArrayList class and Main class in search algorithms. Please modify the existing program so it can time the sequential search and the binary search methods several times each for randomly generated values, and record the results in a table. Do not time individual searches, but groups of them. For example, time 100 searches together or 1,000 searches together. Compare the running times of these two search methods that are obtained during the experiment.
My question is pretty simple, I just want to know how to call my ope.pdf
My question is pretty simple, I just want to know how to call my operator== function in
Stack.cpp using a list function.
Here is what I meant. This is my Stack.h file:
class Stack {
public:
/**constructors and destructors*/
Stack();
Stack(const Stack &S);
~Stack();
void pop();
void push(int data);
bool operator==(const Stack &S);
[ .......]
private:
List stack;
};
Here is my List.h file:
template
class List {
private:
struct Node {
listitem data;
Node* next;
Node* previous;
Node(listitem data) :
next(NULL), previous(NULL), data(data) {
}
};
typedef struct Node* NodePtr;
NodePtr start;
NodePtr end;
NodePtr cursor;
int length;
public:
........
bool operator==(const List &list);
[.......] }
[........]
template
bool List::operator==(const List& list) {
if (length != list.length)
return false;
NodePtr temp1 = start;
NodePtr temp2 = list.start;
while (temp1 != NULL) {
if (temp1->data != temp2->data)
return false;
temp1 = temp1->next;
temp2 = temp2->next;
}
return true;
}
[......]
So I already define my functions in List.h and I only need to call my function from List again in
my Stack.cpp file. For example from my Stack.cpp:
Stack::Stack(const Stack &S) :
stack(S.stack) {
}
void Stack::pop() {
stack.remove_start();
}
[......]
And I don\'t know how to call my operator== function in Stack.cpp from the List.h like the way
above. This is what my guess so far but did not work:
bool Stack::operator==(const Stack &S) {
stack.operator==(S.stack);
}
Thank you
Solution
When we wish to make a comparison, such as in an if statement, we use the double equals sign
(==).
1)bool operator==(const Stack &S); [ .......]
It means whatever the boolean operator it should be belongs to stack or equal to.
2) bool operator==(const List &list);
Likewise link list also compare with the constructor link list.
and constructor need not to call explicitly. it will call itself when program called first..
#include String.hpp#include ..Functionsfunctions.hpp.docx
#include "String.hpp"
#include "../Functions/functions.hpp"
// O(1)
String::String() {
// Allocate space.
array = new char[1];
// Add the null.
array[0] = '\0';
// Adjust private variables.
_capacity = 0;
_size = 0;
}
// O(1)
String::String(char c) {
// Allocate space.
array = new char[2];
// Add the character and the null.
array[0] = c;
array[1] = '\0';
// Adjust private variables.
_capacity = 1;
_size = 1;
}
// O(n)
String::String(char* str) {
// Get the length of the incoming string.
int length = 0;
while (str[length])
++length;
// Allocate space for the string plus a null.
array = new char[length + 1];
// Fill our array up, including the null.
for (int i = 0; i <= length; ++i)
array[i] = str[i];
// Adjust private variables.
_capacity = length;
_size = length;
}
// O(1)
String::~String() {
delete[] array;
}
// O(n)
char String::at(int index) const {
// If our index is negative, or beyond the size of our array, we cannot return
// anything.
return (index < 0 || (unsigned int)index >= size()) ? throw "Index"
: array[index];
}
void String::clear() {
for (unsigned int i = 0; i < _capacity; ++i)
array[i] = '\0';
_size = 0;
}
// O(n)
unsigned int String::size() const {
return _size;
}
// O(1)
bool String::empty() const {
return !this->array[0];
}
// O(1)
unsigned int String::capacity() const {
return this->_capacity;
}
// O(n)
void String::reserve(unsigned int n) {
if (!n)
return;
// Make a new array.
char* _array = new char[_capacity + n + 1]();
// Fill it up.
int length = this->size();
for (int i = 0; i <= length; ++i)
_array[i] = array[i];
// Remove old memory.
delete[] array;
// Save new memory.
array = _array;
// Adjust private variables.
_capacity += n;
return;
}
// O(n)
void String::insert(char c, int index) {
// Prepend and append as easy cases.
if (index <= 0)
prepend(c);
else if ((unsigned int)index >= size())
append(c);
else {
// Increase capacity, if needed.
if (this->size() == this->_capacity) {
this->reserve(this->size() * 2);
}
// Move all elements after index over.
for (int i = this->size() + 1; i >= index; --i)
array[i] = array[i - 1];
// Insert our new character.
array[index] = c;
_size++;
}
return;
}
// O(n)
void String::erase(char c) {
// Create a new array.
char* _array = new char[_capacity + 1];
// Copy all non-erased characters to the new array.
int length = size();
for (int i = 0, j = 0; i <= length; ++i) {
if (array[i] != c)
_array[j++] = array[i];
else
_size--;
}
// Remove the old array.
delete[] array;
array = _array;
return;
}
// O(n)
void String::remove(int index) {
// Copy all characters to the left, overwriting index.
int length = this->size();
for (int i = index; i < length; ++i)
array[i] = array[i + 1];
_ ...
maincpp include ListItemh include ltstringgt in.pdf
(main.cpp)
#include "ListItem.h"
#include <string>
#include <list>
#include <vector>
#include <algorithm>
#include <iostream>
using namespace std;
int main () {
// working with a vector of ints
int myints[] = { 5, 10, 15, 20 };
std::vector<int> vectorOfNums (myints,myints+4);
std::vector<int>::iterator vectItr;
// TODO: write call to find() to search for 15 in the vectorOfNums
if (vectItr != vectorOfNums.end())
std::cout << "Element found: " << *vectItr << 'n';
else
std::cout << "Element not foundn";
// TODO: write call to find() to search for 85 in the vectorOfNums
if (vectItr != vectorOfNums.end())
std::cout << "Element found: " << *vectItr << 'n';
else
std::cout << "Element not foundn";
// working with a list of strings
std::list<std::string> listOfWords;
std::list<std::string>::iterator listIter;
listOfWords.push_back("house");
listOfWords.push_back("cup");
listOfWords.push_back("car");
listOfWords.push_back("lamp");
// TODO: write call to find() to search for 'lamp' in the listOfWords and write
// the code to test for it
// TODO: write call to find() to search for 'music' in the listOfWords and write
// the code to test for it
// working with a list of listItems
std::list<ListItem> listOfItems;
std::list<ListItem>::iterator listItemIter;
listOfItems.push_back(ListItem("shoes", 150.95));
listOfItems.push_back(ListItem("laptop", 1245.85));
listOfItems.push_back(ListItem("dress", 85.68));
listOfItems.push_back(ListItem("polo shirt", 25.67));
// TODO: write call to find() to search for the 'dress' object in the listOfItems and write
// the code to test for it
// TODO: write call to find() to search for the 'slacks' object that cost '85.68' in the listOfItems and
write
// the code to test for it
return 0;
}
(ListItem.h)
#ifndef LISTITEMH
#define LISTITEMH
#include <string>
using namespace std;
class ListItem {
public:
ListItem();
ListItem(string itemInit, double priceInit);
// Print this node
void PrintNodeData();
// TODO: write the prototype for the '==' overload
// TODO: write the prototype for '<<' overload (hint: must be a friend)
private:
string item;
double price;
};
#endif
(ListIem.cpp)
#include "ListItem.h"
#include <iostream>
ListItem::ListItem() {
item = "";
price = 0.0;
}
ListItem::ListItem(string itemInit, double priceInit) {
item = itemInit;
price = priceInit;
}
// Print this node
void ListItem::PrintNodeData() {
cout << item << ": $" << price << endl;
}
// TODO: write the definition for the '==' overload
// TODO: write the prototype for '<<' overload
Given a Listitem class, complete main() using algorithms from the STL (STL Algorithms). An
example algorithm the find(): find (Inputiterator first, Inputiterator last, const T& val) The find uses
two iterators for the bounds of the search, first and last. The 3rd parameter is the value being
searched for. if we look inside the find() we might see code like this (ref cplusplus.com): The
description of find () states "The function uses operator== to compare the individual elements to
.
1- The design of a singly-linked list below is a picture of the functi (1).pdf
1. The design of a singly-linked list
below is a picture of the function that needs to be used
below is the code of the above picture:
#include <string>
#include <iostream>
#include <cmath>
#include <cstdio>
#include <algorithm>
using namespace std;
#define defaultSize 100
void Assert(bool val, string s)
{
if (!val)
{ // Assertion failed -- close the program
cout << "Assertion Failed: " << s << endl;
exit(-1);
}
}
template <typename E>
class Link {
public:
E element; // Value for this node
Link *next; // Pointer to next node in list
// Constructors
Link(const E& elemval, Link<E>* nextval = NULL)
{ element = elemval; next = nextval; }
Link(Link<E>* nextval =NULL) { next = nextval; }
};
template <typename E>
class LList: public Link<E> {
private:
Link<E>* head;// Intialization helper method
Link<E>* tail;// Pointer to last element
Link<E>* curr;// Access to current element
int cnt;// Size of list
void init(){// Intialization helper method
curr = tail = head = new Link<E>;
cnt = 0;
}
void removeall() {// Return link nodes to free store
while(head != NULL) {
curr = head;
head = head->next;
delete curr;
}
}
public:
LList(int size=defaultSize) { init(); }// Constructor
~LList() { removeall(); }// Destructor
void print() const;// Print list contents
void clear() { removeall(); init(); }// Clear list
// Insert "it" at current position
void insert(const E& it) {
curr->next = new Link<E>(it, curr->next);
if (tail == curr) tail = curr->next; // New tail
cnt++;
}
void append(const E& it) { // Append "it" to list
tail = tail->next = new Link<E>(it, NULL);
cnt++;
}
// Remove and return current element
E remove() {
Assert(curr->next != NULL, "No element");
E it = curr->next->element; // Remember value
Link<E>* ltemp = curr->next; // Remember link node
if (tail == curr->next) tail = curr; // Reset tail
curr->next = curr->next->next; // Remove from list
delete ltemp; // Reclaim space
cnt--; // Decrement the count
return it;
}
void moveToStart()// Place curr at list start
{ curr = head; }
void moveToEnd() // Place curr at list end
{ curr = tail; }
void prev(){
if (curr == head) return;
Link<E>* temp = head;
while (temp->next!=curr) temp=temp->next;
curr = temp;
}
void next(){ if (curr != tail) curr = curr->next; }
int length() const { return cnt; }
int currPos() const {
Link<E>* temp = head;
int i;
for (i=0; curr != temp; i++)
temp = temp->next;
return i;
}
void moveToPos(int pos){
Assert ((pos>=0)&&(pos<=cnt), "Position out of range");
curr = head;
for(int i=0; i<pos; i++) curr = curr->next;
}
const E& getValue() const {
Assert(curr->next != NULL, "No value");
return curr->next->element;
}
};
completed this code to fulfill the requirement below:
Write a function to insert an integer into a singly-linked list of elements arranged from largest to
smallest. Requires that elements remain ordered after insertion.
2. The design of array-based stack
below is a picture of the function that needs to be used
below is the code of the above picture:
#include <string.h>
#.
ReversePoem.java ---------------------------------- public cl.pdf
ReversePoem.java :-
---------------------------------
public class ReversePoem {
/*This programs has you display a pessimistic poem from a list of phrases*/
// and then reverse the phrases to find another more optimistic poem.
public static void main(String[] args) throws Exception
{
//Queue object
MyQueue queue = new MyQueue<>();
//Stack object
MyStack stack = new MyStack<>();
//String buffer to apppend all Strings
StringBuffer sb = new StringBuffer();
// Create a single String object from the 16 Strings below
String set1 = \"I am part of a lost generation#and I refuse to believe that#\";
sb.append(set1);
String set2 = \"I can change the world#I realize this may be a shock but#\";
sb.append(set2);
String set3 = \"\'Happiness comes from within\'#is a lie, and#\";
sb.append(set3);
String set4 = \"\'Money will make me happy\'#So in 30 years I will tell my children#\";
sb.append(set4);
String set5 = \"they are not the most important thing in my life#\";
sb.append(set5);
String set6 = \"My employer will know that#I have my priorities straight because#\";
sb.append(set6);
String set7 = \"work#is more important than#family#I tell you this#\";
sb.append(set7);
String set8 = \"Once upon a time#Families stayed together#\";
sb.append(set8);
String set9 = \"but this will not be true in my era#\";
sb.append(set9);
String set10 = \"This is a quick fix society#Experts tell me#\";
sb.append(set10);
String set11 = \"30 years from now, I will be celebrating the 10th anniversary of my
divorce#\";
sb.append(set11);
String set12 = \"I do not concede that#I will live in a country of my own making#\";
sb.append(set12);
String set13 = \"In the future#Environmental destruction will be the norm#\";
sb.append(set13);
String set14 = \"No longer can it be said that#My peers and I care about this earth#\";
sb.append(set14);
String set15 = \"It will be evident that#My generation is apathetic and lethargic#\";
sb.append(set15);
String set16 = \"It is foolish to presume that#There is hope#\";
sb.append(set16);
String finalString = sb.toString();
String itmes[] = finalString.split(\"#\");
System.out.println(\"========== Original Phrase ==============\");
for(int i = 0 ; i < itmes.length;i++){
queue.enqueue(itmes[i]);
System.out.println(itmes[i]);
}
for(int i = 0 ; i < itmes.length;i++){
stack.push(queue.dequeue());
}
System.out.println(\"========== Reverse Phrase ==============\");
for(int i = 0 ; i < itmes.length;i++){
System.out.println(stack.pop());
}
/* You are given a list of phrases in Strings; the phrases
are separated by pound signs: \'#\':
1. Create a single String object from this list.
2. Then, split the String of phrases into an array of
phrases using the String split method.
3. Display a poem by walking through the array and
displaying each phrase one per line.
4. And, at the same time, place each phrase on a
MyQueue object using only the enqueue method.
5. After all the phrases have been placed on the queue,
transfer the phrases from the MyQueue object to a
MyS.
#ifndef MYLIST_H_ #define MYLIST_H_#includeiostream #include.docx
#ifndef MYLIST_H_ #define MYLIST_H_#includeiostream #include
RightTrianglerightTriangle.cppRightTrianglerightTriangle.cpp.docx
RightTriangle/rightTriangle.cppRightTriangle/rightTriangle.cpp// This file includes implementations for functions of the right
// triangle class.
#include<iostream>
#include<cmath>
usingnamespace std;
#include"rightTriangle.h"
// Default constructor
RightTriangle::RightTriangle()
{
base =0;
height =0;
}
// SET functions (for storing data in private data members)
voidRightTriangle::setHeight(double h)
{
height = h;
}
voidRightTriangle::setBase(double b)
{
base = b;
}
// Calculate length of hypotenuse using
// Pythagorean Theorem
doubleRightTriangle::calcHypotenuse()
{
return sqrt (base * base + height * height);
}
__MACOSX/RightTriangle/._rightTriangle.cpp
RightTriangle/rightTriangle.h
// This file defines the specifications for a class to store
// attributes of a right triangle
class RightTriangle
{
private: // PRIVATE data members
double base;
double height;
public: // PUBLIC member functions
RightTriangle(); // Default constructor
void setHeight(double h); // SET functions
void setBase(double b);
// Calculate length of hypotenuse
double calcHypotenuse();
};
__MACOSX/RightTriangle/._rightTriangle.h
RightTriangle/testTriangle.cppRightTriangle/testTriangle.cpp// This program calculates various parameters of a
// right triangle.
#include<iostream>
usingnamespace std;
#include"rightTriangle.h"
int main()
{
// Declaration
double base,height;
RightTriangle aTriangle;
// Input
cout <<"Enter the base of the triangle: ";
cin >> base;
cout <<"Enter the height of the triangle: ";
cin >> height;
// Move data to object
aTriangle.setBase(base);
aTriangle.setHeight(height);
// Calculations and output
cout << endl;
cout <<"Length of hypotenuse: "
<< aTriangle.calcHypotenuse()<< endl;
return0;
}// end main function
__MACOSX/RightTriangle/._testTriangle.cpp
c++practice3a3b/._rightTriangle.cpp
c++practice3a3b/._rightTriangle.h
c++practice3a3b/._testTriangle.cpp
c++practice3a3b/partList.txt
2345 Snoozle 15.4 29.95
1234 Widget 5.4 9.99
3456 Bludger 9.1 15.49
5678 Zeeter 7.7 1.99
6789 Sub_Tweezer 12.3 5.25
4567 Woofle 3.7 49.79
c++practice3a3b/partMgr.cppc++practice3a3b/partMgr.cpp// This program manages a list of parts.
#include<iostream>
#include<iomanip>
#include<fstream>
usingnamespace std;
// Attributes for one part
struct partInfo
{
int number;
char name[30];
double weight;
double price;
};
constint MAX_LIST_SIZE =100;
// Function prototypes
int menu();
void buildPartsList(partInfo partList[],int& listSize);
void searchParts(partInfo partList[],int numParts);
void listParts(partInfo partList[],int& numParts);
void insertPart(partInfo list[],int& numElems);
void deletePart(partInfo list[],int& numElems);
partInfo getPartInfo();
v ...
Please teach me how to fix the errors and where should be modified. .pdf
Please teach me how to fix the errors and where should be modified. Thank you!
"Program generated too much output. Output restricted to 50000 characters. Check program for
any unterminated loops generating output."
LinkedList.cpp
LinkedList::LinkedList() {
head = new Node;
head->next = NULL;
length = 0;
}
void LinkedList::insertNode(Sales dataIn) {
/* Write your code here */
Node *newNode;
Node *pCur;
Node *pPre;
newNode = new Node;
newNode->data = dataIn;
pPre = head;
pCur = head->next;
while (pCur != NULL && pCur->data.getName() < dataIn.getName()) {
pPre = pCur;
pCur = pCur->next;
}
pPre->next = newNode;
newNode->next = pCur;
length++;
}
bool LinkedList::deleteNode(string target){
Node *pCur;
Node *pPre;
bool deleted = false;
pPre = head;
pCur = head->next;
while (pCur != NULL && pCur->data.getName() < target) {
pPre = pCur;
pCur = pCur->next;
}
if (pCur != NULL && pCur->data.getName() == target) {
pPre->next = pCur->next;
delete pCur;
deleted = true;
length--;
}
return deleted;
}
void LinkedList::displayList() const{
Node *pCur;
pCur = head->next;
while (pCur) {
cout << pCur->data;
pCur = pCur->next;
}
cout << endl;
}
void LinkedList::displayList(int year) const {
Node *pCur;
pCur = head->next;
int cnt = 0;
while (pCur) {
if (pCur->data.getYear() == year){
cout << pCur->data;
cnt++;
}
pCur = pCur->next;
}
if (cnt == 0){
cout << "N/A" << endl;
}
}
double LinkedList::average() const {
double total = 0.0;
double average;
Node *pCur;
pCur = head;
while (pCur != NULL) {
total += pCur->data.getAmount();
pCur = pCur->next;
}
average = total / static_cast(length);
return average;
}
bool LinkedList::searchList(string find, Sales &dataOut) const {
bool found = false;
Node *pCur;
pCur = head->next;
while (pCur != NULL && pCur->data.getName() < find) {
pCur = pCur->next;
}
if (pCur != NULL && pCur->data.getName() == find) {
dataOut = pCur->data;
found = true;
}
return found;
}
LinkedList::~LinkedList() {
Node *pCur;
Node *pNext;
pCur = head->next;
while(pCur != NULL) {
pNext = pCur->next;
delete pCur;
pCur = pNext;
}
delete head;
}
main.cpp
void buildList(const string &filename, LinkedList &list);
void deleteManager(LinkedList &list);
void searchManager(const LinkedList &list);
void displayManager(const LinkedList &list);
int main() {
string inputFileName;
LinkedList list;
cout << "Enter file name: ";
getline(cin, inputFileName);
buildList(inputFileName, list);
displayManager(list);
searchManager(list);
deleteManager(list);
displayManager(list);
return 0;
}
void buildList(const string &filename, LinkedList &list) {
ifstream inFile(filename);
cout <<"Reading data from \"" << filename << "\"\n";
if(!inFile) {
cout << "Error opening the input file: \""<< filename << "\"" << endl;
exit(EXIT_FAILURE);
}
string id;
int year;
string name;
int amount;
string line;
while (getline(inFile, line) ) {
stringstream temp(line);
temp >> id >> year;
temp.ignore();
getline(temp, name, ';');
temp >> amount;
// create a Sales object and initialize it with data from file.
Please answer it as soon as possible Chapter 2- Part 2 Link Stat.pdf
Please answer it as soon as possible Chapter 2- Part 2: Link State Routing I. Link state routing
Consider the following network. The objective is to fill the routing and forwarding tables of node
X. Q1. Draw the shortest-path tree from X Use the Dijkstra's algorithm to compute the shortest
path from X to all the other routers, then draw the shortest path tree. - Only the following file
extensions are accepted: .pdf. docx, .gif and .gpg, - Hand writing figures are not accepted Attach
File.
Please answer in Arm assembly language The file palindrome.s conta.pdf
Please answer in Arm assembly language
The file palindrome.s contains the following subroutine definition:
Complete this subroutine with a recursive algorithm. (Fix the problem in isLetter as you did for
the previous task.) Save the file as l07_t02.s. Marks are:
1-the string contains only lower case letters, no digits, spaces, or punctuation (ex: "otto")
2-string has mixed case, but only letters (ex: "RaceCar")
3-string has mixed case, and non-letters (ex: "A man, a plan, a canal, Panama!")
All versions must return false for a non-palindrome (ex: "David"). Do not change the contents of
the string in memory.
Hint: here is Python code for a recursive palindrome function:
palindrome.s:.
More Related Content
Similar to Pleae help me with this C++ question, ill upvote thanks.Write the .pdf
helpInstructionsAdd the function max as an abstract function to .pdf
help
Instructions
Add the function max as an abstract function to the class arrayListType to return the largest
element of the list.
Also, write the definition of the function max in the class unorderedArrayListType and write a
program to test this function.
files:
main.cpp:
//Data: 18 42 78 22 42 5 42 57
arrayListType.h:
#ifndef H_arrayListType
#define H_arrayListType
class arrayListType
{
public:
bool isEmpty() const;
//Function to determine whether the list is empty
//Postcondition: Returns true if the list is empty;
// otherwise, returns false.
bool isFull() const;
//Function to determine whether the list is full
//Postcondition: Returns true if the list is full;
// otherwise, returns false.
int listSize() const;
//Function to determine the number of elements in
//the list.
//Postcondition: Returns the value of length.
int maxListSize() const;
//Function to determine the maximum size of the list
//Postcondition: Returns the value of maxSize.
void print() const;
//Function to output the elements of the list
//Postcondition: Elements of the list are output on the
// standard output device.
bool isItemAtEqual(int location, int item) const;
//Function to determine whether item is the same as
//the item in the list at the position specified
//by location.
//Postcondition: Returns true if list[location]
// is the same as item; otherwise,
// returns false.
// If location is out of range, an
// appropriate message is displayed.
virtual void insertAt(int location, int insertItem) = 0;
//Function to insert insertItem in the list at the
//position specified by location.
//Note that this is an abstract function.
//Postcondition: Starting at location, the elements of
// the list are shifted down,
// list[location] = insertItem; length++;
// If the list is full or location is out of
// range, an appropriate message is displayed.
virtual void insertEnd(int insertItem) = 0;
//Function to insert insertItem at the end of
//the list. Note that this is an abstract function.
//Postcondition: list[length] = insertItem; and length++;
// If the list is full, an appropriate
// message is displayed.
void removeAt(int location);
//Function to remove the item from the list at the
//position specified by location
//Postcondition: The list element at list[location] is
// removed and length is decremented by 1.
// If location is out of range, an
// appropriate message is displayed.
void retrieveAt(int location, int& retItem) const;
//Function to retrieve the element from the list at the
//position specified by location
//Postcondition: retItem = list[location]
// If location is out of range, an
// appropriate message is displayed.
virtual void replaceAt(int location, int repItem) = 0;
//Function to replace the elements in the list
//at the position specified by location.
//Note that this is an abstract function.
//Postcondition: list[location] = repItem
// If location is out of range, an
// appropriate message is displayed.
void clearList();
//Function to remove all th.
2.(Sorted list array implementation)This sorted list ADT discussed .pdf
2.(Sorted list: array implementation)This sorted list ADT discussed in class should be extended
by the addition of two new methods:
//Interface: ArrayListADT
//works for int
public interface ArrayListADT {
public boolean isEmpty(); //Method to determine whether the list is empty.
public boolean isFull(); //Method to determine whether the list is full.
public int listSize(); //Method to return the number of elements in the list.
public int maxListSize(); //Method to return the maximum size of the list.
public void print(); //Method to output the elements of the list.
public boolean isItemAtEqual(int location, int item); //Method to determine whether item is
the same as the item in the list at location.
public void insertAt(int location, int insertItem); //Method to insert insertItem in the list at
the position
public void insertEnd(int insertItem); //Method to insert insertItem at the end of the list.
public void removeAt(int location); //Method to remove the item from the list at location.
public int retrieveAt(int location); //Method to retrieve the element from the list at location.
public void replaceAt(int location, int repItem); //Method to replace the element in the list at
location with repItem.
public void clearList(); //Method to remove all the elements from the list.
public int search(int searchItem); //Method to determine whether searchItem is in the list.
public void remove(int removeItem); //Method to remove an item from the list.
}
//Class: ArrayListClass implements
//Interface: ArrayListADT
public abstract class ArrayListClass implements ArrayListADT {
protected int length; //to store the length of the list
protected int maxSize; //to store the maximum size of the list
protected int[] list; //array to hold the list elements
//Default constructor
public ArrayListClass() {
maxSize = 100;
length = 0;
list = new int[maxSize];
}
//Alternate Constructor
public ArrayListClass(int size) {
if(size <= 0) {
System.err.println(\"The array size must be positive. Creating an array of size 100.\");
maxSize = 100;
}
else
maxSize = size;
length = 0;
list = new int[maxSize];
}
public boolean isEmpty() {
return (length == 0);
}
public boolean isFull() {
return (length == maxSize);
}
public int listSize() {
return length;
}
public int maxListSize() {
return maxSize;
}
public void print() {
for (int i = 0; i < length; i++)
System.out.print(list[i] + \" \");
System.out.println();
}
public boolean isItemAtEqual(int location, int item) {
if (location < 0 || location >= length) {
System.err.println(\"The location of the item to be compared is out of range.\");
return false;
}
return list[location]== item;
}
public void clearList() {
for (int i = 0; i < length; i++)
list[i] = 0;
length = 0;
System.gc(); //invoke the Java garbage collector
}
public void removeAt(int location) {
if (location < 0 || location >= length)
System.err.println(\"The location of the item to be removed is out of range.\");
else {
for(int i = location; i < length - 1; i++)
list[i] .
Using the C++ programming language1. Implement the UnsortedList cl.pdf
Using the C++ programming language
1. Implement the UnsortedList class to store a list of numbers that are input into the list from
data.txt.
- create a main.cpp file that gets the numbers from the file
- insert the number 7 into the list
- insert another number 300 into the list
- delete the number 6 from the list
- print out the following:
--the entire list
- the greatest
- the least
2. Attach the main.cpp, UnsortedList.cpp, the ItemType.h, and the output file two called
outfile2.txt
Use the files below:
// listDriver.cpp
// Test driver
#include
#include
#include
#include
#include
#include \"unsorted.h\"
using namespace std;
void PrintList(ofstream& outFile, UnsortedType& list);
int main()
{
ifstream inFile; // file containing operations
ofstream outFile; // file containing output
string inFileName; // input file external name
string outFileName; // output file external name
string outputLabel;
string command; // operation to be executed
int number;
ItemType item;
UnsortedType list;
bool found;
int numCommands;
// Prompt for file names, read file names, and prepare files
cout << \"Enter name of input command file; press return.\" << endl;
cin >> inFileName;
inFile.open(inFileName.c_str());
cout << \"Enter name of output file; press return.\" << endl;
cin >> outFileName;
outFile.open(outFileName.c_str());
cout << \"Enter name of test run; press return.\" << endl;
cin >> outputLabel;
outFile << outputLabel << endl;
if (!inFile)
{
cout << \"file not found\" << endl;
exit(2)
}
inFile >> command;
numCommands = 0;
while (command != \"Quit\")
{
if (command == \"PutItem\")
{
inFile >> number;
item.Initialize(number);
list.PutItem(item);
item.Print(outFile);
outFile << \" is in list\" << endl;
}
else if (command == \"DeleteItem\")
{
inFile >> number;
item.Initialize(number);
list.DeleteItem(item);
item.Print(outFile);
outFile << \" is deleted\" << endl;
}
else if (command == \"GetItem\")
{
inFile >> number;
item.Initialize(number);
item = list.GetItem(item, found);
item.Print(outFile);
if (found)
outFile << \" found in list.\" << endl;
else outFile << \" not in list.\" << endl;
}
else if (command == \"GetLength\")
outFile << \"Length is \" << list.GetLength() << endl;
else if (command == \"IsFull\")
if (list.IsFull())
outFile << \"List is full.\" << endl;
else outFile << \"List is not full.\" << endl;
else if (command == \"MakeEmpty\")
list.MakeEmpty();
else if (command == \"PrintList\")
PrintList(outFile, list);
else
cout << command << \" is not a valid command.\" << endl;
numCommands++;
cout << \" Command number \" << numCommands << \" completed.\"
<< endl;
inFile >> command;
};
cout << \"Testing completed.\" << endl;
inFile.close();
outFile.close();
return 0;
}
void PrintList(ofstream& dataFile, UnsortedType& list)
// Pre: list has been initialized.
// dataFile is open for writing.
// Post: Each component in list has been written to dataFile.
// dataFile is still open.
{
int length;
ItemType item;
list.ResetList();
length = list.GetLength();
for .
#ifndef LINKED_LIST_ #define LINKED_LIST_ templateclass It.pdf
#ifndef LINKED_LIST_
#define LINKED_LIST_
template
class LinkedList {
private:
std::shared_ptr> headPtr; // Pointer to first node in the chain;
// (contains the first entry in the list)
int itemCount; // Current count of list items
std::shared_ptr> getNodeAt(int position) const;
public:
LinkedList();
LinkedList(const LinkedList& aList);
virtual ~LinkedList();
bool isEmpty() const;
int getLength() const;
bool insert(int newPosition, const ItemType& newEntry);
bool remove(int position);
void clear();
/** throw PrecondViolatedExcept if position < 1 or
position > getLength(). */
ItemType getEntry(int position) const throw(PrecondViolatedExcept);
/** throw PrecondViolatedExcept if position < 1 or
position > getLength(). */
void replace(int position, const ItemType& newEntry)
throw(PrecondViolatedExcept);
// Operator Overloading
void operator = (const LinkedList& arg);
friend std::ostream& operator << (std::ostream& os, const LinkedList& arg)
{
os << \"There are \" << arg.getLength() << \" values in the list:\" << std::endl;
for (int i{ 1 }; i <= arg.getLength(); i++) {
os << arg.getEntry(i) << std::endl;
}
os << std::endl << std::endl << std::endl << std::endl;
return os;
}
};
// Returns a pointer to the Node at the given position.
template
std::shared_ptr> LinkedList::getNodeAt (int position) const {
std::shared_ptr> currPtr{ headPtr };
for (int i{ 1 }; i < position; i++)
currPtr = currPtr->getNext();
return currPtr;
}
// Default constructor.
template
LinkedList::LinkedList() {
headPtr = nullptr;
itemCount = 0;
}
// Copy constructor.
template
LinkedList::LinkedList(const LinkedList& aList) {
itemCount = aList.getLength();
auto currPtr{ aList.headPtr };
auto newNodePtr{ headPtr = std::make_shared>(currPtr->getItem()) };
auto prevNodePtr{ newNodePtr };
currPtr = currPtr->getNext();
for (int i{ 2 }; i <= itemCount; i++) {
newNodePtr = std::make_shared>(currPtr->getItem());
prevNodePtr->setNext(newNodePtr);
prevNodePtr = newNodePtr;
currPtr = currPtr->getNext();
}
}
// Destructor.
template
LinkedList::~LinkedList() {
headPtr = nullptr;
itemCount = 0;
}
// Accessor/Info Functions.
template
bool LinkedList::isEmpty() const {
return (itemCount > 0)?0:1;
}
template
int LinkedList::getLength() const {
return itemCount;
}
// Places a Node at a given position (element at the same position is now pos+1).
template
bool LinkedList::insert(const int newPosition,
const ItemType& newEntry)
{
bool ableToInsert{ (newPosition >= 1) &&
(newPosition <= itemCount + 1) };
if (ableToInsert)
{
// Create a new node containing the new entry
auto newNodePtr{ std::make_shared>(newEntry) };
// Attach new node to chain
if (newPosition == 1)
{
// Insert new node at beginning of chain
newNodePtr->setNext(headPtr);
headPtr = newNodePtr;
}
else
{
// Find node that will be before new node
auto prevPtr{ getNodeAt(newPosition - 1) };
// Insert new node after node to which prevPtr points
newNodePtr->setNext(prevPtr->getNext());
prevPtr->setNext(newNodePtr);
} // end if
itemCount++; // .
AnswerNote LinkedList.cpp is written and driver program main.cpp.pdf
Answer:
Note: LinkedList.cpp is written and driver program main.cpp is also given.
//ListInterface.h
#ifndef _LIST_INTERFACE
#define _LIST_INTERFACE
template
class ListInterface
{
public:
virtual bool isEmpty() const = 0;
virtual int getLength() const = 0;
virtual bool insert(int newPosition, const ItemType& newEntry) = 0;
virtual bool remove(int position) = 0;
virtual void clear() = 0;
virtual ItemType getEntry(int position) const = 0;
virtual void replace(int position, const ItemType& newEntry) = 0;
}; // end ListInterface
#endif
//Node.h
#ifndef NODE_
#define NODE_
template
class Node
{
private:
ItemType item; // A data item
Node* next; // Pointer to next node
public:
Node();
Node(const ItemType& anItem);
Node(const ItemType& anItem, Node* nextNodePtr);
void setItem(const ItemType& anItem);
void setNext(Node* nextNodePtr);
ItemType getItem() const ;
Node* getNext() const ;
}; // end Node
#endif
//Node.cpp
#include \"Node.h\"
template
Node::Node() : next(nullptr)
{
} // end default constructor
template
Node::Node(const ItemType& anItem) : item(anItem), next(nullptr)
{
} // end constructor
template
Node::Node(const ItemType& anItem, Node* nextNodePtr) :
item(anItem), next(nextNodePtr)
{
} // end constructor
template
void Node::setItem(const ItemType& anItem)
{
item = anItem;
} // end setItem
template
void Node::setNext(Node* nextNodePtr)
{
next = nextNodePtr;
} // end setNext
template
ItemType Node::getItem() const
{
return item;
} // end getItem
template
Node* Node::getNext() const
{
return next;
} // end getNext
//PrecondViolatedExcept.h
#ifndef PRECOND_VIOLATED_EXCEPT_
#define PRECOND_VIOLATED_EXCEPT_
#include
#include
class PrecondViolatedExcept : public std::logic_error
{
public:
PrecondViolatedExcept(const std::string& message = \"\");
}; // end PrecondViolatedExcept
#endif
//PrecondViolatedExcept.cpp
#include \"PrecondViolatedExcept.h\"
PrecondViolatedExcept::PrecondViolatedExcept(const std::string& message)
: std::logic_error(\"Precondition Violated Exception: \" + message)
{
} // end constructor
//LinkedList.h
#ifndef LINKED_LIST_
#define LINKED_LIST_
#include \"ListInterface.h\"
#include \"Node.h\"
#include
#include \"PrecondViolatedExcept.h\"
template
class LinkedList : public ListInterface
{
private:
Node* headPtr; // Pointer to first node in the chain;
// (contains the first entry in the list)
int itemCount; // Current count of list items
// Locates a specified node in this linked list.
Node* getNodeAt(int position) const;
public:
LinkedList();
LinkedList(const LinkedList& aList);
virtual ~LinkedList();
bool isEmpty() const;
int getLength() const;
bool insert(int newPosition, const ItemType& newEntry);
bool remove(int position);
void clear();
ItemType getEntry(int position) const;
void replace(int position, const ItemType& newEntry);
}; // end LinkedList
#endif
//LinkedList.cpp
#include \"LinkedList.h\"
#include
#include
#include
#include
//Default constructor
template
LinkedList::LinkedList() : headPtr(nullptr), itemCount(0)
{
.
Complete the provided partial C++ Linked List program. Main.cpp is g.pdf
Complete the provided partial C++ Linked List program. Main.cpp is given and Link list header
file is also given. The given testfile listmain.cpp is given for demonstration of unsorted list
functionality. The functions header file is also given. Complete the functions of the header file
linked_list.h below.
=========================================================
// listmain.cpp
#include \"Linked_List.h\"
int main(int argc, char **argv)
{
float f;
Linked_List *theList;
cout << \"Simple List Demonstration\ \";
cout << \"(List implemented as an Array - Do not try this at home)\ \ \";
cout << \"Create a list and add a few tasks to the list\";
theList = new Linked_List(); // Instantiate a list object
theList->Insert(5, 3.1f); // Note: The argument to the funtion should be a float
theList->Insert(1, 5.6f); // A constant real number like 3.1 is interpreted as
theList->Insert(3, 8.3f); // a double unless it is explicitly defined as a float
theList->Insert(2, 7.4f); // by adding an \'f\' to the end of the number.
theList->Insert(4, 2.5f);
// Show what is in the list
theList->PrintList();
// Test the list length function
cout << \"\ List now contains \" << theList->ListLength() << \"items.\ \ \";
// Test delete function
cout << \"Testing delete of last item in list.\ \";
theList->Delete(4);
theList->PrintList();
// Test delete function
cout << \"Testing delete of first item in list.\ \";
theList->Delete(5);
theList->PrintList();
// Test delete function
cout << \"Testing delete of a middle item in list.\ \";
theList->Delete(3);
theList->PrintList();
// Test delete function with a known failure argument
cout << \"Testing failure in delete function.\ \";
if(theList->Delete(4))
cout << \"Oops! Should not have been able to delete.\ \";
else
cout << \"Unable to locate item to delete.\ \";
// Test search (known failure)
cout << \"Testing Search function. Search for key 3\ \";
if(theList->Search(3, &f))
cout << \"Search result: theData = %f\ \", f;
else
cout << \"Search result: Unable to locate item in list\ \";
// Test search (known success)
cout << \"Testing Search function. Search for key 2\ \";
if(theList->Search(2, &f))
cout << \"Search result: theData = \" << f << \"\ \";
else
cout << \"Search result: Unable to locate item in list\ \";
cout << \"\ \ End list demonstration...\";
return 0;
}
=====================================================================
===================
// linked_list.h functions
#include
using namespace std;
// Define a structure to use as the list item
struct ListItem
{
int key;
float theData;
ListItem *next;
};
class Linked_List
{
private:
ListItem *head; // Pointer to head of the list
public:
Linked_List(); // Class constructor
~Linked_List(); // Class destuctor
void ClearList(); // Remove all items from the list
bool Insert(int key, float f);// Add an item to the list
bool Delete(int key); // Delete an item from the list
bool Search(int key, float *retVal); // Search for an item in the list
int ListLength(); // Return numb.
How do I declare the following constructors in my .h file Below.pdf
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.
lab08build.bat@echo offclsset DRIVE_LETTER=1s.docx
lab08/build.bat
@echo off
cls
set DRIVE_LETTER=%1:
set PATH=%DRIVE_LETTER%\MinGW\bin;%DRIVE_LETTER%\MinGW\msys\1.0\bin;%DRIVE_LETTER%\MinGW\gtkmm3\bin;%DRIVE_LETTER%\MinGW\gtk\bin;c:\Windows;c:\Windows\system32
set PROJECT_PATH=.
make DRIVE_LETTER="%DRIVE_LETTER%" PROJECT_DIR="%PROJECT_PATH%"
lab08/CSC2110/CD.h
#if !defined CD_H
#define CD_H
#include "Song.h"
#include "Text.h"
using CSC2110::String;
#include "ListArray.h"
using CSC2110::ListArray;
namespace CSC2110
{
class CD
{
private:
String* artist;
String* title;
int year;
int rating;
int num_tracks;
ListArray<Song>* songs;
public:
CD(String* artist, String* title, int year, int rating, int num_tracks);
virtual ~CD();
String* getKey();
void addSong(String* title, String* length);
void displayCD();
static ListArray<CD>* readCDs(const char* file_name);
static int compare_items(CD* one, CD* two);
static int compare_keys(String* sk, CD* cd);
static char getRadixChar(CD* cd, int index); //1-based
};
}
#endif
lab08/CSC2110/Double.h
#if !defined (DOUBLE_H)
#define DOUBLE_H
namespace CSC2110
{
class Double
{
private:
double value;
public:
Double(double val);
~Double();
double getValue();
};
}
#endif
lab08/CSC2110/HighPerformanceCounter.h
#if !defined (HIGHPERFORMANCECOUNTER_H)
#define HIGHPERFORMANCECOUNTER_H
namespace CSC2110
{
class HighPerformanceCounter
{
private:
double micro_spt; //micro_seconds per tick
HighPerformanceCounter();
static HighPerformanceCounter* hpc;
static int getTicksPerSecond();
public:
virtual ~HighPerformanceCounter();
static HighPerformanceCounter* getHighPerformanceCounter();
int getCurrentTimeInTicks();
double getTimeDifferenceInMicroSeconds(int start_time, int end_time);
};
}
#endif
lab08/CSC2110/Integer.h
#if !defined (INTEGER_H)
#define INTEGER_H
namespace CSC2110
{
class Integer
{
private:
int value;
public:
Integer(int val);
virtual ~Integer();
int getValue();
};
}
#endif
lab08/CSC2110/Keyboard.h
#if !defined KEYBOARD_H
#define KEYBOARD_H
#include "Text.h"
using CSC2110::String;
#include <string>
using namespace std;
namespace CSC2110
{
class Keyboard
{
private:
Keyboard();
public:
virtual ~Keyboard();
static Keyboard* getKeyboard();
//pre: the string (character literal) that will prompt the user for input
//post: the input read from the keyboard interpreted as an int is returned
int readInt(string prompt);
int getValidatedInt(string prompt, int min, int max);
//pre: the string that will prompt the user for input
//post: the input read from the keyboard interpreted as a double is returned
double readDouble(string prompt);
double getValidatedDouble(string prom ...
Below is a given ArrayList class and Main class Your Dreams Our Mission/tuto...
FOR MORE CLASSES VISIT
www.tutorialoutlet.com
Below is a given ArrayList class and Main class in search algorithms. Please modify the existing program so it can time the sequential search and the binary search methods several times each for randomly generated values, and record the results in a table. Do not time individual searches, but groups of them. For example, time 100 searches together or 1,000 searches together. Compare the running times of these two search methods that are obtained during the experiment.
My question is pretty simple, I just want to know how to call my ope.pdf
My question is pretty simple, I just want to know how to call my operator== function in
Stack.cpp using a list function.
Here is what I meant. This is my Stack.h file:
class Stack {
public:
/**constructors and destructors*/
Stack();
Stack(const Stack &S);
~Stack();
void pop();
void push(int data);
bool operator==(const Stack &S);
[ .......]
private:
List stack;
};
Here is my List.h file:
template
class List {
private:
struct Node {
listitem data;
Node* next;
Node* previous;
Node(listitem data) :
next(NULL), previous(NULL), data(data) {
}
};
typedef struct Node* NodePtr;
NodePtr start;
NodePtr end;
NodePtr cursor;
int length;
public:
........
bool operator==(const List &list);
[.......] }
[........]
template
bool List::operator==(const List& list) {
if (length != list.length)
return false;
NodePtr temp1 = start;
NodePtr temp2 = list.start;
while (temp1 != NULL) {
if (temp1->data != temp2->data)
return false;
temp1 = temp1->next;
temp2 = temp2->next;
}
return true;
}
[......]
So I already define my functions in List.h and I only need to call my function from List again in
my Stack.cpp file. For example from my Stack.cpp:
Stack::Stack(const Stack &S) :
stack(S.stack) {
}
void Stack::pop() {
stack.remove_start();
}
[......]
And I don\'t know how to call my operator== function in Stack.cpp from the List.h like the way
above. This is what my guess so far but did not work:
bool Stack::operator==(const Stack &S) {
stack.operator==(S.stack);
}
Thank you
Solution
When we wish to make a comparison, such as in an if statement, we use the double equals sign
(==).
1)bool operator==(const Stack &S); [ .......]
It means whatever the boolean operator it should be belongs to stack or equal to.
2) bool operator==(const List &list);
Likewise link list also compare with the constructor link list.
and constructor need not to call explicitly. it will call itself when program called first..
#include String.hpp#include ..Functionsfunctions.hpp.docx
#include "String.hpp"
#include "../Functions/functions.hpp"
// O(1)
String::String() {
// Allocate space.
array = new char[1];
// Add the null.
array[0] = '\0';
// Adjust private variables.
_capacity = 0;
_size = 0;
}
// O(1)
String::String(char c) {
// Allocate space.
array = new char[2];
// Add the character and the null.
array[0] = c;
array[1] = '\0';
// Adjust private variables.
_capacity = 1;
_size = 1;
}
// O(n)
String::String(char* str) {
// Get the length of the incoming string.
int length = 0;
while (str[length])
++length;
// Allocate space for the string plus a null.
array = new char[length + 1];
// Fill our array up, including the null.
for (int i = 0; i <= length; ++i)
array[i] = str[i];
// Adjust private variables.
_capacity = length;
_size = length;
}
// O(1)
String::~String() {
delete[] array;
}
// O(n)
char String::at(int index) const {
// If our index is negative, or beyond the size of our array, we cannot return
// anything.
return (index < 0 || (unsigned int)index >= size()) ? throw "Index"
: array[index];
}
void String::clear() {
for (unsigned int i = 0; i < _capacity; ++i)
array[i] = '\0';
_size = 0;
}
// O(n)
unsigned int String::size() const {
return _size;
}
// O(1)
bool String::empty() const {
return !this->array[0];
}
// O(1)
unsigned int String::capacity() const {
return this->_capacity;
}
// O(n)
void String::reserve(unsigned int n) {
if (!n)
return;
// Make a new array.
char* _array = new char[_capacity + n + 1]();
// Fill it up.
int length = this->size();
for (int i = 0; i <= length; ++i)
_array[i] = array[i];
// Remove old memory.
delete[] array;
// Save new memory.
array = _array;
// Adjust private variables.
_capacity += n;
return;
}
// O(n)
void String::insert(char c, int index) {
// Prepend and append as easy cases.
if (index <= 0)
prepend(c);
else if ((unsigned int)index >= size())
append(c);
else {
// Increase capacity, if needed.
if (this->size() == this->_capacity) {
this->reserve(this->size() * 2);
}
// Move all elements after index over.
for (int i = this->size() + 1; i >= index; --i)
array[i] = array[i - 1];
// Insert our new character.
array[index] = c;
_size++;
}
return;
}
// O(n)
void String::erase(char c) {
// Create a new array.
char* _array = new char[_capacity + 1];
// Copy all non-erased characters to the new array.
int length = size();
for (int i = 0, j = 0; i <= length; ++i) {
if (array[i] != c)
_array[j++] = array[i];
else
_size--;
}
// Remove the old array.
delete[] array;
array = _array;
return;
}
// O(n)
void String::remove(int index) {
// Copy all characters to the left, overwriting index.
int length = this->size();
for (int i = index; i < length; ++i)
array[i] = array[i + 1];
_ ...
maincpp include ListItemh include ltstringgt in.pdf
(main.cpp)
#include "ListItem.h"
#include <string>
#include <list>
#include <vector>
#include <algorithm>
#include <iostream>
using namespace std;
int main () {
// working with a vector of ints
int myints[] = { 5, 10, 15, 20 };
std::vector<int> vectorOfNums (myints,myints+4);
std::vector<int>::iterator vectItr;
// TODO: write call to find() to search for 15 in the vectorOfNums
if (vectItr != vectorOfNums.end())
std::cout << "Element found: " << *vectItr << 'n';
else
std::cout << "Element not foundn";
// TODO: write call to find() to search for 85 in the vectorOfNums
if (vectItr != vectorOfNums.end())
std::cout << "Element found: " << *vectItr << 'n';
else
std::cout << "Element not foundn";
// working with a list of strings
std::list<std::string> listOfWords;
std::list<std::string>::iterator listIter;
listOfWords.push_back("house");
listOfWords.push_back("cup");
listOfWords.push_back("car");
listOfWords.push_back("lamp");
// TODO: write call to find() to search for 'lamp' in the listOfWords and write
// the code to test for it
// TODO: write call to find() to search for 'music' in the listOfWords and write
// the code to test for it
// working with a list of listItems
std::list<ListItem> listOfItems;
std::list<ListItem>::iterator listItemIter;
listOfItems.push_back(ListItem("shoes", 150.95));
listOfItems.push_back(ListItem("laptop", 1245.85));
listOfItems.push_back(ListItem("dress", 85.68));
listOfItems.push_back(ListItem("polo shirt", 25.67));
// TODO: write call to find() to search for the 'dress' object in the listOfItems and write
// the code to test for it
// TODO: write call to find() to search for the 'slacks' object that cost '85.68' in the listOfItems and
write
// the code to test for it
return 0;
}
(ListItem.h)
#ifndef LISTITEMH
#define LISTITEMH
#include <string>
using namespace std;
class ListItem {
public:
ListItem();
ListItem(string itemInit, double priceInit);
// Print this node
void PrintNodeData();
// TODO: write the prototype for the '==' overload
// TODO: write the prototype for '<<' overload (hint: must be a friend)
private:
string item;
double price;
};
#endif
(ListIem.cpp)
#include "ListItem.h"
#include <iostream>
ListItem::ListItem() {
item = "";
price = 0.0;
}
ListItem::ListItem(string itemInit, double priceInit) {
item = itemInit;
price = priceInit;
}
// Print this node
void ListItem::PrintNodeData() {
cout << item << ": $" << price << endl;
}
// TODO: write the definition for the '==' overload
// TODO: write the prototype for '<<' overload
Given a Listitem class, complete main() using algorithms from the STL (STL Algorithms). An
example algorithm the find(): find (Inputiterator first, Inputiterator last, const T& val) The find uses
two iterators for the bounds of the search, first and last. The 3rd parameter is the value being
searched for. if we look inside the find() we might see code like this (ref cplusplus.com): The
description of find () states "The function uses operator== to compare the individual elements to
.
1- The design of a singly-linked list below is a picture of the functi (1).pdf
1. The design of a singly-linked list
below is a picture of the function that needs to be used
below is the code of the above picture:
#include <string>
#include <iostream>
#include <cmath>
#include <cstdio>
#include <algorithm>
using namespace std;
#define defaultSize 100
void Assert(bool val, string s)
{
if (!val)
{ // Assertion failed -- close the program
cout << "Assertion Failed: " << s << endl;
exit(-1);
}
}
template <typename E>
class Link {
public:
E element; // Value for this node
Link *next; // Pointer to next node in list
// Constructors
Link(const E& elemval, Link<E>* nextval = NULL)
{ element = elemval; next = nextval; }
Link(Link<E>* nextval =NULL) { next = nextval; }
};
template <typename E>
class LList: public Link<E> {
private:
Link<E>* head;// Intialization helper method
Link<E>* tail;// Pointer to last element
Link<E>* curr;// Access to current element
int cnt;// Size of list
void init(){// Intialization helper method
curr = tail = head = new Link<E>;
cnt = 0;
}
void removeall() {// Return link nodes to free store
while(head != NULL) {
curr = head;
head = head->next;
delete curr;
}
}
public:
LList(int size=defaultSize) { init(); }// Constructor
~LList() { removeall(); }// Destructor
void print() const;// Print list contents
void clear() { removeall(); init(); }// Clear list
// Insert "it" at current position
void insert(const E& it) {
curr->next = new Link<E>(it, curr->next);
if (tail == curr) tail = curr->next; // New tail
cnt++;
}
void append(const E& it) { // Append "it" to list
tail = tail->next = new Link<E>(it, NULL);
cnt++;
}
// Remove and return current element
E remove() {
Assert(curr->next != NULL, "No element");
E it = curr->next->element; // Remember value
Link<E>* ltemp = curr->next; // Remember link node
if (tail == curr->next) tail = curr; // Reset tail
curr->next = curr->next->next; // Remove from list
delete ltemp; // Reclaim space
cnt--; // Decrement the count
return it;
}
void moveToStart()// Place curr at list start
{ curr = head; }
void moveToEnd() // Place curr at list end
{ curr = tail; }
void prev(){
if (curr == head) return;
Link<E>* temp = head;
while (temp->next!=curr) temp=temp->next;
curr = temp;
}
void next(){ if (curr != tail) curr = curr->next; }
int length() const { return cnt; }
int currPos() const {
Link<E>* temp = head;
int i;
for (i=0; curr != temp; i++)
temp = temp->next;
return i;
}
void moveToPos(int pos){
Assert ((pos>=0)&&(pos<=cnt), "Position out of range");
curr = head;
for(int i=0; i<pos; i++) curr = curr->next;
}
const E& getValue() const {
Assert(curr->next != NULL, "No value");
return curr->next->element;
}
};
completed this code to fulfill the requirement below:
Write a function to insert an integer into a singly-linked list of elements arranged from largest to
smallest. Requires that elements remain ordered after insertion.
2. The design of array-based stack
below is a picture of the function that needs to be used
below is the code of the above picture:
#include <string.h>
#.
ReversePoem.java ---------------------------------- public cl.pdf
ReversePoem.java :-
---------------------------------
public class ReversePoem {
/*This programs has you display a pessimistic poem from a list of phrases*/
// and then reverse the phrases to find another more optimistic poem.
public static void main(String[] args) throws Exception
{
//Queue object
MyQueue queue = new MyQueue<>();
//Stack object
MyStack stack = new MyStack<>();
//String buffer to apppend all Strings
StringBuffer sb = new StringBuffer();
// Create a single String object from the 16 Strings below
String set1 = \"I am part of a lost generation#and I refuse to believe that#\";
sb.append(set1);
String set2 = \"I can change the world#I realize this may be a shock but#\";
sb.append(set2);
String set3 = \"\'Happiness comes from within\'#is a lie, and#\";
sb.append(set3);
String set4 = \"\'Money will make me happy\'#So in 30 years I will tell my children#\";
sb.append(set4);
String set5 = \"they are not the most important thing in my life#\";
sb.append(set5);
String set6 = \"My employer will know that#I have my priorities straight because#\";
sb.append(set6);
String set7 = \"work#is more important than#family#I tell you this#\";
sb.append(set7);
String set8 = \"Once upon a time#Families stayed together#\";
sb.append(set8);
String set9 = \"but this will not be true in my era#\";
sb.append(set9);
String set10 = \"This is a quick fix society#Experts tell me#\";
sb.append(set10);
String set11 = \"30 years from now, I will be celebrating the 10th anniversary of my
divorce#\";
sb.append(set11);
String set12 = \"I do not concede that#I will live in a country of my own making#\";
sb.append(set12);
String set13 = \"In the future#Environmental destruction will be the norm#\";
sb.append(set13);
String set14 = \"No longer can it be said that#My peers and I care about this earth#\";
sb.append(set14);
String set15 = \"It will be evident that#My generation is apathetic and lethargic#\";
sb.append(set15);
String set16 = \"It is foolish to presume that#There is hope#\";
sb.append(set16);
String finalString = sb.toString();
String itmes[] = finalString.split(\"#\");
System.out.println(\"========== Original Phrase ==============\");
for(int i = 0 ; i < itmes.length;i++){
queue.enqueue(itmes[i]);
System.out.println(itmes[i]);
}
for(int i = 0 ; i < itmes.length;i++){
stack.push(queue.dequeue());
}
System.out.println(\"========== Reverse Phrase ==============\");
for(int i = 0 ; i < itmes.length;i++){
System.out.println(stack.pop());
}
/* You are given a list of phrases in Strings; the phrases
are separated by pound signs: \'#\':
1. Create a single String object from this list.
2. Then, split the String of phrases into an array of
phrases using the String split method.
3. Display a poem by walking through the array and
displaying each phrase one per line.
4. And, at the same time, place each phrase on a
MyQueue object using only the enqueue method.
5. After all the phrases have been placed on the queue,
transfer the phrases from the MyQueue object to a
MyS.
#ifndef MYLIST_H_ #define MYLIST_H_#includeiostream #include.docx
#ifndef MYLIST_H_ #define MYLIST_H_#includeiostream #include
RightTrianglerightTriangle.cppRightTrianglerightTriangle.cpp.docx
RightTriangle/rightTriangle.cppRightTriangle/rightTriangle.cpp// This file includes implementations for functions of the right
// triangle class.
#include<iostream>
#include<cmath>
usingnamespace std;
#include"rightTriangle.h"
// Default constructor
RightTriangle::RightTriangle()
{
base =0;
height =0;
}
// SET functions (for storing data in private data members)
voidRightTriangle::setHeight(double h)
{
height = h;
}
voidRightTriangle::setBase(double b)
{
base = b;
}
// Calculate length of hypotenuse using
// Pythagorean Theorem
doubleRightTriangle::calcHypotenuse()
{
return sqrt (base * base + height * height);
}
__MACOSX/RightTriangle/._rightTriangle.cpp
RightTriangle/rightTriangle.h
// This file defines the specifications for a class to store
// attributes of a right triangle
class RightTriangle
{
private: // PRIVATE data members
double base;
double height;
public: // PUBLIC member functions
RightTriangle(); // Default constructor
void setHeight(double h); // SET functions
void setBase(double b);
// Calculate length of hypotenuse
double calcHypotenuse();
};
__MACOSX/RightTriangle/._rightTriangle.h
RightTriangle/testTriangle.cppRightTriangle/testTriangle.cpp// This program calculates various parameters of a
// right triangle.
#include<iostream>
usingnamespace std;
#include"rightTriangle.h"
int main()
{
// Declaration
double base,height;
RightTriangle aTriangle;
// Input
cout <<"Enter the base of the triangle: ";
cin >> base;
cout <<"Enter the height of the triangle: ";
cin >> height;
// Move data to object
aTriangle.setBase(base);
aTriangle.setHeight(height);
// Calculations and output
cout << endl;
cout <<"Length of hypotenuse: "
<< aTriangle.calcHypotenuse()<< endl;
return0;
}// end main function
__MACOSX/RightTriangle/._testTriangle.cpp
c++practice3a3b/._rightTriangle.cpp
c++practice3a3b/._rightTriangle.h
c++practice3a3b/._testTriangle.cpp
c++practice3a3b/partList.txt
2345 Snoozle 15.4 29.95
1234 Widget 5.4 9.99
3456 Bludger 9.1 15.49
5678 Zeeter 7.7 1.99
6789 Sub_Tweezer 12.3 5.25
4567 Woofle 3.7 49.79
c++practice3a3b/partMgr.cppc++practice3a3b/partMgr.cpp// This program manages a list of parts.
#include<iostream>
#include<iomanip>
#include<fstream>
usingnamespace std;
// Attributes for one part
struct partInfo
{
int number;
char name[30];
double weight;
double price;
};
constint MAX_LIST_SIZE =100;
// Function prototypes
int menu();
void buildPartsList(partInfo partList[],int& listSize);
void searchParts(partInfo partList[],int numParts);
void listParts(partInfo partList[],int& numParts);
void insertPart(partInfo list[],int& numElems);
void deletePart(partInfo list[],int& numElems);
partInfo getPartInfo();
v ...
Please teach me how to fix the errors and where should be modified. .pdf
Please teach me how to fix the errors and where should be modified. Thank you!
"Program generated too much output. Output restricted to 50000 characters. Check program for
any unterminated loops generating output."
LinkedList.cpp
LinkedList::LinkedList() {
head = new Node;
head->next = NULL;
length = 0;
}
void LinkedList::insertNode(Sales dataIn) {
/* Write your code here */
Node *newNode;
Node *pCur;
Node *pPre;
newNode = new Node;
newNode->data = dataIn;
pPre = head;
pCur = head->next;
while (pCur != NULL && pCur->data.getName() < dataIn.getName()) {
pPre = pCur;
pCur = pCur->next;
}
pPre->next = newNode;
newNode->next = pCur;
length++;
}
bool LinkedList::deleteNode(string target){
Node *pCur;
Node *pPre;
bool deleted = false;
pPre = head;
pCur = head->next;
while (pCur != NULL && pCur->data.getName() < target) {
pPre = pCur;
pCur = pCur->next;
}
if (pCur != NULL && pCur->data.getName() == target) {
pPre->next = pCur->next;
delete pCur;
deleted = true;
length--;
}
return deleted;
}
void LinkedList::displayList() const{
Node *pCur;
pCur = head->next;
while (pCur) {
cout << pCur->data;
pCur = pCur->next;
}
cout << endl;
}
void LinkedList::displayList(int year) const {
Node *pCur;
pCur = head->next;
int cnt = 0;
while (pCur) {
if (pCur->data.getYear() == year){
cout << pCur->data;
cnt++;
}
pCur = pCur->next;
}
if (cnt == 0){
cout << "N/A" << endl;
}
}
double LinkedList::average() const {
double total = 0.0;
double average;
Node *pCur;
pCur = head;
while (pCur != NULL) {
total += pCur->data.getAmount();
pCur = pCur->next;
}
average = total / static_cast(length);
return average;
}
bool LinkedList::searchList(string find, Sales &dataOut) const {
bool found = false;
Node *pCur;
pCur = head->next;
while (pCur != NULL && pCur->data.getName() < find) {
pCur = pCur->next;
}
if (pCur != NULL && pCur->data.getName() == find) {
dataOut = pCur->data;
found = true;
}
return found;
}
LinkedList::~LinkedList() {
Node *pCur;
Node *pNext;
pCur = head->next;
while(pCur != NULL) {
pNext = pCur->next;
delete pCur;
pCur = pNext;
}
delete head;
}
main.cpp
void buildList(const string &filename, LinkedList &list);
void deleteManager(LinkedList &list);
void searchManager(const LinkedList &list);
void displayManager(const LinkedList &list);
int main() {
string inputFileName;
LinkedList list;
cout << "Enter file name: ";
getline(cin, inputFileName);
buildList(inputFileName, list);
displayManager(list);
searchManager(list);
deleteManager(list);
displayManager(list);
return 0;
}
void buildList(const string &filename, LinkedList &list) {
ifstream inFile(filename);
cout <<"Reading data from \"" << filename << "\"\n";
if(!inFile) {
cout << "Error opening the input file: \""<< filename << "\"" << endl;
exit(EXIT_FAILURE);
}
string id;
int year;
string name;
int amount;
string line;
while (getline(inFile, line) ) {
stringstream temp(line);
temp >> id >> year;
temp.ignore();
getline(temp, name, ';');
temp >> amount;
// create a Sales object and initialize it with data from file.
Similar to Pleae help me with this C++ question, ill upvote thanks.Write the .pdf (20)
helpInstructionsAdd the function max as an abstract function to .pdf
helpInstructionsAdd the function max as an abstract function to .pdf
2.(Sorted list array implementation)This sorted list ADT discussed .pdf
2.(Sorted list array implementation)This sorted list ADT discussed .pdf
Using the C++ programming language1. Implement the UnsortedList cl.pdf
Using the C++ programming language1. Implement the UnsortedList cl.pdf
#ifndef LINKED_LIST_ #define LINKED_LIST_ templateclass It.pdf
#ifndef LINKED_LIST_ #define LINKED_LIST_ templateclass It.pdf
AnswerNote LinkedList.cpp is written and driver program main.cpp.pdf
AnswerNote LinkedList.cpp is written and driver program main.cpp.pdf
Complete the provided partial C++ Linked List program. Main.cpp is g.pdf
Complete the provided partial C++ Linked List program. Main.cpp is g.pdf
How do I declare the following constructors in my .h file Below.pdf
How do I declare the following constructors in my .h file Below.pdf
lab08build.bat@echo offclsset DRIVE_LETTER=1s.docx
lab08build.bat@echo offclsset DRIVE_LETTER=1s.docx
Below is a given ArrayList class and Main class Your Dreams Our Mission/tuto...
Below is a given ArrayList class and Main class Your Dreams Our Mission/tuto...
My question is pretty simple, I just want to know how to call my ope.pdf
My question is pretty simple, I just want to know how to call my ope.pdf
#include String.hpp#include ..Functionsfunctions.hpp.docx
#include String.hpp#include ..Functionsfunctions.hpp.docx
maincpp include ListItemh include ltstringgt in.pdf
maincpp include ListItemh include ltstringgt in.pdf
1- The design of a singly-linked list below is a picture of the functi (1).pdf
1- The design of a singly-linked list below is a picture of the functi (1).pdf
ReversePoem.java ---------------------------------- public cl.pdf
ReversePoem.java ---------------------------------- public cl.pdf
#ifndef MYLIST_H_ #define MYLIST_H_#includeiostream #include.docx
#ifndef MYLIST_H_ #define MYLIST_H_#includeiostream #include.docx
RightTrianglerightTriangle.cppRightTrianglerightTriangle.cpp.docx
RightTrianglerightTriangle.cppRightTrianglerightTriangle.cpp.docx
Please teach me how to fix the errors and where should be modified. .pdf
Please teach me how to fix the errors and where should be modified. .pdf
More from vinodagrawal6699
Please answer it as soon as possible Chapter 2- Part 2 Link Stat.pdf
Please answer it as soon as possible Chapter 2- Part 2: Link State Routing I. Link state routing
Consider the following network. The objective is to fill the routing and forwarding tables of node
X. Q1. Draw the shortest-path tree from X Use the Dijkstra's algorithm to compute the shortest
path from X to all the other routers, then draw the shortest path tree. - Only the following file
extensions are accepted: .pdf. docx, .gif and .gpg, - Hand writing figures are not accepted Attach
File.
Please answer in Arm assembly language The file palindrome.s conta.pdf
Please answer in Arm assembly language
The file palindrome.s contains the following subroutine definition:
Complete this subroutine with a recursive algorithm. (Fix the problem in isLetter as you did for
the previous task.) Save the file as l07_t02.s. Marks are:
1-the string contains only lower case letters, no digits, spaces, or punctuation (ex: "otto")
2-string has mixed case, but only letters (ex: "RaceCar")
3-string has mixed case, and non-letters (ex: "A man, a plan, a canal, Panama!")
All versions must return false for a non-palindrome (ex: "David"). Do not change the contents of
the string in memory.
Hint: here is Python code for a recursive palindrome function:
palindrome.s:.
Please answer in Arm assembly languageThe file palindrome.s contai.pdf
Please answer in Arm assembly language
The file palindrome.s contains the following subroutine definition:
Complete this subroutine with a recursive algorithm. (Fix the problem in isLetter as you did for
the previous task.) Save the file as l07_t02.s. Marks are:
1-the string contains only lower case letters, no digits, spaces, or punctuation (ex: "otto")
2-string has mixed case, but only letters (ex: "RaceCar")
3-string has mixed case, and non-letters (ex: "A man, a plan, a canal, Panama!")
All versions must return false for a non-palindrome (ex: "David"). Do not change the contents of
the string in memory.
Hint: here is Python code for a recursive palindrome function:
palindrome.s:
I need the code not the explanation please.
please answer detail thank you 5 .Deontology and consequentialism .pdf
please answer detail thank you
5 .Deontology and consequentialism differ from one another because both are normative ethical
theories but they are different in terms of (i) perspective, (ii) features, (iii) morally correct action
and (iv) strengths. Use a four-by-two table to answer the differences. [4 2.5 = 10 marks]
6. a. What is meant by diffusion of responsibility? [4 marks]
b. What are the TWO (2) practical implications of this basic social-psychological concept for
managing and promoting ethical behaviour among staff? [6 marks].
Please answer based on the requirements written in the photo.Pro.pdf
Please answer based on the requirements written in the photo.
Provide a formal written report that includes the following:
1. Explanation on how to specify an abstract data type using the example of software stack.
2. Explanation of the advantages of encapsulation and information hiding when using an ADT.
3. Discussion of imperative ADTs with regard to object orientation. LO2 Specify abstract data
types and algorithms in a formal notation.
Please answer based on the requirements written in the photo.Prepa.pdf
Please answer based on the requirements written in the photo.
Prepare a report on how to create a design specification for data structures, explaining the valid
operations that can be carried out on the structures using the example of:
1. A stack ADT, a concrete data structure for a First In First out (FIFO) queue.
2. Two sorting algorithms.
3. Two network shortest path algorithms.
L01 Examine abstract data types, concrete data structures and algorithms.
Playground Project PlanYou have been asked to create a project pla.pdf
Playground Project Plan
You have been asked to create a project plan to build a playground for children in your local
community. Your project should have 10-15 tasks (therefore, your network will have 10-15
nodes).
Please perform the following for this project:
1. Develop a WBS for your project.
2. Hand-draw a network diagram for your project.
3. Perform the forward and backward pass to calculate the slack for each task.
4. Write a short narrative that describes your networks overall sensitivity..
Plasmids do all of the following EXCEPTO have their own initiation.pdf
Plasmids do all of the following EXCEPT
O have their own initiation and termination sites for replication
. O use the host proteins for conducting processes essential for replication.
O maintain multiple copies within the cell, typically in higher abundance than the chromosome.
depend on the host cell's regulatory mechanisms to control the timing of replication.
O replicate either bidirectionally or via rolling circle replication..
plan de atenci�n de enfermer�a para Linda Pittmon, una paciente de 7.pdf
plan de atencin de enfermera para Linda Pittmon, una paciente de 74 aos que es diabtica no
conforme y que con frecuencia se hospeda en el refugio local para personas sin hogar. Ha sido
admitida en el suelo con quejas de entumecimiento en el pie y el tobillo derechos. La Sra.
Pittmon afirma que ha tenido entumecimiento durante aos, pero "ahora no puedo sentirlo en
absoluto y los dedos de mis pies no se ven del color correcto". El plan de cuidados debe tener 5
diagnsticos de enfermera prioritarios..
Physicians� Hospital has the following balances on December 31, 2024.pdf
Physicians Hospital has the following balances on December 31, 2024, before any adjustment:
Accounts Receivable = $43,000; Allowance for Uncollectible Accounts = $1,200 (credit). On
December 31, 2024, Physicians estimates uncollectible accounts to be 10% of accounts
receivable. Required: 1. Record the adjusting entry for uncollectible accounts on December 31,
2024. 2. Determine the amount at which bad debt expense is reported in the income statement
and the allowance for uncollectible accounts is report.
Peter arrend� un espacio de oficina comercial al arrendador sobre la.pdf
Peter arrend un espacio de oficina comercial al arrendador sobre la base de que David iba a
ocupar (subarrendar) la esquina noroeste de las instalaciones. Cuando las partes se dieron cuenta
de que el contrato de arrendamiento prohiba un subarrendamiento a David y que David no tendra
una ocupacin legal, David se neg a seguir adelante con el trato. La expectativa de Peter era que
se hubiera hecho un contrato de subarrendamiento con David.
Requerido:
Discutir las obligaciones legales (si las hay) de Peter y David.
Philip Brickell, a forty-three-year-old employee of the London Under.pdf
Philip Brickell, a forty-three-year-old employee of the London Underground, was inside the
cavernous main hall of the King's Cross subway station on a November evening in 1987 when a
commuter stopped him as he was collecting tickets and said there was a burning tissue at the
bottom of a nearby escalator. King's Cross was one of the largest, grandest, and most heavily
trafficked of London's subway stops, a labyrinth of deep escalators, passageways, and tunnels,
some of which were almost a century old. The station's escalators, in particular, were famous for
their size and age. Some stretched as many as five stories into the ground and were built of
wooden slats and rubber handrails, the same materials used to construct them decades earlier.
More than a quarter million passengers passed through King's Cross every day on six different
train lines. During evening rush hour, the station's ticketing hall was a sea of people hurrying
beneath a ceiling repainted so many times that no one could recall its original hue. The burning
tissue, the passenger said, was at the bottom of one of the station's longest escalators, servicing
the Piccadilly line. Brickell immediately left his position, rode the escalator down to the
platform, found the smoldering wad of tissue, and, with a rolled-up magazine, beat out the fire.
Then he returned to his post. Brickell didn't investigate further. He didn't try to figure out why
the tissue was burning or if it might have flown off of a larger fire somewhere else within the
station. He didn't mention the incident to another employee or call the fire department. A
separate department handled fire safety, and Brickell, in keeping with the strict divisions that
ruled the Underground, knew better than to step on anyone's toes. Besides, even if he had
investigated the possibility of a fire, he wouldn't have known what to do with any information he
learned. The tightly prescribed chain of command at the Underground prohibited him from
contacting another department without a superior's direct authorization. And the Underground's
routines handed down from employee to employee told him that he should never, under any
circumstances, refer out loud to anything inside a station as a "fire," lest commuters become
panicked. It wasn't how things were done. The Underground was governed by a sort of
theoretical rule book that no one had ever seen or read and that didn't, in fact, exist except in the
unwritten rules that shaped every employee's life. For decades, the Underground had been run by
the "Four Barons" the chiefs of civil, signal, electrical, and mechanical engineering and within
each of their departments, there were bosses and sub-bosses who all jealously guarded their
authority. The trains ran on time because all nineteen thousand Underground employees
cooperated in a delicate system that passed passengers and trains among dozens sometimes
hundreds of hands all day long. But that co-operation depended upon a balance of power
.
Periferik tolerans, bariyer bakl i�in neden kritiktir A) Uygun .pdf
Periferik tolerans, bariyer bakl iin neden kritiktir?
A)
Uygun olmayan aktivasyona kar koyduu iin
B)
nk ar aktivasyon kronik inflamasyona ve hastala yol aabilir.
C)
nk deri ve barsak gibi blgelere yerleen mikroplar,
zararl
D)
nk hem uygun olmayan aktivasyona kar koyar hem de ar aktivasyon,
kronik inflamasyon ve hastalk.
e)
Yantlarn hibiri evresel toleransn bariyer iin neden kritik olduunu aklamyor
baklk..
paypal i�in sorular Paypaln profili nedir Kullanm nasl.pdf
paypal iin sorular
Paypal'n profili nedir?
Kullanm nasl?
Bir vizyonlar ve misyonlar var m?
Ka kullanclar var?
Ne zaman kullanlmaya baland?
Hangi lkeden baladlar ve u anda ka tane var?
zel mi yoksa halka ak bir irket mi?
Kullanclarn ya ka?
Onlarn bir uygulamas var m?
rnlerini nasl pazarlyorlar?
Kullanm dzeyi nedir?
Kullanclar iin reklam vermeleri gerekiyor mu? (Balangta yapt ama sonra durdu mu?)
Paypal kullanmann avantajlar ve dezavantajlar nelerdir?.
Paul Casey se retir� de la Marina de los EE. UU. en 2013. Recibe una.pdf
Paul Casey se retir de la Marina de los EE. UU. en 2013. Recibe una pensin militar basada en sus
aos de servicio. El 3 de agosto de 2019, recibi una determinacin de discapacidad relacionada con
el servicio retroactiva a 2013. Cul de las siguientes es cierta con respecto al reclamo de Paul de
un reembolso de los impuestos pagados sobre su pensin?
A. Paul no puede presentar una reclamacin de reembolso de los impuestos pagados sobre su
pensin en ningn ao.
B. Bajo el perodo de limitacin especial, Paul puede presentar un reclamo de reembolso de los
impuestos pagados sobre su pensin para 2015 siempre que presente el reclamo antes del 3 de
agosto de 2020
C. Paul puede presentar un reclamo de reembolso de los impuestos pagados sobre su pensin para
2013 y 2014
D. Paul solo puede presentar un reclamo de devolucin de impuestos pagados en su pensin para
2018.
Party Supply Inc. a calender year corporation, took a physical inven.pdf
Party Supply Inc. a calender year corporation, took a physical inventory count on November 30,
Year 1 and properly valued its inventory at $4,250,000. Because the company will not perform
another physical inventory count on December 31, Year 1, you have been asked to calculate how
each of the following transactions would affect the inventory balance reported on the December
31, Year 1 balance sheet. Enter the amount in the associated cells.
1. The company purchased inventory costing $1,500,000 during the month of December. The
inventory was entirely paid for in December so that the company could take advantage of a 2%
discount on the purchase. Freight-in on the inventory was $100,000 for the month.
2. The company purchased goods from a Chinese manufacturer. The cost of goods was
$750,000. The goods were shipped FOB shipping point on December 23 and were received at
U.S. customs on January 2, Year 2. The goods were delayed in customs until January 8, Year 2,
when they were finally received by Party Supply.
3. Sales for the month of December were $5,000,000 and the company has an average gross
profit margin of 30%.
4. Party Supply placed goods with a selling price of $300,000 on its shipping dock on December
31, Year 1. The sale and transaction were recorded by the accounting department on December
31. The terms of the sale were FOB shipping point. The shipper did not pick up the goods the
same afternoon because of inclement weather. The goods were picked up on January 2, Year 2.
5. In response to a customer survey, Party Supply decided to start selling goods on consignment
in December Year 1. An initial order of $100,000 (at cost) was delivered from the Party Supply
warehouse to the consignee. The consignee sold 25% of the goods in December, Year 1 and
another 40% in January, Year 2. The remaining inventory was returned by the consignee in
January.
6. Party Supply started to use a public warehouse so that its products would be closer to its
customers locations. $150,000 of the total inventory was held in the public warehouse on
December 31, Year 1. The cost to ship the goods from the main warehouse to the public
warehouse was $20,000. The rent paid on the public warehouse for December Year 1 was
$10,000.
7. Part of the company's inventory on hand at year end is specific to New Year's Eve. The value
of that inventory decreases substantially if it is not sold before year end. Remaining inventory of
these items with an original cost of $50,000 was on hand at December 31, Year 1. In early
January, Year 2, Party Supply sold these items for $10,000 and also paid $6,000 to have the
inventory shipped to the buyer..
Parte 1 �Cu�l es el capital contable total de la Entidad A con bas.pdf
Parte 1
Cul es el capital contable total de la Entidad A con base en los siguientes saldos de cuenta?
Acciones comunes $950,000
Capital pagado en exceso de Par 50,000
Utilidades retenidas 175,000
Autocartera 25.000
Cuentas por pagar 40,000
Otros integrales acumulados
ingreso 10,000
Parte 2
Registre en el diario las siguientes transacciones para la Entidad B. La Entidad B est autorizada
para emitir 1,000,000 de acciones ordinarias a la par de $1.
A. 1 de enero. Emiti 600,000 acciones a $6 por accin.
B. 15 de marzo. Compr 5,000 acciones para el Tesoro a $7 por accin.
C. 1 de octubre. Declar un dividendo de 75 centavos por accin a los accionistas registrados el 15
de octubre de 2020, pagadero el 31 de octubre de 2020.
Parte 3 Indique si cada afirmacin es verdadera (V) o falsa (F). Utilice letras MAYSCULAS.
____ 1. Los dividendos atrasados sobre las acciones preferentes acumulativas deben pagarse
antes de que los accionistas ordinarios reciban un dividendo en efectivo.
____ 2. Cuando se paga un dividendo en efectivo previamente declarado, el capital contable
disminuye y el pasivo aumenta.
____ 3. Una empresa puede optar por expandirse mediante la emisin de acciones ordinarias en
lugar de deuda porque la empresa no est obligada a pagar dividendos.
____ 4. Los bonos que se pueden canjear por acciones ordinarias se llaman bonos exigibles.
parte 4
Son los dividendos atrasados sobre las acciones preferentes acumulativas un pasivo?
Si la Entidad C tiene 1.000.000 de acciones ordinarias autorizadas, 400.000 acciones ordinarias
emitidas y 5.000 acciones en tesorera, cul es el nmero de acciones ordinarias en circulacin?.
PART I Think about the best and worst companies you know. What is e.pdf
PART I: Think about the best and worst companies you know. What is extraordinary (or
extraordinarily bad) about these firms? You must discuss THREE companies and identify
something that is extraordinary or extraordinarily bad about each company. Your claims must be
substantiated by FACTS, this is not an opinion-based paper. PART II: Using the three
organization from Part I, identify their corporate strategies. Are their strategies clear and focused
or difficult to define? PART III: Using one organization named in part I, look at their vision and
mission statement (include the mission and vision statement in your content with appropriate
reference citations). Does their vision and mission statement align with their organization
strategies identified in Part II? ADDITIONAL INSTRUCTIONS: 1. You are required to use Peer
Reviewed sources and in text citations. Please use, at minimum, two peer reviewed sources for
this assignment. You must have a peer reviewed or scholarly source for each company discussed..
Part AToday, theUS dollaris trading at 4.60, compared to 4.20 ayea.pdf
Part A
Today, theUS dollaris trading at 4.60, compared to 4.20 ayear ago. What is the percentage
appreciation/depreciation ofthe dollarrelativeto the cedi?What isthe
percentageappreciation/depreciation ofthe cedi relative to thedollar? Please comment
onyourresults..
Parann d�ng�s� nedir Para d�ng�s�ne kimler katlyor Finansal bir il.pdf
Parann dngs nedir? Para dngsne kimler katlyor? Finansal bir ilemin amac nedir?
Parann dngs: (En iyi yant sein.)
A. fonlarn bor verenden bor alana ve tekrar bor verene hareketi.
B. Parann bor alandan bor verene ve tekrar bor alana hareketi.
C. Parann tasarruf hesabnzdan ek hesabnza ve ardndan tasarruf hesabnza geri hareketi.
D. Parann ek hesabnzdan Gelir daresi Bakanl'na gemesi ve Sosyal Gvenlik eki eklinde size geri
dnmesi.
Para dngsndeki katlmclar: (Uygun olan tm seenekleri iaretleyin.)
A. Para arzn kontrol eden ve ticari krediler iin para salayan Merkez Bankas.
B. bor vereni bir bor alanla eletiren veya tek bir bor alan iin bir dizi bor vereni bir araya getiren
finansal kurulu.
C. ilk bor veren, genellikle dorudan yatrm veya bir finans kurumu araclyla bir birey (veya hane
halk).
D. fonlar ii yrtmek veya ii bytmek iin kullanan bir irket gibi bir borlu.
Her finansal ilemin amac udur: (En iyi yant sein.)
A. Borlularn satn alma yapabilmelerini salamak.
B. finansal kurumlarn gl kalmasn salamak.
C. ilemdeki tm taraflar daha iyi duruma getirmek.
D. bor verenleri zenginletirmek..
More from vinodagrawal6699 (20)
Please answer it as soon as possible Chapter 2- Part 2 Link Stat.pdf
Please answer it as soon as possible Chapter 2- Part 2 Link Stat.pdf
Please answer in Arm assembly language The file palindrome.s conta.pdf
Please answer in Arm assembly language The file palindrome.s conta.pdf
Please answer in Arm assembly languageThe file palindrome.s contai.pdf
Please answer in Arm assembly languageThe file palindrome.s contai.pdf
please answer detail thank you 5 .Deontology and consequentialism .pdf
please answer detail thank you 5 .Deontology and consequentialism .pdf
Please answer based on the requirements written in the photo.Pro.pdf
Please answer based on the requirements written in the photo.Pro.pdf
Please answer based on the requirements written in the photo.Prepa.pdf
Please answer based on the requirements written in the photo.Prepa.pdf
Playground Project PlanYou have been asked to create a project pla.pdf
Playground Project PlanYou have been asked to create a project pla.pdf
Plasmids do all of the following EXCEPTO have their own initiation.pdf
Plasmids do all of the following EXCEPTO have their own initiation.pdf
plan de atenci�n de enfermer�a para Linda Pittmon, una paciente de 7.pdf
plan de atenci�n de enfermer�a para Linda Pittmon, una paciente de 7.pdf
Physicians� Hospital has the following balances on December 31, 2024.pdf
Physicians� Hospital has the following balances on December 31, 2024.pdf
Peter arrend� un espacio de oficina comercial al arrendador sobre la.pdf
Peter arrend� un espacio de oficina comercial al arrendador sobre la.pdf
Philip Brickell, a forty-three-year-old employee of the London Under.pdf
Philip Brickell, a forty-three-year-old employee of the London Under.pdf
Periferik tolerans, bariyer bakl i�in neden kritiktir A) Uygun .pdf
Periferik tolerans, bariyer bakl i�in neden kritiktir A) Uygun .pdf
paypal i�in sorular Paypaln profili nedir Kullanm nasl.pdf
paypal i�in sorular Paypaln profili nedir Kullanm nasl.pdf
Paul Casey se retir� de la Marina de los EE. UU. en 2013. Recibe una.pdf
Paul Casey se retir� de la Marina de los EE. UU. en 2013. Recibe una.pdf
Party Supply Inc. a calender year corporation, took a physical inven.pdf
Party Supply Inc. a calender year corporation, took a physical inven.pdf
Parte 1 �Cu�l es el capital contable total de la Entidad A con bas.pdf
Parte 1 �Cu�l es el capital contable total de la Entidad A con bas.pdf
PART I Think about the best and worst companies you know. What is e.pdf
PART I Think about the best and worst companies you know. What is e.pdf
Part AToday, theUS dollaris trading at 4.60, compared to 4.20 ayea.pdf
Part AToday, theUS dollaris trading at 4.60, compared to 4.20 ayea.pdf
Parann d�ng�s� nedir Para d�ng�s�ne kimler katlyor Finansal bir il.pdf
Parann d�ng�s� nedir Para d�ng�s�ne kimler katlyor Finansal bir il.pdf
Recently uploaded
How libraries can support authors with open access requirements for UKRI fund...
How libraries can support authors with open access requirements for UKRI funded books
Wednesday 22 May 2024, 14:00-15:00.
"Protectable subject matters, Protection in biotechnology, Protection of othe...
Protectable subject matters, Protection in biotechnology, Protection of other biological materials, Ownership and period of protection
How to Make a Field invisible in Odoo 17
It is possible to hide or invisible some fields in odoo. Commonly using “invisible” attribute in the field definition to invisible the fields. This slide will show how to make a field invisible in odoo 17.
Chapter 3 - Islamic Banking Products and Services.pptx
Chapter 3 - Islamic Banking Products and Services.pptxMohd Adib Abd Muin, Senior Lecturer at Universiti Utara Malaysia
This slide is prepared for master's students (MIFB & MIBS) UUM. May it be useful to all.Exploiting Artificial Intelligence for Empowering Researchers and Faculty, In...
Exploiting Artificial Intelligence for Empowering Researchers and Faculty, In...Dr. Vinod Kumar Kanvaria
Exploiting Artificial Intelligence for Empowering Researchers and Faculty,
International FDP on Fundamentals of Research in Social Sciences
at Integral University, Lucknow, 06.06.2024
By Dr. Vinod Kumar KanvariaBÀI TẬP BỔ TRỢ TIẾNG ANH GLOBAL SUCCESS LỚP 3 - CẢ NĂM (CÓ FILE NGHE VÀ ĐÁP Á...
BÀI TẬP BỔ TRỢ TIẾNG ANH GLOBAL SUCCESS LỚP 3 - CẢ NĂM (CÓ FILE NGHE VÀ ĐÁP Á...Nguyen Thanh Tu Collection
https://app.box.com/s/hqnndn05v4q5a4k4jd597rkdbda0fniiSynthetic Fiber Construction in lab .pptx
Synthetic fiber production is a fascinating and complex field that blends chemistry, engineering, and environmental science. By understanding these aspects, students can gain a comprehensive view of synthetic fiber production, its impact on society and the environment, and the potential for future innovations. Synthetic fibers play a crucial role in modern society, impacting various aspects of daily life, industry, and the environment. ynthetic fibers are integral to modern life, offering a range of benefits from cost-effectiveness and versatility to innovative applications and performance characteristics. While they pose environmental challenges, ongoing research and development aim to create more sustainable and eco-friendly alternatives. Understanding the importance of synthetic fibers helps in appreciating their role in the economy, industry, and daily life, while also emphasizing the need for sustainable practices and innovation.
Unit 8 - Information and Communication Technology (Paper I).pdf
This slides describes the basic concepts of ICT, basics of Email, Emerging Technology and Digital Initiatives in Education. This presentations aligns with the UGC Paper I syllabus.
The French Revolution Class 9 Study Material pdf free download
The French Revolution, which began in 1789, was a period of radical social and political upheaval in France. It marked the decline of absolute monarchies, the rise of secular and democratic republics, and the eventual rise of Napoleon Bonaparte. This revolutionary period is crucial in understanding the transition from feudalism to modernity in Europe.
For more information, visit-www.vavaclasses.com
Digital Artifact 2 - Investigating Pavilion Designs
Digital Artifact 2 - Pavilions
NGV Architecture Commission Competition
MPavilion Commission Competition
Other Pavilion Designs
special B.ed 2nd year old paper_20240531.pdf
Instagram:-
https://instagram.com/special_education_needs_01?igshid=YmMyMTA2M2Y=
WhatsApp:-
https://chat.whatsapp.com/JVakNIYlSV94x7bwunO3Dc
YouTube:-
https://youtube.com/@special_education_needs
Teligram :- https://t.me/special_education_needs
Slide Shere :-
https://www.slideshare.net/shabnambano20?utm_campaign=profiletracking&utm_medium=sssite&utm_source=ssslideview
Azure Interview Questions and Answers PDF By ScholarHat
Azure Interview Questions and Answers PDF By ScholarHat
June 3, 2024 Anti-Semitism Letter Sent to MIT President Kornbluth and MIT Cor...
Letter from the Congress of the United States regarding Anti-Semitism sent June 3rd to MIT President Sally Kornbluth, MIT Corp Chair, Mark Gorenberg
Dear Dr. Kornbluth and Mr. Gorenberg,
The US House of Representatives is deeply concerned by ongoing and pervasive acts of antisemitic
harassment and intimidation at the Massachusetts Institute of Technology (MIT). Failing to act decisively to ensure a safe learning environment for all students would be a grave dereliction of your responsibilities as President of MIT and Chair of the MIT Corporation.
This Congress will not stand idly by and allow an environment hostile to Jewish students to persist. The House believes that your institution is in violation of Title VI of the Civil Rights Act, and the inability or
unwillingness to rectify this violation through action requires accountability.
Postsecondary education is a unique opportunity for students to learn and have their ideas and beliefs challenged. However, universities receiving hundreds of millions of federal funds annually have denied
students that opportunity and have been hijacked to become venues for the promotion of terrorism, antisemitic harassment and intimidation, unlawful encampments, and in some cases, assaults and riots.
The House of Representatives will not countenance the use of federal funds to indoctrinate students into hateful, antisemitic, anti-American supporters of terrorism. Investigations into campus antisemitism by the Committee on Education and the Workforce and the Committee on Ways and Means have been expanded into a Congress-wide probe across all relevant jurisdictions to address this national crisis. The undersigned Committees will conduct oversight into the use of federal funds at MIT and its learning environment under authorities granted to each Committee.
• The Committee on Education and the Workforce has been investigating your institution since December 7, 2023. The Committee has broad jurisdiction over postsecondary education, including its compliance with Title VI of the Civil Rights Act, campus safety concerns over disruptions to the learning environment, and the awarding of federal student aid under the Higher Education Act.
• The Committee on Oversight and Accountability is investigating the sources of funding and other support flowing to groups espousing pro-Hamas propaganda and engaged in antisemitic harassment and intimidation of students. The Committee on Oversight and Accountability is the principal oversight committee of the US House of Representatives and has broad authority to investigate “any matter” at “any time” under House Rule X.
• The Committee on Ways and Means has been investigating several universities since November 15, 2023, when the Committee held a hearing entitled From Ivory Towers to Dark Corners: Investigating the Nexus Between Antisemitism, Tax-Exempt Universities, and Terror Financing. The Committee followed the hearing with letters to those institutions on January 10, 202
Digital Tools and AI for Teaching Learning and Research
This Presentation in details discusses on Digital Tools and AI for Teaching Learning and Research
Francesca Gottschalk - How can education support child empowerment.pptx
Francesca Gottschalk from the OECD’s Centre for Educational Research and Innovation presents at the Ask an Expert Webinar: How can education support child empowerment?
Supporting (UKRI) OA monographs at Salford.pptx
How libraries can support authors with open access requirements for UKRI funded books
Wednesday 22 May 2024, 14:00-15:00.
Operation Blue Star - Saka Neela Tara
Operation “Blue Star” is the only event in the history of Independent India where the state went into war with its own people. Even after about 40 years it is not clear if it was culmination of states anger over people of the region, a political game of power or start of dictatorial chapter in the democratic setup.
The people of Punjab felt alienated from main stream due to denial of their just demands during a long democratic struggle since independence. As it happen all over the word, it led to militant struggle with great loss of lives of military, police and civilian personnel. Killing of Indira Gandhi and massacre of innocent Sikhs in Delhi and other India cities was also associated with this movement.
Recently uploaded (20)
How libraries can support authors with open access requirements for UKRI fund...
How libraries can support authors with open access requirements for UKRI fund...
"Protectable subject matters, Protection in biotechnology, Protection of othe...
"Protectable subject matters, Protection in biotechnology, Protection of othe...
Chapter 3 - Islamic Banking Products and Services.pptx
Chapter 3 - Islamic Banking Products and Services.pptx
Exploiting Artificial Intelligence for Empowering Researchers and Faculty, In...
Exploiting Artificial Intelligence for Empowering Researchers and Faculty, In...
Pride Month Slides 2024 David Douglas School District
Pride Month Slides 2024 David Douglas School District
BÀI TẬP BỔ TRỢ TIẾNG ANH GLOBAL SUCCESS LỚP 3 - CẢ NĂM (CÓ FILE NGHE VÀ ĐÁP Á...
BÀI TẬP BỔ TRỢ TIẾNG ANH GLOBAL SUCCESS LỚP 3 - CẢ NĂM (CÓ FILE NGHE VÀ ĐÁP Á...
Unit 8 - Information and Communication Technology (Paper I).pdf
Unit 8 - Information and Communication Technology (Paper I).pdf
The French Revolution Class 9 Study Material pdf free download
The French Revolution Class 9 Study Material pdf free download
Digital Artifact 2 - Investigating Pavilion Designs
Digital Artifact 2 - Investigating Pavilion Designs
Azure Interview Questions and Answers PDF By ScholarHat
Azure Interview Questions and Answers PDF By ScholarHat
June 3, 2024 Anti-Semitism Letter Sent to MIT President Kornbluth and MIT Cor...
June 3, 2024 Anti-Semitism Letter Sent to MIT President Kornbluth and MIT Cor...
Digital Tools and AI for Teaching Learning and Research
Digital Tools and AI for Teaching Learning and Research
Francesca Gottschalk - How can education support child empowerment.pptx
Francesca Gottschalk - How can education support child empowerment.pptx
Pleae help me with this C++ question, ill upvote thanks.Write the .pdf
- 1. Pleae help me with this C++ question, ill upvote thanks. Write the definitions of the functions of the class orderedArrayListType that are not given in this chapter. please write a main.cpp and orderedArrayListTypeImp.cpp file and all the file that is given is everything i have for this task main.cpp #include #include "unorderedArrayListType.h" using namespace std; int main() { // Write your main here return 0; } //////////// orderedArrayListType.h #ifndef H_orderedArrayListType #define H_orderedArrayListType #include "arrayListType.h" class orderedArrayListType: public arrayListType { public: void insertAt(int location, int insertItem); void insertEnd(int insertItem); void replaceAt(int location, int repItem); int seqSearch(int searchItem) const; void insert(int insertItem); void remove(int removeItem); orderedArrayListType(int size = 100); //Constructor }; #endif ///////////////// orderedArrayListTypeImp.cpp /////////////////////////////
- 2. arrayListType.h #include #include "orderedArrayListType.h" using namespace std; void orderedArrayListType::insert(int insertItem) { if (length == 0) //list is empty list[length++] = insertItem; //insert insertItem //and increment length else if (length == maxSize) cout << "Cannot insert in a full list." << endl; else { //Find the location in the list where to insert //insertItem. int loc; bool found = false; for (loc = 0; loc < length; loc++) { if (list[loc] >= insertItem) { found = true; break; } } for (int i = length; i > loc; i--) list[i] = list[i - 1]; //move the elements down list[loc] = insertItem; //insert insertItem length++; //increment the length } } //end insert int orderedArrayListType::seqSearch(int searchItem) const { int loc; bool found = false;
- 3. for (loc = 0; loc < length; loc++) { if (list[loc] >= searchItem) { found = true; break; } } if (found) { if (list[loc] == searchItem) return loc; else return -1; } else return -1; } //end seqSearch void orderedArrayListType::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 { cout << "This is a sorted list. Inserting at the proper place." << endl; insert(insertItem); } } //end insertAt void orderedArrayListType::insertEnd(int insertItem) { if (length == maxSize) //the list is full
- 4. cout << "Cannot insert in a full list." << endl; else { cout << "This is a sorted list. Inserting at the proper " << "place." << endl; insert(insertItem); } } //end insertEnd void orderedArrayListType::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 { removeAt(location); insert(repItem); } } //end replaceAt void orderedArrayListType::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; } } //end remove orderedArrayListType::orderedArrayListType(int size) : arrayListType(size) {
- 5. } ///////////////// arrayListTypeImp.cpp #include #include "arrayListType.h" using namespace std; bool arrayListType::isEmpty() const { return (length == 0); } //end isEmpty bool arrayListType::isFull() const { return (length == maxSize); } //end isFull int arrayListType::listSize() const { return length; } //end listSize int arrayListType::maxListSize() const { return maxSize; } //end maxListSize void arrayListType::print() const { for (int i = 0; i < length; i++) cout << list[i] << " "; cout << endl; } //end print bool arrayListType::isItemAtEqual(int location, int item) const { if (location < 0 || location >= length) { cout << "The location of the item to be removed " << "is out of range." << endl; return false;
- 6. } else return (list[location] == item); } //end isItemAtEqual void arrayListType::removeAt(int location) { if (location < 0 || location >= length) cout << "The location of the item to be removed " << "is out of range." << endl; else { for (int i = location; i < length - 1; i++) list[i] = list[i+1]; length--; } } //end removeAt void arrayListType::retrieveAt(int location, int& retItem) const { if (location < 0 || location >= length) cout << "The location of the item to be retrieved is " << "out of range" << endl; else retItem = list[location]; } //end retrieveAt void arrayListType::clearList() { length = 0; } //end clearList arrayListType::arrayListType(int size) { if (size <= 0) { cout << "The array size must be positive. Creating " << "an array of the size 100." << endl; maxSize = 100; }
- 7. else maxSize = size; length = 0; list = new int[maxSize]; } //end constructor arrayListType::~arrayListType() { delete [] list; } //end destructor arrayListType::arrayListType(const arrayListType& otherList) { maxSize = otherList.maxSize; length = otherList.length; list = new int[maxSize]; //create the array for (int j = 0; j < length; j++) //copy otherList list [j] = otherList.list[j]; }//end copy constructor