Please implement Stack using Array (capacity 100)- Use template to.pdf

•

0 likes•2 views

Please implement Stack using Array (capacity 100) - Use template to be able to handle any types of data - In main function, create two stacks (an integer type stack and character type stack). Test your stacks with functions including push (), pop(), top(), isEmpty(), and size() - Make a header file and a source file separately - code should have no compile error template class ArrayStack { private: // member data enum { CAPACITY = 1000 }; // default capacity of stack int capacity; // actual length of stack array Object* S; // the stack array int t; // index of the top of the stack public: //constructor given max capacity ArrayStack(int cap = CAPACITY) { capacity = cap; S = new Object[capacity]; t = -1; } int size() const // number of elements in the stack { return(t + 1); } bool isEmpty() const // is the stack empty? { return(t < 0); } // return the top of the stack Object& top() throw(StackEmptyException) { if (isEmpty()) throw StackEmptyException(\"Access to empty stack\"); return S[t]; } // push object onto the stack void push(const Object& elem) throw(StackFullException) { if (size() == capacity) throw StackFullException(\"Stack overflow\"); S[++t] = elem; } // pop the stack Object pop() throw(StackEmptyException) { if (isEmpty()) throw StackEmptyException(\"Access to empty stack\"); return S[t--]; } ArrayStack(const ArrayStack& st); //copy constructor // assignment operator constructor ArrayStack& operator=(const ArrayStack& st); ~ArrayStack() // destructor {delete[] S; } }; template // copy constructor ArrayStack:: ArrayStack(const ArrayStack& st) { capacity = st.capacity; t = st.t; S = new Object[capacity]; for (int i = 0; i <= t; i++){ // copy contents S[i] = st.S[i]; } } template // assignment operator ArrayStack& ArrayStack:: operator=(const ArrayStack& st) { if (this != &st) { //avoid self copy (x=x) delete[] S; // delete old contents capacity = st.capacity; t = st.t; S = new Object[capacity]; for (int i = 0; i <= t; i++) { // copy contents S[i] = st.S[i]; } } return *this; } Solution template class ArrayStack { private: // member data enum { CAPACITY = 1000 }; // default capacity of stack int capacity; // actual length of stack array Object* S; // the stack array int t; // index of the top of the stack public: //constructor given max capacity ArrayStack(int cap = CAPACITY) { capacity = cap; S = new Object[capacity]; t = -1; } int size() const // number of elements in the stack { return(t + 1); } bool isEmpty() const // is the stack empty? { return(t < 0); } // return the top of the stack Object& top() throw(StackEmptyException) { if (isEmpty()) throw StackEmptyException(\"Access to empty stack\"); return S[t]; } // push object onto the stack void push(const Object& elem) throw (StackFullException) { if (size() == capacity) throw StackFullException(\"Stack overflow\"); S[++t] = elem; } // pop the stack Object pop() throw (StackEmptyException) { if (isEmpty()) throw StackEmptyException(\"Access to empty stack\"); return S[t--]; } } .

Education

void push(const Object& elem) throw(StackFullException) {
if (size() == capacity)
throw StackFullException("Stack overflow");
S[++t] = elem;
}
// pop the stack
Object pop() throw(StackEmptyException) {
if (isEmpty())
throw StackEmptyException("Access to empty stack");
return S[t--];
}
ArrayStack(const ArrayStack& st); //copy constructor
// assignment operator constructor
ArrayStack& operator=(const ArrayStack& st);
~ArrayStack() // destructor
{delete[] S; }
};
template // copy constructor
ArrayStack::
ArrayStack(const ArrayStack& st) {
capacity = st.capacity;
t = st.t;
S = new Object[capacity];
for (int i = 0; i <= t; i++){ // copy contents
S[i] = st.S[i];
}
}
template // assignment operator
ArrayStack& ArrayStack::
operator=(const ArrayStack& st) {
if (this != &st) { //avoid self copy (x=x)
delete[] S; // delete old contents
capacity = st.capacity;
t = st.t;
S = new Object[capacity];
for (int i = 0; i <= t; i++) { // copy contents

S[i] = st.S[i];
}
}
return *this;
}
Solution
template
class ArrayStack {
private: // member data
enum { CAPACITY = 1000 }; // default capacity of stack
int capacity; // actual length of stack array
Object* S; // the stack array
int t; // index of the top of the stack
public:
//constructor given max capacity
ArrayStack(int cap = CAPACITY) {
capacity = cap;
S = new Object[capacity];
t = -1;
}
int size() const // number of elements in the stack
{
return(t + 1);
}
bool isEmpty() const // is the stack empty?
{
return(t < 0);
}
// return the top of the stack
Object& top() throw(StackEmptyException) {
if (isEmpty())
throw StackEmptyException("Access to empty stack");
return S[t];
}

// push object onto the stack
void push(const Object& elem) throw (StackFullException) {
if (size() == capacity)
throw StackFullException("Stack overflow");
S[++t] = elem;
}
// pop the stack
Object pop() throw (StackEmptyException) {
if (isEmpty())
throw StackEmptyException("Access to empty stack");
return S[t--];
}
}
ArrayStack(const ArrayStack&st); //copy constructor
// assignment operator constructor
ArrayStack&operator=(const ArrayStack&st);
~ArrayStack() // destructor
{delete[] S; }
}
};
template // copy constructor
ArrayStack::
ArrayStack(const ArrayStack&st) {
capacity = st.capacity;
t = st.t;
S = new Object[capacity];
for (int i = 0; i <= t; i++){ // copy contents
S[i] = st.S[i];
}
}
template // assignment operator

ArrayStack& ArrayStack::
operator=(const ArrayStack&st) {
if (this != &st) { //avoid self copy (x=x)
delete[] S; // delete old contents
capacity = st.capacity;
t = st.t;
S = new Object[capacity];
for (int i = 0; i <= t; i++) { // copy contents
S[i] = st.S[i];
}
}
return *this;
}
int main()
{
ArrayStack a = new ArrayStack(10); // Stack can have at max 10 element
try{<<
cout<<"Stack size:"<

Similar to Please implement Stack using Array (capacity 100)- Use template to.pdf

computer notes - Data Structures - 8

ecomputernotes

Stack Implementation

Zidny Nafan

Please make it to clear 12-95. The basketball passed through the hoop even though it barely cleared the hands of the player B who attempted to block it. Neglecting the size of the ball, determine the magnitude vn of its initial velocity and the height h of the ball when it passes over player B 10 ft 5 ft Prob. 12-95 Solution Consider the motion along horizontal direction Vox = initial velocity in horizontal direction = Va Cos30 X = horizontal distance = 25 + 3 = 28 ft t = time taken t = X / Vox = 28/(Va Cos30) eq-1 consider the motion in vertical direction Y = vertical displacement = 10 - 7 = 3 ft a = acceleration = - 32.2 Voy = initial velocity = Va Sin30 t = time taken using the equation Y = Voy t + (0.5) a t2 3 = (Va Sin30) (28/(Va Cos30)) + (0.5) (- 32.2) (28/(Va Cos30))2 Va = 35.8 m/s t\' = time taken to reach B = 25 / (Va Cos30) = 25 / (35.8 Cos30) = 0.81 sec h = 7 + Voy t\' + (0.5) a t\'2 h = 7 + (35.8 Sin30) (0.81) + (0.5) (- 32.2) (0.81)2 h = 10.94 ft.

Please review my code (java)Someone helped me with it but i cannot.pdf

fathimafancyjeweller

Modifications highlighted in bold lettersDropOutStack.javaim.pdf

Lalkamal2

Write a class ArrayList that represents an array of integers. Initially it has a capacity of 1 and is “empty”. At any time, it can be partially full, so it keeps track of its current occupied size, as well as its capacity (true size). Write a class ArrayList that represents an array of integers. Initially it has a capacity of 1 and is “empty”. At any time, it can be partially full, so it keeps track of its current occupied size, as well as its capacity (true size). However the output for the prime numbers 1 -50 is incorrect. Displaying numbers like 0, 625 for prime numbers. This is my code with the main method below #include #include #include using namespace std; class ArrayList { private: int *array; int capacity, asize; public: int size(); ArrayList(); int & operator [](unsigned int); void push_back(int); void erase(int m); string toString(); }; // 1.a: Default constructor used to unitialize the array with capacity=1 ArrayList::ArrayList() { asize = 0; capacity = 1; array = new int[capacity]; } // This function returns the actual size of array int ArrayList::size() { return asize; } // 1.b:The overloaded [] oprtaor return element at ith position in array int & ArrayList::operator [](unsigned int i) { if(i >= asize) { cout << \"invalid reference \"; exit(0); } return *(array + i); } //1.c: This function push m at the end of the array void ArrayList::push_back(int m) { // this condition checks if size is beyond capacity or not. if so double the capacity. if(asize == capacity) { capacity = 2 * capacity; int *temp = new int[capacity]; for(int i = 0; i < asize; i++) temp[i] = array[i]; array = new int[capacity]; for(int i = 0; i < asize; i++) array[i] = temp[i]; } array[asize] = m; asize = asize + 1; } void ArrayList::erase(int m){ int pos = -1; for(int i = 0; i < asize; i++){ if(array[i] == m){ pos = i; break; } } if(pos == -1){ cout << \"Element not present\ \"; } else{ for(int i = pos; i < asize - 1; i++){ array[i] = array[i + 1]; } } asize--; if(asize == capacity / 2) { capacity = capacity / 2; int *temp = new int[capacity]; for(int i = 0; i < asize; i++) temp[i] = array[i]; array = new int[capacity]; for(int i = 0; i < asize; i++) array[i] = temp[i]; } } string ArrayList::toString(){ string str = \"[\"; for(int i = 0; i < asize; i++){ ostringstream oss; oss << array[i]; str += oss.str(); if(i != asize - 1){ str += \", \"; } } str += \"]\"; return str; } //--------------------------- //You can test above class by using main() below int main() { ArrayList arr; // call ro default constructor for (int i = 1; i <= 50; i++) { arr.push_back(i); // call to push_back() } cout << \"Should contain numbers 1..50, is \"; cout << arr.toString(); cout << \"\ \"; return 0; } This is my code with the main method below #include #include #include using namespace std; class ArrayList { private: int *array; int capacity, asize; public: int size(); ArrayList(); int & operator [](unsigned int); void push_back(int); void erase(int m); string toString(); }; // 1.a:.

Write a class ArrayList that represents an array of integers. Init.pdf

footworld1

STLStack.pdf

rajaratna4

Use a simple vector you created before to create two other more complex vectors with A) Memory allocation that doubles size of memory when end reached, and 1/2's memory when the size reaches 1/4. B) Implemented with a singularly linked list. Main.cpp #include #include "SimpleVector.h" //System Libraries #include //Input/Output Library using namespace std; //User Libraries //Global Constants, no Global Variables are allowed //Math/Physics/Conversions/Higher Dimensions - i.e. PI, e, etc... //Function Prototypes void fillVec(SimpleVector &); void addVec(SimpleVector &); void delVec(SimpleVector &); void prntVec(SimpleVector &,int); //Execution Begins Here! int main(int argc, char** argv) { //Declare Variables int size; //Read in the size cout<<"What size vector to test?"< cin>>size; SimpleVector sv(size); //Initialize or input i.e. set variable values fillVec(sv); //Display the outputs prntVec(sv,10); //Add and subtract from the vector addVec(sv); //Display the outputs prntVec(sv,10); //Add and subtract from the vector delVec(sv); //Display the outputs prntVec(sv,10); //Exit stage right or left! return 0; } void addVec(SimpleVector &sv){ int add=sv.size()*0.1; for(int i=1;i<=add;i++){ sv.push_front(i+add-1); sv.push_back(i-add); } } void delVec(SimpleVector &sv){ int del=sv.size()*0.2; for(int i=1;i<=del;i++){ sv.pop_front(); sv.pop_back(); } } void fillVec(SimpleVector &sv){ for(int i=0;i sv[i]=i%10; } } void prntVec(SimpleVector &sv,int n){ cout< for(int i=0;i cout< if(i%n==(n-1))cout< } cout< } SimpleVector.h // SimpleVector class template #ifndef SIMPLEVECTOR_H #define SIMPLEVECTOR_H #include #include // Needed for bad_alloc exception #include // Needed for the exit function using namespace std; template class SimpleVector { private: T *aptr; // To point to the allocated array int arraySize; // Number of elements in the array void memError(); // Handles memory allocation errors void subError(); // Handles subscripts out of range public: // Default constructor SimpleVector() { aptr = 0; arraySize = 0;} // Constructor declaration SimpleVector(int); // Copy constructor declaration SimpleVector(const SimpleVector &); // Destructor declaration ~SimpleVector(); //Adding and subtracting from the Vector void push_front(T); void push_back(T); T pop_front(); T pop_back(); // Accessor to return the array size int size() const { return arraySize; } // Accessor to return a specific element T getElementAt(int position); // Overloaded [] operator declaration T &o ...

Use a simple vector you created before to create two other more

steviesellars

C programming. For this code I only need to add a function so that the array of pointers is sorted by the age of the individual entered. it must be a function and called in main . That is the only thing needed. #define _CRT_SECURE_NO_WARNINGS #include #include #define PAUSE system(\"pause\") typedef struct { int age; int weight; int height; } STATS; STATS *makeArrayOfPointers(int ); void loadArray(STATS **array, int *c); void displayArray(STATS **array, int c); void saveArray(STATS **array, int count, int size); STATS **reloadArray(char *, int *count, int *size); main() { STATS** array = 0; int count = 0; int size = 500; char reloaded = \'N\'; array = reloadArray(&reloaded, &count, &size); if(reloaded == \'N\') array = makeArrayOfPointers(size); PAUSE; loadArray(array, &count); printf(\"** unSorted Array **\ \"); displayArray(array, count); //sortArray(array, count) printf(\"** Sorted by Age **\ \"); displayArray(array, count); saveArray(array, count, size); PAUSE; } // end of main void displayArray(STATS **array, int c) { int i; for (i = 0; i < c; i++) { printf(\"Record[%i] Age is %i.\\t Weight is %i.\\t Height is %i.\ \", i, array[i]->age, array[i]- >weight, array[i]->height); } PAUSE; } // end displayArray void loadArray(STATS **array, int *c) { int value; int counter = *c; for (*c; *c < (counter + 4); *c = *c + 1) { printf(\"\ \ Information for person: %i\ \ \", (*c) + 1); array[*c] = calloc(1, sizeof(STATS)); printf(\"Enter age: \"); scanf(\"%i\", &value); array[*c]->age = value; printf(\"Enter weight: \"); scanf(\"%i\", &value); array[*c]->weight = value; printf(\"Enter height: \"); scanf(\"%i\", &value); array[*c]->height = value; } // end for } // end loadArray STATS *makeArrayOfPointers(int size) { STATS *result; result = malloc(sizeof(STATS*) * size); return result; } // end makeArrayOfPointers void saveArray(STATS **array, int count, int size) { FILE *ptr; int i; ptr = fopen(\"c:\\\\myBinFile.bin\", \"wb\"); if (ptr == NULL) { printf(\"Could not open the file\ \"); PAUSE; exit(-1); } // SAVE THE SIZE OF THE ARRAY fwrite(&size, sizeof(int), 1, ptr); // SAVE THE EFFECTIVE SIZE or COUNT fwrite(&count, sizeof(int), 1, ptr); // SAVE EACH NODE/ELEMENT in the ARRAY for (i = 0; i < count; i++) { fwrite(array[i], sizeof(STATS), 1, ptr); } // end for fclose(ptr); }// end saveArray STATS **reloadArray(char *result, int *count, int *size) { STATS **temp = 0; FILE *ptr; int i; *result = \'Y\'; ptr = fopen(\"c:\\\\myBinFile.bin\", \"rb\"); if (ptr == NULL) { printf(\"Could not open the file\ \"); PAUSE; *result = \'N\'; } else { // Reload the size of the array fread(size, sizeof(int), 1, ptr); // Create the Array of Pointers temp = makeArrayOfPointers(*size); // Reload the count or effective size variable fread(count, sizeof(int), 1, ptr); // Reload the nodes or elements of the array for (i = 0; i < *count; i++) { temp[i] = calloc(1, sizeof(STATS)); fread(temp[i], sizeof(STATS), 1, ptr); } } // end else fclose(ptr); return temp; }// end reloadAr.

C programming. For this code I only need to add a function so th.pdf

badshetoms

Stack, queue and hashing

Dumindu Pahalawatta

Lec2

Anjneya Varshney

MO 2020 DS Stacks 1 AB.ppt

shashankbhadouria4

#C programming Question 35Implement the functions required for the.docx

Java Generics

Templates

01-intro_stacks.ppt

Stack and Queue

Write a program that converts an infix expression into an equivalent postfix expression. The rules to convert an infix expression into an equivalent postfix expression are as follows (C++): Initialize pfx to an empty expression and also initialize the stack. Get the next symbol, sym, from infx. If sym is an operand, append sym to pfx. If sym is (, push sym into the stack. If sym is ), pop and append all of the symbols from the stack until the most recent left parentheses. Pop and discard the left parentheses. If sym is an operator: Pop and append all of the operators from the stack to pfx that are above the most recent left parentheses and have precedence greater than or equal to sym. Push sym onto the stack. After processing infx, some operators might be left in the stack. Pop and append to pfx everything from the stack. In this program, you will consider the following (binary) arithmetic operators: +, -, *, and /. You may assume that the expressions you will process are error free. Design a class that stores the infix and postfix strings. The class must include the following operations: getInfix: Stores the infix expression. showInfix: Outputs the infix expression. showPostfix: Outputs the postfix expression. convertToPostfix: Converts the infix expression into a postfix expression. The resulting postfix expression is stored in pfx. precedence: Determines the precedence between two operators. If the first operator is of higher or equal precedence than the second operator, it returns the value true; otherwise, it returns the value false. A + B - C; (A + B ) * C; (A + B) * (C - D); A + ((B + C) * (E - F) - G) / (H - I); A + B * (C + D ) - E / F * G + H; Infix Expression: A+B-C; Postfix Expression: AB+C- Infix Expression: (A+B)*C; Postfix Expression: AB+C* Infix Expression: (A+B)*(C-D); Postfix Expression: AB+CD-* Infix Expression: A+((B+C)*(E-F)-G)/(H-I); Postfix Expression: ABC+EF-*G-HI-/+ Infix Expression: A+B*(C+D)-E/F*G+H; Postfix Expression: ABCD+*+EF/G*-H+ Turn in: A UML diagram for your class. The header file for your class. The implementation file for your class. The source code for your test program. (C++) (Below already done code.) //Header file: myStack.h #ifndef H_StackType #define H_StackType #include #include #include \"stackADT.h\" using namespace std; template class stackType: public stackADT { public: const stackType& operator=(const stackType&); //Overload the assignment operator. void initializeStack(); //Function to initialize the stack to an empty state. //Postcondition: stackTop = 0 bool isEmptyStack() const; //Function to determine whether the stack is empty. //Postcondition: Returns true if the stack is empty, // otherwise returns false. bool isFullStack() const; //Function to determine whether the stack is full. //Postcondition: Returns true if the stack is full, // otherwise returns false. void push(const Type& newItem); //Function to add newItem to the stack. //Precondition: The stack exists and is not full. //Postc.

Write a program that converts an infix expression into an equivalent.pdf

mohdjakirfb

LectureNotes-06-DSA

Haitham El-Ghareeb

1. The design of a singly-linked list below is a picture of the function that needs to be used below is the code of the above picture: #include <string> #include <iostream> #include <cmath> #include <cstdio> #include <algorithm> using namespace std; #define defaultSize 100 void Assert(bool val, string s) { if (!val) { // Assertion failed -- close the program cout << "Assertion Failed: " << s << endl; exit(-1); } } template <typename E> class Link { public: E element; // Value for this node Link *next; // Pointer to next node in list // Constructors Link(const E& elemval, Link<E>* nextval = NULL) { element = elemval; next = nextval; } Link(Link<E>* nextval =NULL) { next = nextval; } }; template <typename E> class LList: public Link<E> { private: Link<E>* head;// Intialization helper method Link<E>* tail;// Pointer to last element Link<E>* curr;// Access to current element int cnt;// Size of list void init(){// Intialization helper method curr = tail = head = new Link<E>; cnt = 0; } void removeall() {// Return link nodes to free store while(head != NULL) { curr = head; head = head->next; delete curr; } } public: LList(int size=defaultSize) { init(); }// Constructor ~LList() { removeall(); }// Destructor void print() const;// Print list contents void clear() { removeall(); init(); }// Clear list // Insert "it" at current position void insert(const E& it) { curr->next = new Link<E>(it, curr->next); if (tail == curr) tail = curr->next; // New tail cnt++; } void append(const E& it) { // Append "it" to list tail = tail->next = new Link<E>(it, NULL); cnt++; } // Remove and return current element E remove() { Assert(curr->next != NULL, "No element"); E it = curr->next->element; // Remember value Link<E>* ltemp = curr->next; // Remember link node if (tail == curr->next) tail = curr; // Reset tail curr->next = curr->next->next; // Remove from list delete ltemp; // Reclaim space cnt--; // Decrement the count return it; } void moveToStart()// Place curr at list start { curr = head; } void moveToEnd() // Place curr at list end { curr = tail; } void prev(){ if (curr == head) return; Link<E>* temp = head; while (temp->next!=curr) temp=temp->next; curr = temp; } void next(){ if (curr != tail) curr = curr->next; } int length() const { return cnt; } int currPos() const { Link<E>* temp = head; int i; for (i=0; curr != temp; i++) temp = temp->next; return i; } void moveToPos(int pos){ Assert ((pos>=0)&&(pos<=cnt), "Position out of range"); curr = head; for(int i=0; i<pos; i++) curr = curr->next; } const E& getValue() const { Assert(curr->next != NULL, "No value"); return curr->next->element; } }; completed this code to fulfill the requirement below: Write a function to insert an integer into a singly-linked list of elements arranged from largest to smallest. Requires that elements remain ordered after insertion. 2. The design of array-based stack below is a picture of the function that needs to be used below is the code of the above picture: #include <string.h> #.

1- The design of a singly-linked list below is a picture of the functi (1).pdf

afgt2012

#include "String.hpp" #include "../Functions/functions.hpp" // O(1) String::String() { // Allocate space. array = new char[1]; // Add the null. array[0] = '\0'; // Adjust private variables. _capacity = 0; _size = 0; } // O(1) String::String(char c) { // Allocate space. array = new char[2]; // Add the character and the null. array[0] = c; array[1] = '\0'; // Adjust private variables. _capacity = 1; _size = 1; } // O(n) String::String(char* str) { // Get the length of the incoming string. int length = 0; while (str[length]) ++length; // Allocate space for the string plus a null. array = new char[length + 1]; // Fill our array up, including the null. for (int i = 0; i <= length; ++i) array[i] = str[i]; // Adjust private variables. _capacity = length; _size = length; } // O(1) String::~String() { delete[] array; } // O(n) char String::at(int index) const { // If our index is negative, or beyond the size of our array, we cannot return // anything. return (index < 0 || (unsigned int)index >= size()) ? throw "Index" : array[index]; } void String::clear() { for (unsigned int i = 0; i < _capacity; ++i) array[i] = '\0'; _size = 0; } // O(n) unsigned int String::size() const { return _size; } // O(1) bool String::empty() const { return !this->array[0]; } // O(1) unsigned int String::capacity() const { return this->_capacity; } // O(n) void String::reserve(unsigned int n) { if (!n) return; // Make a new array. char* _array = new char[_capacity + n + 1](); // Fill it up. int length = this->size(); for (int i = 0; i <= length; ++i) _array[i] = array[i]; // Remove old memory. delete[] array; // Save new memory. array = _array; // Adjust private variables. _capacity += n; return; } // O(n) void String::insert(char c, int index) { // Prepend and append as easy cases. if (index <= 0) prepend(c); else if ((unsigned int)index >= size()) append(c); else { // Increase capacity, if needed. if (this->size() == this->_capacity) { this->reserve(this->size() * 2); } // Move all elements after index over. for (int i = this->size() + 1; i >= index; --i) array[i] = array[i - 1]; // Insert our new character. array[index] = c; _size++; } return; } // O(n) void String::erase(char c) { // Create a new array. char* _array = new char[_capacity + 1]; // Copy all non-erased characters to the new array. int length = size(); for (int i = 0, j = 0; i <= length; ++i) { if (array[i] != c) _array[j++] = array[i]; else _size--; } // Remove the old array. delete[] array; array = _array; return; } // O(n) void String::remove(int index) { // Copy all characters to the left, overwriting index. int length = this->size(); for (int i = index; i < length; ++i) array[i] = array[i + 1]; _ ...

#include String.hpp#include ..Functionsfunctions.hpp.docx

gertrudebellgrove

Similar to Please implement Stack using Array (capacity 100)- Use template to.pdf (20)

computer notes - Data Structures - 8

Stack Implementation

Please review my code (java)Someone helped me with it but i cannot.pdf

Modifications highlighted in bold lettersDropOutStack.javaim.pdf

Write a class ArrayList that represents an array of integers. Init.pdf

STLStack.pdf

Use a simple vector you created before to create two other more

C programming. For this code I only need to add a function so th.pdf

Stack, queue and hashing

Lec2

MO 2020 DS Stacks 1 AB.ppt

#C programming Question 35Implement the functions required for the.docx

Java Generics

Templates

01-intro_stacks.ppt

Stack and Queue

Write a program that converts an infix expression into an equivalent.pdf

LectureNotes-06-DSA

1- The design of a singly-linked list below is a picture of the functi (1).pdf

#include String.hpp#include ..Functionsfunctions.hpp.docx

More from fashionscollect

Interpersonal tactics, motivation, planning and leadership style can be labeled as foundation strategies for career advancement. How each of them influence individual career sucess? Pick one example from each tactic below to elaborate. Interpersonal Example: People interaction, social communication, emotional intelligence Motivation Example: Aggressiveness, ambition, challenge Planning Example: Goal directed, preparation, strategizing Leadership style Example: Influence process, motivational style, personality traits Solution Absolutely, the mentioned 4 can be stated as foundation strategies for career advancements. Each tactic is explained below as:.

Interpersonal tactics, motivation, planning and leadership style can.pdf

fashionscollect

In the \"exclusivity\" case (Mayer et al., p. 849-853), given the provisions of the contract (e.g., anti discrimination, no-strike, and no-lockout clauses), what effect did the protesting employees\' actions have on their rights to court claims? Exclusivity Emporium Capwell Co. v. Western Addition Community Organization 420 U.S. 50 (1975) The Emporium Capwell Company (Company) operates a department store in San Francisco. At all times relevant to this litigation it was a party to the collective-bargaining agreement negotiated by the San Francisco Retailer’s Council, of which it was a member, and the Department Store Employees Union (Union), which represented all stock and marketing area employees of the Company. The agreement, in which the Union was recognized as the sole collective-bargaining agency for all covered employees, prohibited employment discrimination by reason of race, color, creed, national origin, age, or sex, as well as union activity. It had a no- strike or lockout clause, and it established grievance and arbitration machinery for processing any claimed violation of the contract, including a violation of the antidiscrimination clause. On April 3, 1968, a group of Company employees covered by the agreement met with the secretarytreasurer of the Union, Walter Johnson, to present a list of grievances including a claim that the Company was discriminating on the basis of race in making assignments and promotions. The Union official agreed to certain of the grievances and to investigate the charge of racial discrimination. He appointed an investigating committee and prepared a report on the employees’ grievances, which he submitted to the Retailer’s Council and which the Council in turn referred to the Company. The report described “the possibility of racial discrimination” as perhaps the most important issue raised by the employees and termed the situation at the Company as potentially explosive if corrective action were not taken. It offers as an example of the problem the Company’s failure to promote a Negro stock employee regarded by other employees as an outstanding candidate but a victim of racial discrimination. Shortly after receiving the report, the Company’s labor relations director met representatives and agreed to “look into the matter” of discrimination, and see what needed to be done. Apparently unsatisfied with these representations, the Union held a meeting in September attended by Union officials, Company employees, and representatives of the California Fair Employment Practices Committee (FEPC) and the local anti-poverty agency. The secretary-treasurer of the Union announced that the Union had concluded that the Company was discriminating, and that it would process every such grievance through to arbitration if necessary. Testimony about the Company’s practices was taken and transcribed by a court reporter, and the next day the Union notified the Company of its formal charge and demanded that the union-management .

In the exclusivity case (Mayer et al., p. 849-853), given the pr.pdf

fashionscollect

In which sentence is the underlined group of words a prepositional phrase acting as an adverb? My sister hopes to be one of the finest novelists in the world. My sister\'s grades gave her a place in the top rank of her class. My sister is going to write novels. My sister applied on Tuesday to a graduate school in England. Solution last statement as it modifies the verb applied. first statement modifies noun one. 2nd also modifies palce. underlined statement in 3rd is not PP.

In which sentence is the underlined group of words a prepositional ph.pdf

fashionscollect

In 1905, the French biologist Lucien Cuénot discovered an interesting mutant mouse displaying a yellow coat color. He bred the mouse and its progeny for several generations but could never obtain a pure breeding stock of yellow mice! Normal mice have a coat color called Agouti which appears gray. When he crossed pure breeding gray Agouti mice with the yellow mouse, half the progeny had the gray Agouti coat and half had the light yellow coat. When he crossed the F1 yellow mice with each other, he found that 1/3 of the F2 progeny had the gray Agouti coat and 2/3 had the yellow coat. When he crossed the F2 yellow progeny with pure breeding Agouti mice, he found again that they produced 50% gray Agouti mice and 50% yellow mice. Based on these results, you would conclude that relative to the Agouti coat color, the Yellow coat color is: A. Completely Dominant B. Incompletely Dominant C. Co-dominant D. Incompletely Penetrant E. Recessive Cuénot was never able to produce a pure breeding strain of yellow mice even after trying several crosses for several years. Provide a one-sentence explanation for why Cuénot was unable to obtain yellow mice but not a pure breeding stock of yellow mice. Solution (A) It is complete dominant. As per definition, dominant allele shows phenotype in homozygous. Genes are located on chromosomes and consist of DNA. They are passed from parents to their offspring through reproduction. Genes also contain information about a specific characteristic or trait and can either be dominant or recessive. Each gene has a designated place on every chromosome, called a locus. All copies of a gene are not identical and alternative forms of a gene is called alleles that lead to the alternative or different form of one trait. Alleles are helpful in identification of the two members of a gene pair, which produce opposite contrasting phenotypes, e.g., b is an allele of B and vice versa. When the two alleles of a gene are identical, the individual is homozygous for that trail, and on the other hand, if there are two different alleles, the individual is heterozygous. A homozygous pair can be either dominant (AA, BB) or recessive (aa, bb). Heterozygous pairs are made up of one dominant and one recessive allele (Aa, Bb). In heterozygous individuals, only one allele, the dominant one, is able to express itself, while the other allele, the recessive, is hidden but still present. The dominant genes are denoted by upper case letters and recessive genes are denoted by lower case letters. The word genotype was created to identify genes of an individual and phenotype for the external appearance of the trait and genes.Phenotype and genotype are terms used to describe the difference between the visible expressions of the trait versus the actual gene makeup. An individual, which expresses a dominant trait may carry a recessive allele, but the recessive expression is hidden by its dominant partner. Mendel\'s observations from these experiments can be summar.

In 1905, the French biologist Lucien Cuénot discovered an interestin.pdf

fashionscollect

Identify and explain the characteristics that distinguish governmental and not-for-profit entities from for-profit entities Solution The Financial Accounting Standards Board’s (FASB) lists down some characteristics that distinguishes a governmental and a not-for-profit entities from business organizations Other differences between a ‘governmental and a not-for-profit entities’ and ‘business organizations’ are:.

Identify and explain the characteristics that distinguish government.pdf

fashionscollect

how slavery build the united states economy Solution Chattel slavery is such a difficult piece of American history that we presently can\'t seem to give the subject appropriate broadcast appointment in our national discussions and classrooms. A few of us would rather do without real exchanges and smother grant about the transgressions of our progenitors to abstain from affecting sentiments of blame and commitment. There are different people who guarantee there is a limited break between that woeful 250-year field in our country\'s adolescence and a period that manufactured a worldwide good example for majority rules system and monetary development. Quiet and misleading statements work to secure a national mystery and a false picture. What\'s more, similar to every single frightful mystery, the ability to propagate disgrace and blame is lessened with arrival of reality. The genuine story?—?the one we Americans don\'t advertise?—?is that we didn\'t rise up out of the fiery remains of the mid twentieth century clashes as a superpower. Nor did we construct our strength exclusively from the muscles of Ellis Island. By the start of the nineteenth century, subjugated work had deliberately both straightforwardly and in a roundabout way transformed the United States into one of the best two monetary powers on the planet. Afterward, in spite of the assaults of the Civil War, the capital and framework separated from the spirits, sweat, and blood of oppressed African Americans situated a previous backwater province to explore the Industrial Revolution. In 1880?—?not 1917 or 1945?—?the U.S. started to supersede its significantly more seasoned and more settled opponent, Great Britain. The shores of the U.S., in the next decades, turned into a worldwide reference point for economic opportunity and flexibility to more than 12 million fresh introductions. U.S. servitude was not a Southern men of honor\'s liven. As Ta-Nehisi Coates wrote in his article \"The Case for Reparations\" in The Atlantic, \"by 1840, cotton created by slave work constituted 59 percent of the nation\'s fares.\" The monetary commitment of subjugated Americans, regardless, did not start and end with King Cotton in the South. Northern states profited from the slave exchange, as well, start with the Puritans. Servitude and the business movement brought by the slave dispatches going through New England ports in early America developed the locale\'s beginning economy and, at last, propelled the spread of North American colonization past the soonest settlements. There is another once in a while talked about part of servitude that helped shape our country\'s worldwide economic impression. The evaluated advertise estimation of the subjugated populace by 1860 had achieved seven times the estimation of money available for use. At the point when a slaveholder required money, he had three choices: 1) lease the work of a man he held in servitude; 2) offer that oppressed individual to another person; .

how slavery build the united states economySolutionChattel sla.pdf

fashionscollect

How did Woodrow Wilson impact public administrationSolutionWo.pdf

fashionscollect

Describe the three most well-known types of ethical decision making and the four dilemmas that each engender. Why do these matter to the leader in his or her own ethical perspectives? Solution Three Broad Types of Ethical Theory: Ethical theories are often broadly divided into three types: i) Consequentialist theories, which are primarily concerned with the ethical consequences of particular actions; ii) Non- consequentialist theories, which tend to be broadly concerned with the intentions of the person making ethical decisions about particular actions; and iii) Agent-centered theories, which, unlike consequentialist and non-consequentialist theories, are more concerned with the overall ethical status of individuals, or agents, and are less concerned to identify the morality of particular actions. Each of these three broad categories contains varieties of approaches to ethics, some of which share characteristics across the categories. Below is a sample of some of the most important and useful of these ethical approaches. i.) Consequentialist Theories: The Utilitarian Approach Utilitarianism can be traced back to the school of the Ancient Greek philosopher Epicurus of Samos (341-270 BCE), who argued that the best life is one that produces the least pain and distress. The 18th Century British philosopher Jeremy Bentham (1748-1832) applied a similar standard to individual actions, and created a system in which actions could be described as good or bad depending upon the amount and degree of pleasure and/or pain they would produce. Bentham’s student, John Stuart Mill (1806-1873) modified this system by making its standard for the good the more subjective concept of “happiness,” as opposed to the more materialist idea of “pleasure.” Utilitarianism is one of the most common approaches to making ethical decisions,especially decisions with consequences that concern large groups of people, in part because it instructs us to weigh the different amounts of good and bad that will be produced by our action. This conforms to our feeling that some good and some bad will necessarily be the result of our action and that the best action will be that which provides the most good or does the least harm, or, to put it another way, produces the greatest balance of good over harm. Ethical environmental action, then, is the one that produces the greatest good and does the least harm for all who are affected—government, corporations, the community, and the environment. The Egoistic Approach One variation of the utilitarian approach is known as ethical egoism, or the ethics of self- interest. In this approach, an individual often uses utilitarian calculation to produce the greatest amount of good for him or herself. Ancient Greek Sophists like Thrasymacus (c. 459-400 BCE), who famously claimed that might makes right, and early modern thinkers like Thomas Hobbes (1588-1679) may be considered forerunners of this approach. One of the most influential recent proponents of.

Describe the three most well-known types of ethical decision making .pdf

fashionscollect

Central banks in advanced economies have gradually moved away from monetary policy based on monetary targeting (founded on the quantity theory of money) and tend to focus on inflation using some variation of the interest rate determination rule or “Taylor rule”. What explains that evolution of monetary policy? How does the Taylor rule work? What is your evaluation of the efficiency of the new approaches to monetary policy in advanced economies, using the US as an example? Solution What explains that evolution of monetary policy? How does the Taylor rule work? What is your evaluation of the efficiency of the new approaches to monetary policy in advanced economies, using the US as an example?.

Central banks in advanced economies have gradually moved away from m.pdf

fashionscollect

Cell division in the apical meristems Cell division in the apical me.pdf

fashionscollect

Asteroids X, Y, and Z have equal mass of 4.0 kg each, They orbit around a planet with M = 7.20*10^24 kg. The orbits are in the plane of the paper. The 3 asteroids orbit in the same counterclockwise direction. Solution 1. Greater than, 2. equal to, (r and c seems to be at same distance from the planet, if not the answer will change), 3. greater than ( v seems to be closer to the planet than c) 4. less than 5. equal to, 6. less than 7. less than.

Asteroids X, Y, and Z have equal mass of 4.0 kg each, They orbit aro.pdf

fashionscollect

Biochemistry:- Explain the differences in the ease of lateral movement and transmembrane movement of phospholipids. Solution Lateral movement refers to the lateral movement of lipids and proteins found in the membrane. Membrane lipids and proteins are generally free to move laterally if they are not restricted by certain interactions. Lateral diffusion is a fairly quick and spontaneous process. Transverse movement involves the movement of a lipid or protein from one membrane surface to the other. Unlike lateral diffusion, transverse diffusion is a fairly slow process due to the fact that a relatively significant amount of energy is required for flip-flopping to occur. Most large proteins do not flip-flop due to their extensive polar regions, which are unfavorable in the hydrophobic core of a membrane bilayer. Differences in the ease of lateral movement and transmembrane movement of phospholipids.

Biochemistry-Explain the differences in the ease of lateral movem.pdf

fashionscollect

4. Ammonia and calcium chlorate react to yield nitrogen gas, water, a.pdf

fashionscollect

With regard to the SDLC and the Systems Engineering process: The SDLC and Systems Engineering method are independent from each other. You may use the SE method without being within a life cycle and alternatively you may develop a system throughout its life cycle without using the SE method. The SDLC and Systems Engineering method are highly dependent on each other. A system\'s life cycle is iterated several times within the SE method. The SDLC and Systems Engineering method are highly dependent on each other. The SE method is iterated several times over a system\'s development life cycle. The SDLC and SE method are essentially the same thing. Showing a system\'s life cycle is just another way of showing the SE method.a. The SDLC and Systems Engineering method are independent from each other. You may use the SE method without being within a life cycle and alternatively you may develop a system throughout its life cycle without using the SE method.b. The SDLC and Systems Engineering method are highly dependent on each other. A system\'s life cycle is iterated several times within the SE method.c. The SDLC and Systems Engineering method are highly dependent on each other. The SE method is iterated several times over a system\'s development life cycle.d. The SDLC and SE method are essentially the same thing. Showing a system\'s life cycle is just another way of showing the SE method. Solution Answer b) The SDLC and Systems Engineering method are highly dependent on each other. A system\'s life cycle is iterated several times within the SE method. Explanation: The systems development life cycle (SDLC), is a term used in systems engineering, information systems and software engineering to describe a process for planning, creating, testing, and deploying an information system..

With regard to the SDLC and the Systems Engineering processThe SD.pdf

fashionscollect

What is the conjugate acid of each of the following Brønsted–Lowry bases? HSO3 Express your answer as a chemical formula. SO32 Express your answer as a chemical formula. OH Express your answer as a chemical formula. H2PO4 Express your answer as a chemical formula. Solution the conjugate acid is formed by addition of H+ , ions to base , H2SO3 is the conjugate acid of bronsted lowry base HSO3-- , for SO3 2-- It is HSO3--, FOR OH-- , it is H2O , FOR H2PO4-- , it is H3PO4.

What is the conjugate acid of each of the following Brønsted–Lowry b.pdf

fashionscollect

What is the importance of phosphoryl-transfer potential and what factors differentiate the stability of reactants vs. products? Solution Importance of phosphoryl-transfer potential:is defined as the ability of a compound to transfer its phosphoryl group across a membrane.The phosphoryl transfer potential is an important form of cellular energy transformation. 4 factors differentiate the stability of reactants and products: 1. Electrostatic (charge) repulsion. 2. Resonance stabilization. 3. Increase in Entropy. 4.Stabilization due to hydration..

What is the importance of phosphoryl-transfer potential and what fac.pdf

fashionscollect

What is emphysema? What effect does emphysema have on breathing? What are the causes and treatments? Solution Emphysema is progressive disease of lungs that causes due to over inflation of alveoli. The lung tissue involved in exchange of gases are impaired or destroyed. In this disease, the airflow on exhalation is slowed or stopped because of over inflation of alveoli . So when a person tries to breathe, no movements of gases out of the alveoli. The causes of emphysema are cigarette smoking, air pollution, airway reactivity etc. It can be treated using bronchodilating medications, steroid medications, antibiotics, and oxygen in the case of emergency conditions..

What is emphysema What effect does emphysema have on breathing Wha.pdf

fashionscollect

What are cyclins?and How do cyclins oscillate? Solution Cyclines are group of protein that control the progression of cell in cell cycle by activating cycline dependent kinase. Each cycline associates with one or two CDK. And cycline - CDK complex results in activation of active sites. Some studies suggest that cell cycle is triggered by an oscillator present in midst of cyclin - CDK complex. Cyclins in presence of sufficient growth factor of CDK is capable of self organisation in the form of oscillations. The oscillations corresponds to sequential activation various CDK cyclin complex that control cell cycle.the change from cell quiescence to cell proliferation corresponds to transition from a stable state to oscillations state of CDK..

What are cyclinsand How do cyclins oscillateSolutionCyclines.pdf

fashionscollect

Weaver Company Comparative Balance Sheet December 31, 2015 and 2014 2015 2014 Cash Accounts recelvable Inventory Prepald expenses $ 2 $ 11 231 196 306 155 9 Total current assets 468 443 Property, plant, and equipment 508 428 Less accumulated depreciation Net property, plant, and equipment Long-term Investments Total assets (86) 422 28 (71) 357 35 $ 918 835 Liabilties and Stockholders\' Equity Accounts payable Accrued llabilities Income taxes payable $301 226 79 64 71 72 369 172 Total current llabllitles 198 642 161 Bonds payable Total llabllities 541 Common stock 200 94. 115 Retalned earnings Total stockholders\' equity Total liabllties and stockholders\' equity 276 294 $ 918 835 Solution Weaver Company Statement of Cash Flows For the year ended December 31, 2015 (I) Operating activities Net income for the current year 60 Adjustments to convert net income to cash basis Provision for tax made 25 Loss on sale of equipments 2 Depreciation provided 25 Less: Gain on sale of investments -5 Operating profits before working capital changes 107 Add: Decrease in current assets Inventory 41 Less: Increase in current assets Accounts receivable - 75 Prepaid expenses - 4 Add: Increase in current liabilities Accounts payables 75 Less: Decrease in current liabilities Accrued liabilities - 8 Less: Tax paid - 17 Net cash generated from operating activities 119 (II) Investing activities Sale of investments 12 Sale of equipments 18 Purchase of property, plant and equipments -110 Net cash used in investing activities - 80 (III) Financing activities Cash dividend paid - 39 Buy back of own stock - 39 Issue of bonds payable 26 Net cash used in financing activities - 52 Net increase in cash and cash equivalents (I+II+III) - 13 Add:Begining cash and cash equivalents 11 Ending cash and cash equivalents - 2 Dr. Provision for tax account Cr. Cash(Tax paid) 17 Balance b/d 64 Balance c/d 72 Provision for tax made 25 89 89 Dr. Property, plant and equipments account Cr. Balance b/d 428 Accu. depreciation 10 Cash (Purchases) 110 Cash (sale) 18 (Bal.Fig.) Loss on sale 2 Balance c/d 508 538 538 Dr. Accumulated depreciation account Cr. Equipment account 10 Balance b/d 71 Balance c/d 86 Depreciation for the current year 25 96 96 Net cash provided by operating activities $119.

Weaver Company Comparative Balance Sheet December 31, 2015 and 2014 2.pdf

fashionscollect

13. The auditor\'s report on Other Financial Information (OFI) accompanying the audited statements may take the form of: a. an opinion that the OFI is fairly stated, but only with respect to the statements taken as a whole b. an opinion that the OFI is fairly stated at the OFI detail level of analysis c. a disclaimer of opinion on the OFI d. either a or c. e. either b or c. Solution Management is responsible for the other information. The other information comprises the information included in the X report but does not include the financial statements and our auditor’s report thereon. Asnwer: D .either a or c..

13. The auditors report on Other Financial Information (OFI) accomp.pdf

fashionscollect

More from fashionscollect (20)