#include stdafx.h#include iostreamusing namespace std;cl.pdf
•
0 likes•3 views
#include \"stdafx.h\" #include using namespace std; class Inventory { private: int itemNumber; int quantity; double cost; double totalCost; public: Inventory() { itemNumber = 0; quantity = 0; cost = 0; totalCost = 0; } Inventory(int newItemNumber, int newQuantity, double newCost) { itemNumber = newItemNumber; quantity = newQuantity; cost = newCost; setTotalCost(quantity, cost); // this can be called as quantity and cost have now been initialized. } void setItemNumber(int) { itemNumber = itemNumber; } void setQuantity(int) { quantity = quantity; } void setCost(double) { cost = cost; } void setTotalCost(int, double) { totalCost = quantity * cost; } int getItemNumber() { return itemNumber; } int getQuantity() { return quantity; } double getCost() { return cost; } double getTotalCost() { return totalCost; } }; int main() { int itemNumber; int quantity; double cost; double totalCost; cout << \"Enter the Item Number: \"; cin >> itemNumber; while (itemNumber < 0) { cout << \"Please enter a positive value for the Item Number: \"; cin >> itemNumber; } cout << \"Enter the Quantity of the item: \"; cin >> quantity; while (quantity < 0) { cout << \"Please enter a positive value for the Quantity of the item: \"; cin >> quantity; } cout << \"Enter the Cost of the item: \"; cin >> cost; while (cost < 0) { cout << \"Please enter a positive value for the Cost of the item: \"; cin >> cost; } Inventory information(itemNumber, quantity, cost); totalCost = information.getTotalCost(); itemNumber = information.getItemNumber(); cost = information.getCost(); quantity = information.getQuantity(); cout << \"The Item Number is: \" << itemNumber << endl; cout << \"The Quantity is: \" << quantity << endl; cout << \"The Cost is: \" << cost << endl; cout << \"The Total Cost is: \" << totalCost << endl; return 0; } int _tmain(int argc, _TCHAR* argv[]) { return 0; } Solution #include \"stdafx.h\" #include using namespace std; class Inventory { private: int itemNumber; int quantity; double cost; double totalCost; public: Inventory() { itemNumber = 0; quantity = 0; cost = 0; totalCost = 0; } Inventory(int newItemNumber, int newQuantity, double newCost) { itemNumber = newItemNumber; quantity = newQuantity; cost = newCost; setTotalCost(quantity, cost); // this can be called as quantity and cost have now been initialized. } void setItemNumber(int) { itemNumber = itemNumber; } void setQuantity(int) { quantity = quantity; } void setCost(double) { cost = cost; } void setTotalCost(int, double) { totalCost = quantity * cost; } int getItemNumber() { return itemNumber; } int getQuantity() { return quantity; } double getCost() { return cost; } double getTotalCost() { return totalCost; } }; int main() { int itemNumber; int quantity; double cost; double totalCost; cout << \"Enter the Item Number: \"; cin >> itemNumber; while (itemNumber < 0) { cout << \"Please enter a positive value for the Item Number: \"; cin >> itemNumber; } cout << \"Enter the Quantity of the item: \"; cin >> quantity; .
Report
Share
Report
Share
Download to read offline
Recommended
Header file for an array-based implementation of the ADT bag. @f.pdf
/** Header file for an array-based implementation of the ADT bag. @file ArrayBag.h */
#ifndef _ARRAY_BAG
#define _ARRAY_BAG
#include \"BagInterface.h\"
template class ArrayBag : public BagInterface
{
private:
static const int DEFAULT_CAPACITY = 6; // Small size to test for a full bag
ItemType items[DEFAULT_CAPACITY]; // Array of bag items
int itemCount; // Current count of bag items
int maxItems; // Max capacity of the bag
// Returns either the index of the element in the array items that // contains the given target or -1,
if the array does not contain // the target.
int getIndexOf(const ItemType& target) const;
public:
ArrayBag();
int getCurrentSize() const;
bool isEmpty() const;
bool add(const ItemType& newEntry);
bool remove(const ItemType& anEntry);
void clear();
bool contains(const ItemType& anEntry) const;
int getFrequencyOf(const ItemType& anEntry) const;
vector toVector() const;
}; // end ArrayBag
//#include \"ArrayBag.cpp\" // /** Implementation file for the class ArrayBag. @file
ArrayBag.cpp */
#include \"ArrayBag.h\"
#include template
ArrayBag::ArrayBag(): itemCount(0), maxItems(DEFAULT_CAPACITY)
{ } // end default constructor
template int ArrayBag::getCurrentSize() const { return itemCount; } // end getCurrentSize
template bool ArrayBag::isEmpty() const { return itemCount == 0; } // end isEmpty
template bool ArrayBag::add(const ItemType& newEntry)
{
bool hasRoomToAdd = (itemCount < maxItems);
if (hasRoomToAdd)
{
items[itemCount] = newEntry; itemCount++;
} // end if return hasRoomToAdd;
} // end add
/* // STUB template bool ArrayBag::remove(const ItemType& anEntry) { return false; // STUB
} // end remove
*/ template bool ArrayBag::remove(const ItemType& anEntry)
{
int locatedIndex = getIndexOf(anEntry);
bool canRemoveItem = !isEmpty() && (locatedIndex > -1);
if (canRemoveItem)
{
itemCount--;
items[locatedIndex] = items[itemCount];
} // end if return
canRemoveItem;
} // end remove /*
// STUB template void ArrayBag::clear() { // STUB } // end clear
*/ template void ArrayBag::clear() { itemCount = 0; } // end clear
template int ArrayBag::getFrequencyOf(const ItemType& anEntry) const
{
int frequency = 0;
int curIndex = 0; // Current array index
while (curIndex < itemCount)
{
if (items[curIndex] == anEntry)
{
frequency++;
} // end if
curIndex++; // Increment to next entry
} // end while
return frequency;
} // end getFrequencyOf
template bool ArrayBag::contains(const ItemType& anEntry) const
{
return getIndexOf(anEntry) > -1;
} // end contains
/* ALTERNATE 1: First version
template bool ArrayBag::contains(const ItemType& target) const
{
return getFrequencyOf(target) > 0;
} // end contains
// ALTERNATE 2: Second version
template bool ArrayBag::contains(const ItemType& anEntry) const
{
bool found = false;
int curIndex = 0; // Current array index
while (!found && (curIndex < itemCount))
{
if (anEntry == items[curIndex])
{
found = true;
} // end if
curIndex++; // Increment to next entry
} // end while
return found;
} // end contains
*/ temp.
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)
{
.
Can you please debug this Thank you in advance! This program is sup.pdf
Can you please debug this? Thank you in advance! This program is supposed to use stacks and
find the paths of an airplane. It should tell you whether or not the plane goes from the requested
city to the requested destination. requestFile.txt contains the requests, flightFile.txt contains the
flights and cityFile.txt contains the city\'s that the airline serves.
My errors: my output is simply \"Hpair does not serve Los Angeles.\" Thats it and it stops.
It should look something like (these are not real values of the file just an example):
\"Request is to fly from cityA to CityB.
Hpair flight from cityA to CityB.
Request is to fly from cityC to cityD.
Sorry, HPAir does not serve City D
Request is to fly from cityE to CityF
Sorry, HPAir does not fly from cityE to CityF\"
**It said to use ispath.cpp but I got confused on how to implement it completely.\"
isPath.cpp
//***I did not include ispath.cpp in my program. Parts of it are in the map.h portion.
main.cpp
#include
#include
#include \"Map.h\"
using namespace std;
int main()
{
Map aMap;
aMap.readFlights();
aMap.verifyRequestedFile();
}
StackInterface.h
#ifndef StackInterface_h
#define StackInterface_h
template
class StackInterface
{
/** Checks if the stack is empty.
@return True if the stack is empty or false if the stack is not.*/
virtual bool isEmpty() const = 0;
/** Adds a new item to the stack
@post newEntry is at the top of the stack
@param newEntry is the object to be added to the stack
@return True if successfully added, otherwise false. */
virtual bool push(const ItemType& newEntry) = 0;
/** Removes item from stack
@post The top item in the stack is removed
@return True if the item was removed, false if it was not. */
virtual bool pop() = 0;
/** Returns the top item in the stack
@pre The stack is not empty
@post The top item in the stack is returned
@return The top of the stack */
virtual ItemType peek() const = 0;
};
#endif /* StackInterface_h */
Node.h
#ifndef node_h
#define node_h
template
class 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;
private:
ItemType item;
Node* next;
};
template
Node::Node():next(nullptr){}
template
Node::Node(const ItemType &anItem):item(anItem), next(nullptr){}
template
Node::Node(const ItemType &anItem, Node * nextNodePtr):item(anItem), next(nextNodePtr)
{
}
template
void Node::setItem(const ItemType &anItem){
item = anItem;
}
template
void Node::setNext(Node * nextNodePtr) {
next = nextNodePtr;
}
template
ItemType Node::getItem() const {
return item;
}
template
Node* Node::getNext()const{
return next;
}
#endif /* node_h */
LinkedStack.h
#include
#ifndef LinkedStack_h
#define LinkedStack_h
#include \"Node.h\"
#include \"StackInterface.h\"
template
class LinkedStack:public StackInterface{
public:
LinkedStack();
LinkedStack(const LinkedStack &aStack); //space matter?***********
virt.
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
.
Please fill in the code, which only need to add code in the adju.pdf
//Please fill in the code, which only need to add code in the \"adjustHeap\" function.
#ifndef HEAP_H
#define HEAP_H
#include
#include // std::out_of_range
using namespace std;
template
class Heap
{
private:
vector _items;
void buildHeap()
{
for (int i = _items.size() / 2; i >= 0; i--)
{
adjustHeap(i);
}
}
//MA TODO: Implement adjustHeap!
//Percolates the item specified at by index down into its proper location within a heap.
// Used for dequeue operations and array to heap conversions
void adjustHeap(int index)
{
// The ONLY code you\'d need to do for this MA would be in this function call
}
public:
Heap()
{
}
Heap(const vector &unsorted)
{
for (int i = 0; i < unsorted.size(); i++)
{
_items.push(unsorted[i]);
}
buildHeap();
}
//Adds a new item to the heap
void insert(T item)
{
//calculate positions
int current_position = _items.size();
int parent_position = (current_position - 1) / 2;
//insert element (note: may get erased if we hit the WHILE loop)
_items.push_back(item);
//get parent element if it exists
T *parent = nullptr;
if (parent_position >= 0)
{
parent = &_items[parent_position];
}
//only continue if we have a non-null parent
if (parent != nullptr)
{
//bubble up
while (current_position > 0 && item < *parent)
{
_items[current_position] = *parent;
current_position = parent_position;
parent_position = (current_position - 1) / 2;
if (parent_position >= 0)
{
parent = &_items[parent_position];
}
}
//after finding the correct location, we can finally place our item
_items[current_position] = item;
}
}
//Returns the top-most item in our heap without actually removing the item from the heap
T& getFirst()
{
if( size() > 0 )
return _items[0];
else
throw std::out_of_range(\"No elements in Heap.\");
}
//Removes the top-most item from the heap and returns it to the caller
T deleteMin()
{
int last_position = _items.size() - 1;
T last_item = _items[last_position];
T top = _items[0];
_items[0] = last_item;
_items.erase(_items.begin() + last_position);
//percolate down
adjustHeap(0);
return top;
}
// Returns true if heap is empty, false otherwise
bool isEmpty() const
{
return _items.size() == 0;
}
// Return size (N) of the Heap
int size() const
{
return _items.size();
}
// Simple debugging print out
void printAll() const
{
for(int i = 0; i < _items.size(); i++)
{
cout << \" [x] Heap element [\" << i << \"]. key=\" << _items[i] << endl;
}
}
};
#endif
Solution
void adjustHeap(int index) { int largest,left,right; Map.Entry temp = null;
while(true){ left = 2*index+1; right = 2*index+2; if(left < size &&
elements[index].getValue() < elements[left].getValue()){ largest = left;
if(right < size && elements[left].getValue() < elements[right].getValue()){ largest =
right; } } else if(right < size && elements[index].getValue() <
elements[right].getValue()){ largest = right; } else break; // swapping
temp = elements[index]; elements[index] = elements[largest];
elements[largest] = temp; index = largest; } } } }.
#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++; // .
Given the following class in Java- public class ThreeTenDynArray-T- {.pdf
Given the following class in Java :
public class ThreeTenDynArray<T> {
//default initial capacity / minimum capacity
private static final int MIN_CAPACITY = 2;
//underlying array for storage -- you MUST use this for credit!
//Do NOT change the name or type
private T[] data;
private int size = 0;
private int capacity = 0;
// ADD MORE PRIVATE MEMBERS HERE IF NEEDED!
/**
*
*/
@SuppressWarnings("unchecked")
public ThreeTenDynArray() {
// Constructor
// Initial capacity of the storage should be MIN_CAPACITY
// Hint: Can't remember how to make an array of generic Ts? It's in the textbook...
data = (T[])(new Object[MIN_CAPACITY]);
size = 0;
capacity = MIN_CAPACITY;
}
/**
* @param initCapacity
*/
@SuppressWarnings("unchecked")
public ThreeTenDynArray(int initCapacity) {
// Constructor
// Initial capacity of the storage should be initCapacity.
// - Throw IllegalArgumentException if initCapacity is smaller than
// MIN_CAPACITY 2
// - Use this _exact_ error message for the exception
// (quotes are not part of the message):
// "Capacity must be at least 2!"
if (initCapacity < MIN_CAPACITY) {
throw new IllegalArgumentException("Capacity must be at least 2!");
}
}
/**
* @return
*/
public int size() {
// Report the current number of elements
// O(1)
return size; //default return, remove/change as needed
}
/**
* @return
*/
public int capacity() {
// Report max number of elements of the current storage
// (subject to change since this is a _dynamic_ )
// O(1)
return capacity; //default return, remove/change as needed
}
/**
* @param index index you're changing
* @param value what you're adding
* @return the old item at the index
*/
public T set(int index, T value) {
// Replace the item at the given index to be the given value.
// Return the old item at that index.
// Note: You cannot add new items (i.e. cannot increase size) with this method.
// O(1)
//return firstIndexOf(value);
// - Throw IndexOutOfBoundsException if index is not valid
// - Use this code to produce the correct error message for
// the exception (do not use a different message):
// "Index: " + index + " out of bounds!"
if (index < 0 && index >= size) {
throw new IndexOutOfBoundsException("Index: " + index + " out of bounds!");
}
// - Throw IllegalArgumentException if value is null.
// - Use this _exact_ error message for the exception
// (quotes are not part of the message):
// "Cannot include null values!"
if (value==null) {
throw new IllegalArgumentException("Cannot include null values!");
}
T oldValue = data[index];
data[index] = value;
return oldValue; //default return, remove/change as needed
}
/**
* @param index
* @return
*/
public T get(int index) {
// Return the item at the given index
if (index < 0 && index >= size) {
throw new IndexOutOfBoundsException("Index: " + index + " out of bounds!");
}
// O(1)
// Use the exception (and error message) described in set()
// for invalid indicies.
return data[index]; //default return, remove/change as needed
}
/**
* @param value
*/
@SuppressWarn.
So I have this code(StackInAllSocks) and I implemented the method but.pdf
So I have this code( StackInAllSocks ) and I implemented the method but I can't seem to figure
out why there isn't anything showing up on the console. It should pop,peek and push b using the
methods from the class called ArrayListTen . The ArrayListTen works fine and compiles the
tested code of Rigth# but for StackInAllSocks it doesn't complete at all. note that file
VodeDodeis not to be changed is just a Node storage area of the array list.
Did I implement the method on StackInAllSocks correctly? if so, should I not use the method
from the ArrayListTen .?
__________________________________________________________________________
: the code is : VodeDodeis
class VodeDode<T> {
private T data;
private VodeDode<T> next;
private VodeDode<T> prev;
public VodeDode(T data) {
this.data = data;
this.next = null;
this.prev = null;}
public T getData() {
return data;}
public void setData(T data) {
this.data = data;}
public VodeDode<T> getNext() {
return this.next;}
public void setNext(VodeDode<T> next) {
this.next = next;}
public VodeDode<T> getPrev() {
return this.prev;}
public void setPrev(VodeDode<T> prev) {
this.prev = prev;}
@Override
public String toString() {
return data.toString();}}
_________________________________________________________________________
CODE that works fine called ArrayListTen:
import java.util.Iterator;
public class ArrayListTen<T> implements Iterable<T> {
private VodeDode<T> head; //beginning of list
private VodeDode<T> tail; //end of list
private int size;
private VodeDode<T> new_item;
public ArrayListTen( ){
this.head = null;
this.tail = null;
this.size = 0;}
public int lenght() {
return size ;}
public T getBegin() {
if (this.head != null) {
return head.getData();}
else { return null;}}
public void addBegin(T value) {
VodeDode<T> newVodeDode =new VodeDode<T>(value);
if (this.head== null) {
head = newVodeDode;
tail =newVodeDode;}
else {VodeDode<T> temp = head;
head = newVodeDode;
head.setNext(temp);}
size++;}
public T removeBegin() {
if(this.head == null) {
return null;}
else {T current = head.getData();
if (tail == head) {
tail = null;
head = null;
} else {
head = head.getNext();
head.setPrev(null);}size--;
return current;}}
public T getEnd() {
if (tail != null) {
return tail.getData();
} else {
return null;}}
public void addEnd(T value) {
VodeDode<T> newVodeDode = new VodeDode<T>(value);
if (this.tail == null) {
head = newVodeDode;
tail = newVodeDode;
} else {
newVodeDode.setPrev(tail);
tail.setNext(newVodeDode);
tail = newVodeDode;}
size++;}
public T removeEnd() {
if(this.tail == null) {
return null;}
else {
T current = tail.getData();//was head.
if (head == tail) {
head = null;
tail = null;
} else {
tail = tail.getPrev();
tail.setNext(null);}
size--;
return current;}}
public T removeBN(T value) {
VodeDode<T> currVodeDode = head;
VodeDode<T> prevVodeDode = null;
while(currVodeDode != null){
if(currVodeDode.getData().equals(value)){
if(prevVodeDode != null){
prevVodeDode.setNext(currVodeDode.getNext());}
else{
head = curr.
Recommended
Header file for an array-based implementation of the ADT bag. @f.pdf
/** Header file for an array-based implementation of the ADT bag. @file ArrayBag.h */
#ifndef _ARRAY_BAG
#define _ARRAY_BAG
#include \"BagInterface.h\"
template class ArrayBag : public BagInterface
{
private:
static const int DEFAULT_CAPACITY = 6; // Small size to test for a full bag
ItemType items[DEFAULT_CAPACITY]; // Array of bag items
int itemCount; // Current count of bag items
int maxItems; // Max capacity of the bag
// Returns either the index of the element in the array items that // contains the given target or -1,
if the array does not contain // the target.
int getIndexOf(const ItemType& target) const;
public:
ArrayBag();
int getCurrentSize() const;
bool isEmpty() const;
bool add(const ItemType& newEntry);
bool remove(const ItemType& anEntry);
void clear();
bool contains(const ItemType& anEntry) const;
int getFrequencyOf(const ItemType& anEntry) const;
vector toVector() const;
}; // end ArrayBag
//#include \"ArrayBag.cpp\" // /** Implementation file for the class ArrayBag. @file
ArrayBag.cpp */
#include \"ArrayBag.h\"
#include template
ArrayBag::ArrayBag(): itemCount(0), maxItems(DEFAULT_CAPACITY)
{ } // end default constructor
template int ArrayBag::getCurrentSize() const { return itemCount; } // end getCurrentSize
template bool ArrayBag::isEmpty() const { return itemCount == 0; } // end isEmpty
template bool ArrayBag::add(const ItemType& newEntry)
{
bool hasRoomToAdd = (itemCount < maxItems);
if (hasRoomToAdd)
{
items[itemCount] = newEntry; itemCount++;
} // end if return hasRoomToAdd;
} // end add
/* // STUB template bool ArrayBag::remove(const ItemType& anEntry) { return false; // STUB
} // end remove
*/ template bool ArrayBag::remove(const ItemType& anEntry)
{
int locatedIndex = getIndexOf(anEntry);
bool canRemoveItem = !isEmpty() && (locatedIndex > -1);
if (canRemoveItem)
{
itemCount--;
items[locatedIndex] = items[itemCount];
} // end if return
canRemoveItem;
} // end remove /*
// STUB template void ArrayBag::clear() { // STUB } // end clear
*/ template void ArrayBag::clear() { itemCount = 0; } // end clear
template int ArrayBag::getFrequencyOf(const ItemType& anEntry) const
{
int frequency = 0;
int curIndex = 0; // Current array index
while (curIndex < itemCount)
{
if (items[curIndex] == anEntry)
{
frequency++;
} // end if
curIndex++; // Increment to next entry
} // end while
return frequency;
} // end getFrequencyOf
template bool ArrayBag::contains(const ItemType& anEntry) const
{
return getIndexOf(anEntry) > -1;
} // end contains
/* ALTERNATE 1: First version
template bool ArrayBag::contains(const ItemType& target) const
{
return getFrequencyOf(target) > 0;
} // end contains
// ALTERNATE 2: Second version
template bool ArrayBag::contains(const ItemType& anEntry) const
{
bool found = false;
int curIndex = 0; // Current array index
while (!found && (curIndex < itemCount))
{
if (anEntry == items[curIndex])
{
found = true;
} // end if
curIndex++; // Increment to next entry
} // end while
return found;
} // end contains
*/ temp.
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)
{
.
Can you please debug this Thank you in advance! This program is sup.pdf
Can you please debug this? Thank you in advance! This program is supposed to use stacks and
find the paths of an airplane. It should tell you whether or not the plane goes from the requested
city to the requested destination. requestFile.txt contains the requests, flightFile.txt contains the
flights and cityFile.txt contains the city\'s that the airline serves.
My errors: my output is simply \"Hpair does not serve Los Angeles.\" Thats it and it stops.
It should look something like (these are not real values of the file just an example):
\"Request is to fly from cityA to CityB.
Hpair flight from cityA to CityB.
Request is to fly from cityC to cityD.
Sorry, HPAir does not serve City D
Request is to fly from cityE to CityF
Sorry, HPAir does not fly from cityE to CityF\"
**It said to use ispath.cpp but I got confused on how to implement it completely.\"
isPath.cpp
//***I did not include ispath.cpp in my program. Parts of it are in the map.h portion.
main.cpp
#include
#include
#include \"Map.h\"
using namespace std;
int main()
{
Map aMap;
aMap.readFlights();
aMap.verifyRequestedFile();
}
StackInterface.h
#ifndef StackInterface_h
#define StackInterface_h
template
class StackInterface
{
/** Checks if the stack is empty.
@return True if the stack is empty or false if the stack is not.*/
virtual bool isEmpty() const = 0;
/** Adds a new item to the stack
@post newEntry is at the top of the stack
@param newEntry is the object to be added to the stack
@return True if successfully added, otherwise false. */
virtual bool push(const ItemType& newEntry) = 0;
/** Removes item from stack
@post The top item in the stack is removed
@return True if the item was removed, false if it was not. */
virtual bool pop() = 0;
/** Returns the top item in the stack
@pre The stack is not empty
@post The top item in the stack is returned
@return The top of the stack */
virtual ItemType peek() const = 0;
};
#endif /* StackInterface_h */
Node.h
#ifndef node_h
#define node_h
template
class 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;
private:
ItemType item;
Node* next;
};
template
Node::Node():next(nullptr){}
template
Node::Node(const ItemType &anItem):item(anItem), next(nullptr){}
template
Node::Node(const ItemType &anItem, Node * nextNodePtr):item(anItem), next(nextNodePtr)
{
}
template
void Node::setItem(const ItemType &anItem){
item = anItem;
}
template
void Node::setNext(Node * nextNodePtr) {
next = nextNodePtr;
}
template
ItemType Node::getItem() const {
return item;
}
template
Node* Node::getNext()const{
return next;
}
#endif /* node_h */
LinkedStack.h
#include
#ifndef LinkedStack_h
#define LinkedStack_h
#include \"Node.h\"
#include \"StackInterface.h\"
template
class LinkedStack:public StackInterface{
public:
LinkedStack();
LinkedStack(const LinkedStack &aStack); //space matter?***********
virt.
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
.
Please fill in the code, which only need to add code in the adju.pdf
//Please fill in the code, which only need to add code in the \"adjustHeap\" function.
#ifndef HEAP_H
#define HEAP_H
#include
#include // std::out_of_range
using namespace std;
template
class Heap
{
private:
vector _items;
void buildHeap()
{
for (int i = _items.size() / 2; i >= 0; i--)
{
adjustHeap(i);
}
}
//MA TODO: Implement adjustHeap!
//Percolates the item specified at by index down into its proper location within a heap.
// Used for dequeue operations and array to heap conversions
void adjustHeap(int index)
{
// The ONLY code you\'d need to do for this MA would be in this function call
}
public:
Heap()
{
}
Heap(const vector &unsorted)
{
for (int i = 0; i < unsorted.size(); i++)
{
_items.push(unsorted[i]);
}
buildHeap();
}
//Adds a new item to the heap
void insert(T item)
{
//calculate positions
int current_position = _items.size();
int parent_position = (current_position - 1) / 2;
//insert element (note: may get erased if we hit the WHILE loop)
_items.push_back(item);
//get parent element if it exists
T *parent = nullptr;
if (parent_position >= 0)
{
parent = &_items[parent_position];
}
//only continue if we have a non-null parent
if (parent != nullptr)
{
//bubble up
while (current_position > 0 && item < *parent)
{
_items[current_position] = *parent;
current_position = parent_position;
parent_position = (current_position - 1) / 2;
if (parent_position >= 0)
{
parent = &_items[parent_position];
}
}
//after finding the correct location, we can finally place our item
_items[current_position] = item;
}
}
//Returns the top-most item in our heap without actually removing the item from the heap
T& getFirst()
{
if( size() > 0 )
return _items[0];
else
throw std::out_of_range(\"No elements in Heap.\");
}
//Removes the top-most item from the heap and returns it to the caller
T deleteMin()
{
int last_position = _items.size() - 1;
T last_item = _items[last_position];
T top = _items[0];
_items[0] = last_item;
_items.erase(_items.begin() + last_position);
//percolate down
adjustHeap(0);
return top;
}
// Returns true if heap is empty, false otherwise
bool isEmpty() const
{
return _items.size() == 0;
}
// Return size (N) of the Heap
int size() const
{
return _items.size();
}
// Simple debugging print out
void printAll() const
{
for(int i = 0; i < _items.size(); i++)
{
cout << \" [x] Heap element [\" << i << \"]. key=\" << _items[i] << endl;
}
}
};
#endif
Solution
void adjustHeap(int index) { int largest,left,right; Map.Entry temp = null;
while(true){ left = 2*index+1; right = 2*index+2; if(left < size &&
elements[index].getValue() < elements[left].getValue()){ largest = left;
if(right < size && elements[left].getValue() < elements[right].getValue()){ largest =
right; } } else if(right < size && elements[index].getValue() <
elements[right].getValue()){ largest = right; } else break; // swapping
temp = elements[index]; elements[index] = elements[largest];
elements[largest] = temp; index = largest; } } } }.
#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++; // .
Given the following class in Java- public class ThreeTenDynArray-T- {.pdf
Given the following class in Java :
public class ThreeTenDynArray<T> {
//default initial capacity / minimum capacity
private static final int MIN_CAPACITY = 2;
//underlying array for storage -- you MUST use this for credit!
//Do NOT change the name or type
private T[] data;
private int size = 0;
private int capacity = 0;
// ADD MORE PRIVATE MEMBERS HERE IF NEEDED!
/**
*
*/
@SuppressWarnings("unchecked")
public ThreeTenDynArray() {
// Constructor
// Initial capacity of the storage should be MIN_CAPACITY
// Hint: Can't remember how to make an array of generic Ts? It's in the textbook...
data = (T[])(new Object[MIN_CAPACITY]);
size = 0;
capacity = MIN_CAPACITY;
}
/**
* @param initCapacity
*/
@SuppressWarnings("unchecked")
public ThreeTenDynArray(int initCapacity) {
// Constructor
// Initial capacity of the storage should be initCapacity.
// - Throw IllegalArgumentException if initCapacity is smaller than
// MIN_CAPACITY 2
// - Use this _exact_ error message for the exception
// (quotes are not part of the message):
// "Capacity must be at least 2!"
if (initCapacity < MIN_CAPACITY) {
throw new IllegalArgumentException("Capacity must be at least 2!");
}
}
/**
* @return
*/
public int size() {
// Report the current number of elements
// O(1)
return size; //default return, remove/change as needed
}
/**
* @return
*/
public int capacity() {
// Report max number of elements of the current storage
// (subject to change since this is a _dynamic_ )
// O(1)
return capacity; //default return, remove/change as needed
}
/**
* @param index index you're changing
* @param value what you're adding
* @return the old item at the index
*/
public T set(int index, T value) {
// Replace the item at the given index to be the given value.
// Return the old item at that index.
// Note: You cannot add new items (i.e. cannot increase size) with this method.
// O(1)
//return firstIndexOf(value);
// - Throw IndexOutOfBoundsException if index is not valid
// - Use this code to produce the correct error message for
// the exception (do not use a different message):
// "Index: " + index + " out of bounds!"
if (index < 0 && index >= size) {
throw new IndexOutOfBoundsException("Index: " + index + " out of bounds!");
}
// - Throw IllegalArgumentException if value is null.
// - Use this _exact_ error message for the exception
// (quotes are not part of the message):
// "Cannot include null values!"
if (value==null) {
throw new IllegalArgumentException("Cannot include null values!");
}
T oldValue = data[index];
data[index] = value;
return oldValue; //default return, remove/change as needed
}
/**
* @param index
* @return
*/
public T get(int index) {
// Return the item at the given index
if (index < 0 && index >= size) {
throw new IndexOutOfBoundsException("Index: " + index + " out of bounds!");
}
// O(1)
// Use the exception (and error message) described in set()
// for invalid indicies.
return data[index]; //default return, remove/change as needed
}
/**
* @param value
*/
@SuppressWarn.
So I have this code(StackInAllSocks) and I implemented the method but.pdf
So I have this code( StackInAllSocks ) and I implemented the method but I can't seem to figure
out why there isn't anything showing up on the console. It should pop,peek and push b using the
methods from the class called ArrayListTen . The ArrayListTen works fine and compiles the
tested code of Rigth# but for StackInAllSocks it doesn't complete at all. note that file
VodeDodeis not to be changed is just a Node storage area of the array list.
Did I implement the method on StackInAllSocks correctly? if so, should I not use the method
from the ArrayListTen .?
__________________________________________________________________________
: the code is : VodeDodeis
class VodeDode<T> {
private T data;
private VodeDode<T> next;
private VodeDode<T> prev;
public VodeDode(T data) {
this.data = data;
this.next = null;
this.prev = null;}
public T getData() {
return data;}
public void setData(T data) {
this.data = data;}
public VodeDode<T> getNext() {
return this.next;}
public void setNext(VodeDode<T> next) {
this.next = next;}
public VodeDode<T> getPrev() {
return this.prev;}
public void setPrev(VodeDode<T> prev) {
this.prev = prev;}
@Override
public String toString() {
return data.toString();}}
_________________________________________________________________________
CODE that works fine called ArrayListTen:
import java.util.Iterator;
public class ArrayListTen<T> implements Iterable<T> {
private VodeDode<T> head; //beginning of list
private VodeDode<T> tail; //end of list
private int size;
private VodeDode<T> new_item;
public ArrayListTen( ){
this.head = null;
this.tail = null;
this.size = 0;}
public int lenght() {
return size ;}
public T getBegin() {
if (this.head != null) {
return head.getData();}
else { return null;}}
public void addBegin(T value) {
VodeDode<T> newVodeDode =new VodeDode<T>(value);
if (this.head== null) {
head = newVodeDode;
tail =newVodeDode;}
else {VodeDode<T> temp = head;
head = newVodeDode;
head.setNext(temp);}
size++;}
public T removeBegin() {
if(this.head == null) {
return null;}
else {T current = head.getData();
if (tail == head) {
tail = null;
head = null;
} else {
head = head.getNext();
head.setPrev(null);}size--;
return current;}}
public T getEnd() {
if (tail != null) {
return tail.getData();
} else {
return null;}}
public void addEnd(T value) {
VodeDode<T> newVodeDode = new VodeDode<T>(value);
if (this.tail == null) {
head = newVodeDode;
tail = newVodeDode;
} else {
newVodeDode.setPrev(tail);
tail.setNext(newVodeDode);
tail = newVodeDode;}
size++;}
public T removeEnd() {
if(this.tail == null) {
return null;}
else {
T current = tail.getData();//was head.
if (head == tail) {
head = null;
tail = null;
} else {
tail = tail.getPrev();
tail.setNext(null);}
size--;
return current;}}
public T removeBN(T value) {
VodeDode<T> currVodeDode = head;
VodeDode<T> prevVodeDode = null;
while(currVodeDode != null){
if(currVodeDode.getData().equals(value)){
if(prevVodeDode != null){
prevVodeDode.setNext(currVodeDode.getNext());}
else{
head = curr.
template-typename T- class Array { public- ---------------------------.pdf
template<typename T>
class Array
{
public:
//*****************************************************
// DO NOT MODIFY THIS SECTION!
// Some standard Container type aliases
using value_type = T;
// Iterators are just pointers to objects of type T
using iterator = value_type*;
using const_iterator = const value_type*;
using reference = value_type&;
using const_reference = const value_type&;
using size_type = size_t;
using difference_type = ptrdiff_t;
//*****************************************************
// Default ctor.
// Initialize an empty Array.
// This method is complete, and does NOT need modification.
// Remember to use a _member initialization list_ for each ctor,
// like I have below for the default ctor.
Array ()
: m_size (0),
m_capacity (0),
m_array (nullptr)
{
}
// Size ctor.
// Initialize an Array of size "pSize", with each element
// set to "value".
explicit Array (size_t pSize, const T& value = T ())
: m_size (pSize),
m_capacity (pSize),
m_array (new T[m_capacity])
{
fill (begin (), end (), value);
}
// Range ctor.
// Initialize an Array from the range [first, last).
// "first" and "last" must be Array iterators or pointers
// into a primitive array.
Array (const_iterator first, const_iterator last)
:m_size(distance(first,last)),m_capacity(m_size),m_array(new T[m_capacity])
{
copy(first,last,m_array);
}
// Copy ctor.
// Initialize this object from "a".
Array (const Array& a)
:m_size(a.m_size),m_capacity(a.m_capacity),m_array(new T[m_capacity])
{
copy(a.begin(),a.end(),m_array);
}
// Destructor.
// Release allocated memory.
~Array ()
{
delete[] m_array;
}
// Assignment operator.
// Assign "a" to this object.
// Be careful to check for self-assignment.
Array&
operator= (const Array& a)
{
if (this != &a)
{
m_size = a.m_size;
m_capacity = a.m_capacity;
m_array = new T[m_capacity];
copy(a.begin(),a.end(),m_array);
}
return *this;
}
// Return the size.
size_t
size () const
{
return m_size;
}
// Return true if this Array is empty, false o/w.
bool
empty () const
{
return m_size == 0;
}
// Return the capacity.
size_t
capacity () const
{
return m_capacity;
}
// Return the element at position "index".
T& operator[] (size_t index)
{
return m_array[index];
}
const T& operator[] (size_t index) const
{
return m_array[index];
}
// Insert an element at the back.
// If the capacity is insufficient, DOUBLE it.
// If the capacity is 0, increase it to 1.
void
push_back (const T& item)
{
if (m_size == 0)
{
m_capacity = 1;
m_array = new T[m_capacity];
}
else if (m_size == m_capacity)
{
m_capacity *= 2;
T* temp = new T[2 * m_capacity];
copy(begin(),end(),temp);
delete[] m_array;
m_array = temp;
}
m_array[m_size] = item;
++m_size;
}
// Erase the element at the back.
void
pop_back ()
{
if (m_size > 0)
{
--m_size;
}
}
// Reserve capacity for "space" elements.
// "space" must be greater than capacity.
// If not, leave the capacity unchanged.
// "size" must remain unchanged.
void
reserve (size_t space)
{
if (space > capacity ())
{
T* array = new T[space];
co.
I have created a class hasdhedDictionary that implements the Diction.pdf
I have created a class hasdhedDictionary that implements the DictionaryInterface.java that
should count the collisions when reading a txt file
Write an application WordFrequency that will be using the Dictionary ADT to study the
number of collisions that occur with different hash table length, use 1361, 1637 and 2011 it
should not return zero but a value. for the txt file plz us the US constitution, if my collision
counter is wrong (public V add(K key, V value) please rework it)
do not add new adt or implementations like nodes, linked list or array or methods like setNext or
getNext
HASHEDDICTIONARY
import java.util.Iterator;
import java.util.NoSuchElementException;
public class HashedDictionary implements DictionaryInterface
{
// The dictionary:
private int numberOfEntries;
private static final int DEFAULT_CAPACITY = 5; // Must be prime
private static final int MAX_CAPACITY = 10000;
// The hash table:
private Entry[] hashTable;
private int tableSize; // Must be prime
private static final int MAX_SIZE = 2 * MAX_CAPACITY;
private boolean integrityOK = false;
private static final double MAX_LOAD_FACTOR = 0.5; // Fraction of
// hash table that can be filled
private int collisionCount;
protected final Entry AVAILABLE = new Entry<>(null, null);
// Counter to keep track of collisions
public HashedDictionary()
{
this(DEFAULT_CAPACITY); // Call next constructor
} // end default constructor
public HashedDictionary(int initialCapacity)
{
initialCapacity = checkCapacity(initialCapacity);
numberOfEntries = 0; // Dictionary is empty
// Set up hash table:
// Initial size of hash table is same as initialCapacity if it is prime;
// otherwise increase it until it is prime size
tableSize = getNextPrime(initialCapacity);
checkSize(tableSize); // Check that size is not too large
// The cast is safe because the new array contains null entries
@SuppressWarnings("unchecked")
Entry[] temp = (Entry[])new Entry[tableSize];
hashTable = temp;
integrityOK = true;
collisionCount = 0;
} // end constructor
/* Implementations of methods in DictionaryInterface are here. . . .*/
public V add(K key, V value) {
int index = getHashIndex(key);
V oldValue = null;
if (key == null || value == null) {
throw new NoSuchElementException("Cannot add null key or value.");
}
// If the index is empty or has an AVAILABLE entry, add the new entry.
if (hashTable[index] == null || hashTable[index] == AVAILABLE) {
hashTable[index] = new Entry<>(key, value);
numberOfEntries++;
}
// If the index has the same key as the new entry, update the value.
else if (hashTable[index].getKey().equals(key)) {
oldValue = hashTable[index].getValue();
hashTable[index].setValue(value);
}
// Otherwise, there is a collision.
else {
int startIndex = index;
index = (index + 1) % hashTable.length;
// Keep probing until an empty or AVAILABLE index is found.
while (index != startIndex && hashTable[index] != null && hashTable[index] != AVAILABLE)
{
index = (index + 1) % hashTable.length;
}
// If an empty index is found, ad.
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.
Need help with writing the test cases for the following code in java-.docx
Need help with this question ASAP! Please and thanks
2 points The is typically the most powerful stakeholder for the project but is often not the most powerful person in the company. 2 points The two axes on grid we use to measure the impact a stakeholder could have on our project and how we manage the relationship with them are and
.
Given main() in the Inventory class, define an insertAtFront() metho.pdf
Given main() in the Inventory class, define an insertAtFront() method in the InventoryNode class
that inserts items at the front of a linked list (after the dummy head node).
Ex. If the input is:
the output is:
CODE:
public class InventoryNode {
private String item;
private int numberOfItems;
private InventoryNode nextNodeRef; // Reference to the next node
public InventoryNode() {
item = "";
numberOfItems = 0;
nextNodeRef = null;
}
// Constructor
public InventoryNode(String itemInit, int numberOfItemsInit) {
this.item = itemInit;
this.numberOfItems = numberOfItemsInit;
this.nextNodeRef = null;
}
// Constructor
public InventoryNode(String itemInit, int numberOfItemsInit, InventoryNode nextLoc) {
this.item = itemInit;
this.numberOfItems = numberOfItemsInit;
this.nextNodeRef = nextLoc;
}
// TODO: Define an insertAtFront() method that inserts a node at the
// front of the linked list (after the dummy head node)
// Get location pointed by nextNodeRef
public InventoryNode getNext() {
return this.nextNodeRef;
}
// Print node data
public void printNodeData() {
System.out.println(this.numberOfItems + " " + this.item);
}
}.
Infinum Android Talks #20 - DiffUtil
We're taking a closer look into a new utility class from Android Support Library. It enables you to calculate the difference between two lists and output a list of update operations swiftly and with style. Presented by Željko Plesac from Infinum.
Create a Dynamic Array container with this user interface Ge.pdf
Create a \"Dynamic Array\" container with this user interface: // Gets the current number of
entries in container int getCurrentSize() // Returns the current capacity of the container int
capacity() // Checks whether the container is empty. boolean isEmpty() // Adds a new entry to
the container boolean insert(newEntry) // Removes an entry from the container and moves all
entries above anEntry down one boolean remove(anEntry) // Get index value int getValue(index)
// Removes all entries from the container void clear() // Resize a container by doubling current
capacity int resize() * Implement dynamic resizing using this algorithm: 1. Starting with a
dynamic size of 10, if the number of elements exceed this number: a. Reallocate the container
size to double the current size b. Move the contents of the current container to the newly sized
container c. Delete the previously sized container. Resize C++ Data* ptemp = new
Data[capacity*2 ]; for (int i=0; i
Solution
container.cpp ---
#include
#include
using namespace std;
template
class DynamicArray
{
/*
Container class DynamicArray
*/
private:
ArrayType *arr;
int entry,size;
public:
DynamicArray();
~DynamicArray();
int getCurrentSize() { return entry; };/*this function returns total number of entries in the
container*/
int capacity() { return size; };/*this function returns capacity of the container*/
bool isEmpty();
bool insert(ArrayType);
bool remove(ArrayType);
int getValue(ArrayType);
void clear() { entry = 0; };/*this function clears the whole container*/
int resize();
};
template
int DynamicArray::resize()
{
/*this function resizes the container by doubling its previous size*/
ArrayType *temp = NULL;
try
{
temp = new ArrayType [2 * size];
}catch(bad_alloc xa){
cout<<\"\ Array allocation failed\ \";
exit(1);
}
size *= 2;
for(int i = 0 , j = 0 ; i < entry ; i++)
{
temp[i] = arr[i];
j++;
}
delete [] arr;
arr = NULL;
arr = temp , temp = NULL;
return size;
}
template
int DynamicArray::getValue(ArrayType index)
{
/*this function return index of an element specified as index in the container if it presents
in the container, else it returns -1*/
int loc = -1;
for(int i = 0 ; i < entry ; i++)
{
if(arr[i] == index)
{
loc = i;
break;
}
}
return loc;
}
template
bool DynamicArray::remove(ArrayType anEntry)
{
/*this function removes an element specified as anEntry from the container and returns true
and
decrements total number of entries by one else returns false*/
bool flag = false;
int index = -1;
for(int i = 0 ; i < entry ; i++)
{
if(arr[i] == anEntry)
{
index = i , flag = true;
break;
}
}
for(int i = index ; i < (entry - 1) && flag == true ; i++)
{
arr[i] = arr[i+1];
}
if(flag == true)
entry -= 1;
return flag;
}
template
bool DynamicArray::insert(ArrayType newEntry)
{
/*this function inserts an element specified as newEntry in the container,
if it successfully inserts an element then it returns true and increments total
number of entries by one, else it returns false*/
entry += 1;
if(entry <= size)
{
ar.
How do I fix it in LinkedList.javaLabProgram.javaLinkedList.jav.pdf
How do I fix it in LinkedList.java?
LabProgram.java
LinkedList.java:
/**
* Defines a doubly-linked list class
* @author
* @author
*/
import java.util.NoSuchElementException;
public class LinkedList {
private class Node {
private T data;
private Node next;
private Node prev;
public Node(T data) {
this.data = data;
this.next = null;
this.prev = null;
}
}
private int length;
private Node first;
private Node last;
private Node iterator;
/**** CONSTRUCTORS ****/
/**
* Instantiates a new LinkedList with default values
* @postcondition
*/
public LinkedList() {
first = null;
last = null;
iterator = null;
length = 0;
}
/**
* Converts the given array into a LinkedList
* @param array the array of values to insert into this LinkedList
* @postcondition
*/
public LinkedList(T[] array) {
}
/**
* Instantiates a new LinkedList by copying another List
* @param original the LinkedList to copy
* @postcondition a new List object, which is an identical,
* but separate, copy of the LinkedList original
*/
public LinkedList(LinkedList original) {
}
/**** ACCESSORS ****/
public T getFirst() throws NoSuchElementException {
if (isEmpty()){
throw new NoSuchElementException("The list is empty");
}
return first.data;
}
public T getLast() throws NoSuchElementException {
if (isEmpty()){
throw new NoSuchElementException("The list is empty");
}
return last.data;
}
/**
* Returns the data stored in the iterator node
* @precondition
* @return the data stored in the iterator node
* @throw NullPointerException
*/
public T getIterator() throws NullPointerException {
if (iterator != null){
return iterator.data;
}else{
throw new NullPointerException("Iterator is off the end opf the list.");
}
}
/**
* Returns the current length of the LinkedList
* @return the length of the LinkedList from 0 to n
*/
public int getLength() {
return length;
}
/**
* Returns whether the LinkedList is currently empty
* @return whether the LinkedList is empty
*/
public boolean isEmpty() {
return length == 0;
}
/**
* Returns whether the iterator is offEnd, i.e. null
* @return whether the iterator is null
*/
public boolean offEnd() {
return iterator == null;
}
/**** MUTATORS ****/
public void addFirst(T data) {
Node newNode = new Node(data);
if(isEmpty()){
first = newNode;
last = newNode;
}
else{
newNode.next = first;
first.prev = newNode;
first = newNode;
}
length++;
}
public void addLast(T data) {
Node newNode = new Node(data);
if(isEmpty()){
first = newNode;
last = newNode;
}
else{
last.next = newNode;
newNode.prev = last;
last = newNode;
}
length++;
}
/**
* Inserts a new element after the iterator
* @param data the data to insert
* @precondition
* @throws NullPointerException
*/
public void addIterator(T data) throws NullPointerException{
if(iterator != null){
Node newNode = new Node(data);
newNode.next = iterator.next;
iterator.next = newNode;
if (iterator == first){
first = newNode;
}
}else{
throw new NullPointerException("Iterator is off the end opf the list.");
}
}
/
public void removeFirst() throws NoS.
#include -algorithm- #include -cstdlib- #include -iostream- #include -.pdf
#include <algorithm>
#include <cstdlib>
#include <iostream>
#include <iterator>
/************************************************************/
// Local includes
/************************************************************/
// Using declarations
// YOU DO NOT NECESSARILY NEED TO USE ALL OF THESE!
using std::copy;
using std::copy_backward;
using std::distance;
using std::fill;
using std::ostream;
using std::ptrdiff_t;
/************************************************************/
template<typename T>
class Array
{
public:
//*****************************************************
// DO NOT MODIFY THIS SECTION!
// Some standard Container type aliases
using value_type = T;
// Iterators are just pointers to objects of type T
using iterator = value_type*;
using const_iterator = const value_type*;
using reference = value_type&;
using const_reference = const value_type&;
using size_type = size_t;
using difference_type = ptrdiff_t;
//*****************************************************
// Default ctor.
// Initialize an empty Array.
// This method is complete, and does NOT need modification.
// Remember to use a _member initialization list_ for each ctor,
// like I have below for the default ctor.
Array ()
: m_size (0),
m_capacity (0),
m_array (nullptr)
{
}
// Size ctor.
// Initialize an Array of size "pSize", with each element
// set to "value".
explicit Array (size_t pSize, const T& value = T ())
: m_size (pSize),
m_capacity (pSize),
m_array (new T[m_capacity])
{
fill (begin (), end (), value);
}
// TODO!
// Range ctor.
// Initialize an Array from the range [first, last).
// "first" and "last" must be Array iterators or pointers
// into a primitive array.
Array (const_iterator first, const_iterator last)
:m_size(distance(first,last)),m_capacity(m_size),m_array(new T[m_capacity])
{
copy(first,last,m_array);
}
// TODO!
// Copy ctor.
// Initialize this object from "a".
Array (const Array& a)
:m_size(a.m_size),m_capacity(a.m_capacity),m_array(new T[m_capacity])
{
copy(a.begin(),a.end(),m_array);
}
// TODO!
// Destructor.
// Release allocated memory.
~Array ()
{
delete[] m_array;
}
// TODO!
// Assignment operator.
// Assign "a" to this object.
// Be careful to check for self-assignment.
Array&
operator= (const Array& a)
{
if (this != &a)
{
delete[] m_array;
m_size = a.m_size;
m_capacity = a.m_capacity;
m_array = new T[m_capacity];
copy(a.begin(),a.end(),m_array);
}
return *this;
}
// Return the size.
size_t
size () const
{
return m_size;
}
// TODO!
// Return true if this Array is empty, false o/w.
bool
empty () const
{
return m_size == 0;
}
// TODO!
// Return the capacity.
size_t
capacity () const
{
return m_capacity;
}
// TODO!
// Return the element at position "index".
T& operator[] (size_t index)
{
return m_array[index];
}
// TODO!
const T& operator[] (size_t index) const
{
return m_array[index];
}
// TODO!
// Insert an element at the back.
// If the capacity is insufficient, DOUBLE it.
// If the capacity is 0, increase it to 1.
void
push_back (const T&.
Character.cpphpp givenCharacter.cpp#include Character.hp.pdf
Character.cpp/hpp given:
Character.cpp:
#include "Character.hpp"
/**
Default constructor.
Default-initializes all private members.
Default character name: "NAMELESS".
Booleans are default-initialized to False.
Default enum value: NONE.
Default Vitality, Max Armor, and Level: 0.
*/
Character::Character():name_{"NAMELESS"},race_{NONE},vitality_{0},armor_{0},level_{0}
,enemy_{false}
{
}
/**
Parameterized constructor.
@param : The name of the character (a string in UPPERCASE)
@param : The race of the character (a string)
@param : The character's vitality (a non-negative integer) , with default value 0
@param : The character's max armor level (a non-negative integer), with default value 0
@param : The character's level (a non-negative integer), with default value 0
@param : A flag indicating whether the character is an enemy, with default value false
@post : The private members are set to the values of the corresponding parameters.
Hint: Notice the default arguments in the parameterized constructor.
If the given parameters are invalid, the default values are used instead.
*/
Character::Character(const std::string& name, const std::string& race, int vitality, int armor, int
level, bool enemy) : Character()
{
setName(name); // checks valid name
setRace(race); // checks valid race
(vitality >= 0) ? vitality_ = vitality: vitality_ = 0;
(armor >= 0) ? armor_ = armor: armor_ = 0;
(level >= 0) ? level_ = level: level_ = 0;
enemy_ = enemy;
}
/**
@param : the name of the Character
@post : sets the Character's title to the value of the parameter, in UPPERCASE. Only
alphabetical characters are allowed. For example, attempting to create a character named
"TW3EDLEDUM2" should create a character named "TWEDLEDUM".
: If the given parameter does not have any valid alphabetical characters, the character's name
should be set to "NAMELESS".
*/
void Character::setName(const std::string& name)
{
std::string nameUpper = "";
for(int i = 0; i= 0 : Characters cannot have negative health
@post : sets the vitality private member to the value of the parameter
*/
void Character::setVitality(const int& vitality)
{
if (vitality >= 0)
{
vitality_ = vitality;
}
}
/**
@return : the value stored in vitality_
*/
int Character::getVitality() const
{
return vitality_;
}
/**
@param : an integer armor level
@pre : armor >= 0 : Characters cannot have negative armor
@post : sets the armor private member to the value of the parameter
*/
void Character::setArmor(const int& armor)
{
if (armor >= 0)
{
armor_ = armor;
}
}
/**
@return : the value stored in armor_
*/
int Character::getArmor() const
{
return armor_;
}
/**
@param : an integer level
@pre : level >= 0 : Characters cannot have a negative
@post : sets the level private member to the value of the parameter
*/
void Character::setLevel(const int& level)
{
if (level >= 0)
{
level_ = level;
}
}
/**
@return : the value stored in level_
*/
int Character::getLevel() const
{
return level_;
}
/**
@post : sets the enemy flag to true
*/
void Char.
vectors.(join ALL INDIA POLYTECHNIC (AICTE)).pptx
join ALL INDIA POLYTECHNIC (AICTE) telegram group
Vectors power point presentation
Help explain the code with line comments public class CompletedLis.pdf
Help explain the code with line comments
public class CompletedList implements ListADT, Iterable
{
//Three instance variables
protected int count;
protected int modChange;
protected DoubleLinearNode head, tail;
//head and tail set to empty count set to zero
public CompletedList() {
head = tail = null;
count = 0;
}
//Override for head and tail, remove first number of list
@Override
public T removeFirst() throws NoSuchElementException
{
//if head is empty return error
if(isEmpty())
throw new NoSuchElementException("The collection is empty");
//Temp for each number set to head item
T temp = head.getItem();
//if first number equals last they are null
if(head == tail)
{
head = tail = null;
}
//else the ne
else if(head.getNext() == tail)
{
head.remove();
head = tail;
}
else
{
head = head.getNext();
head.getPrev().remove();
}
count--;
modChange++;
return temp;
}
@Override
public T removeLast() throws NoSuchElementException
{
if(isEmpty())
throw new NoSuchElementException("The collection is empty");
T temp = tail.getItem();
if(head == tail)
{
head = tail = null;
}
else if(head.getNext() == tail){
tail.remove();
tail = head;
}
else
{
tail = tail.getPrev();
tail.getNext().remove();
}
count--;
modChange++;
return temp;
}
@Override
public T remove( T element )
{
if(isEmpty())
throw new NoSuchElementException("The target is not in the collection");
if(tail.getItem().equals(element))
{
return removeLast();
}
for (DoubleLinearNode current = head; current != null; current = current.getNext())
{
if(current.getItem().equals(element))
{
if(current == head)
{
return removeFirst();
}
else
{
count--;
modChange++;
return current.remove();
}
}
}
throw new NoSuchElementException("The target is not in the collection");
}
@Override
public T first()
{
if (isEmpty())
throw new NoSuchElementException("The collection is empty");
return head.getItem();
}
@Override
public T last()
{
if (isEmpty())
throw new NoSuchElementException("The collection is empty");
return tail.getItem();
}
@Override
public boolean contains( T target )
{
if(isEmpty())
return false;
if(tail.getItem().equals(target))
{
return true;
}
for (DoubleLinearNode current = head; current != null; current = current.getNext())
{
if(current.getItem().equals(target))
{
return true;
}
}
return false;
}
@Override
public boolean isEmpty()
{
return count == 0;
}
@Override
public int size()
{
return count;
}
@Override
public Iterator iterator()
{
return new ListIterator(head);
}
@Override
public String toString()
{
StringBuilder sb = new StringBuilder();
for (DoubleLinearNode current = head; current != null; current = current.getNext())
{
sb.append(current.getItem()).append(' ');
}
return sb.toString();
}
private class ListIterator implements Iterator
{
private DoubleLinearNode current;
private int modNum;
public ListIterator( DoubleLinearNode node)
{
this.modNum = modChange;
this.current = node;
}
@Override
public boolean hasNext()
{
if(this.modNum != modChange)
throw new ConcurrentModificationException("The collection.
Please review my code (java)Someone helped me with it but i cannot.pdf
Please make it to clear 12-95. The basketball passed through the hoop even though it barely
cleared the hands of the player B who attempted to block it. Neglecting the size of the ball,
determine the magnitude vn of its initial velocity and the height h of the ball when it passes over
player B 10 ft 5 ft Prob. 12-95
Solution
Consider the motion along horizontal direction
Vox = initial velocity in horizontal direction = Va Cos30
X = horizontal distance = 25 + 3 = 28 ft
t = time taken
t = X / Vox = 28/(Va Cos30) eq-1
consider the motion in vertical direction
Y = vertical displacement = 10 - 7 = 3 ft
a = acceleration = - 32.2
Voy = initial velocity = Va Sin30
t = time taken
using the equation
Y = Voy t + (0.5) a t2
3 = (Va Sin30) (28/(Va Cos30)) + (0.5) (- 32.2) (28/(Va Cos30))2
Va = 35.8 m/s
t\' = time taken to reach B = 25 / (Va Cos30) = 25 / (35.8 Cos30) = 0.81 sec
h = 7 + Voy t\' + (0.5) a t\'2
h = 7 + (35.8 Sin30) (0.81) + (0.5) (- 32.2) (0.81)2
h = 10.94 ft.
Java: Nie popełniaj tych błędów!
Jako opiekun praktyk, stażów, mentor młodszych kolegów i koleżanek z zespołu, osoba odpowiedzialna za rekrutację techniczną, a także programista, który każdego dnia pracuje z oprogramowaniem dane mi było widzieć wiele błędów, złych zachowań i pomyłek w podejściu do tworzenia czystego kodu. Chciałbym się z Wami podzielić tymi najczęstszymi wpadkami w pracy z językiem Java. To nie będzie zwyczajna pogawędka! Zobaczycie kod źródłowy i ostry refaktoring. Zobaczycie, jak proste zmiany i lepsze zrozumienie samego języka mogą poprawić wydajność i czytelność Waszych aplikacji. Na podstawie całkiem prostych fragmentów kodu pokażę, na co zwrócić uwagę, żeby - to zabrzmi banalnie - być lepszym. Prezentacja dla wszystkich, którzy są na początku (i nie tylko) wspaniałej przygody z programowaniem (i zawrotnej kariery!).
I keep getting an error about m_pHead in printStoresInfo(); function.pdf
I keep getting an error about m_pHead in printStoresInfo(); function in the cpp file.
CustomerList.h
#pragma once;
#include
#include \"Store.h\"
class CustomerList
{
public:
Store *m_pHead;
CustomerList();
~CustomerList();
bool addStore(Store *s);
Store *removeStore(int ID);
Store *getStore(int ID);
bool updateStore(int ID, char *name, char *addr, char *city, char *st, char *zip);
void printStoresInfo();
};
CustomerList.cpp
#include
#include \"CustomerList.h\"
#include \"Store.h\"
using namespace std;
CustomerList::CustomerList()
{
// Default constructor
}
CustomerList::~CustomerList()
{
// Destructor
}
bool CustomerList:: addStore(Store *s)
{
//creating a new instance
s = new Store();
if(s==NULL)
return true;
}
Store *CustomerList::removeStore(int ID)
{
Store *temp, *back;
temp = m_pHead;
back = NULL;
while((temp != NULL)&&(ID != temp ->getStoreID()))
{
back=temp;
temp=temp->m_pNext;
}
if(temp==NULL)
return NULL;
else if(back==NULL)
{
m_pHead = m_pHead ->m_pNext;
return temp;
}
else
{
back -> m_pNext = temp-> m_pNext;
return temp;
}
return NULL;
}
Store *CustomerList::getStore(int ID)
{
Store *temp;
temp = m_pHead;
while((temp != NULL) && (ID != temp ->getStoreID()))
{
temp = temp->m_pNext;
}
if(temp == NULL)
return NULL;
else
{
Store *retStore = new Store;
*retStore = *temp;
retStore->m_pNext = NULL;
return retStore;
}
}
bool CustomerList::updateStore(int ID, char *name, char *addr, char *city, char *st, char *zip)
{
return false;
}
void CustomerList::printStoresInfo()
{
Store *temp;
cout << \"
=====================================================================
================ \" << endl;
if(m_pHead == NULL)
{
cout << \" The List is currently empty.\ \" ;
}
else
{
temp = m_pHead;
while(temp != NULL)
{
cout << temp->m_pNext << endl;
}
}
}
Store.h
#pragma once;
#include
#include
using namespace std;
class Store
{
private:
int m_iStoreID;
char m_sStoreName[64];
char m_sAddress[64];
char m_sCity[32];
char m_sState[32];
char m_sZip[11];
public:
Store *m_pNext;
Store(); // Default constructor
Store(int ID, // Constructor
char *name,
char *addr,
char *city,
char *st,
char *zip);
~Store(); // Destructor
int getStoreID(); // Get/Set store ID
void setStoreID(int ID);
char *getStoreName(); // Get/Set store name
void setStoreName(char *name);
char *getStoreAddress(); // Get/Set store address
void setStoreAddress(char *addr);
char *getStoreCity(); // Get/Set store city
void setStoreCity(char *city);
char *getStoreState(); // Get/Set store state
void setStoreState(char *state);
char *getStoreZip(); // Get/Set store zip code
void setStoreZip(char *zip);
void printStoreInfo(); // Print all info on this store
};
Store.cpp
#include \"Store.h\"
#include
using namespace std;
Store::Store()
{
m_pNext = NULL;
}
Store::Store(int ID, char *name, char *addr, char *city, char *st, char *zip)
{
m_iStoreID = ID;
strcpy(m_sStoreName, name);
strcpy(m_sAddress, addr);
strcpy(m_sCity, city);
strcpy(m_sState, st);
strcpy(m_sZip, zip);
m_pNext = NULL;
}
Store::~Store()
{.
Help please, I have attached LinkedList.cpp and LinkedList.hPlease.pdf
Help please, I have attached LinkedList.cpp and LinkedList.h
Please help with the implementation of the Stack.h and Stack.cpp as well
LinkedList.cpp
~~~~~~~~~~~~~~
#include \"LinkedList.h\"
LinkedList::LinkedList()
{
first = last = NULL;
}
LinkedList::~LinkedList()
{
while (first != NULL)
{
Node *temp;
temp = first;
first = first->next;
free(temp);
}
last = NULL;
}
void LinkedList::insertAtBack(int valueToInsert)
{
Node *temp = (Node *)malloc(sizeof(Node));
temp->val = valueToInsert;
temp->next = NULL;
if (last == NULL)
first = last = temp;
else
{
last->next = temp;
last = temp;
}
}
bool LinkedList::removeFromBack()
{
if (first == NULL)
return false;
else if (first == last)
{
free(first);
first = last = NULL;
}
else
{
Node *temp;
temp = first;
while (temp->next != last)
temp = temp->next;
last = temp;
temp = temp->next;
free(temp);
last->next = NULL;
}
return true;
}
void LinkedList::print()
{
Node *temp = first;
while (temp != last)
{
cout << temp->val << \" \";
temp = temp->next;
}
if (temp != NULL)
cout << temp->val;
}
bool LinkedList::isEmpty()
{
if (first == last)
return true;
return false;
}
int LinkedList::size()
{
int count = 0;
Node *temp = first;
if (temp == NULL)
return count;
while (temp != last)
{
count++;
temp = temp->next;
}
return count + 1;
}
void LinkedList::clear()
{
while (first != NULL)
{
Node *temp;
temp = first;
first = first->next;
free(temp);
}
last = NULL;
}
/*Exercise2 */
void LinkedList::insertAtFront(int valueToInsert)
{
Node *temp = (Node *)malloc(sizeof(Node));
temp->val = valueToInsert;
if (last == NULL)
first = last = temp;
else
{
temp->next = first;
first = temp;
}
}
bool LinkedList::removeFromFront()
{
if (first == NULL)
return false;
Node *temp = first;
first = first->next;
free(temp);
if (first == NULL)
last = NULL;
return true;
}
LinkedList.h
~~~~~~~~~~~
#include \"LinkedList.h\"
LinkedList::LinkedList()
{
first = last = NULL;
}
LinkedList::~LinkedList()
{
while (first != NULL)
{
Node *temp;
temp = first;
first = first->next;
free(temp);
}
last = NULL;
}
void LinkedList::insertAtBack(int valueToInsert)
{
Node *temp = (Node *)malloc(sizeof(Node));
temp->val = valueToInsert;
temp->next = NULL;
if (last == NULL)
first = last = temp;
else
{
last->next = temp;
last = temp;
}
}
bool LinkedList::removeFromBack()
{
if (first == NULL)
return false;
else if (first == last)
{
free(first);
first = last = NULL;
}
else
{
Node *temp;
temp = first;
while (temp->next != last)
temp = temp->next;
last = temp;
temp = temp->next;
free(temp);
last->next = NULL;
}
return true;
}
void LinkedList::print()
{
Node *temp = first;
while (temp != last)
{
cout << temp->val << \" \";
temp = temp->next;
}
if (temp != NULL)
cout << temp->val;
}
bool LinkedList::isEmpty()
{
if (first == last)
return true;
return false;
}
int LinkedList::size()
{
int count = 0;
Node *temp = first;
if (temp == NULL)
return count;
while (temp != last)
{
count++;
temp = temp->next;
}
return count + 1;
}
void LinkedList::clear()
{
while (first != NULL)
{
Node *.
For the code below complete the preOrder() method so that it perform.pdf
For the code below complete the preOrder() method so that it performs a preOrder traversal of
the tree. For each node it traverses, it should call sb.append() to add a \"[\" the results of
traversing the subtree rooted at that node, and then a \"]\". You should add a space before the
results of the left and right child traversals, but only if the node exists.
code:
Solution
In preorder Nodes visited are in the order of
code:
package edu.buffalo.cse116;
import java.util.AbstractSet;
import java.util.Iterator;
public class BinarySearchTree> extends AbstractSet {
protected Entry root;
protected int size;
/**
* Initializes this BinarySearchTree object to be empty, to contain only
* elements of type E, to be ordered by the Comparable interface, and to
* contain no duplicate elements.
*/
public BinarySearchTree() {
root = null;
size = 0;
}
/**
* Initializes this BinarySearchTree object to contain a shallow copy of a
* specified BinarySearchTree object. The worstTime(n) is O(n), where n is the
* number of elements in the specified BinarySearchTree object.
*
* @param otherTree - the specified BinarySearchTree object that this
* BinarySearchTree object will be assigned a shallow copy of.
*/
public BinarySearchTree(BinarySearchTree otherTree) {
root = copy(otherTree.root, null);
size = otherTree.size;
}
/* Method to complete is here! */
public void preOrder(Entry ent, StringBuilder sb) {
preorder(root)
protected Entry copy(Entry p, Entry parent) {
if (p != null) {
Entry q = new Entry(p.element, parent);
q.left = copy(p.left, q);
q.right = copy(p.right, q);
return q;
}
return null;
} // method copy
@SuppressWarnings(\"unchecked\")
@Override
public boolean equals(Object obj) {
if (!(obj instanceof BinarySearchTree)) {
return false;
}
return equals(root, ((BinarySearchTree) obj).root);
}
public boolean equals(Entry p, Entry q) {
if ((p == null) || (q == null)) {
return p == q;
}
if (!p.element.equals(q.element)) {
return false;
}
if (equals(p.left, q.left) && equals(p.right, q.right)) {
return true;
}
return false;
}
/**
* Returns the size of this BinarySearchTree object.
*
* @return the size of this BinarySearchTree object.
*/
@Override
public int size() {
return size;
}
/**
* Iterator method will be implemented for a future
*
* @return an iterator positioned at the smallest element in this
* BinarySearchTree object.
*/
@Override
public Iterator iterator() {
throw new UnsupportedOperationException(\"Not implemented yet!\");
}
/**
* Determines if there is at least one element in this BinarySearchTree object
* that equals a specified element. The worstTime(n) is O(n) and
* averageTime(n) is O(log n).
*
* @param obj - the element sought in this BinarySearchTree object.
* @return true - if there is an element in this BinarySearchTree object that
* equals obj; otherwise, return false.
* @throws ClassCastException - if obj cannot be compared to the elements in
* this BinarySearchTree object.
* @throws NullPointerException - if obj is null.
*/
@Override
public .
Given an array nums of size n- return the majority element- The majori.pdf
Given an array nums of size n, return the majority element.
The majority element is the element that appears more than round(n/2) times. You may assume
that the majority element always exists in the array.
Use the code template main_find_major_element
main_find_major_element:
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
// implement the function here.
int findMajorityElement(vector< int > &v)
{
return 0;
}
int main()
{
int n;
cout << "Enter the size of the vector: ";
cin >> n;
vector< int > input;
int element;
cout << "Enter the elements of the vector: ";
for ( int i = 0; i < n; i++)
{ cin >> element;
input.push_back(element);
}
int result = findMajorityElement(input);
cout << "The Majority Element is: " << result << endl;
return 0;
}
Examples:
Input:
Output:
3
Input:
Output:
2.
Writing native bindings to node.js in C++
Talk given at JSFoo Pune 2012
http://jsfoo.in/pune2012/schedule
1. Seminal vesicle2. Prostate gland3. bulbourethral gland4. Ep.pdf
1. Seminal vesicle
2. Prostate gland
3. bulbourethral gland
4. Epididymis
5. Testis
6. Scrotal sac
7. Urethra
8. Corpora Cavernosa
9. Ductus deferens (vas deferens)
10. Urinary bladder
Solution
1. Seminal vesicle
2. Prostate gland
3. bulbourethral gland
4. Epididymis
5. Testis
6. Scrotal sac
7. Urethra
8. Corpora Cavernosa
9. Ductus deferens (vas deferens)
10. Urinary bladder.
More Related Content
Similar to #include stdafx.h#include iostreamusing namespace std;cl.pdf
template-typename T- class Array { public- ---------------------------.pdf
template<typename T>
class Array
{
public:
//*****************************************************
// DO NOT MODIFY THIS SECTION!
// Some standard Container type aliases
using value_type = T;
// Iterators are just pointers to objects of type T
using iterator = value_type*;
using const_iterator = const value_type*;
using reference = value_type&;
using const_reference = const value_type&;
using size_type = size_t;
using difference_type = ptrdiff_t;
//*****************************************************
// Default ctor.
// Initialize an empty Array.
// This method is complete, and does NOT need modification.
// Remember to use a _member initialization list_ for each ctor,
// like I have below for the default ctor.
Array ()
: m_size (0),
m_capacity (0),
m_array (nullptr)
{
}
// Size ctor.
// Initialize an Array of size "pSize", with each element
// set to "value".
explicit Array (size_t pSize, const T& value = T ())
: m_size (pSize),
m_capacity (pSize),
m_array (new T[m_capacity])
{
fill (begin (), end (), value);
}
// Range ctor.
// Initialize an Array from the range [first, last).
// "first" and "last" must be Array iterators or pointers
// into a primitive array.
Array (const_iterator first, const_iterator last)
:m_size(distance(first,last)),m_capacity(m_size),m_array(new T[m_capacity])
{
copy(first,last,m_array);
}
// Copy ctor.
// Initialize this object from "a".
Array (const Array& a)
:m_size(a.m_size),m_capacity(a.m_capacity),m_array(new T[m_capacity])
{
copy(a.begin(),a.end(),m_array);
}
// Destructor.
// Release allocated memory.
~Array ()
{
delete[] m_array;
}
// Assignment operator.
// Assign "a" to this object.
// Be careful to check for self-assignment.
Array&
operator= (const Array& a)
{
if (this != &a)
{
m_size = a.m_size;
m_capacity = a.m_capacity;
m_array = new T[m_capacity];
copy(a.begin(),a.end(),m_array);
}
return *this;
}
// Return the size.
size_t
size () const
{
return m_size;
}
// Return true if this Array is empty, false o/w.
bool
empty () const
{
return m_size == 0;
}
// Return the capacity.
size_t
capacity () const
{
return m_capacity;
}
// Return the element at position "index".
T& operator[] (size_t index)
{
return m_array[index];
}
const T& operator[] (size_t index) const
{
return m_array[index];
}
// Insert an element at the back.
// If the capacity is insufficient, DOUBLE it.
// If the capacity is 0, increase it to 1.
void
push_back (const T& item)
{
if (m_size == 0)
{
m_capacity = 1;
m_array = new T[m_capacity];
}
else if (m_size == m_capacity)
{
m_capacity *= 2;
T* temp = new T[2 * m_capacity];
copy(begin(),end(),temp);
delete[] m_array;
m_array = temp;
}
m_array[m_size] = item;
++m_size;
}
// Erase the element at the back.
void
pop_back ()
{
if (m_size > 0)
{
--m_size;
}
}
// Reserve capacity for "space" elements.
// "space" must be greater than capacity.
// If not, leave the capacity unchanged.
// "size" must remain unchanged.
void
reserve (size_t space)
{
if (space > capacity ())
{
T* array = new T[space];
co.
I have created a class hasdhedDictionary that implements the Diction.pdf
I have created a class hasdhedDictionary that implements the DictionaryInterface.java that
should count the collisions when reading a txt file
Write an application WordFrequency that will be using the Dictionary ADT to study the
number of collisions that occur with different hash table length, use 1361, 1637 and 2011 it
should not return zero but a value. for the txt file plz us the US constitution, if my collision
counter is wrong (public V add(K key, V value) please rework it)
do not add new adt or implementations like nodes, linked list or array or methods like setNext or
getNext
HASHEDDICTIONARY
import java.util.Iterator;
import java.util.NoSuchElementException;
public class HashedDictionary implements DictionaryInterface
{
// The dictionary:
private int numberOfEntries;
private static final int DEFAULT_CAPACITY = 5; // Must be prime
private static final int MAX_CAPACITY = 10000;
// The hash table:
private Entry[] hashTable;
private int tableSize; // Must be prime
private static final int MAX_SIZE = 2 * MAX_CAPACITY;
private boolean integrityOK = false;
private static final double MAX_LOAD_FACTOR = 0.5; // Fraction of
// hash table that can be filled
private int collisionCount;
protected final Entry AVAILABLE = new Entry<>(null, null);
// Counter to keep track of collisions
public HashedDictionary()
{
this(DEFAULT_CAPACITY); // Call next constructor
} // end default constructor
public HashedDictionary(int initialCapacity)
{
initialCapacity = checkCapacity(initialCapacity);
numberOfEntries = 0; // Dictionary is empty
// Set up hash table:
// Initial size of hash table is same as initialCapacity if it is prime;
// otherwise increase it until it is prime size
tableSize = getNextPrime(initialCapacity);
checkSize(tableSize); // Check that size is not too large
// The cast is safe because the new array contains null entries
@SuppressWarnings("unchecked")
Entry[] temp = (Entry[])new Entry[tableSize];
hashTable = temp;
integrityOK = true;
collisionCount = 0;
} // end constructor
/* Implementations of methods in DictionaryInterface are here. . . .*/
public V add(K key, V value) {
int index = getHashIndex(key);
V oldValue = null;
if (key == null || value == null) {
throw new NoSuchElementException("Cannot add null key or value.");
}
// If the index is empty or has an AVAILABLE entry, add the new entry.
if (hashTable[index] == null || hashTable[index] == AVAILABLE) {
hashTable[index] = new Entry<>(key, value);
numberOfEntries++;
}
// If the index has the same key as the new entry, update the value.
else if (hashTable[index].getKey().equals(key)) {
oldValue = hashTable[index].getValue();
hashTable[index].setValue(value);
}
// Otherwise, there is a collision.
else {
int startIndex = index;
index = (index + 1) % hashTable.length;
// Keep probing until an empty or AVAILABLE index is found.
while (index != startIndex && hashTable[index] != null && hashTable[index] != AVAILABLE)
{
index = (index + 1) % hashTable.length;
}
// If an empty index is found, ad.
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.
Need help with writing the test cases for the following code in java-.docx
Need help with this question ASAP! Please and thanks
2 points The is typically the most powerful stakeholder for the project but is often not the most powerful person in the company. 2 points The two axes on grid we use to measure the impact a stakeholder could have on our project and how we manage the relationship with them are and
.
Given main() in the Inventory class, define an insertAtFront() metho.pdf
Given main() in the Inventory class, define an insertAtFront() method in the InventoryNode class
that inserts items at the front of a linked list (after the dummy head node).
Ex. If the input is:
the output is:
CODE:
public class InventoryNode {
private String item;
private int numberOfItems;
private InventoryNode nextNodeRef; // Reference to the next node
public InventoryNode() {
item = "";
numberOfItems = 0;
nextNodeRef = null;
}
// Constructor
public InventoryNode(String itemInit, int numberOfItemsInit) {
this.item = itemInit;
this.numberOfItems = numberOfItemsInit;
this.nextNodeRef = null;
}
// Constructor
public InventoryNode(String itemInit, int numberOfItemsInit, InventoryNode nextLoc) {
this.item = itemInit;
this.numberOfItems = numberOfItemsInit;
this.nextNodeRef = nextLoc;
}
// TODO: Define an insertAtFront() method that inserts a node at the
// front of the linked list (after the dummy head node)
// Get location pointed by nextNodeRef
public InventoryNode getNext() {
return this.nextNodeRef;
}
// Print node data
public void printNodeData() {
System.out.println(this.numberOfItems + " " + this.item);
}
}.
Infinum Android Talks #20 - DiffUtil
We're taking a closer look into a new utility class from Android Support Library. It enables you to calculate the difference between two lists and output a list of update operations swiftly and with style. Presented by Željko Plesac from Infinum.
Create a Dynamic Array container with this user interface Ge.pdf
Create a \"Dynamic Array\" container with this user interface: // Gets the current number of
entries in container int getCurrentSize() // Returns the current capacity of the container int
capacity() // Checks whether the container is empty. boolean isEmpty() // Adds a new entry to
the container boolean insert(newEntry) // Removes an entry from the container and moves all
entries above anEntry down one boolean remove(anEntry) // Get index value int getValue(index)
// Removes all entries from the container void clear() // Resize a container by doubling current
capacity int resize() * Implement dynamic resizing using this algorithm: 1. Starting with a
dynamic size of 10, if the number of elements exceed this number: a. Reallocate the container
size to double the current size b. Move the contents of the current container to the newly sized
container c. Delete the previously sized container. Resize C++ Data* ptemp = new
Data[capacity*2 ]; for (int i=0; i
Solution
container.cpp ---
#include
#include
using namespace std;
template
class DynamicArray
{
/*
Container class DynamicArray
*/
private:
ArrayType *arr;
int entry,size;
public:
DynamicArray();
~DynamicArray();
int getCurrentSize() { return entry; };/*this function returns total number of entries in the
container*/
int capacity() { return size; };/*this function returns capacity of the container*/
bool isEmpty();
bool insert(ArrayType);
bool remove(ArrayType);
int getValue(ArrayType);
void clear() { entry = 0; };/*this function clears the whole container*/
int resize();
};
template
int DynamicArray::resize()
{
/*this function resizes the container by doubling its previous size*/
ArrayType *temp = NULL;
try
{
temp = new ArrayType [2 * size];
}catch(bad_alloc xa){
cout<<\"\ Array allocation failed\ \";
exit(1);
}
size *= 2;
for(int i = 0 , j = 0 ; i < entry ; i++)
{
temp[i] = arr[i];
j++;
}
delete [] arr;
arr = NULL;
arr = temp , temp = NULL;
return size;
}
template
int DynamicArray::getValue(ArrayType index)
{
/*this function return index of an element specified as index in the container if it presents
in the container, else it returns -1*/
int loc = -1;
for(int i = 0 ; i < entry ; i++)
{
if(arr[i] == index)
{
loc = i;
break;
}
}
return loc;
}
template
bool DynamicArray::remove(ArrayType anEntry)
{
/*this function removes an element specified as anEntry from the container and returns true
and
decrements total number of entries by one else returns false*/
bool flag = false;
int index = -1;
for(int i = 0 ; i < entry ; i++)
{
if(arr[i] == anEntry)
{
index = i , flag = true;
break;
}
}
for(int i = index ; i < (entry - 1) && flag == true ; i++)
{
arr[i] = arr[i+1];
}
if(flag == true)
entry -= 1;
return flag;
}
template
bool DynamicArray::insert(ArrayType newEntry)
{
/*this function inserts an element specified as newEntry in the container,
if it successfully inserts an element then it returns true and increments total
number of entries by one, else it returns false*/
entry += 1;
if(entry <= size)
{
ar.
How do I fix it in LinkedList.javaLabProgram.javaLinkedList.jav.pdf
How do I fix it in LinkedList.java?
LabProgram.java
LinkedList.java:
/**
* Defines a doubly-linked list class
* @author
* @author
*/
import java.util.NoSuchElementException;
public class LinkedList {
private class Node {
private T data;
private Node next;
private Node prev;
public Node(T data) {
this.data = data;
this.next = null;
this.prev = null;
}
}
private int length;
private Node first;
private Node last;
private Node iterator;
/**** CONSTRUCTORS ****/
/**
* Instantiates a new LinkedList with default values
* @postcondition
*/
public LinkedList() {
first = null;
last = null;
iterator = null;
length = 0;
}
/**
* Converts the given array into a LinkedList
* @param array the array of values to insert into this LinkedList
* @postcondition
*/
public LinkedList(T[] array) {
}
/**
* Instantiates a new LinkedList by copying another List
* @param original the LinkedList to copy
* @postcondition a new List object, which is an identical,
* but separate, copy of the LinkedList original
*/
public LinkedList(LinkedList original) {
}
/**** ACCESSORS ****/
public T getFirst() throws NoSuchElementException {
if (isEmpty()){
throw new NoSuchElementException("The list is empty");
}
return first.data;
}
public T getLast() throws NoSuchElementException {
if (isEmpty()){
throw new NoSuchElementException("The list is empty");
}
return last.data;
}
/**
* Returns the data stored in the iterator node
* @precondition
* @return the data stored in the iterator node
* @throw NullPointerException
*/
public T getIterator() throws NullPointerException {
if (iterator != null){
return iterator.data;
}else{
throw new NullPointerException("Iterator is off the end opf the list.");
}
}
/**
* Returns the current length of the LinkedList
* @return the length of the LinkedList from 0 to n
*/
public int getLength() {
return length;
}
/**
* Returns whether the LinkedList is currently empty
* @return whether the LinkedList is empty
*/
public boolean isEmpty() {
return length == 0;
}
/**
* Returns whether the iterator is offEnd, i.e. null
* @return whether the iterator is null
*/
public boolean offEnd() {
return iterator == null;
}
/**** MUTATORS ****/
public void addFirst(T data) {
Node newNode = new Node(data);
if(isEmpty()){
first = newNode;
last = newNode;
}
else{
newNode.next = first;
first.prev = newNode;
first = newNode;
}
length++;
}
public void addLast(T data) {
Node newNode = new Node(data);
if(isEmpty()){
first = newNode;
last = newNode;
}
else{
last.next = newNode;
newNode.prev = last;
last = newNode;
}
length++;
}
/**
* Inserts a new element after the iterator
* @param data the data to insert
* @precondition
* @throws NullPointerException
*/
public void addIterator(T data) throws NullPointerException{
if(iterator != null){
Node newNode = new Node(data);
newNode.next = iterator.next;
iterator.next = newNode;
if (iterator == first){
first = newNode;
}
}else{
throw new NullPointerException("Iterator is off the end opf the list.");
}
}
/
public void removeFirst() throws NoS.
#include -algorithm- #include -cstdlib- #include -iostream- #include -.pdf
#include <algorithm>
#include <cstdlib>
#include <iostream>
#include <iterator>
/************************************************************/
// Local includes
/************************************************************/
// Using declarations
// YOU DO NOT NECESSARILY NEED TO USE ALL OF THESE!
using std::copy;
using std::copy_backward;
using std::distance;
using std::fill;
using std::ostream;
using std::ptrdiff_t;
/************************************************************/
template<typename T>
class Array
{
public:
//*****************************************************
// DO NOT MODIFY THIS SECTION!
// Some standard Container type aliases
using value_type = T;
// Iterators are just pointers to objects of type T
using iterator = value_type*;
using const_iterator = const value_type*;
using reference = value_type&;
using const_reference = const value_type&;
using size_type = size_t;
using difference_type = ptrdiff_t;
//*****************************************************
// Default ctor.
// Initialize an empty Array.
// This method is complete, and does NOT need modification.
// Remember to use a _member initialization list_ for each ctor,
// like I have below for the default ctor.
Array ()
: m_size (0),
m_capacity (0),
m_array (nullptr)
{
}
// Size ctor.
// Initialize an Array of size "pSize", with each element
// set to "value".
explicit Array (size_t pSize, const T& value = T ())
: m_size (pSize),
m_capacity (pSize),
m_array (new T[m_capacity])
{
fill (begin (), end (), value);
}
// TODO!
// Range ctor.
// Initialize an Array from the range [first, last).
// "first" and "last" must be Array iterators or pointers
// into a primitive array.
Array (const_iterator first, const_iterator last)
:m_size(distance(first,last)),m_capacity(m_size),m_array(new T[m_capacity])
{
copy(first,last,m_array);
}
// TODO!
// Copy ctor.
// Initialize this object from "a".
Array (const Array& a)
:m_size(a.m_size),m_capacity(a.m_capacity),m_array(new T[m_capacity])
{
copy(a.begin(),a.end(),m_array);
}
// TODO!
// Destructor.
// Release allocated memory.
~Array ()
{
delete[] m_array;
}
// TODO!
// Assignment operator.
// Assign "a" to this object.
// Be careful to check for self-assignment.
Array&
operator= (const Array& a)
{
if (this != &a)
{
delete[] m_array;
m_size = a.m_size;
m_capacity = a.m_capacity;
m_array = new T[m_capacity];
copy(a.begin(),a.end(),m_array);
}
return *this;
}
// Return the size.
size_t
size () const
{
return m_size;
}
// TODO!
// Return true if this Array is empty, false o/w.
bool
empty () const
{
return m_size == 0;
}
// TODO!
// Return the capacity.
size_t
capacity () const
{
return m_capacity;
}
// TODO!
// Return the element at position "index".
T& operator[] (size_t index)
{
return m_array[index];
}
// TODO!
const T& operator[] (size_t index) const
{
return m_array[index];
}
// TODO!
// Insert an element at the back.
// If the capacity is insufficient, DOUBLE it.
// If the capacity is 0, increase it to 1.
void
push_back (const T&.
Character.cpphpp givenCharacter.cpp#include Character.hp.pdf
Character.cpp/hpp given:
Character.cpp:
#include "Character.hpp"
/**
Default constructor.
Default-initializes all private members.
Default character name: "NAMELESS".
Booleans are default-initialized to False.
Default enum value: NONE.
Default Vitality, Max Armor, and Level: 0.
*/
Character::Character():name_{"NAMELESS"},race_{NONE},vitality_{0},armor_{0},level_{0}
,enemy_{false}
{
}
/**
Parameterized constructor.
@param : The name of the character (a string in UPPERCASE)
@param : The race of the character (a string)
@param : The character's vitality (a non-negative integer) , with default value 0
@param : The character's max armor level (a non-negative integer), with default value 0
@param : The character's level (a non-negative integer), with default value 0
@param : A flag indicating whether the character is an enemy, with default value false
@post : The private members are set to the values of the corresponding parameters.
Hint: Notice the default arguments in the parameterized constructor.
If the given parameters are invalid, the default values are used instead.
*/
Character::Character(const std::string& name, const std::string& race, int vitality, int armor, int
level, bool enemy) : Character()
{
setName(name); // checks valid name
setRace(race); // checks valid race
(vitality >= 0) ? vitality_ = vitality: vitality_ = 0;
(armor >= 0) ? armor_ = armor: armor_ = 0;
(level >= 0) ? level_ = level: level_ = 0;
enemy_ = enemy;
}
/**
@param : the name of the Character
@post : sets the Character's title to the value of the parameter, in UPPERCASE. Only
alphabetical characters are allowed. For example, attempting to create a character named
"TW3EDLEDUM2" should create a character named "TWEDLEDUM".
: If the given parameter does not have any valid alphabetical characters, the character's name
should be set to "NAMELESS".
*/
void Character::setName(const std::string& name)
{
std::string nameUpper = "";
for(int i = 0; i= 0 : Characters cannot have negative health
@post : sets the vitality private member to the value of the parameter
*/
void Character::setVitality(const int& vitality)
{
if (vitality >= 0)
{
vitality_ = vitality;
}
}
/**
@return : the value stored in vitality_
*/
int Character::getVitality() const
{
return vitality_;
}
/**
@param : an integer armor level
@pre : armor >= 0 : Characters cannot have negative armor
@post : sets the armor private member to the value of the parameter
*/
void Character::setArmor(const int& armor)
{
if (armor >= 0)
{
armor_ = armor;
}
}
/**
@return : the value stored in armor_
*/
int Character::getArmor() const
{
return armor_;
}
/**
@param : an integer level
@pre : level >= 0 : Characters cannot have a negative
@post : sets the level private member to the value of the parameter
*/
void Character::setLevel(const int& level)
{
if (level >= 0)
{
level_ = level;
}
}
/**
@return : the value stored in level_
*/
int Character::getLevel() const
{
return level_;
}
/**
@post : sets the enemy flag to true
*/
void Char.
vectors.(join ALL INDIA POLYTECHNIC (AICTE)).pptx
join ALL INDIA POLYTECHNIC (AICTE) telegram group
Vectors power point presentation
Help explain the code with line comments public class CompletedLis.pdf
Help explain the code with line comments
public class CompletedList implements ListADT, Iterable
{
//Three instance variables
protected int count;
protected int modChange;
protected DoubleLinearNode head, tail;
//head and tail set to empty count set to zero
public CompletedList() {
head = tail = null;
count = 0;
}
//Override for head and tail, remove first number of list
@Override
public T removeFirst() throws NoSuchElementException
{
//if head is empty return error
if(isEmpty())
throw new NoSuchElementException("The collection is empty");
//Temp for each number set to head item
T temp = head.getItem();
//if first number equals last they are null
if(head == tail)
{
head = tail = null;
}
//else the ne
else if(head.getNext() == tail)
{
head.remove();
head = tail;
}
else
{
head = head.getNext();
head.getPrev().remove();
}
count--;
modChange++;
return temp;
}
@Override
public T removeLast() throws NoSuchElementException
{
if(isEmpty())
throw new NoSuchElementException("The collection is empty");
T temp = tail.getItem();
if(head == tail)
{
head = tail = null;
}
else if(head.getNext() == tail){
tail.remove();
tail = head;
}
else
{
tail = tail.getPrev();
tail.getNext().remove();
}
count--;
modChange++;
return temp;
}
@Override
public T remove( T element )
{
if(isEmpty())
throw new NoSuchElementException("The target is not in the collection");
if(tail.getItem().equals(element))
{
return removeLast();
}
for (DoubleLinearNode current = head; current != null; current = current.getNext())
{
if(current.getItem().equals(element))
{
if(current == head)
{
return removeFirst();
}
else
{
count--;
modChange++;
return current.remove();
}
}
}
throw new NoSuchElementException("The target is not in the collection");
}
@Override
public T first()
{
if (isEmpty())
throw new NoSuchElementException("The collection is empty");
return head.getItem();
}
@Override
public T last()
{
if (isEmpty())
throw new NoSuchElementException("The collection is empty");
return tail.getItem();
}
@Override
public boolean contains( T target )
{
if(isEmpty())
return false;
if(tail.getItem().equals(target))
{
return true;
}
for (DoubleLinearNode current = head; current != null; current = current.getNext())
{
if(current.getItem().equals(target))
{
return true;
}
}
return false;
}
@Override
public boolean isEmpty()
{
return count == 0;
}
@Override
public int size()
{
return count;
}
@Override
public Iterator iterator()
{
return new ListIterator(head);
}
@Override
public String toString()
{
StringBuilder sb = new StringBuilder();
for (DoubleLinearNode current = head; current != null; current = current.getNext())
{
sb.append(current.getItem()).append(' ');
}
return sb.toString();
}
private class ListIterator implements Iterator
{
private DoubleLinearNode current;
private int modNum;
public ListIterator( DoubleLinearNode node)
{
this.modNum = modChange;
this.current = node;
}
@Override
public boolean hasNext()
{
if(this.modNum != modChange)
throw new ConcurrentModificationException("The collection.
Please review my code (java)Someone helped me with it but i cannot.pdf
Please make it to clear 12-95. The basketball passed through the hoop even though it barely
cleared the hands of the player B who attempted to block it. Neglecting the size of the ball,
determine the magnitude vn of its initial velocity and the height h of the ball when it passes over
player B 10 ft 5 ft Prob. 12-95
Solution
Consider the motion along horizontal direction
Vox = initial velocity in horizontal direction = Va Cos30
X = horizontal distance = 25 + 3 = 28 ft
t = time taken
t = X / Vox = 28/(Va Cos30) eq-1
consider the motion in vertical direction
Y = vertical displacement = 10 - 7 = 3 ft
a = acceleration = - 32.2
Voy = initial velocity = Va Sin30
t = time taken
using the equation
Y = Voy t + (0.5) a t2
3 = (Va Sin30) (28/(Va Cos30)) + (0.5) (- 32.2) (28/(Va Cos30))2
Va = 35.8 m/s
t\' = time taken to reach B = 25 / (Va Cos30) = 25 / (35.8 Cos30) = 0.81 sec
h = 7 + Voy t\' + (0.5) a t\'2
h = 7 + (35.8 Sin30) (0.81) + (0.5) (- 32.2) (0.81)2
h = 10.94 ft.
Java: Nie popełniaj tych błędów!
Jako opiekun praktyk, stażów, mentor młodszych kolegów i koleżanek z zespołu, osoba odpowiedzialna za rekrutację techniczną, a także programista, który każdego dnia pracuje z oprogramowaniem dane mi było widzieć wiele błędów, złych zachowań i pomyłek w podejściu do tworzenia czystego kodu. Chciałbym się z Wami podzielić tymi najczęstszymi wpadkami w pracy z językiem Java. To nie będzie zwyczajna pogawędka! Zobaczycie kod źródłowy i ostry refaktoring. Zobaczycie, jak proste zmiany i lepsze zrozumienie samego języka mogą poprawić wydajność i czytelność Waszych aplikacji. Na podstawie całkiem prostych fragmentów kodu pokażę, na co zwrócić uwagę, żeby - to zabrzmi banalnie - być lepszym. Prezentacja dla wszystkich, którzy są na początku (i nie tylko) wspaniałej przygody z programowaniem (i zawrotnej kariery!).
I keep getting an error about m_pHead in printStoresInfo(); function.pdf
I keep getting an error about m_pHead in printStoresInfo(); function in the cpp file.
CustomerList.h
#pragma once;
#include
#include \"Store.h\"
class CustomerList
{
public:
Store *m_pHead;
CustomerList();
~CustomerList();
bool addStore(Store *s);
Store *removeStore(int ID);
Store *getStore(int ID);
bool updateStore(int ID, char *name, char *addr, char *city, char *st, char *zip);
void printStoresInfo();
};
CustomerList.cpp
#include
#include \"CustomerList.h\"
#include \"Store.h\"
using namespace std;
CustomerList::CustomerList()
{
// Default constructor
}
CustomerList::~CustomerList()
{
// Destructor
}
bool CustomerList:: addStore(Store *s)
{
//creating a new instance
s = new Store();
if(s==NULL)
return true;
}
Store *CustomerList::removeStore(int ID)
{
Store *temp, *back;
temp = m_pHead;
back = NULL;
while((temp != NULL)&&(ID != temp ->getStoreID()))
{
back=temp;
temp=temp->m_pNext;
}
if(temp==NULL)
return NULL;
else if(back==NULL)
{
m_pHead = m_pHead ->m_pNext;
return temp;
}
else
{
back -> m_pNext = temp-> m_pNext;
return temp;
}
return NULL;
}
Store *CustomerList::getStore(int ID)
{
Store *temp;
temp = m_pHead;
while((temp != NULL) && (ID != temp ->getStoreID()))
{
temp = temp->m_pNext;
}
if(temp == NULL)
return NULL;
else
{
Store *retStore = new Store;
*retStore = *temp;
retStore->m_pNext = NULL;
return retStore;
}
}
bool CustomerList::updateStore(int ID, char *name, char *addr, char *city, char *st, char *zip)
{
return false;
}
void CustomerList::printStoresInfo()
{
Store *temp;
cout << \"
=====================================================================
================ \" << endl;
if(m_pHead == NULL)
{
cout << \" The List is currently empty.\ \" ;
}
else
{
temp = m_pHead;
while(temp != NULL)
{
cout << temp->m_pNext << endl;
}
}
}
Store.h
#pragma once;
#include
#include
using namespace std;
class Store
{
private:
int m_iStoreID;
char m_sStoreName[64];
char m_sAddress[64];
char m_sCity[32];
char m_sState[32];
char m_sZip[11];
public:
Store *m_pNext;
Store(); // Default constructor
Store(int ID, // Constructor
char *name,
char *addr,
char *city,
char *st,
char *zip);
~Store(); // Destructor
int getStoreID(); // Get/Set store ID
void setStoreID(int ID);
char *getStoreName(); // Get/Set store name
void setStoreName(char *name);
char *getStoreAddress(); // Get/Set store address
void setStoreAddress(char *addr);
char *getStoreCity(); // Get/Set store city
void setStoreCity(char *city);
char *getStoreState(); // Get/Set store state
void setStoreState(char *state);
char *getStoreZip(); // Get/Set store zip code
void setStoreZip(char *zip);
void printStoreInfo(); // Print all info on this store
};
Store.cpp
#include \"Store.h\"
#include
using namespace std;
Store::Store()
{
m_pNext = NULL;
}
Store::Store(int ID, char *name, char *addr, char *city, char *st, char *zip)
{
m_iStoreID = ID;
strcpy(m_sStoreName, name);
strcpy(m_sAddress, addr);
strcpy(m_sCity, city);
strcpy(m_sState, st);
strcpy(m_sZip, zip);
m_pNext = NULL;
}
Store::~Store()
{.
Help please, I have attached LinkedList.cpp and LinkedList.hPlease.pdf
Help please, I have attached LinkedList.cpp and LinkedList.h
Please help with the implementation of the Stack.h and Stack.cpp as well
LinkedList.cpp
~~~~~~~~~~~~~~
#include \"LinkedList.h\"
LinkedList::LinkedList()
{
first = last = NULL;
}
LinkedList::~LinkedList()
{
while (first != NULL)
{
Node *temp;
temp = first;
first = first->next;
free(temp);
}
last = NULL;
}
void LinkedList::insertAtBack(int valueToInsert)
{
Node *temp = (Node *)malloc(sizeof(Node));
temp->val = valueToInsert;
temp->next = NULL;
if (last == NULL)
first = last = temp;
else
{
last->next = temp;
last = temp;
}
}
bool LinkedList::removeFromBack()
{
if (first == NULL)
return false;
else if (first == last)
{
free(first);
first = last = NULL;
}
else
{
Node *temp;
temp = first;
while (temp->next != last)
temp = temp->next;
last = temp;
temp = temp->next;
free(temp);
last->next = NULL;
}
return true;
}
void LinkedList::print()
{
Node *temp = first;
while (temp != last)
{
cout << temp->val << \" \";
temp = temp->next;
}
if (temp != NULL)
cout << temp->val;
}
bool LinkedList::isEmpty()
{
if (first == last)
return true;
return false;
}
int LinkedList::size()
{
int count = 0;
Node *temp = first;
if (temp == NULL)
return count;
while (temp != last)
{
count++;
temp = temp->next;
}
return count + 1;
}
void LinkedList::clear()
{
while (first != NULL)
{
Node *temp;
temp = first;
first = first->next;
free(temp);
}
last = NULL;
}
/*Exercise2 */
void LinkedList::insertAtFront(int valueToInsert)
{
Node *temp = (Node *)malloc(sizeof(Node));
temp->val = valueToInsert;
if (last == NULL)
first = last = temp;
else
{
temp->next = first;
first = temp;
}
}
bool LinkedList::removeFromFront()
{
if (first == NULL)
return false;
Node *temp = first;
first = first->next;
free(temp);
if (first == NULL)
last = NULL;
return true;
}
LinkedList.h
~~~~~~~~~~~
#include \"LinkedList.h\"
LinkedList::LinkedList()
{
first = last = NULL;
}
LinkedList::~LinkedList()
{
while (first != NULL)
{
Node *temp;
temp = first;
first = first->next;
free(temp);
}
last = NULL;
}
void LinkedList::insertAtBack(int valueToInsert)
{
Node *temp = (Node *)malloc(sizeof(Node));
temp->val = valueToInsert;
temp->next = NULL;
if (last == NULL)
first = last = temp;
else
{
last->next = temp;
last = temp;
}
}
bool LinkedList::removeFromBack()
{
if (first == NULL)
return false;
else if (first == last)
{
free(first);
first = last = NULL;
}
else
{
Node *temp;
temp = first;
while (temp->next != last)
temp = temp->next;
last = temp;
temp = temp->next;
free(temp);
last->next = NULL;
}
return true;
}
void LinkedList::print()
{
Node *temp = first;
while (temp != last)
{
cout << temp->val << \" \";
temp = temp->next;
}
if (temp != NULL)
cout << temp->val;
}
bool LinkedList::isEmpty()
{
if (first == last)
return true;
return false;
}
int LinkedList::size()
{
int count = 0;
Node *temp = first;
if (temp == NULL)
return count;
while (temp != last)
{
count++;
temp = temp->next;
}
return count + 1;
}
void LinkedList::clear()
{
while (first != NULL)
{
Node *.
For the code below complete the preOrder() method so that it perform.pdf
For the code below complete the preOrder() method so that it performs a preOrder traversal of
the tree. For each node it traverses, it should call sb.append() to add a \"[\" the results of
traversing the subtree rooted at that node, and then a \"]\". You should add a space before the
results of the left and right child traversals, but only if the node exists.
code:
Solution
In preorder Nodes visited are in the order of
code:
package edu.buffalo.cse116;
import java.util.AbstractSet;
import java.util.Iterator;
public class BinarySearchTree> extends AbstractSet {
protected Entry root;
protected int size;
/**
* Initializes this BinarySearchTree object to be empty, to contain only
* elements of type E, to be ordered by the Comparable interface, and to
* contain no duplicate elements.
*/
public BinarySearchTree() {
root = null;
size = 0;
}
/**
* Initializes this BinarySearchTree object to contain a shallow copy of a
* specified BinarySearchTree object. The worstTime(n) is O(n), where n is the
* number of elements in the specified BinarySearchTree object.
*
* @param otherTree - the specified BinarySearchTree object that this
* BinarySearchTree object will be assigned a shallow copy of.
*/
public BinarySearchTree(BinarySearchTree otherTree) {
root = copy(otherTree.root, null);
size = otherTree.size;
}
/* Method to complete is here! */
public void preOrder(Entry ent, StringBuilder sb) {
preorder(root)
protected Entry copy(Entry p, Entry parent) {
if (p != null) {
Entry q = new Entry(p.element, parent);
q.left = copy(p.left, q);
q.right = copy(p.right, q);
return q;
}
return null;
} // method copy
@SuppressWarnings(\"unchecked\")
@Override
public boolean equals(Object obj) {
if (!(obj instanceof BinarySearchTree)) {
return false;
}
return equals(root, ((BinarySearchTree) obj).root);
}
public boolean equals(Entry p, Entry q) {
if ((p == null) || (q == null)) {
return p == q;
}
if (!p.element.equals(q.element)) {
return false;
}
if (equals(p.left, q.left) && equals(p.right, q.right)) {
return true;
}
return false;
}
/**
* Returns the size of this BinarySearchTree object.
*
* @return the size of this BinarySearchTree object.
*/
@Override
public int size() {
return size;
}
/**
* Iterator method will be implemented for a future
*
* @return an iterator positioned at the smallest element in this
* BinarySearchTree object.
*/
@Override
public Iterator iterator() {
throw new UnsupportedOperationException(\"Not implemented yet!\");
}
/**
* Determines if there is at least one element in this BinarySearchTree object
* that equals a specified element. The worstTime(n) is O(n) and
* averageTime(n) is O(log n).
*
* @param obj - the element sought in this BinarySearchTree object.
* @return true - if there is an element in this BinarySearchTree object that
* equals obj; otherwise, return false.
* @throws ClassCastException - if obj cannot be compared to the elements in
* this BinarySearchTree object.
* @throws NullPointerException - if obj is null.
*/
@Override
public .
Given an array nums of size n- return the majority element- The majori.pdf
Given an array nums of size n, return the majority element.
The majority element is the element that appears more than round(n/2) times. You may assume
that the majority element always exists in the array.
Use the code template main_find_major_element
main_find_major_element:
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
// implement the function here.
int findMajorityElement(vector< int > &v)
{
return 0;
}
int main()
{
int n;
cout << "Enter the size of the vector: ";
cin >> n;
vector< int > input;
int element;
cout << "Enter the elements of the vector: ";
for ( int i = 0; i < n; i++)
{ cin >> element;
input.push_back(element);
}
int result = findMajorityElement(input);
cout << "The Majority Element is: " << result << endl;
return 0;
}
Examples:
Input:
Output:
3
Input:
Output:
2.
Writing native bindings to node.js in C++
Talk given at JSFoo Pune 2012
http://jsfoo.in/pune2012/schedule
Similar to #include stdafx.h#include iostreamusing namespace std;cl.pdf (20)
template-typename T- class Array { public- ---------------------------.pdf
template-typename T- class Array { public- ---------------------------.pdf
I have created a class hasdhedDictionary that implements the Diction.pdf
I have created a class hasdhedDictionary that implements the Diction.pdf
This is the main file include itemh include itemList.pdf
This is the main file include itemh include itemList.pdf
Need help with writing the test cases for the following code in java-.docx
Need help with writing the test cases for the following code in java-.docx
Given main() in the Inventory class, define an insertAtFront() metho.pdf
Given main() in the Inventory class, define an insertAtFront() metho.pdf
Create a Dynamic Array container with this user interface Ge.pdf
Create a Dynamic Array container with this user interface Ge.pdf
How do I fix it in LinkedList.javaLabProgram.javaLinkedList.jav.pdf
How do I fix it in LinkedList.javaLabProgram.javaLinkedList.jav.pdf
#include -algorithm- #include -cstdlib- #include -iostream- #include -.pdf
#include -algorithm- #include -cstdlib- #include -iostream- #include -.pdf
Character.cpphpp givenCharacter.cpp#include Character.hp.pdf
Character.cpphpp givenCharacter.cpp#include Character.hp.pdf
Help explain the code with line comments public class CompletedLis.pdf
Help explain the code with line comments public class CompletedLis.pdf
Please review my code (java)Someone helped me with it but i cannot.pdf
Please review my code (java)Someone helped me with it but i cannot.pdf
I keep getting an error about m_pHead in printStoresInfo(); function.pdf
I keep getting an error about m_pHead in printStoresInfo(); function.pdf
Help please, I have attached LinkedList.cpp and LinkedList.hPlease.pdf
Help please, I have attached LinkedList.cpp and LinkedList.hPlease.pdf
For the code below complete the preOrder() method so that it perform.pdf
For the code below complete the preOrder() method so that it perform.pdf
Given an array nums of size n- return the majority element- The majori.pdf
Given an array nums of size n- return the majority element- The majori.pdf
More from aashwini4
1. Seminal vesicle2. Prostate gland3. bulbourethral gland4. Ep.pdf
1. Seminal vesicle
2. Prostate gland
3. bulbourethral gland
4. Epididymis
5. Testis
6. Scrotal sac
7. Urethra
8. Corpora Cavernosa
9. Ductus deferens (vas deferens)
10. Urinary bladder
Solution
1. Seminal vesicle
2. Prostate gland
3. bulbourethral gland
4. Epididymis
5. Testis
6. Scrotal sac
7. Urethra
8. Corpora Cavernosa
9. Ductus deferens (vas deferens)
10. Urinary bladder.
moles of Na2CO3 = massmolecular mass = 0.50106 .pdf
moles of Na2CO3 = mass/molecular mass = 0.50/106 = 4.72 x 10^-3 moles or 4.72
millimoles
Solution
moles of Na2CO3 = mass/molecular mass = 0.50/106 = 4.72 x 10^-3 moles or 4.72
millimoles.
Hydronium ion = hydrogen ion [H3O+] = [H+] = 2.15.pdf
Hydronium ion = hydrogen ion [H3O+] = [H+] = 2.15*10^-3 pH = - log [H+] pH =
- log ( 2.15*10^-3) = 2.667
Solution
Hydronium ion = hydrogen ion [H3O+] = [H+] = 2.15*10^-3 pH = - log [H+] pH =
- log ( 2.15*10^-3) = 2.667.
E.moles of solute per liter of of solution .pdf
E.moles of solute per liter of of solution
Solution
E.moles of solute per liter of of solution.
This is mainly based on Hard - Soft acid base theory.Hard Acid .pdf
This is mainly based on Hard - Soft acid base theory.
Hard Acid and bases :
i) Small in size
ii) Compact
iii) Nonpolarizable
Ex: Na+ , Al3+ , F-, Cl-
Soft acids and base :
i) Larger in size
ii) Low electronegativity
iii) Highly polarizable
ii) Low electronegativity
iii) Highly polarizable
Ex: Cu+, Hg+ , H-,I-
It should be remembered that hard acid reacts with a hard base and soft acid reacts with a soft
base.
Here Hg+ is a soft, so it reacts with a soft base to form a stable compound.
It should be remembered that hard acid reacts with a hard base and soft acid reacts with a soft
base.
Here Hg+ is a soft, so it reacts with a soft base to form a stable compound.
sulfide is a soft base whereas silicates, carbonates, and Oxides are hard bases. Hence Hg is
avilable as HgS.
Zn is a border line acid. It will have the intermediate properties between the hard and soft.
It is mainly avilable as ZnS. Even ZnO is also avilable.
Zn is a border line acid. It will have the intermediate properties between the hard and soft.
It is mainly avilable as ZnS. Even ZnO is also avilable.
Solution
This is mainly based on Hard - Soft acid base theory.
Hard Acid and bases :
i) Small in size
ii) Compact
iii) Nonpolarizable
Ex: Na+ , Al3+ , F-, Cl-
Soft acids and base :
i) Larger in size
ii) Low electronegativity
iii) Highly polarizable
ii) Low electronegativity
iii) Highly polarizable
Ex: Cu+, Hg+ , H-,I-
It should be remembered that hard acid reacts with a hard base and soft acid reacts with a soft
base.
Here Hg+ is a soft, so it reacts with a soft base to form a stable compound.
It should be remembered that hard acid reacts with a hard base and soft acid reacts with a soft
base.
Here Hg+ is a soft, so it reacts with a soft base to form a stable compound.
sulfide is a soft base whereas silicates, carbonates, and Oxides are hard bases. Hence Hg is
avilable as HgS.
Zn is a border line acid. It will have the intermediate properties between the hard and soft.
It is mainly avilable as ZnS. Even ZnO is also avilable.
Zn is a border line acid. It will have the intermediate properties between the hard and soft.
It is mainly avilable as ZnS. Even ZnO is also avilable..
We are generally omitt the concentration of the solids &the concentr.pdf
We are generally omitt the concentration of the solids &the concentration of the solvents from
the equilibrium constantexpression.
So the omitted substances areI2(s) , BaCO3(s) , Mg(s) , FeO(s) ,H2O(l) (solvent)
Solution
We are generally omitt the concentration of the solids &the concentration of the solvents from
the equilibrium constantexpression.
So the omitted substances areI2(s) , BaCO3(s) , Mg(s) , FeO(s) ,H2O(l) (solvent).
COVALENT ionic hydrogen bonding .pdf
COVALENT ionic hydrogen bonding
Solution
COVALENT ionic hydrogen bonding.
The reaction is maintained at a low temperature with slow addition o.pdf
The reaction is maintained at a low temperature with slow addition of the HNO3/H2SO4 mixture
to ensure that only one NO2 group is substituted into the benzene ring (i.e. mononitration).
If the temperature and nitronium ion (NO2+) concentration are too high (from quick addition of
HNO3/H2SO4), then the chances of more than one NO2 group substituting into the benzene ring
increases. This would give rise to unwanted dinitration products.
Solution
The reaction is maintained at a low temperature with slow addition of the HNO3/H2SO4 mixture
to ensure that only one NO2 group is substituted into the benzene ring (i.e. mononitration).
If the temperature and nitronium ion (NO2+) concentration are too high (from quick addition of
HNO3/H2SO4), then the chances of more than one NO2 group substituting into the benzene ring
increases. This would give rise to unwanted dinitration products..
There are two reasons.1. Presence of natural immunity2. Immunity.pdf
There are two reasons.
1. Presence of natural immunity
2. Immunity to superinfection
Bacteria have defense mechanisms to combat phage infection. This comprises of restriction
endonuclease system, the enzyme system which modifies the host DNA and specifically
recognize and cleave the exogenous DNA. When a phage infects, only its genome is injected into
the host cell. The injected DNA is recognized by the host restriction endonuclease system and is
cleaved into fragments.
The other reason is that immunity to superinfection. If a lysogenic phage infects a host cell, it
integrates into genome into the host chromosome. At the same time, it also prevents the host
from being infected by another lysogenic phage. The accumulation of cI protein in the host due
to the existing prophage prevents infection by other phages.
Some other reasons for resistance are lack of a receptor that facilitates the entry of the phage,
lack of supporting machinery for the phage replication.
Solution
There are two reasons.
1. Presence of natural immunity
2. Immunity to superinfection
Bacteria have defense mechanisms to combat phage infection. This comprises of restriction
endonuclease system, the enzyme system which modifies the host DNA and specifically
recognize and cleave the exogenous DNA. When a phage infects, only its genome is injected into
the host cell. The injected DNA is recognized by the host restriction endonuclease system and is
cleaved into fragments.
The other reason is that immunity to superinfection. If a lysogenic phage infects a host cell, it
integrates into genome into the host chromosome. At the same time, it also prevents the host
from being infected by another lysogenic phage. The accumulation of cI protein in the host due
to the existing prophage prevents infection by other phages.
Some other reasons for resistance are lack of a receptor that facilitates the entry of the phage,
lack of supporting machinery for the phage replication..
The difference between maximization of value of the corporation and .pdf
The difference between maximization of value of the corporation and profit maximization and
return to the shareholder and maximise their wealth is the difference of objectives of living one
and non-living legal entity.
The firms objective is not only the maximisation of the wealth or return to the Shareholders but
creating values in the product is produced, development of the society in which it operates and
growth of the persons attached to it like employees, suppliers and customers. On the other hand,
it is the Shareholders whose objective to invest in the corporation is mainly to earn return on
their investment. The shareholders wants the corporation to earns more and more profits for them
every quater. The value of the corporation can be raised by only when the general society would
recognises the company and its products and services. The corporation concentrates on the
growth and development whereas the Shareholders pay attention to the return or profits.
Solution
The difference between maximization of value of the corporation and profit maximization and
return to the shareholder and maximise their wealth is the difference of objectives of living one
and non-living legal entity.
The firms objective is not only the maximisation of the wealth or return to the Shareholders but
creating values in the product is produced, development of the society in which it operates and
growth of the persons attached to it like employees, suppliers and customers. On the other hand,
it is the Shareholders whose objective to invest in the corporation is mainly to earn return on
their investment. The shareholders wants the corporation to earns more and more profits for them
every quater. The value of the corporation can be raised by only when the general society would
recognises the company and its products and services. The corporation concentrates on the
growth and development whereas the Shareholders pay attention to the return or profits..
The changes between the steady state.SolutionThe changes betwe.pdf
The changes between the steady state.
Solution
The changes between the steady state..
Spore forming bacteria (prokaryotes) such as Bacillus anthracis can .pdf
Spore forming bacteria (prokaryotes) such as Bacillus anthracis can be dormant & survive even
for 1000 years under the exposure of ultra-violet rays (the longest UV exposure). This is because
of the following properties
Bacillus subtilis produce dormant spores by sporulation ate suitable conditions and these spores
are called as endospores. These endopores have the capability to survive at extreme temperatures
followed by insufficient nutrient availability and their spore DNA is completely resistant to
mutagens such as UV light, chemicals. They are also resistant to desiccation and resistant to
extreme freezing and chemical disinfectants.
Factor-1: These endospores possess very complex diversified structure that can withstand all the
possible mutation inducing changes. These possess structural adaptations such as exosporium,
hard spore coat and these are acts as very hard complex resistant materials, which can eliminate
digesting enzymes such as lysozymes. These endospores possess cortex composed of
peptidoglycan and it has a core wall that is present under the cortex and surrounds protoplast.
These layers potentially protect spore DNA material.
Factor-2: Core material of the spore also possesses calcium dipicolinate that enable stability of
chromosomal DNA by protecting it from oxidizing agents. Inside the core material, spore
possess DNA and it is covered by specifically small acid-soluble spore proteins an these are
similar to chromatin-like proteins and enable in protecting DNA from heat as well as UV
radiation inducing mutation.
Factor-3: In order to keep the spore dormancy all the spore structural components formed and
maintain signal transduction pathways, which further result in elevated activity of the cAMP-
dependent protein kinase, triggers rapid encapsulation.
Solution
Spore forming bacteria (prokaryotes) such as Bacillus anthracis can be dormant & survive even
for 1000 years under the exposure of ultra-violet rays (the longest UV exposure). This is because
of the following properties
Bacillus subtilis produce dormant spores by sporulation ate suitable conditions and these spores
are called as endospores. These endopores have the capability to survive at extreme temperatures
followed by insufficient nutrient availability and their spore DNA is completely resistant to
mutagens such as UV light, chemicals. They are also resistant to desiccation and resistant to
extreme freezing and chemical disinfectants.
Factor-1: These endospores possess very complex diversified structure that can withstand all the
possible mutation inducing changes. These possess structural adaptations such as exosporium,
hard spore coat and these are acts as very hard complex resistant materials, which can eliminate
digesting enzymes such as lysozymes. These endospores possess cortex composed of
peptidoglycan and it has a core wall that is present under the cortex and surrounds protoplast.
These layers potentially protect spore DNA material.
Factor-2: Core mater.
b) the solutes volatilize at different rates in t.pdf
b) the solutes volatilize at different rates in the injector
Solution
b) the solutes volatilize at different rates in the injector.
Partnership Firms are taxed at multiple levels the Corporate Level.pdf
Partnership Firms are taxed at multiple levels : the Corporate Level, which is the taxation for the
firm, and individual level, which is the taxation of the individual partners on a one-to-one basis.
Solution
Partnership Firms are taxed at multiple levels : the Corporate Level, which is the taxation for the
firm, and individual level, which is the taxation of the individual partners on a one-to-one basis..
Please give the problem detailsWhat are the solutions being mixed.pdf
Please give the problem details:
What are the solutions being mixed?, the volumes, concentrations?
Solution
Please give the problem details:
What are the solutions being mixed?, the volumes, concentrations?.
One case of paternity testing has been given in the figure. Four aut.pdf
One case of paternity testing has been given in the figure. Four autoradiographs (autorads) that
show DNA \"fingerprints\" for three individuals: a mother, her child, and the child\'s alleged
father(said father/without proof). Each autorad compares the traits inherited by these three
individuals - four traits are looked at, one for each autorad.
Presence or absence of different alleles (called DNA fingerprints) has been compared in each
case. These alleles (DNA fragments) differ in length from person to person; for this reason they
are used as genetic markers.
In case I-these alleles are A, B, C and D
In case II-E, G and F
In case III-H, I, J and K
In case IV-L, M, N and O
Ans 1
Case
Genotype of Mother
Genotype of Child
Genotype of alleged father
I
A/D
A/C
B/C
II
G/G
E/G
E/F
III
I/J
I/K
H/K
IV
M/N
M/O
L/O
Ans 2
In each case, child has inherited one copy of allele from mother and one from father so by
looking at the genotype of child, contribution from the parents can be predicted (by comparing
the genotype of all three persons)
Case
Genotype of child
Allele inherited from mother
Allele inherited from father
I
A/C
A
C
II
E/G
G
E
III
I/K
I
K
IV
M/O
M
O
Ans-3
In each case, we can see that child has inherited one copy of allele from mother and one from
father. So by making the comparison, it can be predicted that that the alleged father could be the
biological father of this child.
Ans 4
The DNA fingerprint assay is also useful in chimerism analysis after liver transplantation. Four
percent of donor lymphocytes (transient lymphocytes) are present for up to 3 weeks after
transplantation. If the donor lymphocytes persist, they can cause graft-versus-host disease
(GVHD), which is an underdiagnosed and often fatal complication that occurs in approximately
1% of cases, usually 2 to 6 weeks after transplantation. The following cases illustrate the utility
of the this assay in chimerism analysis.
A liver transplant recipient presented with a skin rash 2 weeks after transplant, and a punch
biopsy of the skin was obtained. The pathologist noted the presence of a lymphocyte infiltrate in
the dermis. Possible causes included a drug reaction, a viral infection, or early GVHD. DNA was
extracted from the area of lymphocyte infiltration, and DNA fingerprinting analysis was
performed. The results showed that some of the lymphocytes were of donor origin, confirming
the diagnosis of early GVHD.
https://www.ncbi.nlm.nih.gov/pmc/articles/PMC1200713/
Case
Genotype of Mother
Genotype of Child
Genotype of alleged father
I
A/D
A/C
B/C
II
G/G
E/G
E/F
III
I/J
I/K
H/K
IV
M/N
M/O
L/O
Solution
One case of paternity testing has been given in the figure. Four autoradiographs (autorads) that
show DNA \"fingerprints\" for three individuals: a mother, her child, and the child\'s alleged
father(said father/without proof). Each autorad compares the traits inherited by these three
individuals - four traits are looked at, one for each autorad.
Presence or absence of different alleles.
Answer is D. I (1) will add at the carbonyl rath.pdf
Answer is D. I (1) will add at the carbonyl rather than the double bond
Solution
Answer is D. I (1) will add at the carbonyl rather than the double bond.
Nasal cavity( nasal mucosa)-In humans, olfaction occurs when odora.pdf
Nasal cavity( nasal mucosa)
-In humans, olfaction occurs when odorant molecules bind to specific sites on the olfactory
receptors. These receptors are used to detect the presence of smell.
Solution
Nasal cavity( nasal mucosa)
-In humans, olfaction occurs when odorant molecules bind to specific sites on the olfactory
receptors. These receptors are used to detect the presence of smell..
More from aashwini4 (20)
1. Seminal vesicle2. Prostate gland3. bulbourethral gland4. Ep.pdf
1. Seminal vesicle2. Prostate gland3. bulbourethral gland4. Ep.pdf
moles of Na2CO3 = massmolecular mass = 0.50106 .pdf
moles of Na2CO3 = massmolecular mass = 0.50106 .pdf
Hydronium ion = hydrogen ion [H3O+] = [H+] = 2.15.pdf
Hydronium ion = hydrogen ion [H3O+] = [H+] = 2.15.pdf
This is mainly based on Hard - Soft acid base theory.Hard Acid .pdf
This is mainly based on Hard - Soft acid base theory.Hard Acid .pdf
We are generally omitt the concentration of the solids &the concentr.pdf
We are generally omitt the concentration of the solids &the concentr.pdf
The reaction is maintained at a low temperature with slow addition o.pdf
The reaction is maintained at a low temperature with slow addition o.pdf
There are two reasons.1. Presence of natural immunity2. Immunity.pdf
There are two reasons.1. Presence of natural immunity2. Immunity.pdf
The difference between maximization of value of the corporation and .pdf
The difference between maximization of value of the corporation and .pdf
The changes between the steady state.SolutionThe changes betwe.pdf
The changes between the steady state.SolutionThe changes betwe.pdf
Spore forming bacteria (prokaryotes) such as Bacillus anthracis can .pdf
Spore forming bacteria (prokaryotes) such as Bacillus anthracis can .pdf
b) the solutes volatilize at different rates in t.pdf
b) the solutes volatilize at different rates in t.pdf
Partnership Firms are taxed at multiple levels the Corporate Level.pdf
Partnership Firms are taxed at multiple levels the Corporate Level.pdf
Please give the problem detailsWhat are the solutions being mixed.pdf
Please give the problem detailsWhat are the solutions being mixed.pdf
One case of paternity testing has been given in the figure. Four aut.pdf
One case of paternity testing has been given in the figure. Four aut.pdf
Answer is D. I (1) will add at the carbonyl rath.pdf
Answer is D. I (1) will add at the carbonyl rath.pdf
Nasal cavity( nasal mucosa)-In humans, olfaction occurs when odora.pdf
Nasal cavity( nasal mucosa)-In humans, olfaction occurs when odora.pdf
Recently uploaded
Thesis Statement for students diagnonsed withADHD.ppt
Presentation required for the master in Education.
Normal Labour/ Stages of Labour/ Mechanism of Labour
Normal labor is also termed spontaneous labor, defined as the natural physiological process through which the fetus, placenta, and membranes are expelled from the uterus through the birth canal at term (37 to 42 weeks
Synthetic 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.
Chapter -12, Antibiotics (One Page Notes).pdf
This is a notes for the D.Pharm students and related to the antibiotic drugs.
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.
Introduction to AI for Nonprofits with Tapp Network
Dive into the world of AI! Experts Jon Hill and Tareq Monaur will guide you through AI's role in enhancing nonprofit websites and basic marketing strategies, making it easy to understand and apply.
Azure Interview Questions and Answers PDF By ScholarHat
Azure Interview Questions and Answers PDF By ScholarHat
Digital Tools and AI for Teaching Learning and Research
This Presentation in details discusses on Digital Tools and AI for Teaching Learning and Research
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.
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
2024.06.01 Introducing a competency framework for languag learning materials ...
http://sandymillin.wordpress.com/iateflwebinar2024
Published classroom materials form the basis of syllabuses, drive teacher professional development, and have a potentially huge influence on learners, teachers and education systems. All teachers also create their own materials, whether a few sentences on a blackboard, a highly-structured fully-realised online course, or anything in between. Despite this, the knowledge and skills needed to create effective language learning materials are rarely part of teacher training, and are mostly learnt by trial and error.
Knowledge and skills frameworks, generally called competency frameworks, for ELT teachers, trainers and managers have existed for a few years now. However, until I created one for my MA dissertation, there wasn’t one drawing together what we need to know and do to be able to effectively produce language learning materials.
This webinar will introduce you to my framework, highlighting the key competencies I identified from my research. It will also show how anybody involved in language teaching (any language, not just English!), teacher training, managing schools or developing language learning materials can benefit from using the framework.
Mule 4.6 & Java 17 Upgrade | MuleSoft Mysore Meetup #46
Mule 4.6 & Java 17 Upgrade | MuleSoft Mysore Meetup #46
Event Link:-
https://meetups.mulesoft.com/events/details/mulesoft-mysore-presents-exploring-gemini-ai-and-integration-with-mulesoft/
Agenda
● Java 17 Upgrade Overview
● Why and by when do customers need to upgrade to Java 17?
● Is there any immediate impact to upgrading to Mule Runtime 4.6 and beyond?
● Which MuleSoft products are in scope?
For Upcoming Meetups Join Mysore Meetup Group - https://meetups.mulesoft.com/mysore/
YouTube:- youtube.com/@mulesoftmysore
Mysore WhatsApp group:- https://chat.whatsapp.com/EhqtHtCC75vCAX7gaO842N
Speaker:-
Shubham Chaurasia - https://www.linkedin.com/in/shubhamchaurasia1/
Priya Shaw - https://www.linkedin.com/in/priya-shaw
Organizers:-
Shubham Chaurasia - https://www.linkedin.com/in/shubhamchaurasia1/
Giridhar Meka - https://www.linkedin.com/in/giridharmeka
Priya Shaw - https://www.linkedin.com/in/priya-shaw
Shyam Raj Prasad-
https://www.linkedin.com/in/shyam-raj-prasad/
"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
A Survey of Techniques for Maximizing LLM Performance.pptx
A Survey of Techniques for Maximizing LLM Performance
Model Attribute Check Company Auto Property
In Odoo, the multi-company feature allows you to manage multiple companies within a single Odoo database instance. Each company can have its own configurations while still sharing common resources such as products, customers, and suppliers.
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.
Recently uploaded (20)
Thesis Statement for students diagnonsed withADHD.ppt
Thesis Statement for students diagnonsed withADHD.ppt
Normal Labour/ Stages of Labour/ Mechanism of Labour
Normal Labour/ Stages of Labour/ Mechanism of Labour
Group Presentation 2 Economics.Ariana Buscigliopptx
Group Presentation 2 Economics.Ariana Buscigliopptx
How libraries can support authors with open access requirements for UKRI fund...
How libraries can support authors with open access requirements for UKRI fund...
Introduction to AI for Nonprofits with Tapp Network
Introduction to AI for Nonprofits with Tapp Network
Azure Interview Questions and Answers PDF By ScholarHat
Azure Interview Questions and Answers PDF By ScholarHat
Digital Tools and AI for Teaching Learning and Research
Digital Tools and AI for Teaching Learning and Research
The French Revolution Class 9 Study Material pdf free download
The French Revolution Class 9 Study Material pdf free download
2024.06.01 Introducing a competency framework for languag learning materials ...
2024.06.01 Introducing a competency framework for languag learning materials ...
Mule 4.6 & Java 17 Upgrade | MuleSoft Mysore Meetup #46
Mule 4.6 & Java 17 Upgrade | MuleSoft Mysore Meetup #46
"Protectable subject matters, Protection in biotechnology, Protection of othe...
"Protectable subject matters, Protection in biotechnology, Protection of othe...
A Survey of Techniques for Maximizing LLM Performance.pptx
A Survey of Techniques for Maximizing LLM Performance.pptx
#include stdafx.h#include iostreamusing namespace std;cl.pdf
- 1. #include "stdafx.h" #include using namespace std; class Inventory { private: int itemNumber; int quantity; double cost; double totalCost; public: Inventory() { itemNumber = 0; quantity = 0; cost = 0; totalCost = 0; } Inventory(int newItemNumber, int newQuantity, double newCost) { itemNumber = newItemNumber; quantity = newQuantity; cost = newCost; setTotalCost(quantity, cost); // this can be called as quantity and cost have now been initialized. } void setItemNumber(int) { itemNumber = itemNumber; } void setQuantity(int) { quantity = quantity; } void setCost(double)
- 2. { cost = cost; } void setTotalCost(int, double) { totalCost = quantity * cost; } int getItemNumber() { return itemNumber; } int getQuantity() { return quantity; } double getCost() { return cost; } double getTotalCost() { return totalCost; } }; int main() { int itemNumber; int quantity; double cost; double totalCost; cout << "Enter the Item Number: "; cin >> itemNumber; while (itemNumber < 0) { cout << "Please enter a positive value for the Item Number: "; cin >> itemNumber;
- 3. } cout << "Enter the Quantity of the item: "; cin >> quantity; while (quantity < 0) { cout << "Please enter a positive value for the Quantity of the item: "; cin >> quantity; } cout << "Enter the Cost of the item: "; cin >> cost; while (cost < 0) { cout << "Please enter a positive value for the Cost of the item: "; cin >> cost; } Inventory information(itemNumber, quantity, cost); totalCost = information.getTotalCost(); itemNumber = information.getItemNumber(); cost = information.getCost(); quantity = information.getQuantity(); cout << "The Item Number is: " << itemNumber << endl; cout << "The Quantity is: " << quantity << endl; cout << "The Cost is: " << cost << endl; cout << "The Total Cost is: " << totalCost << endl; return 0; } int _tmain(int argc, _TCHAR* argv[]) { return 0; } Solution #include "stdafx.h" #include
- 4. using namespace std; class Inventory { private: int itemNumber; int quantity; double cost; double totalCost; public: Inventory() { itemNumber = 0; quantity = 0; cost = 0; totalCost = 0; } Inventory(int newItemNumber, int newQuantity, double newCost) { itemNumber = newItemNumber; quantity = newQuantity; cost = newCost; setTotalCost(quantity, cost); // this can be called as quantity and cost have now been initialized. } void setItemNumber(int) { itemNumber = itemNumber; } void setQuantity(int) { quantity = quantity; } void setCost(double) { cost = cost; }
- 5. void setTotalCost(int, double) { totalCost = quantity * cost; } int getItemNumber() { return itemNumber; } int getQuantity() { return quantity; } double getCost() { return cost; } double getTotalCost() { return totalCost; } }; int main() { int itemNumber; int quantity; double cost; double totalCost; cout << "Enter the Item Number: "; cin >> itemNumber; while (itemNumber < 0) { cout << "Please enter a positive value for the Item Number: "; cin >> itemNumber; } cout << "Enter the Quantity of the item: "; cin >> quantity;
- 6. while (quantity < 0) { cout << "Please enter a positive value for the Quantity of the item: "; cin >> quantity; } cout << "Enter the Cost of the item: "; cin >> cost; while (cost < 0) { cout << "Please enter a positive value for the Cost of the item: "; cin >> cost; } Inventory information(itemNumber, quantity, cost); totalCost = information.getTotalCost(); itemNumber = information.getItemNumber(); cost = information.getCost(); quantity = information.getQuantity(); cout << "The Item Number is: " << itemNumber << endl; cout << "The Quantity is: " << quantity << endl; cout << "The Cost is: " << cost << endl; cout << "The Total Cost is: " << totalCost << endl; return 0; } int _tmain(int argc, _TCHAR* argv[]) { return 0; }