Create a Dynamic Array container with this user interface Ge.pdf
•
0 likes•1 view
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.
Report
Share
Report
Share
Download to read offline
![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](https://image.slidesharecdn.com/createadynamicarraycontainerwiththisuserinterfacege-230711202541-92a34737/85/Create-a-Dynamic-Array-container-with-this-user-interface-Ge-pdf-1-320.jpg)
![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](data:image/gif;base64,R0lGODlhAQABAIAAAAAAAP///yH5BAEAAAAALAAAAAABAAEAAAIBRAA7)
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.
I really need help with my C++ assignment. The following is the info.pdf
I really need help with my C++ assignment. The following is the information of my question.
Thank you for helping me.
Take a close look at the code
// IntCollection class implementation
#include \"IntCollection.h\"
#include
using namespace std;
IntCollection::IntCollection()
{
//initialize member data to reflect an empty IntCollection
size = capacity = 0;
data = NULL;
}
void IntCollection::addCapacity()
{
//create a new, bigger buffer, copy the current data to it, delete
//the old buffer, and point our data pointer to the new buffer
//
//note: there is a more efficient way to do this using the C
//memory management function realloc(), but that is beyond the
//scope of our course
int *newData;
capacity += CHUNK_SIZE;
newData = new int[capacity];
for (int i=0; i=size)
{
cout << \"ERROR: get() trying to access index out of range.\ \";
exit(1);
}
return data[index];
}
int IntCollection::getSize()
{
return size;
}
/*
int main()
{
IntCollection c;
c.add(45);
c.add(-210);
c.add(77);
c.add(2);
c.add(-21);
c.add(42);
c.add(7);
for (int i = 0; i < c.getSize(); i++)
{
cout << c.get(i) << endl;
}
}
*/
// IntCollection class header
#ifndef INTCOLLECTION_H
#define INTCOLLECTION_H
const int CHUNK_SIZE=5; // allocate memory in chunks of ints of this size
class IntCollection
{
private:
int size; // the number of ints currently stored in the int collection
int capacity; // the total number of elements available for stoarge in the data array
int* data; // a pointer to the dynamically allocated data array
void addCapacity(); // a private member function to allocate more memory if necessary
public:
IntCollection(); // constructor
//~IntCollection(); // destructor, to be added!
//IntCollection(const IntCollection &c); // copy constructor, to be added!
void add(int value);
int get(int index);
int getSize();
//IntCollection& operator=(const IntCollection &c); // to be added!
//boolean operator==(const IntCollection &c); // to be added!
//IntCollection& operator<<(int value); // to be added!
};
The IntCollection class is a dynamic storage mechanism for storing integers. It could be used in
place of an integer array. It allows you to store and retrieve integers using indices.
The following code creates an IntCollection object named ‘c’. It adds seven integers to ‘c’, then
uses a for loop to display the seven integers:
int main()
{
IntCollection c;
c.add(45);
c.add(-210);
c.add(77);
c.add(2);
c.add(-21);
c.add(42);
c.add(7);
for (int i = 0; i < c.getSize(); i++)
{
cout << c.get(i) << endl;
}
}
For this assignment you will add a copy constructor, a destructor, and three overloaded operators
to the IntCollection class. In the design diagram below, the black member functions represent
code that has already been implemented. You will be implementing the green items. Each item
that you will be adding to the class is described below the diagram.
Private:
int size // the number of ints currently stored in the int collection
int capacity // total number of elements available i.
Object Oriented Programming using C++: Ch08 Operator Overloading.pptx
Object Oriented Programming using C++: Ch08 Operator Overloading
vectors.(join ALL INDIA POLYTECHNIC (AICTE)).pptx
join ALL INDIA POLYTECHNIC (AICTE) telegram group
Vectors power point presentation
This file contains a complete array-based MultiSet, but not the code.pdf
This file contains a complete array-based MultiSet, but not the code needed to support its
Iterator. Complete the Iterator\'s next() and hasNext() methods.
Solution
Hi, I have implemented both required methods.
Please let me know in case of any issue.
import java.util.Collection;
import java.util.Iterator;
public class ArrayMultiSet implements Collection {
/** Array in which the elements in this multiset are stored. */
private E[] _store;
/**
* Array indices below this amount contain the active elements in this collection.
*/
private int _size;
/**
* Modification counter used to preserve the fail-fast nature of its iterators.
*/
private long _modCount;
/**
* Create a new empty multiset.
*/
public ArrayMultiSet() {
_modCount = 0;
clear();
}
/**
* Remove all of the elements within the instance and invalidate any current iterators.
*/
@SuppressWarnings(\"unchecked\")
@Override
public void clear() {
_store = (E[]) (new Object[16]);
_size = 0;
// maintains the class invariant
}
/**
* Update the multiset so that it includes all of the elements from before the call AND the given
element.
*
* @param e Item to be added to this collection.
*/
@SuppressWarnings(\"unchecked\")
@Override
public boolean add(E e) {
// Check if we do not have enough space in the underlying array to store the
// new element
if (_size == _store.length) {
// We do not have space, so create a new larger space (doubling the size
// is the most time efficient)
E[] newStore = (E[]) new Object[_store.length * 2];
// Copy all of the references into the new array
for (int i = 0; i < _store.length; i++ ) {
newStore[i] = _store[i];
}
_store = newStore;
// An easier, more efficient way of coding this (but less useful for
// teaching) would instead be:
// _store = Arrays.copyOf(_store, _store.length * 2);
}
// Add the element to the store
_store[_size] = e;
// Finally, we can increase _size, since this change will no longer violate
// any class invariants.
_size += 1;
return true;
}
/**
* Return true if at least one element in the multiset is equal to the given object. When {@code
obj} is null, it must
* use the {@code ==} operator to perform these checks, but when {@code obj} is not null, the
{@link Object#equals}
* method is used.
*
* @param obj Object (or null) for which we will search
* @return {@code true} if {@code obj} was found; {@code false} if a match could not be
found.
*/
@Override
public boolean contains(Object obj) {
// Only scan through _size, since those are the only \"real\" entries for the
// multiset.
for (int i = 0; i < _size; i++ ) {
// When obj is null, we need to use ==
if ((obj == null) && (_store[i] == null)) {
return true;
}
// Otherwise, we use .equals() to find a match
else if ((obj != null) && obj.equals(_store[i])) {
return true;
}
// No else clause, since the match could be at a higher index!
}
// Checked all VALID indices, so the result must be:
return false;
}
@Override
public int size() {
return _size;
}
/**
* Remove the element found at the given index. .
this file has a complete array-based MultiSet, but not the code need.pdf
this file has a complete array-based MultiSet, but not the code needed to support its Iterator.
Complete the Iterator\'s next() and hasNext() methods.
Solution
Hi, I have implemented required methods.
Please let me know in case of any issue.
import java.util.Collection;
import java.util.Iterator;
import java.util.NoSuchElementException;
public class ArrayMultiSet implements Collection {
/** Array in which the elements in this multiset are stored. */
private E[] _store;
/**
* Array indices below this amount contain the active elements in this collection.
*/
private int _size;
/**
* Modification counter used to preserve the fail-fast nature of its iterators.
*/
private long _modCount;
/**
* Create a new empty multiset.
*/
public ArrayMultiSet() {
_modCount = 0;
clear();
}
/**
* Remove all of the elements within the instance and invalidate any current iterators.
*/
@SuppressWarnings(\"unchecked\")
@Override
public void clear() {
_store = (E[]) (new Object[16]);
_size = 0;
// maintains the class invariant
}
/**
* Update the multiset so that it includes all of the elements from before the call AND the given
element.
*
* @param e Item to be added to this collection.
*/
@SuppressWarnings(\"unchecked\")
@Override
public boolean add(E e) {
// Check if we do not have enough space in the underlying array to store the
// new element
if (_size == _store.length) {
// We do not have space, so create a new larger space (doubling the size
// is the most time efficient)
E[] newStore = (E[]) new Object[_store.length * 2];
// Copy all of the references into the new array
for (int i = 0; i < _store.length; i++ ) {
newStore[i] = _store[i];
}
_store = newStore;
// An easier, more efficient way of coding this (but less useful for
// teaching) would instead be:
// _store = Arrays.copyOf(_store, _store.length * 2);
}
// Add the element to the store
_store[_size] = e;
// Finally, we can increase _size, since this change will no longer violate
// any class invariants.
_size += 1;
return true;
}
/**
* Return true if at least one element in the multiset is equal to the given object. When {@code
obj} is null, it must
* use the {@code ==} operator to perform these checks, but when {@code obj} is not null, the
{@link Object#equals}
* method is used.
*
* @param obj Object (or null) for which we will search
* @return {@code true} if {@code obj} was found; {@code false} if a match could not be
found.
*/
@Override
public boolean contains(Object obj) {
// Only scan through _size, since those are the only \"real\" entries for the
// multiset.
for (int i = 0; i < _size; i++ ) {
// When obj is null, we need to use ==
if ((obj == null) && (_store[i] == null)) {
return true;
}
// Otherwise, we use .equals() to find a match
else if ((obj != null) && obj.equals(_store[i])) {
return true;
}
// No else clause, since the match could be at a higher index!
}
// Checked all VALID indices, so the result must be:
return false;
}
@Override
public int size() {
return _size;
}
/**
* Remove the ele.
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.
I really need help with my C++ assignment. The following is the info.pdf
I really need help with my C++ assignment. The following is the information of my question.
Thank you for helping me.
Take a close look at the code
// IntCollection class implementation
#include \"IntCollection.h\"
#include
using namespace std;
IntCollection::IntCollection()
{
//initialize member data to reflect an empty IntCollection
size = capacity = 0;
data = NULL;
}
void IntCollection::addCapacity()
{
//create a new, bigger buffer, copy the current data to it, delete
//the old buffer, and point our data pointer to the new buffer
//
//note: there is a more efficient way to do this using the C
//memory management function realloc(), but that is beyond the
//scope of our course
int *newData;
capacity += CHUNK_SIZE;
newData = new int[capacity];
for (int i=0; i=size)
{
cout << \"ERROR: get() trying to access index out of range.\ \";
exit(1);
}
return data[index];
}
int IntCollection::getSize()
{
return size;
}
/*
int main()
{
IntCollection c;
c.add(45);
c.add(-210);
c.add(77);
c.add(2);
c.add(-21);
c.add(42);
c.add(7);
for (int i = 0; i < c.getSize(); i++)
{
cout << c.get(i) << endl;
}
}
*/
// IntCollection class header
#ifndef INTCOLLECTION_H
#define INTCOLLECTION_H
const int CHUNK_SIZE=5; // allocate memory in chunks of ints of this size
class IntCollection
{
private:
int size; // the number of ints currently stored in the int collection
int capacity; // the total number of elements available for stoarge in the data array
int* data; // a pointer to the dynamically allocated data array
void addCapacity(); // a private member function to allocate more memory if necessary
public:
IntCollection(); // constructor
//~IntCollection(); // destructor, to be added!
//IntCollection(const IntCollection &c); // copy constructor, to be added!
void add(int value);
int get(int index);
int getSize();
//IntCollection& operator=(const IntCollection &c); // to be added!
//boolean operator==(const IntCollection &c); // to be added!
//IntCollection& operator<<(int value); // to be added!
};
The IntCollection class is a dynamic storage mechanism for storing integers. It could be used in
place of an integer array. It allows you to store and retrieve integers using indices.
The following code creates an IntCollection object named ‘c’. It adds seven integers to ‘c’, then
uses a for loop to display the seven integers:
int main()
{
IntCollection c;
c.add(45);
c.add(-210);
c.add(77);
c.add(2);
c.add(-21);
c.add(42);
c.add(7);
for (int i = 0; i < c.getSize(); i++)
{
cout << c.get(i) << endl;
}
}
For this assignment you will add a copy constructor, a destructor, and three overloaded operators
to the IntCollection class. In the design diagram below, the black member functions represent
code that has already been implemented. You will be implementing the green items. Each item
that you will be adding to the class is described below the diagram.
Private:
int size // the number of ints currently stored in the int collection
int capacity // total number of elements available i.
Object Oriented Programming using C++: Ch08 Operator Overloading.pptx
Object Oriented Programming using C++: Ch08 Operator Overloading
vectors.(join ALL INDIA POLYTECHNIC (AICTE)).pptx
join ALL INDIA POLYTECHNIC (AICTE) telegram group
Vectors power point presentation
This file contains a complete array-based MultiSet, but not the code.pdf
This file contains a complete array-based MultiSet, but not the code needed to support its
Iterator. Complete the Iterator\'s next() and hasNext() methods.
Solution
Hi, I have implemented both required methods.
Please let me know in case of any issue.
import java.util.Collection;
import java.util.Iterator;
public class ArrayMultiSet implements Collection {
/** Array in which the elements in this multiset are stored. */
private E[] _store;
/**
* Array indices below this amount contain the active elements in this collection.
*/
private int _size;
/**
* Modification counter used to preserve the fail-fast nature of its iterators.
*/
private long _modCount;
/**
* Create a new empty multiset.
*/
public ArrayMultiSet() {
_modCount = 0;
clear();
}
/**
* Remove all of the elements within the instance and invalidate any current iterators.
*/
@SuppressWarnings(\"unchecked\")
@Override
public void clear() {
_store = (E[]) (new Object[16]);
_size = 0;
// maintains the class invariant
}
/**
* Update the multiset so that it includes all of the elements from before the call AND the given
element.
*
* @param e Item to be added to this collection.
*/
@SuppressWarnings(\"unchecked\")
@Override
public boolean add(E e) {
// Check if we do not have enough space in the underlying array to store the
// new element
if (_size == _store.length) {
// We do not have space, so create a new larger space (doubling the size
// is the most time efficient)
E[] newStore = (E[]) new Object[_store.length * 2];
// Copy all of the references into the new array
for (int i = 0; i < _store.length; i++ ) {
newStore[i] = _store[i];
}
_store = newStore;
// An easier, more efficient way of coding this (but less useful for
// teaching) would instead be:
// _store = Arrays.copyOf(_store, _store.length * 2);
}
// Add the element to the store
_store[_size] = e;
// Finally, we can increase _size, since this change will no longer violate
// any class invariants.
_size += 1;
return true;
}
/**
* Return true if at least one element in the multiset is equal to the given object. When {@code
obj} is null, it must
* use the {@code ==} operator to perform these checks, but when {@code obj} is not null, the
{@link Object#equals}
* method is used.
*
* @param obj Object (or null) for which we will search
* @return {@code true} if {@code obj} was found; {@code false} if a match could not be
found.
*/
@Override
public boolean contains(Object obj) {
// Only scan through _size, since those are the only \"real\" entries for the
// multiset.
for (int i = 0; i < _size; i++ ) {
// When obj is null, we need to use ==
if ((obj == null) && (_store[i] == null)) {
return true;
}
// Otherwise, we use .equals() to find a match
else if ((obj != null) && obj.equals(_store[i])) {
return true;
}
// No else clause, since the match could be at a higher index!
}
// Checked all VALID indices, so the result must be:
return false;
}
@Override
public int size() {
return _size;
}
/**
* Remove the element found at the given index. .
this file has a complete array-based MultiSet, but not the code need.pdf
this file has a complete array-based MultiSet, but not the code needed to support its Iterator.
Complete the Iterator\'s next() and hasNext() methods.
Solution
Hi, I have implemented required methods.
Please let me know in case of any issue.
import java.util.Collection;
import java.util.Iterator;
import java.util.NoSuchElementException;
public class ArrayMultiSet implements Collection {
/** Array in which the elements in this multiset are stored. */
private E[] _store;
/**
* Array indices below this amount contain the active elements in this collection.
*/
private int _size;
/**
* Modification counter used to preserve the fail-fast nature of its iterators.
*/
private long _modCount;
/**
* Create a new empty multiset.
*/
public ArrayMultiSet() {
_modCount = 0;
clear();
}
/**
* Remove all of the elements within the instance and invalidate any current iterators.
*/
@SuppressWarnings(\"unchecked\")
@Override
public void clear() {
_store = (E[]) (new Object[16]);
_size = 0;
// maintains the class invariant
}
/**
* Update the multiset so that it includes all of the elements from before the call AND the given
element.
*
* @param e Item to be added to this collection.
*/
@SuppressWarnings(\"unchecked\")
@Override
public boolean add(E e) {
// Check if we do not have enough space in the underlying array to store the
// new element
if (_size == _store.length) {
// We do not have space, so create a new larger space (doubling the size
// is the most time efficient)
E[] newStore = (E[]) new Object[_store.length * 2];
// Copy all of the references into the new array
for (int i = 0; i < _store.length; i++ ) {
newStore[i] = _store[i];
}
_store = newStore;
// An easier, more efficient way of coding this (but less useful for
// teaching) would instead be:
// _store = Arrays.copyOf(_store, _store.length * 2);
}
// Add the element to the store
_store[_size] = e;
// Finally, we can increase _size, since this change will no longer violate
// any class invariants.
_size += 1;
return true;
}
/**
* Return true if at least one element in the multiset is equal to the given object. When {@code
obj} is null, it must
* use the {@code ==} operator to perform these checks, but when {@code obj} is not null, the
{@link Object#equals}
* method is used.
*
* @param obj Object (or null) for which we will search
* @return {@code true} if {@code obj} was found; {@code false} if a match could not be
found.
*/
@Override
public boolean contains(Object obj) {
// Only scan through _size, since those are the only \"real\" entries for the
// multiset.
for (int i = 0; i < _size; i++ ) {
// When obj is null, we need to use ==
if ((obj == null) && (_store[i] == null)) {
return true;
}
// Otherwise, we use .equals() to find a match
else if ((obj != null) && obj.equals(_store[i])) {
return true;
}
// No else clause, since the match could be at a higher index!
}
// Checked all VALID indices, so the result must be:
return false;
}
@Override
public int size() {
return _size;
}
/**
* Remove the ele.
Everything needs to be according to the instructions- thank you! SUPPO.pdf
Everything needs to be according to the instructions, thank you!
SUPPORTING CODE:
MyList.java
/**
This interface specifies the basic operations of any list-like object.
This interface contains a variation of the methods of the
standard java.util.List interface.
*/
public interface MyList {
/**
Adds an element at the end of the list.
*/
public void addToEnd(Object o);
/**
Inserts an element at the specified index
Throws NoSuchElementException if index is out of bounds.
*/
public void insertAt(int index, Object o);
/**
Removes the element at the specified index
Throws NoSuchElementException if index is out of bounds.
*/
public void removeAt(int index);
/**
Returns the element at the specified index
Throws NoSuchElementException if index is out of bounds.
*/
public Object getAt(int index);
/**
Returns the size of the list.
@return the number of elements in the list
*/
public int getSize();
/**
Returns a list iterator for this list.
@return a list iterator for this list
*/
public MyListIterator getIterator();
}
MyListIterator.java
/**
A list iterator allows access of a position in a list.
This interface contains a subset of the methods of the
standard java.util.ListIterator interface. The methods for
backward traversal are not included.
*/
public interface MyListIterator
{
/**
Moves the iterator past the next element.
@return the traversed element
*/
Object next();
/**
Tests if there is an element after the iterator
position.
@return true if there is an element after the iterator
position
*/
boolean hasNext();
}
Main.java
// you may use this file to write and run code to test your MyArrayList class
public class Main {
public static void main(String[] args) {
}
}
FILE THAT NEEDS THAT NEEDS CODE:
MyArrayList.java
// Complete the implementation of your MyArrayList class in this file
public class MyArrayList implements MyList {
// Implement the required fields and methods here
private int capacity = 8;
private Object[ ] array = new Object [capacity];
private int size = 0;
@Override
public void add(Object o) {
if (size >= capacity){
Object[] temp = new Object[2*array.length];
for(int i=0;i<size;++i){
temp[i] = array[i];
}
this.capacity = 2*array.length;
array = temp;
array[size++] = o;
return;
}
else
{
array[size++] = o;
}
}
@Override
public int size() {
return size;
}
@Override
public Object at(int index) {
if (index >= capacity)
return null;
else
return array[index];
}
@Override
public void insertAt(int index, Object o) {
if (index >= capacity)
return;
else
{
size++;
for (int x = size - 1; x > index; x--) {
array[x] = array[x - 1];
}
array[index] = o;
}
}
@Override
public void removeAt(int index) {
if (index >= size || size == 0)
return;
else {
Object e = array[index];
for (int x = index; x < this.array.length - 1; x++) {
array[x] = array[x + 1];
}
size--;
}
}
public void ensureCapacity(int minCapacity) {
}
public void trimToSize() {
ensureCapacity(size);
}
// Do not alter the code below
@Override
public MyListIterator getIterator() {
return new MyA.
Use the following data set that compares age to average years lef.docx
Use the following data set that compares age to average "years left to live" to answer the following questions.
Age 10 20 30 40 50 60 70 80 90 100
Years to live 59.2 49.6 40.7 31.9 24.0 17.2 11.6 7.2 4 .4 2.8
a) Show the scatterplot for this data with the least squares regression line. Find R^2. How much of the variation is explained by the regression line?
b) Experiment with the non-linear regressions available on the calculator. Which seem to fit? Show the scatterplot with three different regression curves from the calculator. Label each equation, as well as the applicable R^2.
c) Choose a regression equation to predict how many "years left" a person has if he is now 101 years old. Can he count on celebrating Christmas 2015?
InfoTest.javaInfoTest.javapackage assignment1;
importstatic org.junit.Assert.*;
import org.junit.Test;
publicclassInfoTest{
@Test
publicvoid testInfo(){
Info tempInfo =newInfo();
assertNotNull(tempInfo.tmp);
}
@Test
publicvoid testInsert(){
Info tempInfo =newInfo();
// Insert into an empty list
tempInfo.insert(30);
assertEquals(30, tempInfo.get(0));
// Insert an item to be placed at the beginning of the list
tempInfo.insert(4);
assertEquals(4, tempInfo.get(0));
assertEquals(30, tempInfo.get(1));
// Insert an item to be placed at the end of the list
tempInfo.insert(20);
assertEquals(20, tempInfo.get(1));
assertEquals(30, tempInfo.get(2));
// Insert an which already exists
tempInfo.insert(20);
assertEquals(4, tempInfo.get(0));
assertEquals(20, tempInfo.get(1));
assertEquals(30, tempInfo.get(2));
}
@Test
publicvoid testDelete(){
Info tempInfo =newInfo();
tempInfo.insert(15);
tempInfo.insert(5);
tempInfo.insert(10);
// delete from the middle
tempInfo.delete(10);
assertEquals(5, tempInfo.get(0));
assertEquals(15, tempInfo.get(1));
// delete from the beginning
tempInfo.insert(10);
tempInfo.delete(5);
assertEquals(10, tempInfo.get(0));
assertEquals(15, tempInfo.get(1));
// delete from the end
tempInfo.insert(5);
tempInfo.delete(15);
assertEquals(5, tempInfo.get(0));
assertEquals(10, tempInfo.get(1));
// delete something that does not exist
tempInfo.insert(15);
tempInfo.delete(7);
assertEquals(5, tempInfo.get(0));
assertEquals(10, tempInfo.get(1));
assertEquals(15, tempInfo.get(1));
}
@Test
publicvoid testGet(){
Info tempInfo =newInfo();
tempInfo.insert(15);
tempInfo.insert(5);
tempInfo.insert(10);
// get items at the beginning, middle, and end of the list
assertEquals(5, tempInfo.get(0));
assertEquals(10, tempInfo.get(1));
assertEquals(15, tempInfo.get(2));
// get an unexisting item
assertNull(tempInfo.get(3));
}
@Test
publicvoid testCount(){
Info tempInfo =newInfo();
/ ...
PriorityQueue.cs Jim Mischel using System; using Sy.pdf
// PriorityQueue.cs
//
// Jim Mischel
using System;
using System.Collections;
using System.Collections.Generic;
using System.Runtime.InteropServices;
namespace Mischel.Collections
{
[Serializable]
[ComVisible(false)]
public struct PriorityQueueItem
{
private TValue _value;
public TValue Value
{
get { return _value; }
}
private TPriority _priority;
public TPriority Priority
{
get { return _priority; }
}
internal PriorityQueueItem(TValue val, TPriority pri)
{
this._value = val;
this._priority = pri;
}
}
[Serializable]
[ComVisible(false)]
public class PriorityQueue : ICollection,
IEnumerable>
{
private PriorityQueueItem[] items;
private const Int32 DefaultCapacity = 16;
private Int32 capacity;
private Int32 numItems;
private Comparison compareFunc;
///
/// Initializes a new instance of the PriorityQueue class that is empty,
/// has the default initial capacity, and uses the default IComparer.
///
public PriorityQueue()
: this(DefaultCapacity, Comparer.Default)
{
}
public PriorityQueue(Int32 initialCapacity)
: this(initialCapacity, Comparer.Default)
{
}
public PriorityQueue(IComparer comparer)
: this(DefaultCapacity, comparer)
{
}
public PriorityQueue(int initialCapacity, IComparer comparer)
{
Init(initialCapacity, new Comparison(comparer.Compare));
}
public PriorityQueue(Comparison comparison)
: this(DefaultCapacity, comparison)
{
}
public PriorityQueue(int initialCapacity, Comparison comparison)
{
Init(initialCapacity, comparison);
}
private void Init(int initialCapacity, Comparison comparison)
{
numItems = 0;
compareFunc = comparison;
SetCapacity(initialCapacity);
}
public int Count
{
get { return numItems; }
}
public int Capacity
{
get { return items.Length; }
set { SetCapacity(value); }
}
private void SetCapacity(int newCapacity)
{
int newCap = newCapacity;
if (newCap < DefaultCapacity)
newCap = DefaultCapacity;
// throw exception if newCapacity < NumItems
if (newCap < numItems)
throw new ArgumentOutOfRangeException(\"newCapacity\", \"New capacity is less
than Count\");
this.capacity = newCap;
if (items == null)
{
items = new PriorityQueueItem[newCap];
return;
}
// Resize the array.
Array.Resize>(ref items, newCap);
}
public void Enqueue(PriorityQueueItem newItem)
{
if (numItems == capacity)
{
// need to increase capacity
// grow by 50 percent
SetCapacity((3 * Capacity) / 2);
}
int i = numItems;
++numItems;
while ((i > 0) && (compareFunc(items[(i - 1) / 2].Priority, newItem.Priority) < 0))
{
items[i] = items[(i - 1) / 2];
i = (i - 1) / 2;
}
items[i] = newItem;
//if (!VerifyQueue())
//{
// Console.WriteLine(\"ERROR: Queue out of order!\");
//}
}
public void Enqueue(TValue value, TPriority priority)
{
Enqueue(new PriorityQueueItem(value, priority));
}
private PriorityQueueItem RemoveAt(Int32 index)
{
PriorityQueueItem o = items[index];
--numItems;
// move the last item to fill the hole
PriorityQueueItem tmp = items[numItems];
// If you forget to clear this, you have a potential memory leak.
items[numItems] = default(PriorityQueueItem);
if (num.
Hello need help on this lab- what you need to do is add a code to Arra.pdf
Hello need help on this lab, what you need to do is add a code to ArrayBag methods
equals,duplicateAll,removeDuplicates and remove according to the screenshots and then run it
with the JUnit tests present in ArrayBagTest. I will leave both programs here.
/**
A class of bags whose entries are stored in a fixed-size array.
@author Frank M. Carrano, Timothy M. Henry
* The toString method is overwritten to give a nice display of the items in
* the bag in this format Bag{Size:# [1] [2] [3] [4] }
*
* Extra methods added for lab exercise by Charles Hoot
* //- * @version 5.1
*/
public final class ArrayBag<T> implements BagInterface<T> {
private final T[] bag;
private int numberOfEntries;
private boolean integrityOK = false;
private static final int DEFAULT_CAPACITY = 25;
private static final int MAX_CAPACITY = 10000;
/** Creates an empty bag whose initial capacity is 25. */
public ArrayBag() {
this(DEFAULT_CAPACITY);
} // end default constructor
/** Creates an empty bag having a given capacity.
@param desiredCapacity The integer capacity desired. */
public ArrayBag(int desiredCapacity) {
if (desiredCapacity <= MAX_CAPACITY) {
// The cast is safe because the new array contains null entries
@SuppressWarnings("unchecked")
T[] tempBag = (T[]) new Object[desiredCapacity]; // Unchecked cast
bag = tempBag;
numberOfEntries = 0;
integrityOK = true;
// Test that contents are nulls - OK
// for (int index = 0; index < desiredCapacity; index++)
// System.out.print(bag[index] + " ");
// System.out.println();
} else
throw new IllegalStateException("Attempt to create a bag " +
"whose capacity exceeds " +
"allowed maximum.");
} // end constructor
/** Adds a new entry to this bag.
@param newEntry The object to be added as a new entry.
@return True if the addition is successful, or false if not. */
public boolean add(T newEntry) {
checkIntegrity();
boolean result = true;
if (isArrayFull()) {
result = false;
} else { // Assertion: result is true here
bag[numberOfEntries] = newEntry;
numberOfEntries++;
}
return result;
}
// public <T> T[] toArray() //OK
public T[] toArray() // OK
{
checkIntegrity();
@SuppressWarnings("unchecked")
T[] result = (T[]) new Object[numberOfEntries]; // Unchecked cast
for (int index = 0; index < numberOfEntries; index++) {
result[index] = bag[index];
}
return result;
}
public boolean isEmpty() {
return numberOfEntries == 0;
}
public int getCurrentSize() {
return numberOfEntries;
}
/** Counts the number of times a given entry appears in this bag.
@param anEntry The entry to be counted.
@return The number of times anEntry appears in this ba. */
public int getFrequencyOf(T anEntry) {
checkIntegrity();
int counter = 0;
for (int index = 0; index < numberOfEntries; index++) {
if (anEntry.equals(bag[index])) {
counter++;
}
}
return counter;
}
/** Tests whether this bag contains a given entry.
@param anEntry The entry to locate.
@return True if this bag contains anEntry, or false otherwise. */
public boolean contains(T anEntry) {
checkIntegrity();
retu.
CPP Language Basics - Reference
This presentation explains about the History, cout and cin, Reference in C++
Given below is the code for the question. Since the test files (ment.pdf
Given below is the code for the question. Since the test files (mentioned in question) are missing,
I wrote a small test for the implementation. Output is shown at the end. Please don\'t forget to
rate the answer if it helped. Thank you.
sequence2.cpp
#include \"sequence2.h\"
using namespace CISP430_A2;
sequence::sequence(size_type entry )
{
capacity = entry;
used = 0;
current_index = 0;
data = new value_type[capacity];
}
// COPY CONSTRUCTOR
sequence::sequence(const sequence& entry)
{
data = NULL;
*this = entry;
}
// Library facilities used: cstdlib
// MODIFICATION MEMBER FUNCTIONS
void sequence::start( )
{
current_index = 0;
}
void sequence::advance( )
{
if(is_item())
current_index++;
}
void sequence::insert(const value_type& entry)
{
if(size() == capacity) //check if resizing is needed
{
resize(capacity * 1.1); //increaase by 10%
}
if(is_item() && current_index > 0)
current_index--;
else
current_index = 0;
for(size_type i = size(); i > current_index; i--)
data[i] = data[i-1];
data[current_index] = entry;
used++;
}
void sequence::attach(const value_type& entry)
{
if(size() == capacity) //check if resizing is needed
{
resize(capacity * 1.1); //increaase by 10%
}
if(!is_item())
current_index = used;
else
current_index++;
//make room for new entry by pushing elements after current to right
for(size_type i = size(); i > current_index ; i--)
data[i] = data[i-1];
data[current_index] = entry;
used++;
}
void sequence::remove_current( )
{
if(is_item())
{
for(size_type i = current_index + 1; i < size(); i++)
data[i-1] = data[i];
used--;
}
}
void sequence::resize(size_type new_capacity )
{
if(new_capacity > capacity)
{
value_type *temp = new value_type[new_capacity];
for(int i = 0; i < used; i++)
temp[i] = data[i];
delete []data;
data = temp;
}
}
void sequence::operator =(const sequence &entry)
{
if(data != NULL) delete []data;
capacity = entry.capacity;
used = entry.used;
current_index = entry.current_index;
data = new value_type[capacity];
for(int i = 0; i < used; i++)
data[i] = entry.data[i];
}
// CONSTANT MEMBER FUNCTIONS
sequence::size_type sequence::size( ) const
{
return used ;
}
bool sequence::is_item( ) const
{
return size() != 0 && current_index < used;
}
sequence::value_type sequence::current( ) const
{
return data[current_index];
}
//Destructor
sequence::~sequence()
{
delete []data;
}
output
attach 1 2 3
[1 2 3 ]
advance after print... so should not have current item
is_item() = 0
insert 4 5 6, should appear in front of seq as 6 5 4
print from current
[6 5 4 1 2 3 ]
print from current
[7 5 4 1 2 3 ]
Solution
Given below is the code for the question. Since the test files (mentioned in question) are missing,
I wrote a small test for the implementation. Output is shown at the end. Please don\'t forget to
rate the answer if it helped. Thank you.
sequence2.cpp
#include \"sequence2.h\"
using namespace CISP430_A2;
sequence::sequence(size_type entry )
{
capacity = entry;
used = 0;
current_index = 0;
data = new value_type[capacity];
}
// COPY CONSTR.
Given below is the code for the question. Since the test files (ment.pdf
Given below is the code for the question. Since the test files (mentioned in question) are missing,
I wrote a small test for the implementation. Output is shown at the end. Please don\'t forget to
rate the answer if it helped. Thank you.
sequence2.cpp
#include \"sequence2.h\"
using namespace CISP430_A2;
sequence::sequence(size_type entry )
{
capacity = entry;
used = 0;
current_index = 0;
data = new value_type[capacity];
}
// COPY CONSTRUCTOR
sequence::sequence(const sequence& entry)
{
data = NULL;
*this = entry;
}
// Library facilities used: cstdlib
// MODIFICATION MEMBER FUNCTIONS
void sequence::start( )
{
current_index = 0;
}
void sequence::advance( )
{
if(is_item())
current_index++;
}
void sequence::insert(const value_type& entry)
{
if(size() == capacity) //check if resizing is needed
{
resize(capacity * 1.1); //increaase by 10%
}
if(is_item() && current_index > 0)
current_index--;
else
current_index = 0;
for(size_type i = size(); i > current_index; i--)
data[i] = data[i-1];
data[current_index] = entry;
used++;
}
void sequence::attach(const value_type& entry)
{
if(size() == capacity) //check if resizing is needed
{
resize(capacity * 1.1); //increaase by 10%
}
if(!is_item())
current_index = used;
else
current_index++;
//make room for new entry by pushing elements after current to right
for(size_type i = size(); i > current_index ; i--)
data[i] = data[i-1];
data[current_index] = entry;
used++;
}
void sequence::remove_current( )
{
if(is_item())
{
for(size_type i = current_index + 1; i < size(); i++)
data[i-1] = data[i];
used--;
}
}
void sequence::resize(size_type new_capacity )
{
if(new_capacity > capacity)
{
value_type *temp = new value_type[new_capacity];
for(int i = 0; i < used; i++)
temp[i] = data[i];
delete []data;
data = temp;
}
}
void sequence::operator =(const sequence &entry)
{
if(data != NULL) delete []data;
capacity = entry.capacity;
used = entry.used;
current_index = entry.current_index;
data = new value_type[capacity];
for(int i = 0; i < used; i++)
data[i] = entry.data[i];
}
// CONSTANT MEMBER FUNCTIONS
sequence::size_type sequence::size( ) const
{
return used ;
}
bool sequence::is_item( ) const
{
return size() != 0 && current_index < used;
}
sequence::value_type sequence::current( ) const
{
return data[current_index];
}
//Destructor
sequence::~sequence()
{
delete []data;
}
output
attach 1 2 3
[1 2 3 ]
advance after print... so should not have current item
is_item() = 0
insert 4 5 6, should appear in front of seq as 6 5 4
print from current
[6 5 4 1 2 3 ]
print from current
[7 5 4 1 2 3 ]
Solution
Given below is the code for the question. Since the test files (mentioned in question) are missing,
I wrote a small test for the implementation. Output is shown at the end. Please don\'t forget to
rate the answer if it helped. Thank you.
sequence2.cpp
#include \"sequence2.h\"
using namespace CISP430_A2;
sequence::sequence(size_type entry )
{
capacity = entry;
used = 0;
current_index = 0;
data = new value_type[capacity];
}
// COPY CONSTR.
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.
Your company is preparing to migrate from IPv4 to IPv6, and you are .pdf
Your company is preparing to migrate from IPv4 to IPv6, and you are responsible for
determining the steps that take the company up to deploying a transition technology. Your
company uses Windows 7 and Windows 10 with the lastest service packs for client computers as
well as Windows Server 2012 and Windows Server 2016 for your server infrastructure. You
have determined that there are three critical steps that must occur before deplying a transition
technology: 1. Adopt applications that are independent of IP version. 2. Upgrade name resolution
services. Upgrade client computers. Briefly define the activitied involved in each of these steps.
Solution
Find the below answers as the points:
1.Adopt applications that are independent of IP version
Technically speaking an application cannot be used in wide variety of purposes if the application
is not connected to any other application by the IP address and will have to innovate the other
medium of connection to and fro from the server.
Adopting an app that is independent of IP version can be an independent of protocol specific and
will have the capacity for communicating to the local devices.
We can do this by achieving upgrading the windows name resolution services
2.Upgrade name resolution services.
Making the upgrade of NMS will help you intranslating numerical Internet Protocol addresses
that are used for TCP/IP communications to computer names, which are easier for users to
remember.
With these, the computer names are kept to the IP Address of the systems of the source and
destination hosts.
I fond this way of communication as helpful..
You are burning the latest song you bought on ITunes to a disk. The .pdf
You are burning the latest song you bought on ITunes to a disk. The song is 3 minutes, 23
seconds long and was sampled as a stereo signal (two sides, left and right) at 44.1 kHz using 16-
bit encoding. How much space on the disk does this one track take up? If your CD is
640MBytes, how many songs of this size can you fit on one disk (assume 1 byte is 8-bits in
length)? Remember, you don’t want fractional songs! How many songs could be saved on this
same CD if the sampling rate was 128kHz using 32 bit encoding?
Solution
A)
This stream of audio frames, as a whole, is then subjected to CIRC encoding, which segments
and rearranges the data and expands it with parity bits in a way that allows occasional read errors
to be detected and corrected. CIRC encoding also interleaves the audio frames throughout the
disc over several consecutive frames so that the information will be more resistant to burst errors.
Therefore, a physical frame on the disc will actually contain information from multiple logical
audio frames. This process adds 64 bits of error correction data to each frame. After this, 8 bits
of subcode or subchannel data are added to each of these encoded frames, which is used for
control and addressing when playing the CD.
CIRC encoding plus the subcode byte generate 33-bytes long frames, called \"channel-data\"
frames. These frames are then modulated through eight-to-fourteen modulation (EFM), where
each 8-bit word is replaced with a corresponding 14-bit word designed to reduce the number of
transitions between 0 and 1. This reduces the density of physical pits on the disc and provides an
additional degree of error tolerance. Three \"merging\" bits are added before each 14-bit word for
disambiguation and synchronization. In total there are 33 × (14 + 3) = 561 bits. A 27-bit word (a
24-bit pattern plus 3 merging bits) is added to the beginning of each frame to assist with
synchronization, so the reading device can locate frames easily. With this, a frame ends up
containing 588 bits of \"channel data\" (which are decoded to only 192 bits music).
The frames of channel data are finally written to disc physically in the form of pits and lands,
with each pit or land representing a series of zeroes, and with the transition points—the edge of
each pit—representing 1. A Red Book-compatible CD-R has pit-and-land-shaped spots on a
layer of organic dye instead of actual pits and lands; a laser creates the spots by altering the
reflective properties of the dye.
The audio data stream in an audio CD is continuous, but has three parts. The main portion, which
is further divided into playable audio tracks, is the program area. This section is preceded by a
lead-in track and followed by a lead-out track. The lead-in and lead-out tracks encode only silent
audio, but all three sections contain subcode data streams.
The lead-in\'s subcode contains repeated copies of the disc\'s Table Of Contents (TOC), which
provides an index of the start positions of the track.
More Related Content
Similar to Create a Dynamic Array container with this user interface Ge.pdf
Everything needs to be according to the instructions- thank you! SUPPO.pdf
Everything needs to be according to the instructions, thank you!
SUPPORTING CODE:
MyList.java
/**
This interface specifies the basic operations of any list-like object.
This interface contains a variation of the methods of the
standard java.util.List interface.
*/
public interface MyList {
/**
Adds an element at the end of the list.
*/
public void addToEnd(Object o);
/**
Inserts an element at the specified index
Throws NoSuchElementException if index is out of bounds.
*/
public void insertAt(int index, Object o);
/**
Removes the element at the specified index
Throws NoSuchElementException if index is out of bounds.
*/
public void removeAt(int index);
/**
Returns the element at the specified index
Throws NoSuchElementException if index is out of bounds.
*/
public Object getAt(int index);
/**
Returns the size of the list.
@return the number of elements in the list
*/
public int getSize();
/**
Returns a list iterator for this list.
@return a list iterator for this list
*/
public MyListIterator getIterator();
}
MyListIterator.java
/**
A list iterator allows access of a position in a list.
This interface contains a subset of the methods of the
standard java.util.ListIterator interface. The methods for
backward traversal are not included.
*/
public interface MyListIterator
{
/**
Moves the iterator past the next element.
@return the traversed element
*/
Object next();
/**
Tests if there is an element after the iterator
position.
@return true if there is an element after the iterator
position
*/
boolean hasNext();
}
Main.java
// you may use this file to write and run code to test your MyArrayList class
public class Main {
public static void main(String[] args) {
}
}
FILE THAT NEEDS THAT NEEDS CODE:
MyArrayList.java
// Complete the implementation of your MyArrayList class in this file
public class MyArrayList implements MyList {
// Implement the required fields and methods here
private int capacity = 8;
private Object[ ] array = new Object [capacity];
private int size = 0;
@Override
public void add(Object o) {
if (size >= capacity){
Object[] temp = new Object[2*array.length];
for(int i=0;i<size;++i){
temp[i] = array[i];
}
this.capacity = 2*array.length;
array = temp;
array[size++] = o;
return;
}
else
{
array[size++] = o;
}
}
@Override
public int size() {
return size;
}
@Override
public Object at(int index) {
if (index >= capacity)
return null;
else
return array[index];
}
@Override
public void insertAt(int index, Object o) {
if (index >= capacity)
return;
else
{
size++;
for (int x = size - 1; x > index; x--) {
array[x] = array[x - 1];
}
array[index] = o;
}
}
@Override
public void removeAt(int index) {
if (index >= size || size == 0)
return;
else {
Object e = array[index];
for (int x = index; x < this.array.length - 1; x++) {
array[x] = array[x + 1];
}
size--;
}
}
public void ensureCapacity(int minCapacity) {
}
public void trimToSize() {
ensureCapacity(size);
}
// Do not alter the code below
@Override
public MyListIterator getIterator() {
return new MyA.
Use the following data set that compares age to average years lef.docx
Use the following data set that compares age to average "years left to live" to answer the following questions.
Age 10 20 30 40 50 60 70 80 90 100
Years to live 59.2 49.6 40.7 31.9 24.0 17.2 11.6 7.2 4 .4 2.8
a) Show the scatterplot for this data with the least squares regression line. Find R^2. How much of the variation is explained by the regression line?
b) Experiment with the non-linear regressions available on the calculator. Which seem to fit? Show the scatterplot with three different regression curves from the calculator. Label each equation, as well as the applicable R^2.
c) Choose a regression equation to predict how many "years left" a person has if he is now 101 years old. Can he count on celebrating Christmas 2015?
InfoTest.javaInfoTest.javapackage assignment1;
importstatic org.junit.Assert.*;
import org.junit.Test;
publicclassInfoTest{
@Test
publicvoid testInfo(){
Info tempInfo =newInfo();
assertNotNull(tempInfo.tmp);
}
@Test
publicvoid testInsert(){
Info tempInfo =newInfo();
// Insert into an empty list
tempInfo.insert(30);
assertEquals(30, tempInfo.get(0));
// Insert an item to be placed at the beginning of the list
tempInfo.insert(4);
assertEquals(4, tempInfo.get(0));
assertEquals(30, tempInfo.get(1));
// Insert an item to be placed at the end of the list
tempInfo.insert(20);
assertEquals(20, tempInfo.get(1));
assertEquals(30, tempInfo.get(2));
// Insert an which already exists
tempInfo.insert(20);
assertEquals(4, tempInfo.get(0));
assertEquals(20, tempInfo.get(1));
assertEquals(30, tempInfo.get(2));
}
@Test
publicvoid testDelete(){
Info tempInfo =newInfo();
tempInfo.insert(15);
tempInfo.insert(5);
tempInfo.insert(10);
// delete from the middle
tempInfo.delete(10);
assertEquals(5, tempInfo.get(0));
assertEquals(15, tempInfo.get(1));
// delete from the beginning
tempInfo.insert(10);
tempInfo.delete(5);
assertEquals(10, tempInfo.get(0));
assertEquals(15, tempInfo.get(1));
// delete from the end
tempInfo.insert(5);
tempInfo.delete(15);
assertEquals(5, tempInfo.get(0));
assertEquals(10, tempInfo.get(1));
// delete something that does not exist
tempInfo.insert(15);
tempInfo.delete(7);
assertEquals(5, tempInfo.get(0));
assertEquals(10, tempInfo.get(1));
assertEquals(15, tempInfo.get(1));
}
@Test
publicvoid testGet(){
Info tempInfo =newInfo();
tempInfo.insert(15);
tempInfo.insert(5);
tempInfo.insert(10);
// get items at the beginning, middle, and end of the list
assertEquals(5, tempInfo.get(0));
assertEquals(10, tempInfo.get(1));
assertEquals(15, tempInfo.get(2));
// get an unexisting item
assertNull(tempInfo.get(3));
}
@Test
publicvoid testCount(){
Info tempInfo =newInfo();
/ ...
PriorityQueue.cs Jim Mischel using System; using Sy.pdf
// PriorityQueue.cs
//
// Jim Mischel
using System;
using System.Collections;
using System.Collections.Generic;
using System.Runtime.InteropServices;
namespace Mischel.Collections
{
[Serializable]
[ComVisible(false)]
public struct PriorityQueueItem
{
private TValue _value;
public TValue Value
{
get { return _value; }
}
private TPriority _priority;
public TPriority Priority
{
get { return _priority; }
}
internal PriorityQueueItem(TValue val, TPriority pri)
{
this._value = val;
this._priority = pri;
}
}
[Serializable]
[ComVisible(false)]
public class PriorityQueue : ICollection,
IEnumerable>
{
private PriorityQueueItem[] items;
private const Int32 DefaultCapacity = 16;
private Int32 capacity;
private Int32 numItems;
private Comparison compareFunc;
///
/// Initializes a new instance of the PriorityQueue class that is empty,
/// has the default initial capacity, and uses the default IComparer.
///
public PriorityQueue()
: this(DefaultCapacity, Comparer.Default)
{
}
public PriorityQueue(Int32 initialCapacity)
: this(initialCapacity, Comparer.Default)
{
}
public PriorityQueue(IComparer comparer)
: this(DefaultCapacity, comparer)
{
}
public PriorityQueue(int initialCapacity, IComparer comparer)
{
Init(initialCapacity, new Comparison(comparer.Compare));
}
public PriorityQueue(Comparison comparison)
: this(DefaultCapacity, comparison)
{
}
public PriorityQueue(int initialCapacity, Comparison comparison)
{
Init(initialCapacity, comparison);
}
private void Init(int initialCapacity, Comparison comparison)
{
numItems = 0;
compareFunc = comparison;
SetCapacity(initialCapacity);
}
public int Count
{
get { return numItems; }
}
public int Capacity
{
get { return items.Length; }
set { SetCapacity(value); }
}
private void SetCapacity(int newCapacity)
{
int newCap = newCapacity;
if (newCap < DefaultCapacity)
newCap = DefaultCapacity;
// throw exception if newCapacity < NumItems
if (newCap < numItems)
throw new ArgumentOutOfRangeException(\"newCapacity\", \"New capacity is less
than Count\");
this.capacity = newCap;
if (items == null)
{
items = new PriorityQueueItem[newCap];
return;
}
// Resize the array.
Array.Resize>(ref items, newCap);
}
public void Enqueue(PriorityQueueItem newItem)
{
if (numItems == capacity)
{
// need to increase capacity
// grow by 50 percent
SetCapacity((3 * Capacity) / 2);
}
int i = numItems;
++numItems;
while ((i > 0) && (compareFunc(items[(i - 1) / 2].Priority, newItem.Priority) < 0))
{
items[i] = items[(i - 1) / 2];
i = (i - 1) / 2;
}
items[i] = newItem;
//if (!VerifyQueue())
//{
// Console.WriteLine(\"ERROR: Queue out of order!\");
//}
}
public void Enqueue(TValue value, TPriority priority)
{
Enqueue(new PriorityQueueItem(value, priority));
}
private PriorityQueueItem RemoveAt(Int32 index)
{
PriorityQueueItem o = items[index];
--numItems;
// move the last item to fill the hole
PriorityQueueItem tmp = items[numItems];
// If you forget to clear this, you have a potential memory leak.
items[numItems] = default(PriorityQueueItem);
if (num.
Hello need help on this lab- what you need to do is add a code to Arra.pdf
Hello need help on this lab, what you need to do is add a code to ArrayBag methods
equals,duplicateAll,removeDuplicates and remove according to the screenshots and then run it
with the JUnit tests present in ArrayBagTest. I will leave both programs here.
/**
A class of bags whose entries are stored in a fixed-size array.
@author Frank M. Carrano, Timothy M. Henry
* The toString method is overwritten to give a nice display of the items in
* the bag in this format Bag{Size:# [1] [2] [3] [4] }
*
* Extra methods added for lab exercise by Charles Hoot
* //- * @version 5.1
*/
public final class ArrayBag<T> implements BagInterface<T> {
private final T[] bag;
private int numberOfEntries;
private boolean integrityOK = false;
private static final int DEFAULT_CAPACITY = 25;
private static final int MAX_CAPACITY = 10000;
/** Creates an empty bag whose initial capacity is 25. */
public ArrayBag() {
this(DEFAULT_CAPACITY);
} // end default constructor
/** Creates an empty bag having a given capacity.
@param desiredCapacity The integer capacity desired. */
public ArrayBag(int desiredCapacity) {
if (desiredCapacity <= MAX_CAPACITY) {
// The cast is safe because the new array contains null entries
@SuppressWarnings("unchecked")
T[] tempBag = (T[]) new Object[desiredCapacity]; // Unchecked cast
bag = tempBag;
numberOfEntries = 0;
integrityOK = true;
// Test that contents are nulls - OK
// for (int index = 0; index < desiredCapacity; index++)
// System.out.print(bag[index] + " ");
// System.out.println();
} else
throw new IllegalStateException("Attempt to create a bag " +
"whose capacity exceeds " +
"allowed maximum.");
} // end constructor
/** Adds a new entry to this bag.
@param newEntry The object to be added as a new entry.
@return True if the addition is successful, or false if not. */
public boolean add(T newEntry) {
checkIntegrity();
boolean result = true;
if (isArrayFull()) {
result = false;
} else { // Assertion: result is true here
bag[numberOfEntries] = newEntry;
numberOfEntries++;
}
return result;
}
// public <T> T[] toArray() //OK
public T[] toArray() // OK
{
checkIntegrity();
@SuppressWarnings("unchecked")
T[] result = (T[]) new Object[numberOfEntries]; // Unchecked cast
for (int index = 0; index < numberOfEntries; index++) {
result[index] = bag[index];
}
return result;
}
public boolean isEmpty() {
return numberOfEntries == 0;
}
public int getCurrentSize() {
return numberOfEntries;
}
/** Counts the number of times a given entry appears in this bag.
@param anEntry The entry to be counted.
@return The number of times anEntry appears in this ba. */
public int getFrequencyOf(T anEntry) {
checkIntegrity();
int counter = 0;
for (int index = 0; index < numberOfEntries; index++) {
if (anEntry.equals(bag[index])) {
counter++;
}
}
return counter;
}
/** Tests whether this bag contains a given entry.
@param anEntry The entry to locate.
@return True if this bag contains anEntry, or false otherwise. */
public boolean contains(T anEntry) {
checkIntegrity();
retu.
CPP Language Basics - Reference
This presentation explains about the History, cout and cin, Reference in C++
Given below is the code for the question. Since the test files (ment.pdf
Given below is the code for the question. Since the test files (mentioned in question) are missing,
I wrote a small test for the implementation. Output is shown at the end. Please don\'t forget to
rate the answer if it helped. Thank you.
sequence2.cpp
#include \"sequence2.h\"
using namespace CISP430_A2;
sequence::sequence(size_type entry )
{
capacity = entry;
used = 0;
current_index = 0;
data = new value_type[capacity];
}
// COPY CONSTRUCTOR
sequence::sequence(const sequence& entry)
{
data = NULL;
*this = entry;
}
// Library facilities used: cstdlib
// MODIFICATION MEMBER FUNCTIONS
void sequence::start( )
{
current_index = 0;
}
void sequence::advance( )
{
if(is_item())
current_index++;
}
void sequence::insert(const value_type& entry)
{
if(size() == capacity) //check if resizing is needed
{
resize(capacity * 1.1); //increaase by 10%
}
if(is_item() && current_index > 0)
current_index--;
else
current_index = 0;
for(size_type i = size(); i > current_index; i--)
data[i] = data[i-1];
data[current_index] = entry;
used++;
}
void sequence::attach(const value_type& entry)
{
if(size() == capacity) //check if resizing is needed
{
resize(capacity * 1.1); //increaase by 10%
}
if(!is_item())
current_index = used;
else
current_index++;
//make room for new entry by pushing elements after current to right
for(size_type i = size(); i > current_index ; i--)
data[i] = data[i-1];
data[current_index] = entry;
used++;
}
void sequence::remove_current( )
{
if(is_item())
{
for(size_type i = current_index + 1; i < size(); i++)
data[i-1] = data[i];
used--;
}
}
void sequence::resize(size_type new_capacity )
{
if(new_capacity > capacity)
{
value_type *temp = new value_type[new_capacity];
for(int i = 0; i < used; i++)
temp[i] = data[i];
delete []data;
data = temp;
}
}
void sequence::operator =(const sequence &entry)
{
if(data != NULL) delete []data;
capacity = entry.capacity;
used = entry.used;
current_index = entry.current_index;
data = new value_type[capacity];
for(int i = 0; i < used; i++)
data[i] = entry.data[i];
}
// CONSTANT MEMBER FUNCTIONS
sequence::size_type sequence::size( ) const
{
return used ;
}
bool sequence::is_item( ) const
{
return size() != 0 && current_index < used;
}
sequence::value_type sequence::current( ) const
{
return data[current_index];
}
//Destructor
sequence::~sequence()
{
delete []data;
}
output
attach 1 2 3
[1 2 3 ]
advance after print... so should not have current item
is_item() = 0
insert 4 5 6, should appear in front of seq as 6 5 4
print from current
[6 5 4 1 2 3 ]
print from current
[7 5 4 1 2 3 ]
Solution
Given below is the code for the question. Since the test files (mentioned in question) are missing,
I wrote a small test for the implementation. Output is shown at the end. Please don\'t forget to
rate the answer if it helped. Thank you.
sequence2.cpp
#include \"sequence2.h\"
using namespace CISP430_A2;
sequence::sequence(size_type entry )
{
capacity = entry;
used = 0;
current_index = 0;
data = new value_type[capacity];
}
// COPY CONSTR.
Given below is the code for the question. Since the test files (ment.pdf
Given below is the code for the question. Since the test files (mentioned in question) are missing,
I wrote a small test for the implementation. Output is shown at the end. Please don\'t forget to
rate the answer if it helped. Thank you.
sequence2.cpp
#include \"sequence2.h\"
using namespace CISP430_A2;
sequence::sequence(size_type entry )
{
capacity = entry;
used = 0;
current_index = 0;
data = new value_type[capacity];
}
// COPY CONSTRUCTOR
sequence::sequence(const sequence& entry)
{
data = NULL;
*this = entry;
}
// Library facilities used: cstdlib
// MODIFICATION MEMBER FUNCTIONS
void sequence::start( )
{
current_index = 0;
}
void sequence::advance( )
{
if(is_item())
current_index++;
}
void sequence::insert(const value_type& entry)
{
if(size() == capacity) //check if resizing is needed
{
resize(capacity * 1.1); //increaase by 10%
}
if(is_item() && current_index > 0)
current_index--;
else
current_index = 0;
for(size_type i = size(); i > current_index; i--)
data[i] = data[i-1];
data[current_index] = entry;
used++;
}
void sequence::attach(const value_type& entry)
{
if(size() == capacity) //check if resizing is needed
{
resize(capacity * 1.1); //increaase by 10%
}
if(!is_item())
current_index = used;
else
current_index++;
//make room for new entry by pushing elements after current to right
for(size_type i = size(); i > current_index ; i--)
data[i] = data[i-1];
data[current_index] = entry;
used++;
}
void sequence::remove_current( )
{
if(is_item())
{
for(size_type i = current_index + 1; i < size(); i++)
data[i-1] = data[i];
used--;
}
}
void sequence::resize(size_type new_capacity )
{
if(new_capacity > capacity)
{
value_type *temp = new value_type[new_capacity];
for(int i = 0; i < used; i++)
temp[i] = data[i];
delete []data;
data = temp;
}
}
void sequence::operator =(const sequence &entry)
{
if(data != NULL) delete []data;
capacity = entry.capacity;
used = entry.used;
current_index = entry.current_index;
data = new value_type[capacity];
for(int i = 0; i < used; i++)
data[i] = entry.data[i];
}
// CONSTANT MEMBER FUNCTIONS
sequence::size_type sequence::size( ) const
{
return used ;
}
bool sequence::is_item( ) const
{
return size() != 0 && current_index < used;
}
sequence::value_type sequence::current( ) const
{
return data[current_index];
}
//Destructor
sequence::~sequence()
{
delete []data;
}
output
attach 1 2 3
[1 2 3 ]
advance after print... so should not have current item
is_item() = 0
insert 4 5 6, should appear in front of seq as 6 5 4
print from current
[6 5 4 1 2 3 ]
print from current
[7 5 4 1 2 3 ]
Solution
Given below is the code for the question. Since the test files (mentioned in question) are missing,
I wrote a small test for the implementation. Output is shown at the end. Please don\'t forget to
rate the answer if it helped. Thank you.
sequence2.cpp
#include \"sequence2.h\"
using namespace CISP430_A2;
sequence::sequence(size_type entry )
{
capacity = entry;
used = 0;
current_index = 0;
data = new value_type[capacity];
}
// COPY CONSTR.
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.
Similar to Create a Dynamic Array container with this user interface Ge.pdf (20)
Everything needs to be according to the instructions- thank you! SUPPO.pdf
Everything needs to be according to the instructions- thank you! SUPPO.pdf
Use the following data set that compares age to average years lef.docx
Use the following data set that compares age to average years lef.docx
PriorityQueue.cs Jim Mischel using System; using Sy.pdf
PriorityQueue.cs Jim Mischel using System; using Sy.pdf
Hello need help on this lab- what you need to do is add a code to Arra.pdf
Hello need help on this lab- what you need to do is add a code to Arra.pdf
Given below is the code for the question. Since the test files (ment.pdf
Given below is the code for the question. Since the test files (ment.pdf
Given below is the code for the question. Since the test files (ment.pdf
Given below is the code for the question. Since the test files (ment.pdf
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 sup.pdf
More from sktambifortune
Your company is preparing to migrate from IPv4 to IPv6, and you are .pdf
Your company is preparing to migrate from IPv4 to IPv6, and you are responsible for
determining the steps that take the company up to deploying a transition technology. Your
company uses Windows 7 and Windows 10 with the lastest service packs for client computers as
well as Windows Server 2012 and Windows Server 2016 for your server infrastructure. You
have determined that there are three critical steps that must occur before deplying a transition
technology: 1. Adopt applications that are independent of IP version. 2. Upgrade name resolution
services. Upgrade client computers. Briefly define the activitied involved in each of these steps.
Solution
Find the below answers as the points:
1.Adopt applications that are independent of IP version
Technically speaking an application cannot be used in wide variety of purposes if the application
is not connected to any other application by the IP address and will have to innovate the other
medium of connection to and fro from the server.
Adopting an app that is independent of IP version can be an independent of protocol specific and
will have the capacity for communicating to the local devices.
We can do this by achieving upgrading the windows name resolution services
2.Upgrade name resolution services.
Making the upgrade of NMS will help you intranslating numerical Internet Protocol addresses
that are used for TCP/IP communications to computer names, which are easier for users to
remember.
With these, the computer names are kept to the IP Address of the systems of the source and
destination hosts.
I fond this way of communication as helpful..
You are burning the latest song you bought on ITunes to a disk. The .pdf
You are burning the latest song you bought on ITunes to a disk. The song is 3 minutes, 23
seconds long and was sampled as a stereo signal (two sides, left and right) at 44.1 kHz using 16-
bit encoding. How much space on the disk does this one track take up? If your CD is
640MBytes, how many songs of this size can you fit on one disk (assume 1 byte is 8-bits in
length)? Remember, you don’t want fractional songs! How many songs could be saved on this
same CD if the sampling rate was 128kHz using 32 bit encoding?
Solution
A)
This stream of audio frames, as a whole, is then subjected to CIRC encoding, which segments
and rearranges the data and expands it with parity bits in a way that allows occasional read errors
to be detected and corrected. CIRC encoding also interleaves the audio frames throughout the
disc over several consecutive frames so that the information will be more resistant to burst errors.
Therefore, a physical frame on the disc will actually contain information from multiple logical
audio frames. This process adds 64 bits of error correction data to each frame. After this, 8 bits
of subcode or subchannel data are added to each of these encoded frames, which is used for
control and addressing when playing the CD.
CIRC encoding plus the subcode byte generate 33-bytes long frames, called \"channel-data\"
frames. These frames are then modulated through eight-to-fourteen modulation (EFM), where
each 8-bit word is replaced with a corresponding 14-bit word designed to reduce the number of
transitions between 0 and 1. This reduces the density of physical pits on the disc and provides an
additional degree of error tolerance. Three \"merging\" bits are added before each 14-bit word for
disambiguation and synchronization. In total there are 33 × (14 + 3) = 561 bits. A 27-bit word (a
24-bit pattern plus 3 merging bits) is added to the beginning of each frame to assist with
synchronization, so the reading device can locate frames easily. With this, a frame ends up
containing 588 bits of \"channel data\" (which are decoded to only 192 bits music).
The frames of channel data are finally written to disc physically in the form of pits and lands,
with each pit or land representing a series of zeroes, and with the transition points—the edge of
each pit—representing 1. A Red Book-compatible CD-R has pit-and-land-shaped spots on a
layer of organic dye instead of actual pits and lands; a laser creates the spots by altering the
reflective properties of the dye.
The audio data stream in an audio CD is continuous, but has three parts. The main portion, which
is further divided into playable audio tracks, is the program area. This section is preceded by a
lead-in track and followed by a lead-out track. The lead-in and lead-out tracks encode only silent
audio, but all three sections contain subcode data streams.
The lead-in\'s subcode contains repeated copies of the disc\'s Table Of Contents (TOC), which
provides an index of the start positions of the track.
CASE 3-12 Information System Project Steering Committee The Informat.pdf
CASE 3-12 Information System Project Steering Committee The Information System Steering
Committee in conjunction with administration has decided to implement a computerized
physician order entry (CPOE) system. A separate CPOE committee is being created to control
the implementation of the CPOE with the Information System Steering Committee providing
guidance. As project manager, you have been given the responsibility for selecting the
appropriate individuals—those with a vested interest in the CPOE—for inclusion on this
committee.
1. Identify the departments that should be represented on the CPOE committee.
2. Identify whom the CPOE committee should report to.
3. Recommend the frequency you would recommend that the CPOE committee report to the
Information System Steering Committee.
4. Identify the responsibilities the CPOE committee should have.
Solution
1. The departments that must be represented in the committee are Physicians and clinicians, IT
staff, staff from clinical and other departments, training personnel, Governing authorities,
government bodies and regulatory agencies.
2.CPOE committee should report to the project head overseeing the implementation of the
project. This person should be the head ofInformation System Project Steering Committee, and a
seasoned healthcare practitioner with commercial acumen and exposure to such projects.
3. The frequency of report would depend upon the project duration. For a project duration of six
months, it should be monthly for first three months, fortnightly for next two months and weekly
thereafter.
4.Responsibilities of CPOE committee.
(a) Identifying the issues with the physicians and clinicians as well as those with the IT experts
and act as a bridge between them.
(b) Identify the stakeholders and communicate with them to include them in decision making.
(c) Ensure that compliance with the regulations are met.
(d) Track the progress of the project with the schedule.
(e) Continuous evaluation of the outcomes through trials during the project and take corrective
actions.
(f) Final evaluation and mapping it with project objectives. Record learnings..
Can you date the latest financial crisis in the United States or in .pdf
Can you date the latest financial crisis in the United States or in Europe?Are there reasons to
think that these crises might have been related? Why?
Solution
The last financial crisis both in the United States as well as in UK is the financial crisis of 2008.
This is a global financial crisis and the crisises are related to one another where the factors
contributing are same including the asset liability mismatch, mortgages of banks etc. Sometimes,
it is also said one financial crisis is a warning to the next crisis on the whole..
B1. State the components of organization. Give good examples to justi.pdf
B1. State the components of organization. Give good examples to justify your answer.
Solution
Components of organisation are
1: Purpose: This element is all about a proper mission and objectives of an organisation. ( eg: To
become a market leader in electrnoc industry). Inorder to achieve the purpose organisation has to
set their objectives clearly.
2: Organisation structure: The structure is about the heirarch of organisation ( like formal,
informal, matrix , open etc). Some organisation are having very tight organisation structure and
some will be very flexible and communication flow is based on the organisation structure.
3: Division of labour: This division comprises of activities to be done and responbilities to be
fulfiled based on the roles given. ( like shop floor staffs should do the plant activities, logisitcs
teams should provide the facilties and transportation of required materials etc)
4: Co ordinated effort: Mutual effort and colloborative system is required to produce the desired
result in any organisation. It helps in sustainability of organisation..
Assignment of SOS operating systemThe file lmemman.c has one incom.pdf
Assignment of SOS operating system
The file lmemman.c has one incomplete function with TODO blocks. Finish these blocks to
complete the assignment.
bool init_logical_memory(PCB *p, uint32_t code_size);
This function initializes a process’ logical address space. This involves allocating frames for the
process code, stacks, page directory and page tables, and then setting them up. The PCB is
passed in the argument p, and the number of bytes in the process’ code and data is in the
argument code_size. The function should return TRUE if all goes well; otherwise FALSE. Any
frames allocated in the function must be freed if FALSE is returned.
This should be able to work under SOS operating system.
Here is the lmenman.c file:
////////////////////////////////////////////////////////
// The NAIVE Logical Memory Manager
//
// Divides memory into 4KB pages and allocates from them
#include \"kernel_only.h\"
// kernel page directory will be placed at frame 257
PDE *k_page_directory = (PDE *)(0xC0101000);
// page table entries for the 768th page directory entry will be placed
// at frame 258; 768th entry corresponds to virtual address range
// 3GB to 3GB+4MB-1 (0xC0000000 to 0xC03FFFFF)
PTE *pages_768 = (PTE *)(0xC0102000);
/*** Initialize logical memory for a process ***/
// Allocates physical memory and sets up page tables;
// we need to allocate memory to hold the program code and
// data, the stack, the page directory, and the required
// page tables
// called by runprogram.c; this function does not load the
// program from disk to memory (done in scheduler.c)
bool init_logical_memory(PCB *p, uint32_t code_size) {
// TODO: see background material on what this function should
// do. High-level objectives are:
// 1) calculate the number of frames necessary for program code,
// user-mode stack and kernel-mode stack
// 2) allocate frames for above
// 3) determine beginning physical address of program code,
// user-mode stack and kernel-mode stack
// 4) calculate the number of frames necessary for page directory
// and page tables
// 5) allocate frames for above
// 6) set up page directory and page tables
// 7) set mem struct in PCB: start_code, end_code, start_stack,
// start_brk, brk, and page_directory
// Return value: TRUE if everything goes well; FALSE if allocation
// of frames failed (you should dealloc any frames that may
// have already been allocated before returning)
// TODO: uncomment following line when you start working in
// this function
return FALSE;
}
/*** Initialize kernel\'s page directory and table ***/
void init_kernel_pages(void) {
uint32_t i;
// set up kernel page directory (users cannot touch this)
for (i=0; i<1024; i++) k_page_directory[i] = 0;
k_page_directory[768] = ((uint32_t)pages_768-KERNEL_BASE) | PDE_PRESENT |
PDE_READ_WRITE;
// map virtual (0xC0000000--0xC03FFFFF) to physical (0--0x3FFFFF)
for (i=0; i<1024; i++)
pages_768[i] = (i*4096) | PTE_PRESENT | PTE_READ_WRITE | PTE_GLOBAL;
// load page directory
load_CR3((uint32_t)k_pa.
Any kind of help would gladly be appreciated. (C-programming)Probl.pdf
Any kind of help would gladly be appreciated. (C-programming)
Problem:
Charity Runs are a popular way for organizations to raise awareness and get fit at the same time.
However, these events can be tough to organize. The Princess Half Marathon Weekend, for
example, has as many as 40,000 runners raising money and awareness for the Children’s Miracle
Network Hospitals. People can run both 5ks and 10ks and there’s even a children’s race.
After nearly a semester of C programming, you\'ve decided that you\'d like to donate your skills
to create a program that organizes the typical activities for charity run weekend. In particular,
your program will help manage the following:
1) Individual Registration
2) Team Registration
3) Running Events
4) Donation Totals
Your program will log the number of teams and individual who are signed up for the different
races, process the racing events to see who has the fastest times, and track the total amount of
money raised by teams and individuals for charity.
Header Specification
To facilitate grading, include in your header comment which portions of the assignment you
have completed. You must complete all portions in order to earn full credit, but partial credit is
available for completing some of the steps. The primary steps are as follows:
(1) Processing Individual Registrations
(2) Processing Team Registrations
(3) Processing the running events
(4) Calculating total donations
If your comment is accurate, meaning that you pass the appropriate tests cases corresponding to
your choice, you\'ll earn 10 points. If your comment is roughly accurate, meaning that you
sincerely attempted the items you listed, and most of them work minus a tiny bug, then you\'ll
get 5 of these points. If your comment isn\'t accurate to a reasonable degree, you\'ll get 0 of these
points.
The reason this is here is because it\'s very important to communicate to others accurately what
you\'ve accomplished and what is left to accomplish. This sort of honesty and ability to appraise
your own work is a critical skill in a job.
Program Details
Individual RegistrationDetails
There are a two registration windows: early registration and regular registration. Prices for
registering early and regularly will be given. Each individual will have a unique number and
must be processed separately to record their name, age, running event, and donations raised. The
maximum number of runners for our program will be 10000.
Team RegistrationDetails
Teams may be created and registered to sign up several participators at once. Teams may only
sign up during early registration, have between 5 and 50 members, and must pay the team
registration fee for every member on the team. Teams should be recorded with their name and
number of members. Each member of the team still needs to be recorded with their name, age,
running event, and donations raised. We can organize at most 200 teams.
Running EventsDetails
There will be three running events: a 5k race, a 10k race, .
Which of the following solutions will turn red litmus blue pOH 1.pdf
Which of the following solutions will turn red litmus blue?
pOH 11.50,
2.3 × 10−4 M [OH−],
pH 5.50 or
4.1 × 10−5 M [H3O+]
Solution
 2.3 × 10−4 M [OH−],Â
tip: pH = 14 - pOH = 14 -(-log(2.3x 10-4) = 14-3.64 = 10.36 > pH = 7. The solution is basic and
thus has turn red litmus blue. all the other cases, pH < 7 and thus they are acidic..
What serves as the most reliable source of information about the .pdf
What serves as the most reliable source of information about the world in general?
What serves as the most reliable source of information about the world in general?
Solution
Answer: Things that one learns from others
Own observations may be wrong; own interest may not be adequate unless this is able to produce
information; therefore, learning from others could be a good source because this is a general
tendency – we used to learn if someone teaches us..
What is the difference between the terms “earnings and profits” and .pdf
What is the difference between the terms “earnings and profits” and “retained earnings”?
Solution
Earnings and profits indicates the current year profit earned from the operations while retained
earnings indicate the profits of previous year adjusted with dividends and other distributions
made to stockholders from the profits earned till date. Retained earnings is part of the capital of
the busienss which increases when the company earns profits and decreases when have losses or
pay out dividend.
what are three effects of transistor scaling on computer architectur.pdf
what are three effects of transistor scaling on computer architecture development. Please also
explain these effects in details and make a comparison between old-time computer architecture
and current computer architecture
Solution
Computer architecture: is a specification detailing how a set of software and hardware
technology standards interact to form a computer system or platform. In short, computer
architecture refers to how a computer system is designed and what technologies it is compatible
with.
Let’s understand Moore\'s Law in simple words:
Every two years the Smartphone you are carrying, the computer or tablet you are using or your
TV at home gets twice as powerful/smart while the cost of that computing power dramatically
reduces over time.
Now coming to question, effects of Computer architecture:
1. Higher Level of integration enables more complex architectures.
Ex: On chip memory, super scalar processor.
2. Higher level of integration enables more application specific architectures.
Ex: A variety of microcontrollers
3. Larger logic capacity and higher performance allow more freedom in architecture trade-off.
Comp arch can focus more on what should be done rather than worrying about physical
constraints.
4. Lower cost generates a wider mater. Profitability and competition stimulates arch innovations.
Generations of Computer:
First Generation (1940-1956) Vacuum Tubes: The first computers used vacuum tubes for
circuitry and magnetic drums for memory, and were often enormous, taking up entire rooms.
They were very expensive to operate and in addition to using a great deal of electricity, the first
computers generated a lot of heat, which was often the cause of malfunctions.
Second Generation (1956-1963) Transistors
Transistors replace vacuum tubes and ushered in the second generation of computers. The
transistor was invented in 1947 but did not see widespread use in computers until the late 1950s.
The transistor was far superior to the vacuum tube, allowing computers to become smaller,
faster, cheaper, more energy-efficient and more reliable than their first-generation predecessors.
Third Generation (1964-1971) Integrated Circuits
The development of the integrated circuit was the hallmark of the third generation of computers.
Transistors were miniaturized and placed on silicon chips, called semiconductors, which
drastically increased the speed and efficiency of computers.
Fourth Generation (1971-Present) Microprocessors
The microprocessor brought the fourth generation of computers, as thousands of integrated
circuits were built onto a single silicon chip. What in the first generation filled an entire room
could now fit in the palm of the hand. The Intel 4004 chip, developed in 1971, located all the
components of the computer—from the central processing unit and memory to input/output
controls—on a single chip.
Fifth Generation (Present and Beyond) Artificial Intelligence
Fifth generation computing devices, based on artificial intellig.
What are some of the motives for employee theft What are some .pdf
What are some of the motives for employee theft?
What are some of the motives for employee theft?
Solution
ANSWER:
There can be numerous motives of executives to commit theft discussed as follows:
1) Personal needs:
The personal requirements of the executive’s may drive them to commit a theft. The reason is
that the executives have a lifestyle they need to uphold in the company and in the society. They
will not prefer a situation where they feel inferior to others and thus will use the opportunity
accorded to them to make more money
2) The pressure on the individual
It entails to the pressure on the individual on emanating from a financial situation such as debts,
as well as the shortfall regarding the revenues. Majority of the executive see such problems as
difficult to get solved via the proper methods, therefore resorting to engaging in fraudulent
activities to solve the financial challenges
3) Company requirements
The executives are required to drive the company to success or out of difficult times. Thus there
is a need to show the good performance, as a poor performance is an indicator of poor leadership
in the firm. For its avoidance few executives will inflate some of the results to satisfy the
shareholders requirement, who may have pressured them much to produce certain results in a
given time frame.
4) Comparison with peers
The feel of self-worth among the executives in the company is a major motivator of the
executives to commit fraud. It occurs generally when they compare themselves across their
industry peers as well as how much they are receiving as a reward in their firm. This comparison
generates pressure on the executives as a result they wanting to be equal with their peers
commits theft
5) Opportunity factor
The opportunity factor is natural, because executives may receive number of opportunities in the
company as they understand the internal controls and as well as the command structure of the
organization
6) Ability to rationalize crime
Ability to rationalize crime is a stage of theft triangle calls for the executive officer to make use
of their cognitive skills in order to justify their crime activities within the company. Their
explanations tend to be so convincing to the rest of the company\'s members, that their action
gets seen as just normal
7) Rational approach
Rationalization has its own significance as again human is capable of creating any kind of
justification for their theft activities, thus the executives often don’t consider themselves as
criminals. However they think that they are taking a rational approach..
Twitter is a popular social media. It allows its users to exchange tw.pdf
Twitter is a popular social media. It allows its users to exchange tweets (short messages of a
maximum of 140 Characters). Write a program that prompts the user for a tweet and then flips
the letter-case of each letter in the tweet. Apply the flipping code again to get the original
message If the user enters an empty tweet then the program shall show the message \"Empty
tweet !\". Refer to the sample input/output given below. Your program should have one c-string
(call it twt []).
Solution
#include
#include
#include
using namespace std;
void flipCase( char* s )
{
for(int i=0;s[i];i++)
if (islower(s[i])) s[i] = toupper(s[i]); //if letter is in uppercase convert to lowercase . If letter
is lowercase convert to upper case
else s[i] = tolower(s[i]);
}
int main()
{
char twt[ 100 ];
cout << \"Enter your tweet: \";
cin.getline(twt,141);
flipCase(twt);
cout<<\"\ Tweet after flipping letter-case is: \";
cout << twt << endl;
cout<<\"\ Tweet after flipping letter-case again is: \";
flipCase(twt);
cout << twt << endl;
return 0;
}
output:.
A. State the domai and ranga. 1. y find the inverse and state the dom.pdf
A. State the domai and ranga. 1. y find the inverse and state the domamamd Tange of f Domain:
Rang Graph and sraph.
Solution
f(x) = 3+ 2^x
Domain : ( - inf , inf)
Range : ( 2 , inf )
Inverse : y = 3 +2^x
Plug x= y and y = x:
x = 3 + 2^y
(x -3) = 2^y
take ln on both sides: ln( x-3 ) = yln2
y = ln2( x-3)
f^-1(x) = ln2( x-3)
Range : ( - inf , inf)
Domain : ( 2 , inf ).
The Puritan faith community shaped the New England colonies in virtu.pdf
The Puritan faith community shaped the New England colonies in virtually every way during
much of the seventeenth century. Discuss the ideas and religious principles that characterized
Puritanism, and explore the significant differences between the separatists led by William
Bradford, who founded Plymouth colony, and the group of Puritians led by John Winthrop, who
founded Massachusetts Bay colony.
Solution
Plymouth Colony and the Massachusetts Bay Colony were two distinct Puritan
commonwealths.he Plymouth Colony was founded by the Pilgrims, who arrived in
Massachusetts on the Mayflower in 1620 and celebrated the first Thanksgiving, which was a
harvest festival, the following year. The colony lasted from 1620 to 1691.
Plymouth ultimately proved less successful than its neighbor to the north, the Massachusetts Bay
Colony, which was founded 10 years later in 1630 and also ceased to exist in 1691. When people
talk about Puritan influence in America, they are referring, albeit usually unwittingly, to the
Puritanism of the Massachusetts Bay Colony, not Plymouth or the Pilgrims.
Boston was the chief center of the Bay Colony. Colonial jurisdiction eventually extended to
much of present-day New England, including portions of Massachusetts, Maine, New
Hampshire, Rhode Island, and Connecticut. The Colony’s leading figure was John Winthrop.
William Bradford’s Plymouth Colony was from the start more tolerant than its neighbor.
Although witchcraft, for example, was a capital offense in Plymouth, only two charges for the
crime were ever brought. The first was dismissed before trial; the second resulted in the acquittal
of the defendant and punishment of the accuser for making false allegations.
But even Massachusetts Bay itself was a remarkably argumentative and politically contentious
society, where authority was frequently and vigorously contested. Despite his great natural
leadership gifts and authoritarian style, for example, John Winthrop was deposed more than
once.
The two colonies differed in other important ways.
The Massachusetts Bay colonists were committed to reforming the Church of England from
within rather than separating from it. The Church of England remained the official church.
However, as a practical matter, there was no ecclesiastical hierarchy to sustain a state church
bureaucracy. During the entire colonial period, for example, not a single Anglican bishop was
appointed to rule the American flock.
Thus, over time, migration from England brought about de facto separatism in Massachusetts
Bay, and the adoption of Plymouth Colony’s Congregational form of church polity, wherein each
local congregation controlled its own affairs.
There were also significant wealth and status differences between the two populations.
The Pilgrims at Plymouth were mostly farmers and artisans. The colonists of Massachusetts Bay,
in contrast, were better educated, more economically and socially successful, and brought with
them educated clergy to provide leader.
savings account d. the value of the shares is based on the amount of .pdf
savings account d. the value of the shares is based on the amount of money Drew owes his
creditors. 30. Ali and Alecia are promoters of a new u-pick farm named AA-Apples. Before
incorporating, Ali and Alecia draft a document that explains the rights of shareholders, the
structure of the business, and how many shares form a quorum. This document is named a.
articles of incorporation. b. bylaws c. articles of organization. d. a partnership agreement. 31.
Wild &Scenic; River Tours, Inc., is a corporation. Wild & Scenic has the implie power to a. sell
the majority of assets. b. replace the board of directors. c. change the bylaws. d. perform all acts
reasonably appropriate and necessary to accomplishi corporate purposes
Solution
30. The article of incorporation is the foundation document for any organization. It contains the
essential details on the incorporation of any organization. It contains details on how and why the
organization has come into existence, what are the terms and conditions relating to incorporation,
who are the people involved in the incorporation.
It also explains the very detailed view of who all the shareholders, their rights, nature, and
structure of the business and also what are the requirements on the quorum required for any
decision making.
31. Any corporation which has been formed and registered as a corporation has all the power to
perform all acts which are reasonable, appropriate and necessary to achieve/accomplish what has
been laid down in the mission statement/vision of the corporation.
Thus Option D is the correct answer..
QuestionIt was reported on June 11, 1997, by NBC Nightly News that.pdf
Question
It was reported on June 11, 1997, by NBC Nightly News that according to a study completed,
women are genetically predisposed to developing interpersonal skills such as perceiving the
attitudes and needs of others.
1. Which personality dimensions relate to emotional intelligence, such as sensitivity to the needs
of others mentioned in the case?
2. Does culture affect development of certain personality characteristics by gender? If so, how?
3. Do you think that this phenomenon has changed over time? In which countries do you think
the conclusion reported in the case is true today?
Solution
1. there are five types of personality dimensions, they are openness to experience,
conscientiousness, extraversion, agreeableness and neuroticism.
openness to experience, conscientiousness, extraversion, agreeableness, and neuroticism. and the
given situation comes under openness to experience.
2. yes, culture diefinitely influece gender to think or the way they think. because in some cultures
women is only treated as an instrment to serve the male people. in some cultures, they are treated
like as nature, so, the way they treat and grown will helps them to think, to act and to react.
3. usually in developed countries, we can observe the above said changes. the people who are
educated, and financially and economically better than other nations, they are treating women in
good manner. in developing and under developed nations, it is still a problem only..
946 LTE Labs Le.chateliers-lab.pdf Before beginning this experiment.pdf
9:46 LTE Labs Le.chateliers-lab.pdf Before beginning this experiment in the laboratory you
should be alieto answer the following questions PRE LAB QUESTIONS 1. Beiefly stabe
LeChidelier\'s Principle. 2. Consider the following equilibrium In which direction will the
equilibrium shit if a. HSO,ibs added? Why? b. Buicl, is added? Why C NaCl is added? Why d.
Heat is added? Why? Consider the folewing equilibrium foe nitous acid, HNOs,a weak acid In
which direction will the equilibrium shift if a NaOH is added? b. NaNO, is added HCl is added?
d. The acid solution is made more dilute? Complete and balance the following equations and
then wrae balanced net ionic equations. 4· 3. On the busis of LeChitelier\'s Principle, explain
why Ag-C0 disos when HNO, is added Previous Next Dashboard Calendar To DoNotifications
Inbox
Solution
Answer:
1. Le Chtelier\'s principle states that if a dynamic equilibrium is disturbed by changing the
conditions, the position of equilibrium shifts to counteract the change to re-establish a new
equilibrium
2.a) H2SO4 is added:
the equilibrium shifts to the left because as there are more sulfate ions are added.
b)BaCl2 is added
The equilibrium shifts to the left because as there are more Ba^+2 are added.
c) NaCl is added
There is no shift in the equilibrium. As there are no Na^+1 and Cl^-1 are present in the
equilibrium mixture
d) Heat is added
The equilibrium will shift to the right. As the forward reaction is endothermic, when the heat is
added, the reaction will favours the product
3. a) NaOH is added
The equilibrium will shift to the left because as there are more OH^-1 ions added, it will react
with H+ present in the right side and forms more water.
b)NaNO2 is added
The equilibrium will shift to the left because the more NO2^-1 ions added, it forms more HNO2
by reacts with H3O^+1.
c) HCl is added
The equilibrium will shift to the right because more H+ is added in the equilibrium mixture
d) The acid solution is made more dilute
The equilibrium will shift to the right as there are more water is added.
4 a) AgNO3 (aq) + HCl (aq) <<>> AgCl (s) + HNO3 (aq)
Net ionic equation: Ag^+1 (aq) + Cl^-1 (aq) >> AgCl (s)
b) NH3(aq) + HCl (aq) <<<>> NH4Cl (s)
Net equation: NH3 (aq) + H^+1 (aq) + Cl^-1 (aq) > NH4Cl(s)
c) Na2CO3 (aq) + 2HNO3 (aq) <<>> H2O(l) + 2NaNO3 (aq) + CO2 (g)
Net ionic equation: CO3 ^-2 (aq) + 2H+ (aq) >> H2O (l) + CO2 (g)
5. Ag2CO3 (s) + 2HNO3 (aq) <<<>>> 2AgNO3 (aq) + H2O (l) + CO2(g)
Ag2CO3 is a solid . When adding nitric acid to silver carbonate, it forms soluble silver nitrate..
Prove that the T_i-property is a topological property for i = 0So.pdf
Prove that the T_i-property is a topological property for i = 0
Solution
Hausdorff spaces do not have in general the homotopy type of any finite space. Recall that a
topological space
Xsatisfies the T1- separation axiom if for any two distinct points x, y X there exist open setsu
and V such that
x U,y V , y / U, x / V . This is equivalent to saying that the points are closed in X. AllHausdorff
spaces are
T1,but the converse is false..
4. Refer to the table of Gini coefficients in the Added Dimension box.pdf
4. Refer to the table of Gini coefficients in the Added Dimension box entitled \"The Gini
Coefficient\" in your textbook to answer the following questions: Is income generally more or
less equally distributed in the United States compared to income distribution in other countries?
a. b. Look also at Figure 18-4 in your text. In terms of per capita income, how does the United
States compare to other countries? c. What is more important, the distribution of income or the
level of income?
Solution
a) Income is less equally distributed in US as compared to other countries, which has increased
significantly since the 1970s after several decades of stability. In other words, there has been an
increase in the share of nation\'s income received by higher income households. The U.S. ranks
behind than 70% of countries who have a more equal income distribution than the US.
b) Compared to the other nations per capita income of US is much better than majority of the
other countries (more than its peers or more than other advanced countries), it is more than
Germany, France, United Kingdom, and Italy. US (per capita PPP) is ranked at 9th position
according to world bank and US (per capita nominal) ranked at 7th position.
c) The distribution of income is of enormous importance than the income level. As it influences
the structure of the society while determining the poverty level of it for any given level of GDP.
And also because of the fact that income distribution among the population provides a method of
measurement employed in the determination of the dispersion of incomes..
More from sktambifortune (20)
Your company is preparing to migrate from IPv4 to IPv6, and you are .pdf
Your company is preparing to migrate from IPv4 to IPv6, and you are .pdf
You are burning the latest song you bought on ITunes to a disk. The .pdf
You are burning the latest song you bought on ITunes to a disk. The .pdf
CASE 3-12 Information System Project Steering Committee The Informat.pdf
CASE 3-12 Information System Project Steering Committee The Informat.pdf
Can you date the latest financial crisis in the United States or in .pdf
Can you date the latest financial crisis in the United States or in .pdf
B1. State the components of organization. Give good examples to justi.pdf
B1. State the components of organization. Give good examples to justi.pdf
Assignment of SOS operating systemThe file lmemman.c has one incom.pdf
Assignment of SOS operating systemThe file lmemman.c has one incom.pdf
Any kind of help would gladly be appreciated. (C-programming)Probl.pdf
Any kind of help would gladly be appreciated. (C-programming)Probl.pdf
Which of the following solutions will turn red litmus blue pOH 1.pdf
Which of the following solutions will turn red litmus blue pOH 1.pdf
What serves as the most reliable source of information about the .pdf
What serves as the most reliable source of information about the .pdf
What is the difference between the terms “earnings and profits” and .pdf
What is the difference between the terms “earnings and profits” and .pdf
what are three effects of transistor scaling on computer architectur.pdf
what are three effects of transistor scaling on computer architectur.pdf
What are some of the motives for employee theft What are some .pdf
What are some of the motives for employee theft What are some .pdf
Twitter is a popular social media. It allows its users to exchange tw.pdf
Twitter is a popular social media. It allows its users to exchange tw.pdf
A. State the domai and ranga. 1. y find the inverse and state the dom.pdf
A. State the domai and ranga. 1. y find the inverse and state the dom.pdf
The Puritan faith community shaped the New England colonies in virtu.pdf
The Puritan faith community shaped the New England colonies in virtu.pdf
savings account d. the value of the shares is based on the amount of .pdf
savings account d. the value of the shares is based on the amount of .pdf
QuestionIt was reported on June 11, 1997, by NBC Nightly News that.pdf
QuestionIt was reported on June 11, 1997, by NBC Nightly News that.pdf
946 LTE Labs Le.chateliers-lab.pdf Before beginning this experiment.pdf
946 LTE Labs Le.chateliers-lab.pdf Before beginning this experiment.pdf
Prove that the T_i-property is a topological property for i = 0So.pdf
Prove that the T_i-property is a topological property for i = 0So.pdf
4. Refer to the table of Gini coefficients in the Added Dimension box.pdf
4. Refer to the table of Gini coefficients in the Added Dimension box.pdf
Recently uploaded
How libraries can support authors with open access requirements for UKRI fund...
How libraries can support authors with open access requirements for UKRI funded books
Wednesday 22 May 2024, 14:00-15:00.
The approach at University of Liverpool.pptx
How libraries can support authors with open access requirements for UKRI funded books
Wednesday 22 May 2024, 14:00-15:00.
Operation Blue Star - Saka Neela Tara
Operation “Blue Star” is the only event in the history of Independent India where the state went into war with its own people. Even after about 40 years it is not clear if it was culmination of states anger over people of the region, a political game of power or start of dictatorial chapter in the democratic setup.
The people of Punjab felt alienated from main stream due to denial of their just demands during a long democratic struggle since independence. As it happen all over the word, it led to militant struggle with great loss of lives of military, police and civilian personnel. Killing of Indira Gandhi and massacre of innocent Sikhs in Delhi and other India cities was also associated with this movement.
Polish students' mobility in the Czech Republic
Polish students mobility to the Czech Republic within eTwinning project "Medieval adventures with Marco Polo"
A Strategic Approach: GenAI in Education
Artificial Intelligence (AI) technologies such as Generative AI, Image Generators and Large Language Models have had a dramatic impact on teaching, learning and assessment over the past 18 months. The most immediate threat AI posed was to Academic Integrity with Higher Education Institutes (HEIs) focusing their efforts on combating the use of GenAI in assessment. Guidelines were developed for staff and students, policies put in place too. Innovative educators have forged paths in the use of Generative AI for teaching, learning and assessments leading to pockets of transformation springing up across HEIs, often with little or no top-down guidance, support or direction.
This Gasta posits a strategic approach to integrating AI into HEIs to prepare staff, students and the curriculum for an evolving world and workplace. We will highlight the advantages of working with these technologies beyond the realm of teaching, learning and assessment by considering prompt engineering skills, industry impact, curriculum changes, and the need for staff upskilling. In contrast, not engaging strategically with Generative AI poses risks, including falling behind peers, missed opportunities and failing to ensure our graduates remain employable. The rapid evolution of AI technologies necessitates a proactive and strategic approach if we are to remain relevant.
Honest Reviews of Tim Han LMA Course Program.pptx
Personal development courses are widely available today, with each one promising life-changing outcomes. Tim Han’s Life Mastery Achievers (LMA) Course has drawn a lot of interest. In addition to offering my frank assessment of Success Insider’s LMA Course, this piece examines the course’s effects via a variety of Tim Han LMA course reviews and Success Insider comments.
BÀI TẬP BỔ TRỢ TIẾNG ANH GLOBAL SUCCESS LỚP 3 - CẢ NĂM (CÓ FILE NGHE VÀ ĐÁP Á...
BÀI TẬP BỔ TRỢ TIẾNG ANH GLOBAL SUCCESS LỚP 3 - CẢ NĂM (CÓ FILE NGHE VÀ ĐÁP Á...Nguyen Thanh Tu Collection
https://app.box.com/s/hqnndn05v4q5a4k4jd597rkdbda0fniiPalestine last event orientationfvgnh .pptx
An EFL lesson about the current events in Palestine. It is intended to be for intermediate students who wish to increase their listening skills through a short lesson in power point.
The Roman Empire A Historical Colossus.pdf
The Roman Empire, a vast and enduring power, stands as one of history's most remarkable civilizations, leaving an indelible imprint on the world. It emerged from the Roman Republic, transitioning into an imperial powerhouse under the leadership of Augustus Caesar in 27 BCE. This transformation marked the beginning of an era defined by unprecedented territorial expansion, architectural marvels, and profound cultural influence.
The empire's roots lie in the city of Rome, founded, according to legend, by Romulus in 753 BCE. Over centuries, Rome evolved from a small settlement to a formidable republic, characterized by a complex political system with elected officials and checks on power. However, internal strife, class conflicts, and military ambitions paved the way for the end of the Republic. Julius Caesar’s dictatorship and subsequent assassination in 44 BCE created a power vacuum, leading to a civil war. Octavian, later Augustus, emerged victorious, heralding the Roman Empire’s birth.
Under Augustus, the empire experienced the Pax Romana, a 200-year period of relative peace and stability. Augustus reformed the military, established efficient administrative systems, and initiated grand construction projects. The empire's borders expanded, encompassing territories from Britain to Egypt and from Spain to the Euphrates. Roman legions, renowned for their discipline and engineering prowess, secured and maintained these vast territories, building roads, fortifications, and cities that facilitated control and integration.
The Roman Empire’s society was hierarchical, with a rigid class system. At the top were the patricians, wealthy elites who held significant political power. Below them were the plebeians, free citizens with limited political influence, and the vast numbers of slaves who formed the backbone of the economy. The family unit was central, governed by the paterfamilias, the male head who held absolute authority.
Culturally, the Romans were eclectic, absorbing and adapting elements from the civilizations they encountered, particularly the Greeks. Roman art, literature, and philosophy reflected this synthesis, creating a rich cultural tapestry. Latin, the Roman language, became the lingua franca of the Western world, influencing numerous modern languages.
Roman architecture and engineering achievements were monumental. They perfected the arch, vault, and dome, constructing enduring structures like the Colosseum, Pantheon, and aqueducts. These engineering marvels not only showcased Roman ingenuity but also served practical purposes, from public entertainment to water supply.
Digital Tools and AI for Teaching Learning and Research
This Presentation in details discusses on Digital Tools and AI for Teaching Learning and Research
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/
special B.ed 2nd year old paper_20240531.pdf
Instagram:-
https://instagram.com/special_education_needs_01?igshid=YmMyMTA2M2Y=
WhatsApp:-
https://chat.whatsapp.com/JVakNIYlSV94x7bwunO3Dc
YouTube:-
https://youtube.com/@special_education_needs
Teligram :- https://t.me/special_education_needs
Slide Shere :-
https://www.slideshare.net/shabnambano20?utm_campaign=profiletracking&utm_medium=sssite&utm_source=ssslideview
Embracing GenAI - A Strategic Imperative
Artificial Intelligence (AI) technologies such as Generative AI, Image Generators and Large Language Models have had a dramatic impact on teaching, learning and assessment over the past 18 months. The most immediate threat AI posed was to Academic Integrity with Higher Education Institutes (HEIs) focusing their efforts on combating the use of GenAI in assessment. Guidelines were developed for staff and students, policies put in place too. Innovative educators have forged paths in the use of Generative AI for teaching, learning and assessments leading to pockets of transformation springing up across HEIs, often with little or no top-down guidance, support or direction.
This Gasta posits a strategic approach to integrating AI into HEIs to prepare staff, students and the curriculum for an evolving world and workplace. We will highlight the advantages of working with these technologies beyond the realm of teaching, learning and assessment by considering prompt engineering skills, industry impact, curriculum changes, and the need for staff upskilling. In contrast, not engaging strategically with Generative AI poses risks, including falling behind peers, missed opportunities and failing to ensure our graduates remain employable. The rapid evolution of AI technologies necessitates a proactive and strategic approach if we are to remain relevant.
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.
Unit 2- Research Aptitude (UGC NET Paper I).pdf
This slide describes the research aptitude of unit 2 in the UGC NET paper I.
Chapter 3 - Islamic Banking Products and Services.pptx
Chapter 3 - Islamic Banking Products and Services.pptxMohd Adib Abd Muin, Senior Lecturer at Universiti Utara Malaysia
This slide is prepared for master's students (MIFB & MIBS) UUM. May it be useful to all.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.
Recently uploaded (20)
How libraries can support authors with open access requirements for UKRI fund...
How libraries can support authors with open access requirements for UKRI fund...
BÀI TẬP BỔ TRỢ TIẾNG ANH GLOBAL SUCCESS LỚP 3 - CẢ NĂM (CÓ FILE NGHE VÀ ĐÁP Á...
BÀI TẬP BỔ TRỢ TIẾNG ANH GLOBAL SUCCESS LỚP 3 - CẢ NĂM (CÓ FILE NGHE VÀ ĐÁP Á...
Digital Tools and AI for Teaching Learning and Research
Digital Tools and AI for Teaching Learning and Research
Mule 4.6 & Java 17 Upgrade | MuleSoft Mysore Meetup #46
Mule 4.6 & Java 17 Upgrade | MuleSoft Mysore Meetup #46
Chapter 3 - Islamic Banking Products and Services.pptx
Chapter 3 - Islamic Banking Products and Services.pptx
Create a Dynamic Array container with this user interface Ge.pdf
- 1. 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
- 2. 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
- 3. 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; }
- 4. 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) { arr[entry - 1] = newEntry; return true; } else { entry -= 1; return false; } } template bool DynamicArray::isEmpty() { /*this function checks whether the container is empty or not, if the container is empty then it returns true else returns false*/ if(entry == 0) return true; else return false; } template DynamicArray::DynamicArray() { /*constructer*/ arr = NULL; try { arr = new ArrayType [10];
- 5. }catch(bad_alloc xa) { cout<<" Array allocation failed "; exit(0); } entry = 0, size = 10; } template DynamicArray::~DynamicArray() { /*destructer*/ delete [] arr; arr = NULL; } int main() { /*DynamicArray ob; cout<