Complete the C++ program and implement the routines that are n.docx
•Download as DOCX, PDF•
0 likes•3 views
The document defines classes for a binary tree and tree nodes. It provides the function signatures for common tree operations like insertion, searching, and traversal but does not implement the function bodies. The solution implements the InsertIntoTree(), PrintInOrderTree(), PrintPreOrderTree(), and PrintPostOrderTree() functions to add nodes to the tree and print the tree using different traversal orders. Running the main() method constructs a sample tree and tests the implemented functions.
Report
Share
Report
Share
![// Complete the C++ program and implement the routines that
are not implemented #include <iostream> #include
<iomanip> #include <fstream> #include <string> #include
<vector> using namespace std; class TreeStruct; class Tree;
class Stack; class Queue; typedef TreeStruct* TreeStructPtr;
typedef Tree* TreePtr; class Stack { private:
vector<TreeStructPtr> s; public: void push(TreeStructPtr
ptr) {s.insert(s.begin(), ptr);} TreeStructPtr pop(){
TreeStructPtr ptr = s[0]; s.erase(s.begin()); return ptr;}
bool empty(){return (s.size()==0);} }; class Queue { private:
vector<TreeStructPtr> q; public: void push(TreeStructPtr
ptr) {q.push_back(ptr);} TreeStructPtr pop(){
TreeStructPtr ptr = q[0]; q.erase(q.begin()); return ptr;}
bool empty(){return (q.size()==0);} }; class TreeStruct {
public: int Number; TreeStructPtr Left; TreeStructPtr
Right; }; class Tree { public: TreeStructPtr TreeRoot;
Tree(); void InsertIntoTree(TreeStructPtr& Root, int num);
int FindMaxLen(TreeStructPtr Root); int
FindMinLen(TreeStructPtr Root); int
CountNodes(TreeStructPtr Root); void Copy(TreeStructPtr
Root1, TreeStructPtr& Root2); //copies one tree into another
bool Search(TreeStructPtr Root, int n); void
PrintInOrderTree(TreeStructPtr Root); void
PrintPreOrderTree(TreeStructPtr Root); void
PrintPostOrderTree(TreeStructPtr Root); void
PrintPreOrderTreeWithStack(TreeStructPtr Root); void
PrintBreadthFirstWithQueue(TreeStructPtr Root); }; // ----------
------------------------------------------------------ // tree
constructor Tree::Tree() { TreeRoot = NULL; } //----------------
------------------------------------------------ void
Copy(TreeStructPtr Root1, TreeStructPtr& Root2) //copies one
tree into another { } //----------------------------------------------
------------------ // Inserting into the tree using recursion void
Tree::InsertIntoTree(TreeStructPtr& Root, int x) { } //----------
------------------------------------------------------ int](https://image.slidesharecdn.com/completethecprogramandimplementtheroutinesthataren-220915184048-9f02cfa7/85/Complete-the-C-program-and-implement-the-routines-that-are-n-docx-1-320.jpg)
Recommended
Complete the C++ program and implement the routines that are not .docx
The document describes a C++ program that implements a binary tree data structure with various node-related methods like insertion, searching, and traversal. It includes class definitions for the tree nodes (TreeStruct), the overall tree (Tree), and auxiliary stack and queue classes. Many methods are only declared, leaving their implementation incomplete. The main() function tests the various methods by building a sample tree and printing outputs.
Complete the C++ program and implement the routines that are not .docx
The document describes a C++ program that implements a binary tree data structure with various methods. It includes class definitions for a tree node (TreeStruct), the tree itself (Tree), and stacks and queues used in tree traversals. Many methods of the Tree class are only declared, leaving them to be implemented. The main() function inserts nodes into a sample tree and tests various tree operations. It provides output examples to check if the implemented methods are working correctly.
Data StructuresPlease I need help completing this c++ program..pdf
Data Structures
Please I need help completing this c++ program. it was giving to complete it with no other
discriptions.
#include
using namespace std;
template
struct node
{
datatype info;
node *left, *right;
};
template
class tree
{
public:
tree();
~tree();
bool isempty();
void inserttree(datatype data);
void print();
private:
node *root;
};
template
tree::tree()
{
root = NULL;
}
template
void tree ::inserttree(datatype data)
{
node *temp;
temp = new node ;
temp->left = NULL;
temp->right = NULL;
temp->info = data;
if (root == NULL)
root = temp;
else
before = NULL;
after = root;
while (after != NULL)
{
b = a;
root
...;
else
}
if(temp->info< before->info)
before->left = temp;
else
before->right = temp;
//before = after;
//if (temp->info < after->info)
//after = after->left;
//else
//after = after->right;
//if(temp->info< before->info)
//before->left = temp;
//else
//before->right = temp;
}
template
void tree ::print(tree *temp)
{
if (temp != NULL)
{
print(temp->left);
cout << temp->info << endl;
print(temp->right);
}
p();
print(root);
}
int main()
{
tree t;
//put this in a loop
t.inserttree(90);
t.inserttree(80);
t.inserttree(108);
t.p();
}
Solution
// HEADER FILE FOR BINARY TREE//
// Define a structure to be used as the tree node
struct TreeNode
{
int Key;
float fValue;
int iValue;
char cArray[7];
TreeNode *left;
TreeNode *right;
};
class Code202_Tree
{
private:
TreeNode *root;
public:
Code202_Tree();
~Code202_Tree();
bool isEmpty();
TreeNode *SearchTree(int Key);
bool Insert(TreeNode *newNode);
bool Insert(int Key, float f, int i, char *cA);
bool Delete(int Key);
void PrintOne(TreeNode *T);
void PrintTree();
private:
void ClearTree(TreeNode *T);
TreeNode *DupNode(TreeNode * T);
void PrintAll(TreeNode *T);
};
#endif
//IMPLEMENTATION .CPP FILE FOR BINARY TREE//
#include
#include
#include \"Code202_Tree.h\"
using namespace std;
//--------------------------------------------
// Function: Code202_Tree()
// Purpose: Class constructor.
//--------------------------------------------
Code202_Tree::Code202_Tree()
{
root = NULL;
return;
}
//--------------------------------------------
// Function: Code202_Tree()
// Purpose: Class destructor.
//--------------------------------------------
Code202_Tree::~Code202_Tree()
{
ClearTree(root);
return;
}
//--------------------------------------------
// Function: ClearTree()
// Purpose: Perform a recursive traversal of
// a tree destroying all nodes.
//--------------------------------------------
void Code202_Tree::ClearTree(TreeNode *T)
{
if(T==NULL) return; // Nothing to clear
if(T->left != NULL) ClearTree(T->left); // Clear left sub-tree
if(T->right != NULL) ClearTree(T->right); // Clear right sub-tree
delete T; // Destroy this node
return;
}
//--------------------------------------------
// Function: isEmpty()
// Purpose: Return TRUE if tree is empty.
//--------------------------------------------
bool Code202_Tree::isEmpty()
{
return(root==NULL);
}
//--------------------------------------------
// Function.
DS & Algo 1 - C++ and STL Introduction
Mohammad Imam Hossain is a lecturer in the Department of Computer Science and Engineering at UIU. His email is provided. The document discusses C++ including its history and structure, input/output, file I/O, STL containers like vector, stack, queue and map, and strings. Key STL concepts covered are containers, iterators, insertion, deletion, searching and accessing elements.
AvlTree.h#ifndef AVL_TREE_H#define AVL_TREE_H#include d.docx
AvlTree.h
#ifndef AVL_TREE_H
#define AVL_TREE_H
#include "dsexceptions.h"
#include <iostream> // For NULL
#include <queue> // For level order printout
#include <vector>
#include <algorithm> // For max() function
using namespace std;
// AvlTree class
//
// CONSTRUCTION: with ITEM_NOT_FOUND object used to signal failed finds
//
// ******************PUBLIC OPERATIONS*********************
// Programming Assignment Part I
// bool empty( ) --> Test for empty tree @ root
// int size( ) --> Quantity of elements in tree
// int height( ) --> Height of the tree (null == -1)
// void insert( x ) --> Insert x
// void insert( vector<T> ) --> Insert whole vector of values
// void remove( x ) --> Remove x (unimplemented)
// bool contains( x ) --> Return true if x is present
// Comparable findMin( ) --> Return smallest item
// Comparable findMax( ) --> Return largest item
// boolean isEmpty( ) --> Return true if empty; else false
// void printTree( ) --> Print tree in sorted (in) order
// void printPreOrder( ) --> Print tree in pre order
// void printPostOrder( ) --> Print tree in post order
// void printInOrder( ) --> Print tree in *in* order
// Programming Assignment Part II (microassignment)
// void makeEmpty( ) --> Remove and delete all items
// void ~AvlTree( ) --> Big Five Destructor
// AvlTree(const AvlTree &other) --> BigFive Copy Constructor
// AvlTree(const AvlTree &&other) --> BigFive Move Constructor
// AvlTree &operator= ( AvlTree & other ) --> Big Five Copy *assignment* operator
// AvlTree &operator= ( AvlTree && other ) --> Big Five Move *assignment* operator
// void printLevelOrder( ) --> Print tree in LEVEL order :-)
// ******************ERRORS********************************
// Throws UnderflowException as warranted
template <typename Comparable>
class AvlTree
{
public:
/**
* Basic constructor for an empty tree
*/
AvlTree( ) : root( NULL )
{
//cout << " [d] AvlTree constructor called. " << endl;
}
/**
* Vector of data initializer (needed for move= operator rvalue)
*/
AvlTree( vector<Comparable> vals ) : root( NULL )
{
insert(vals);
}
//*******************************************************************************************
// START AVL TREES PART II - TODO: Implement
// Other functions to look for include: clone, makeEmpty, printLevelOrder
/**
* Destroy contents of the AvlTree object - Big Five Destructor
*/
~AvlTree( )
{
//cout << " [d] AvlTree Destructor called. " << endl;
// Empty out the AVL Tree and destroy all nodes (makeEmpty?)
}
/**
* Copy other to new object - Big Five Copy Constructor
*/
AvlTree( const AvlTree &other ) : root( NULL )
{
cout << " [d] Copy Constructor Called." << endl;
// Copy contents of other to ourselves (maybe clone?)
// Get a deep copy of other's tree
}
/* ...
Stack, queue and hashing
This document provides information about stacks, queues, and hashing. It describes stacks as data structures where the last item inserted is the first item accessed. Common stack operations like push(), pop(), and peek() are discussed. Array and linked list implementations of stacks are presented. Examples of stack applications in compiler design, expression evaluation, and spell checking are given. Queues are defined as structures where the first item inserted is the first item accessed (FIFO). Circular queue implementations are described to avoid overflow issues. Deques, which allow insertion and removal from both ends, are also introduced. Implementation of queues using arrays is demonstrated with methods like enqueue(), dequeue(), and isEmpty().
C++, Implement the class BinarySearchTree, as given in listing 16-4 .pdf
The document provides code for implementing a binary search tree (BST) data structure in C++. It includes the class declaration and functions for inserting nodes, deleting nodes, and traversing the tree using preorder, inorder and postorder traversal. It also includes functions for finding a node, displaying the tree structure, and a main function containing a menu of operations for testing the BST implementation.
g++ -o simpleVector.exe simpleVector.cpp #include stdio.h #i.pdf
//g++ -o simpleVector.exe simpleVector.cpp
#include
#include
#include
using namespace std;
/******************************************************
* Template class named SimpleVector
* An array that can hold any specified
* data type. Use a dynamic array.
******************************************************/
template
class SimpleVector
{
public:
//default constructor
SimpleVector();
//constructor with size of array
SimpleVector(int size);
//copy constructor
SimpleVector(const SimpleVector& object);
//setter method
void SetArray(int size);
//getter method
void ShowArray(int size);
//destructor
void FreeMemory();
//accessor method
int GetSizeOfArray();
//getter method
T GetElementAt(int index);
//Overload the [] operator. The argument is a subscript.
//This function returns a reference
//to the element in the array indexed by the subscript.
T operator [] (int subscript);
private:
//private memeber variable
T *array; //to dynamically allocate an array
T *copy;
};
//These function are going to be used in switch statement
//in order to test each case(integer, double, string).
void caseOne(int userInput, int size);
void caseTwo(int userInput, int size);
void caseThree(int userInput, int size);
int main() {
int userInput;
int size;
char keepInput;
do {
cout << \"What type of data do you want?\ \";
cout <<\"1. intger\ \";
cout <<\"2. double\ \";
cout <<\"3. strings\ \";
cin >> userInput;
cout << \"Enter the number of data \";
cin >> size;
switch(userInput) {
case 1:
{
caseOne(userInput, size);
break;
}
case 2:
{
caseTwo(userInput, size);
break;
}
case 3:
{
caseThree(userInput, size);
break;
}
default:
cout << \"invalid input\";
}
cout << \"\ Do you want to enter the data again?(Y/N)\ \";
cin >> keepInput;
} while(toupper(keepInput) == \'Y\');
return 0;
}
//This funciton is called in the switch satatement
//The purpose of this funtion is test SimpleVecor calss
//funciton for \'int\' type.
void caseOne(int userInput, int size) {
SimpleVectorintegerData(size);
integerData.SetArray(size);
integerData.ShowArray(size);
cout << \"\ Enter an index to retrieve the data\ \";
cin >> userInput;
cout << \"\ Getting an element of array by \ \";
cout << \"1. GetElementAt function : \";
cout << integerData.GetElementAt(userInput);
cout << \"\ 2. overloaded operator [] : \";
cout << integerData[userInput];
cout << \"\ \ Copying the array\";
SimpleVectornewIntegerData(integerData);
newIntegerData.ShowArray(size);
newIntegerData.FreeMemory();
}
//This funciton is called in the switch satatement
//The purpose of this funtion is test SimpleVecor calss
//funciton for \'double\' type.
void caseTwo(int userInput, int size) {
SimpleVectordoubleData(size);
doubleData.SetArray(size);
doubleData.ShowArray(size);
cout << \"\ Enter an index to retrieve the data\ \";
cin >> userInput;
cout << \"\ Getting an element of array by \ \";
cout << \"1. GetElementAt function : \";
cout << doubleData.GetElementAt(userInput);
cout << \"\ 2. overloaded operator [] : \";
cout << doubleData[.
Recommended
Complete the C++ program and implement the routines that are not .docx
The document describes a C++ program that implements a binary tree data structure with various node-related methods like insertion, searching, and traversal. It includes class definitions for the tree nodes (TreeStruct), the overall tree (Tree), and auxiliary stack and queue classes. Many methods are only declared, leaving their implementation incomplete. The main() function tests the various methods by building a sample tree and printing outputs.
Complete the C++ program and implement the routines that are not .docx
The document describes a C++ program that implements a binary tree data structure with various methods. It includes class definitions for a tree node (TreeStruct), the tree itself (Tree), and stacks and queues used in tree traversals. Many methods of the Tree class are only declared, leaving them to be implemented. The main() function inserts nodes into a sample tree and tests various tree operations. It provides output examples to check if the implemented methods are working correctly.
Data StructuresPlease I need help completing this c++ program..pdf
Data Structures
Please I need help completing this c++ program. it was giving to complete it with no other
discriptions.
#include
using namespace std;
template
struct node
{
datatype info;
node *left, *right;
};
template
class tree
{
public:
tree();
~tree();
bool isempty();
void inserttree(datatype data);
void print();
private:
node *root;
};
template
tree::tree()
{
root = NULL;
}
template
void tree ::inserttree(datatype data)
{
node *temp;
temp = new node ;
temp->left = NULL;
temp->right = NULL;
temp->info = data;
if (root == NULL)
root = temp;
else
before = NULL;
after = root;
while (after != NULL)
{
b = a;
root
...;
else
}
if(temp->info< before->info)
before->left = temp;
else
before->right = temp;
//before = after;
//if (temp->info < after->info)
//after = after->left;
//else
//after = after->right;
//if(temp->info< before->info)
//before->left = temp;
//else
//before->right = temp;
}
template
void tree ::print(tree *temp)
{
if (temp != NULL)
{
print(temp->left);
cout << temp->info << endl;
print(temp->right);
}
p();
print(root);
}
int main()
{
tree t;
//put this in a loop
t.inserttree(90);
t.inserttree(80);
t.inserttree(108);
t.p();
}
Solution
// HEADER FILE FOR BINARY TREE//
// Define a structure to be used as the tree node
struct TreeNode
{
int Key;
float fValue;
int iValue;
char cArray[7];
TreeNode *left;
TreeNode *right;
};
class Code202_Tree
{
private:
TreeNode *root;
public:
Code202_Tree();
~Code202_Tree();
bool isEmpty();
TreeNode *SearchTree(int Key);
bool Insert(TreeNode *newNode);
bool Insert(int Key, float f, int i, char *cA);
bool Delete(int Key);
void PrintOne(TreeNode *T);
void PrintTree();
private:
void ClearTree(TreeNode *T);
TreeNode *DupNode(TreeNode * T);
void PrintAll(TreeNode *T);
};
#endif
//IMPLEMENTATION .CPP FILE FOR BINARY TREE//
#include
#include
#include \"Code202_Tree.h\"
using namespace std;
//--------------------------------------------
// Function: Code202_Tree()
// Purpose: Class constructor.
//--------------------------------------------
Code202_Tree::Code202_Tree()
{
root = NULL;
return;
}
//--------------------------------------------
// Function: Code202_Tree()
// Purpose: Class destructor.
//--------------------------------------------
Code202_Tree::~Code202_Tree()
{
ClearTree(root);
return;
}
//--------------------------------------------
// Function: ClearTree()
// Purpose: Perform a recursive traversal of
// a tree destroying all nodes.
//--------------------------------------------
void Code202_Tree::ClearTree(TreeNode *T)
{
if(T==NULL) return; // Nothing to clear
if(T->left != NULL) ClearTree(T->left); // Clear left sub-tree
if(T->right != NULL) ClearTree(T->right); // Clear right sub-tree
delete T; // Destroy this node
return;
}
//--------------------------------------------
// Function: isEmpty()
// Purpose: Return TRUE if tree is empty.
//--------------------------------------------
bool Code202_Tree::isEmpty()
{
return(root==NULL);
}
//--------------------------------------------
// Function.
DS & Algo 1 - C++ and STL Introduction
Mohammad Imam Hossain is a lecturer in the Department of Computer Science and Engineering at UIU. His email is provided. The document discusses C++ including its history and structure, input/output, file I/O, STL containers like vector, stack, queue and map, and strings. Key STL concepts covered are containers, iterators, insertion, deletion, searching and accessing elements.
AvlTree.h#ifndef AVL_TREE_H#define AVL_TREE_H#include d.docx
AvlTree.h
#ifndef AVL_TREE_H
#define AVL_TREE_H
#include "dsexceptions.h"
#include <iostream> // For NULL
#include <queue> // For level order printout
#include <vector>
#include <algorithm> // For max() function
using namespace std;
// AvlTree class
//
// CONSTRUCTION: with ITEM_NOT_FOUND object used to signal failed finds
//
// ******************PUBLIC OPERATIONS*********************
// Programming Assignment Part I
// bool empty( ) --> Test for empty tree @ root
// int size( ) --> Quantity of elements in tree
// int height( ) --> Height of the tree (null == -1)
// void insert( x ) --> Insert x
// void insert( vector<T> ) --> Insert whole vector of values
// void remove( x ) --> Remove x (unimplemented)
// bool contains( x ) --> Return true if x is present
// Comparable findMin( ) --> Return smallest item
// Comparable findMax( ) --> Return largest item
// boolean isEmpty( ) --> Return true if empty; else false
// void printTree( ) --> Print tree in sorted (in) order
// void printPreOrder( ) --> Print tree in pre order
// void printPostOrder( ) --> Print tree in post order
// void printInOrder( ) --> Print tree in *in* order
// Programming Assignment Part II (microassignment)
// void makeEmpty( ) --> Remove and delete all items
// void ~AvlTree( ) --> Big Five Destructor
// AvlTree(const AvlTree &other) --> BigFive Copy Constructor
// AvlTree(const AvlTree &&other) --> BigFive Move Constructor
// AvlTree &operator= ( AvlTree & other ) --> Big Five Copy *assignment* operator
// AvlTree &operator= ( AvlTree && other ) --> Big Five Move *assignment* operator
// void printLevelOrder( ) --> Print tree in LEVEL order :-)
// ******************ERRORS********************************
// Throws UnderflowException as warranted
template <typename Comparable>
class AvlTree
{
public:
/**
* Basic constructor for an empty tree
*/
AvlTree( ) : root( NULL )
{
//cout << " [d] AvlTree constructor called. " << endl;
}
/**
* Vector of data initializer (needed for move= operator rvalue)
*/
AvlTree( vector<Comparable> vals ) : root( NULL )
{
insert(vals);
}
//*******************************************************************************************
// START AVL TREES PART II - TODO: Implement
// Other functions to look for include: clone, makeEmpty, printLevelOrder
/**
* Destroy contents of the AvlTree object - Big Five Destructor
*/
~AvlTree( )
{
//cout << " [d] AvlTree Destructor called. " << endl;
// Empty out the AVL Tree and destroy all nodes (makeEmpty?)
}
/**
* Copy other to new object - Big Five Copy Constructor
*/
AvlTree( const AvlTree &other ) : root( NULL )
{
cout << " [d] Copy Constructor Called." << endl;
// Copy contents of other to ourselves (maybe clone?)
// Get a deep copy of other's tree
}
/* ...
Stack, queue and hashing
This document provides information about stacks, queues, and hashing. It describes stacks as data structures where the last item inserted is the first item accessed. Common stack operations like push(), pop(), and peek() are discussed. Array and linked list implementations of stacks are presented. Examples of stack applications in compiler design, expression evaluation, and spell checking are given. Queues are defined as structures where the first item inserted is the first item accessed (FIFO). Circular queue implementations are described to avoid overflow issues. Deques, which allow insertion and removal from both ends, are also introduced. Implementation of queues using arrays is demonstrated with methods like enqueue(), dequeue(), and isEmpty().
C++, Implement the class BinarySearchTree, as given in listing 16-4 .pdf
The document provides code for implementing a binary search tree (BST) data structure in C++. It includes the class declaration and functions for inserting nodes, deleting nodes, and traversing the tree using preorder, inorder and postorder traversal. It also includes functions for finding a node, displaying the tree structure, and a main function containing a menu of operations for testing the BST implementation.
g++ -o simpleVector.exe simpleVector.cpp #include stdio.h #i.pdf
//g++ -o simpleVector.exe simpleVector.cpp
#include
#include
#include
using namespace std;
/******************************************************
* Template class named SimpleVector
* An array that can hold any specified
* data type. Use a dynamic array.
******************************************************/
template
class SimpleVector
{
public:
//default constructor
SimpleVector();
//constructor with size of array
SimpleVector(int size);
//copy constructor
SimpleVector(const SimpleVector& object);
//setter method
void SetArray(int size);
//getter method
void ShowArray(int size);
//destructor
void FreeMemory();
//accessor method
int GetSizeOfArray();
//getter method
T GetElementAt(int index);
//Overload the [] operator. The argument is a subscript.
//This function returns a reference
//to the element in the array indexed by the subscript.
T operator [] (int subscript);
private:
//private memeber variable
T *array; //to dynamically allocate an array
T *copy;
};
//These function are going to be used in switch statement
//in order to test each case(integer, double, string).
void caseOne(int userInput, int size);
void caseTwo(int userInput, int size);
void caseThree(int userInput, int size);
int main() {
int userInput;
int size;
char keepInput;
do {
cout << \"What type of data do you want?\ \";
cout <<\"1. intger\ \";
cout <<\"2. double\ \";
cout <<\"3. strings\ \";
cin >> userInput;
cout << \"Enter the number of data \";
cin >> size;
switch(userInput) {
case 1:
{
caseOne(userInput, size);
break;
}
case 2:
{
caseTwo(userInput, size);
break;
}
case 3:
{
caseThree(userInput, size);
break;
}
default:
cout << \"invalid input\";
}
cout << \"\ Do you want to enter the data again?(Y/N)\ \";
cin >> keepInput;
} while(toupper(keepInput) == \'Y\');
return 0;
}
//This funciton is called in the switch satatement
//The purpose of this funtion is test SimpleVecor calss
//funciton for \'int\' type.
void caseOne(int userInput, int size) {
SimpleVectorintegerData(size);
integerData.SetArray(size);
integerData.ShowArray(size);
cout << \"\ Enter an index to retrieve the data\ \";
cin >> userInput;
cout << \"\ Getting an element of array by \ \";
cout << \"1. GetElementAt function : \";
cout << integerData.GetElementAt(userInput);
cout << \"\ 2. overloaded operator [] : \";
cout << integerData[userInput];
cout << \"\ \ Copying the array\";
SimpleVectornewIntegerData(integerData);
newIntegerData.ShowArray(size);
newIntegerData.FreeMemory();
}
//This funciton is called in the switch satatement
//The purpose of this funtion is test SimpleVecor calss
//funciton for \'double\' type.
void caseTwo(int userInput, int size) {
SimpleVectordoubleData(size);
doubleData.SetArray(size);
doubleData.ShowArray(size);
cout << \"\ Enter an index to retrieve the data\ \";
cin >> userInput;
cout << \"\ Getting an element of array by \ \";
cout << \"1. GetElementAt function : \";
cout << doubleData.GetElementAt(userInput);
cout << \"\ 2. overloaded operator [] : \";
cout << doubleData[.
RightTrianglerightTriangle.cppRightTrianglerightTriangle.cpp.docx
RightTriangle/rightTriangle.cppRightTriangle/rightTriangle.cpp// This file includes implementations for functions of the right
// triangle class.
#include<iostream>
#include<cmath>
usingnamespace std;
#include"rightTriangle.h"
// Default constructor
RightTriangle::RightTriangle()
{
base =0;
height =0;
}
// SET functions (for storing data in private data members)
voidRightTriangle::setHeight(double h)
{
height = h;
}
voidRightTriangle::setBase(double b)
{
base = b;
}
// Calculate length of hypotenuse using
// Pythagorean Theorem
doubleRightTriangle::calcHypotenuse()
{
return sqrt (base * base + height * height);
}
__MACOSX/RightTriangle/._rightTriangle.cpp
RightTriangle/rightTriangle.h
// This file defines the specifications for a class to store
// attributes of a right triangle
class RightTriangle
{
private: // PRIVATE data members
double base;
double height;
public: // PUBLIC member functions
RightTriangle(); // Default constructor
void setHeight(double h); // SET functions
void setBase(double b);
// Calculate length of hypotenuse
double calcHypotenuse();
};
__MACOSX/RightTriangle/._rightTriangle.h
RightTriangle/testTriangle.cppRightTriangle/testTriangle.cpp// This program calculates various parameters of a
// right triangle.
#include<iostream>
usingnamespace std;
#include"rightTriangle.h"
int main()
{
// Declaration
double base,height;
RightTriangle aTriangle;
// Input
cout <<"Enter the base of the triangle: ";
cin >> base;
cout <<"Enter the height of the triangle: ";
cin >> height;
// Move data to object
aTriangle.setBase(base);
aTriangle.setHeight(height);
// Calculations and output
cout << endl;
cout <<"Length of hypotenuse: "
<< aTriangle.calcHypotenuse()<< endl;
return0;
}// end main function
__MACOSX/RightTriangle/._testTriangle.cpp
c++practice3a3b/._rightTriangle.cpp
c++practice3a3b/._rightTriangle.h
c++practice3a3b/._testTriangle.cpp
c++practice3a3b/partList.txt
2345 Snoozle 15.4 29.95
1234 Widget 5.4 9.99
3456 Bludger 9.1 15.49
5678 Zeeter 7.7 1.99
6789 Sub_Tweezer 12.3 5.25
4567 Woofle 3.7 49.79
c++practice3a3b/partMgr.cppc++practice3a3b/partMgr.cpp// This program manages a list of parts.
#include<iostream>
#include<iomanip>
#include<fstream>
usingnamespace std;
// Attributes for one part
struct partInfo
{
int number;
char name[30];
double weight;
double price;
};
constint MAX_LIST_SIZE =100;
// Function prototypes
int menu();
void buildPartsList(partInfo partList[],int& listSize);
void searchParts(partInfo partList[],int numParts);
void listParts(partInfo partList[],int& numParts);
void insertPart(partInfo list[],int& numElems);
void deletePart(partInfo list[],int& numElems);
partInfo getPartInfo();
v ...
I just need code for processQueue function using iterators from the .pdf
I just need code for processQueue function using iterators from the linkedList class.
#include
#include
#include
#include
#include "Queuecpp.h"
#include "Songcpp.h"
#include "RequestCpp.h"
void populateRequests(Queue& q);
void populateSongDataBase(LinkedList &list);
void processQueue(LinkedList &list,Queue& q);
void processRequest(std::string action, std::string title,std::string singer,int chartPos);
//GIVEN
int main() {
LinkedList list;
Queue q;
populateSongDataBase(list); // fill the Songs Data Base into Linked List
std::cout<<"*************************************\n";
list.printList(); //
std::cout<<"*************************************\n";
populateRequests(q); // fill the request q
std::cout<<"\n";
std::cout<<"---------------PRINTING QUEUE-------------------\n";
q.printList();
std::cout<<"------------------------------------\n";
processQueue(list,q); // process the requests
std::cout<<"*************************************\n";
list.printList();
std::cout<<"*************************************\n";
}
//GIVEN
//Requires an empty linked list
//Effects fills the list with request by reading from the RequestData.txt
//Modifies the queue by filling it
void populateRequests(Queue &q){
}
//GIVEN
//Requires Filled data base , song to play
//Effects Finds song using get, if found plays it
//Modifies nothing
std::string playSong(LinkedList&list, Song s){
if (list.get(s)>=0){
return "PLAYING :"+ s.toString()+"\n";
}
else{
return "SONG NOT FOUND\n";
}
}
//GIVEN
//Requires filled database
//Effects calls print methood to print top ten songs
//Modifies nothing
void printTopTenSongs(LinkedList& list){
std::cout<<"PLAYING TOP TEN SONG __________\n";
list.print(10);
;
}
//Requires filled Song Database, a Song to add. The chart position given in the song is where it
will get added. Note this is a Song that is not supposed to exist in database.
//Effects adds the song from its original chart position
//Modifies the Song database. Adjust chart position of all Songs affected by this addition- this
adjustment is done in insert method using adjustPosition method. If the Process Queue adds a
Song that already is in the database, then a duplicate entry can occur.
//TODO
void addThisSong(LinkedList &list, Song s){
//TODO
/* Use this code
if (found>=0) {std::cout<<"ADDED THIS SONG "< &list, Song s){
/* Use this code
if (found>=0) {std::cout<<"SORRY CANNOT REMOVE THIS SONG - STILL FOUND AT
"< &list, Song s, int pos){
int chartPos=list.get(s);
std::cout<<"MOVING SONG "< &list,std::string action, std::string title,std::string singer,int
chartPos){
Song s(title,singer,chartPos);
char ch =action[0];
switch(ch){
case 'P' : std::cout< &list ,Queue& q){
int requestNumber=1;
//Create an iterator for the Queue to iteratate through requests
std::cout<<"-------------------------------------------------------------------------\n";
// call processRequest
std::cout<<"-------------------------------------------------------------------------\n"
std::cout<<"------------------------.
Using C++I keep getting messagehead does not name a type.pdf
Using C++
I keep getting message:
\'head does not name a type\'
\'teal does not name a type\'
Where do I place this code in my program:
/*search and delete with respect to location as current, head and tail
//define below 2 lines in LinkedList() function
head = new NodeType;
tail = new NodeType;
void UnsorderedType::DeleteItem(ItemType item)
{
NodeType *tempLocation, *location;
bool stop = false;
if(!isEmpty())
{
location = head;
tempLocation = head->link;
while (templocation != tail && !stop)
{
if (templocation->info == item)
stop = true;
else
{
location = templocation;
templocation = templocation->link;
}
}
if (!stop)
cout << \"The node to delete is not in the list!\" << endl;
else
{
location->link = templocation->link;
delete templocation;
count--;
}
}
else
{
cout << \"The list is empty!\" << endl;
}
}*/
/Problem and code:
Implement the UnsortedList class to store a list of strings that are input into the list from
data2.txt.
- create a main.cpp file that gets the numbers from the file
- insert the word \"cat\" into the list
- insert another word \"antibacterial\" into the list
- delete the word \"letter\" from the list
- print out the following:
--the entire list
- the greatest
- the least
2. Attach the main.cpp, UnsortedList.cpp, the ItemType.h, and the output file one called
outfile1.txt
- Yes you need to make your program output an \"outfile1.txt\"
3. Implement the UnsortedList class to store a list of numbers that are input into the list from
data.txt.
- create a main.cpp file that gets the numbers from the file
- insert the number 7 into the list
- insert another number 300 into the list
- delete the number 6 from the list
- print out the following:
--the entire list
- the greatest
- the least
2. Attach the main.cpp, UnsortedList.cpp, the ItemType.h, and the output file two called
outfile2.txt
- Yes you need to make your program output an \"outfile2.txt\"
data.txt
super formula travel free thick Josephine Clara education
data2.txt
super formula travel free thick Josephine Clara education
//My main.cpp
//--------------------------------------------------------------
// Test driver for Linked List UnsortedType list
// Navarr Barnier
// Your class CS3350 TTh 1:00
// Due date: Thursday, September 13, 2012
//
// Compile command: g++ hw2.cpp ch03-UnsortedType.cpp ch03-ItemType.cpp
// Input file name: hw2.txt
// Contains list of commands to add items to list, split original
// list into two lists, print each list and get the length of
// each list.
// Output: The result of each command is displayed on the screen.
// Filename: hw2.cpp
//--------------------------------------------------------------
#include
#include
#include
#include
#include
#include \"ItemType.h\"
using namespace std;
void PrintList(UnsortedType&);
void SplitList(UnsortedType&, ItemType);
ItemType GetItem(ItemType& item, bool& found);
int main()
{
ifstream inFile; // file containing operations
ofstream outFS; // Output file stream
string data; // operation to be executed
s.
Were writing code for a project that dynamically allocates an arra.pdf
We\'re writing code for a project that dynamically allocates an array stack. My other code works,
but my Min(), Max(), and Peek() functions fail. I\'ve provided my code for those functions at the
end of the post.
main.cpp
_________________________________________
#include
#include
#include
#include
#include \"stack.h\"
using namespace std;
int main(int argc, char* argv[])
{
ifstream inputs; // Input file for commands
char op; // Hold operation and optional char input
int value; // Value input from file
string comment; // Holds comment from file
Stack* sPtr = NULL; // Will point to TemplateQ object
// Output usage message if one input file name is not provided
if (argc != 2)
{
cout << \"Usage:\ project03 \ \";
return 1;
}
// Attempt to open input file -- terminate if file does not open
inputs.open(argv[1]);
if (!inputs)
{
cout << \"Error - unable to open input file\" << endl;
return 1;
}
// Input and echo header comment from file
getline(inputs, comment); // Input and echo the comment appearing in the test file
cout << endl << \'#\' << comment << endl;
// Process commands from input file
inputs >> op; // Attempt to input first command
while (inputs)
{
switch (op) // Process operation input from file
{
case \'#\': // Test file comment
getline(inputs, comment); // Input and echo the comment appearing in the test
file
cout << \'#\' << comment << endl;
break;
case \'c\': // Parameterized Constructor
inputs >> value;
cout << endl << \"Stack(\" << value << \")\";
try
{
sPtr = new Stack(value); // Attempt to create a stack object with array size
value
cout << \" -- completed\" << endl;
}
catch ( std::bad_alloc )
{
cout << \"Failed : Terminating now...\" << endl;
return 1;
}
break;
case \'+\': // Push
inputs >> value;
cout << \"Push(\" << value << \") -- \";
try
{
sPtr->Push(value);
cout << \"completed\";
}
catch (StackFull)
{
cout << \"Failed Full Stack\";
}
catch (...)
{
cout << \"operation failed\" << endl;
}
cout << endl;
break;
case \'-\': // Pop
cout << \"Pop() -- \";
try
{
sPtr->Pop();
cout << \"completed\";
}
catch (StackEmpty)
{
cout << \"Failed Empty Stack\";
}
catch (...)
{
cout << \"operation failed\" << endl;
}
cout << endl;
break;
case \'f\': // IsFull
cout << \"IsFull() -- \";
try
{
if (sPtr->IsFull())
cout << \"true\";
else
cout << \"false\";
}
catch ( ... )
{
cout << \"operation failed\";
}
cout << endl;
break;
case \'e\': // IsEmpty
cout << \"IsEmpty() -- \";
try
{
if (sPtr->IsEmpty())
cout << \"true\";
else
cout << \"false\";
}
catch ( ... )
{
cout << \"operation failed\";
}
cout << endl;
break;
case \'m\': // Make Empty
cout << \"MakeEmpty() -- \";
try
{
sPtr->MakeEmpty();
cout << \"completed\" << endl;
}
catch (...)
{
cout << \"operation failed\" << endl;
}
break;
case \'p\': // Print Stack
cout << \"Print() -- \";
sPtr->Print();
break;
case \'t\': // Top of Stack
try
{
cout << \"Top() -- \" << sPtr->Top() << endl;
}
catch (StackEmpty)
{
cout << \"Top() -- Failed Empty Stack\" << endl;
}
catch (...)
{
cout << \"operation failed\" .
complete the following functions in c++ singleRotation putNo.pdf
complete the following functions in c++
singleRotation
putNode: Insert or update the entry in the extended AVL tree map (TreeMapStats) using
the inputted key and value. In addition, efficiently update the statistics information of only
the nodes affected by the insertion of the new entry into the map
eraseNode: Remove the entry in the extended AVL tree map (TreeMapStats) with the
inputted key, if the key is in the map, if necessary. In addition, efficiently update the statistics
information of only the nodes affected by the removal of the new entry from the map
also right a function updateStats
class TreeMapStats : public AVLTreeMap {
public:
// embedded node class extension of an AVL-Tree node
class Node : public AVLTreeMap::Node {
private:
// stats class to account for basic statistics/information of subtree rooted at each node
class Stats {
private:
// data members: number of nodes/map entries stored in the subtree; sum of all the map values of
map entries stored in the subtree; the minimum map value of all the map entries stored in the
subtree; the maximum map value of the map entries stored in the subtree
int num;
int sum;
int min;
int max;
public:
// stats constructors
Stats() { };
Stats(int v, Node *l, Node* r) : num(1), sum(v), min(v), max(v) {
};
// stats destructor
~Stats() { };
// overloading output stream for a representation of stats s
friend ostream& operator<<(ostream& os, const Stats& s) {
os << "{" << s.num << "," << s.sum << "," << s.min << "," << s.max << "}";
return os;
};
};
// data member: node info/stats
Stats *info;
public:
// tree node constructors
Node() : AVLTreeMap::Node() { };
Node(int k, int v, Node* l, Node* r, Node* p) : AVLTreeMap::Node(k,v,l,r,p) {
info = new Stats(v, l, r);
};
// tree node destructor
virtual ~Node() { if (this->info) delete this->info; };
// overloading output stream for a representation of TreeMapStats node w
friend ostream& operator<<(ostream& os, const Node& w) {
os << ((AVLTreeMap::Node) w) << *(w.info) ;
return os;
};
// (overloading) print utility for a node, including map entry and additional info and stats
void printStats() { cout << *this << endl; }
/*
# PRECONDITION: the info values for the left and right nodes for the children of the node have
been properly set, consistent with the subtree that they root
# POSTCONDITION: the info values for the node have been properly set, consistent with the
subtree that it roots
*/
};
// print utilities
void printTreeMapStats();
void printTreeMapStats(Node* w);
void printTreeMap();
// tree constructor
TreeMapStats() { };
// tree desctructor
virtual ~TreeMapStats() { };
protected:
// (overloadable) auxiliary node creation utility
virtual Node* createNode(int k, int v, BSTMap::Node* l, BSTMap::Node* r, BSTMap::Node* p) {
return new Node(k,v,(Node*) l, (Node*) r, (Node*) p); };
// prints a representation of AVL node w
// (overloadable)
// INPUT: node w
virtual void printNode(const BSTMap::Node* w) const { if (w) cout << *((Node*) w); };
// (overloa.
in this assignment you are asked to write a simple driver program an.pdf
in this assignment you are asked to write a simple driver program and set of functions (maybein
a library) that can be performed on a binary search tree.
Your program should allow user to insert/delete integer values into the binary search tree along
with several other operations on the binary search tree. You can use the code given in slides. But
this time your key will be int! Specifically, your program will ask user to enter a command and
related parameters (if any) in a loop, and then perform the given commands. Here is the list of
commands that your program must implement:
* insert
*find\'
*delete
*list inorder
*list preorder
*list postorder
*list levelorder
* max
* min
* height
*count
* sum
*quit
As always, make sure you release (free) the dynamically allocated memories if you allocate any
memory in your programs. So, before submitting your program, run it with valgrind to see if
there is any memory leakage
//my proggram in C
struct tree_node {
int data;
struct tree_node *left, *right;
}
typedef struct nodeT {
int key;
struct nodeT *left, *right;
} nodeT, *treeT;
int main(){
while (TRUE) {
printf(\"> \");
line = GetLine();
ch = toupper(line[0]);
switch (ch) {
case \'I\': insert(); break;
case \'F\': find(); break;
case \'D\': delete(); break;
case \'LI\': listInorder; break;
case \'LPR\': listPreorder(); break;
case \'LPO\': listPostorder(); break;
case \'MAX\': max(); break;
case \'min\': min(); break;
case \'H\': height(); break;
case \'C\': count(); break;
case \'S\': sum(); break;
case \'Q\': exit(0);
default:printf(\"Illegal command\ \"); break;
}
}
}
nodeT *FindNode(nodeT *t, int key){
while(t !=NULL) {
if (key == t->key) return t;
if (key < t->key) {
t = t->left;
} else {
t = t->right;
}
return NULL;
}
void delete(nodeT **p){
nodeT
*target;
target=*p;
if (target->left==NULL && target->right==NULL) {
*p=NULL;
} else if (target->left == NULL) {
*p=target->right;
} else
if (target->right == NULL) {
*p=target->left;
} else {
/* target has two children, see next slide */
}
free(target);
}
void listInorder(nodeT *T){
if (t != NULL) {
DisplayTree(t->left);
printf(“%d “, t->key);
DisplayTree(t->right);
}
}
void listPreorder(nodeT *t) {
if (t != NULL) {
printf(“%d “, t->key);
DisplayTree(t->left);
DisplayTree(t->right);
}
}
void listPostOrder(nodeT *t){
if (t != NULL) {
DisplayTree(t->left);
DisplayTree(t->right);
printf(“%d “, t->key);
}
}
void intsert(nodeT **tptr, int key){
nodeT*t, *tmp;
t=*tptr;
if (t == NULL) {
tmp=New(nodeT*);
tmp->key = key;
tmp->left=tmp->right=NULL;
*tptr=tmp;
return;
}
if (key < t->key) {
InsertNode
(&t->left, key);
} else {
InsertNode(&t->right, key);
}
}
int height(nodeT *t){
if (t == NULL)
return 0;
else
return (1 + maximumof(
height(t->left),
height(t->right)) );
}
int sum(struct tree_node *p){
if (p == NULL)
return 0;
else
return (p->data +
sum(p->left) +
sum(p->right) );
}
Solution
1. /*
2. * Java Program to Implement Binary Search Tree
3. */
4.
5. import java.util.Scanner;
6.
7. /* Class BSTNode */
8. cl.
-- Task 2- Debugging a program with stacks- queues- and doubly-linked.docx
/* Task 2: Debugging a program with stacks, queues, and doubly-linked lists There are a number of errors in the following program. All errors are located in main() and structure definitions. Function declarations and definitions are correct! Locate all errors, fix them (as shown below), run the program and save its output as a comment at the end of the source file. Example: int num = 10; int *ptr; num = &ptr; // <== Error: Comment the line and write the correct line below // Write a short justification where appropriate // num = &ptr; // Error #1 ptr = # Name: */ #include #include #include #include #define DUMMY_TRAILER '\177' // octal ASCII code of the // last character in the ASCII table #define NUM_CITIES 10 typedef struct { char name[12]; int temperature[5]; } CITY; // Stack and Queue Node typedef struct node NODE; struct node { CITY city; node *next; }; // Doubly Linked List Node typedef struct d_node D_NODE; struct d_node { CITY city; NODE *forw; NODE *back; }; // Stack Functions NODE *push(NODE *stack, const CITY *pStu); NODE *pop(NODE **stack); // Queue Functions void enqueue(NODE **queue, NODE **rear, const CITY *pStu); NODE *dequeue(NODE **queue, NODE **rear); // Doubly Linked List Functions D_NODE *init_list(void); int insert(D_NODE *list, const CITY *pStu); void traverse_forw(D_NODE *list); void traverse_back(D_NODE *list); // Other Functions void printCity(const CITY *pCity); int main (void) { CITY cList[NUM_CITIES] = { {"Cupertino", {88, 89, 87, 85, 89}}, {"Flagstaff", {81, 80, 88, 89, 89}}, {"Los Angeles", {87, 88, 89, 89, 90}}, {"Philadelphia", {96, 99, 99, 90, 95}}, {"Phoenix", {106, 109, 109, 100, 105}}, {"Portland", {89, 90, 85, 89, 90}}, {"Reno", {108, 105, 109, 100, 108}}, {"Salem", {85, 90, 85, 89, 90}}, {"Tucson", {107, 100, 109, 100, 108}}, {"Yreka", {101, 109, 100, 108, 109}} }; NODE *stack = NULL; NODE *top = NULL; NODE *queue = NULL, *rear = NULL; NODE *front; D_NODE *list; list = init_list(); // build stack and queue with data from an array of CITY structures srand((unsigned int)time(NULL)); int count = rand() % 10; for ( int n = 0; n < count; n++) { int i = rand() % NUM_CITIES; int duplicate = insert(list, &cList[i]); if(duplicate) { // already in the list! push(stack, &cList[i]); enqueue(&queue, &rear, cList[i]); } } // display list printf("\nLIST contents (forwards):\n"); traverse_forw(list); printf("\nLIST contents (backwards):\n"); traverse_back(list); // display stack if (top) { printf("\nSTACK contents from top to bottom:\n"); while ((top = pop(stack))) { printCity(top->city); } } else printf ("Empty Stack!\n"); // display queue if (front) { printf("\nQUEUE contents from front to rear:\n"); while ((front = dequeue( queue, rear))) { printCity(front->city); } } else printf ("Empty Queue!\n"); return 0; } /*************************************************** Displays the fileds of a CIS_CLASS structure Pre pCls - a pointer to a CIS_CLASS structure Post */ void printCity(const CITY *pCity) { printf("%-20s %3d\n",.
Notes for SQLite3 Usage
This document provides notes and code samples for using SQLite3 in C applications. It includes information on resolving link errors when building SQLite3 applications, the two forms of the LIMIT clause, using the sqlite3_get_table() function to retrieve and iterate through query results, and using the Firefox SQLite Manager add-on to view and edit SQLite databases. Code samples demonstrate getting the total record count of a table, iterating through retrieved records in different ways, and connecting and querying a SQLite database.
Start with the inclusion of libraries#include iostream .docx
// Start with the inclusion of libraries
#include <iostream> //The library of io functions
#include <fstream> //The library of external stream functions
#include <cstdlib> //The library for external errors
#include <string> //The library for string functions
#include <cmath> //The library of C math functions
#include <iomanip> //Allows setting widths, etc. for I/O
#include <stdlib.h>
#include <stdio.h>
#include<vector>
using namespace std;
// Define all of the prototypes for functions used in the program
// Counts the number of unique letters seen
int countunique(int *array, int size);
// Creates the input file and formats it for use by the cipher section.
void createinput(string ifile, string ofile);
// Creates the encoded input file
void createcipher(int key, string ifile, string ofile);
// Finds and counts the number of digrams
int digram(int *pointer, string ifile);
// Counts the letter frequency in the encoded input file
int lettercount(int*, string ifile, string ofile);
// Finds the highest count in the singlton (or any other) array
int singleton(int*, int size);
// Trims an input file to the right size starting at an offset
void trimfile(string ifile, string ofile, int offset, int size);
// Begin the main function for testing
int main(int argc, char* argv[])
{
int count = 0;
int second = 0;
int singlefreq[26];
int *single = singlefreq;
int delta;
int loop; //The loop counter for arguments
int final = 0;
int totalcnt;
int key = -1; //Sets the key value
int len = 0; //The length to investigate for testing
int off; //Holds the offset into the file
double m; //Holds the metric error value
char loopletter;
float percent;
string ifile1 = "";
string ofile1 = "";
string deflt = "c:\\dissertation\\ShiftandSubcipherC++files\\clean.txt";
string ifile2 = "";
string ofile2 = ""; //Holds selected file path names
string cmdarg; //Holds the command line argument
string stop = "l"; //Gives the stop condition, assumes l
string reportfile = "c:\\dissertation\\test\\report.txt";
ofstream outs; //Declare an output stream for reporting
int digramc[676]; //Set up the digram array
int *two = digramc; //Point to the digram array
int dicount = 0; //Holds the count of the number of digrams
int total = 0; //Counts the total number of letters seen for analysis
for (loop = 1; loop<argc; loop++) //Decide if we have arguments or must use defaults
{
if (!argv[1])
{
// cout << "No argument found.\n";
ifile1 = deflt;
}
else
{
cmdarg = argv[loop];
if (cmdarg == "-k")
{
loop++;
key = atoi(argv[loop]);
cout << "key = " << key << endl;
}
if (cmdarg == "-l")
{
loop++;
len = atoi(argv[loop]);
cout << "Run for " << len << " characters.\n";
}
if (cmdarg == "-m")
{
loop++;
m = atof(argv[loop]);
cout << "Run until and error of " << m << "\n";
}
if (cmdarg == "-off")
{
loop++;
off = atoi(argv[loop]);
cout << ...
Memory Manglement in Raku
The document discusses monitoring and analyzing memory usage in Raku processes. It describes using the getrusage(2) system call to retrieve resident set size (RSS) and other memory statistics for a process. It then presents the ProcStats module, which allows periodically sampling getrusage(2) data over time to track RSS and detect changes from an initial baseline. The module outputs differences in memory statistics compared to the first sample, ignoring unchanged values. This provides a concise way to monitor for increases in a process's memory footprint over time.
Binary Tree in C++ coding in the data structure
This document discusses binary trees and binary search trees in C++. It includes functions to create and traverse binary trees in preorder, inorder, and postorder fashion. For binary search trees, it includes functions to insert nodes, perform inorder traversal, find the minimum value node, and delete nodes. These data structures and functions provide ways to organize and manipulate tree-based data in C++ programs.
(1)Objective Binary Search Tree traversal (2 points)Use traversal.pdf
(1)Objective: Binary Search Tree traversal (2 points)
Use traversal.pptx as guidance to write a program to build a binary search tree Dictionary. I of
BST have the same data from each input record.
Download traversal-lab.pptx, inventory.txt, BinNode.java, BSTNode.java, BST.java,
Dictionary.java .
Perform specifications as follow:
(a)Provide Add, Delete and Retrieve functions for user to access the database. Reject duplicate
record when add a new record.
(b)Modify BST.java to add printpostOrder, printpreOrder methods.
(c)At the end, display inorder, postorder and preorder of the tree.
Codes:
/** Source code example for \"A Practical Introduction to Data
Structures and Algorithm Analysis, 3rd Edition (Java)\"
by Clifford A. Shaffer
Copyright 2008-2011 by Clifford A. Shaffer
*/
/** ADT for binary tree nodes */
public interface BinNode {
/** Get and set the element value */
public E element();
public void setElement(E v);
/** @return The left child */
public BinNode left();
/** @return The right child */
public BinNode right();
/** @return True if a leaf node, false otherwise */
public boolean isLeaf();
}
//********************************************************************
// StringTree.java
//
//********************************************************************
import java.util.*;
public class StringTree
{
private Node root;
//----------------------------------------------------------------
// Creates an initially empty tree.
//----------------------------------------------------------------
public StringTree()
{
root = null;
}
//----------------------------------------------------------------
// Adds a string to the tree.
//----------------------------------------------------------------
public void addString (String str)
{
root = addStringToSubTree(str, root);
}
//----------------------------------------------------------------
// Adds a string to the subtree with the given root node
//----------------------------------------------------------------
private Node addStringToSubTree (String str, Node node)
{
Node result = node;
if (node == null)
result = new Node(str);
// If the new string comes before the string in the node, add
// the new string to the left child. Otherwise, add it to the
// right child.
else
if (str.compareTo(node.value) < 0)
node.left = addStringToSubTree(str, node.left);
else
node.right = addStringToSubTree(str, node.right);
return result;
}
//----------------------------------------------------------------
// Prints the result of a depth-first traversal of the tree using
// recursion.
//----------------------------------------------------------------
public void traverseWithRecursion()
{
traverseWithRecursion(root);
}
//----------------------------------------------------------------
// Prints the elements in the specified tree using recursion.
//----------------------------------------------------------------
private void traverseWithRecursion (Node node)
{
if (node != null)
{
traverseWithRecursion (node.left);
System.
Can you finish and write the int main for the code according to the in.pdf
Can you finish and write the int main for the code according to the instruction Thank you so
much.
Here's the code for the BSTNode ADT and BST implementation:
#include <iostream>
#include <fstream>
#include <queue>
using namespace std;
// Krone class
class Krone {
private:
int wholeValue;
int fractionalValue;
public:
Krone() {}
Krone(int whole, int fraction) : wholeValue(whole), fractionalValue(fraction) {}
int getWhole() const { return wholeValue; }
int getFraction() const { return fractionalValue; }
bool operator<(const Krone& other) const {
if (wholeValue < other.wholeValue) {
return true;
} else if (wholeValue == other.wholeValue) {
return fractionalValue < other.fractionalValue;
} else {
return false;
}
}
friend ostream& operator<<(ostream& out, const Krone& krone) {
out << "Kr " << krone.wholeValue << "." << krone.fractionalValue;
return out;
}
};
// BST Node class
class BSTNode {
private:
Krone data;
BSTNode* left;
BSTNode* right;
public:
BSTNode() {}
BSTNode(const Krone& krone) : data(krone), left(nullptr), right(nullptr) {}
Krone getData() const { return data; }
BSTNode* getLeft() const { return left; }
BSTNode* getRight() const { return right; }
void setData(const Krone& krone) { data = krone; }
void setLeft(BSTNode* node) { left = node; }
void setRight(BSTNode* node) { right = node; }
};
// BST class
class BST {
private:
BSTNode* root;
public:
BST() : root(nullptr) {}
BSTNode* getRoot() const { return root; }
bool isEmpty() const { return root == nullptr; }
int countNodes(BSTNode* node) const {
if (node == nullptr) {
return 0;
} else {
return 1 + countNodes(node->getLeft()) + countNodes(node->getRight());
}
}
void empty(BSTNode* node) {
if (node != nullptr) {
empty(node->getLeft());
empty(node->getRight());
delete node;
}
}
void insertNode(const Krone& krone) {
BSTNode* node = new BSTNode(krone);
if (isEmpty()) {
root = node;
} else {
BSTNode* currNode = root;
while (true) {
if (krone < currNode->getData()) {
if (currNode->getLeft() == nullptr) {
currNode->setLeft(node);
break;
} else {
currNode = currNode->getLeft();
}
} else {
if (currNode->getRight() == nullptr) {
currNode->setRight(node);
break;
} else {
currNode = currNode->getRight();
}
}
}
}
}
BSTNode* searchNode(const Krone& krone) const {
BSTNode* currNode = root;
while (currNode != nullptr) {
Declare and implement a BSTNode ADT with a data attribute and two pointer attributes, one for
the left child and the other for the right child. Implement the usual getters/setters for these
attributes.
Declare and implement a BST as a link-based ADT whose data will be Krone objects - the data
will be inserted based on the actual money value of your Krone objects as a combination of the
whole value and fractional value attributes.
For the BST, implement the four traversal methods as well as methods for the usual search,
insert, delete, print, count, isEmpty, empty operations and any other needed.
Your pgm will use the following 20 Krone objects to be created in the exact order in your.
Need help implementing the skeleton code below, I have provided the .pdf
I need help with this practice problem?
Execute the following coding segment and identify the errors in the program. Debug the program
and provide the correct version of the code. Hinclude int main() printf(\"%s\", isdigit(\'A\') ? \"A
is digit\" \"A is not digit\"); a : a printf(\"Inlnln\") return return e;
Solution
in range [0,9]. If it\'s not then this function returns 0.
Given program compiles successfully, compiler does not give any error.
But If the input of isdigit(\'A\') is changed then the program will always print
\"A is a digit\" or
\"A is not a digit\" .
It will not print exact value of char A.
So, correct code is given below.
#include
int main()
{
char A = \'1\';
printf(\"%c%s\",A,isdigit(A)? \" is a digit\" : \" is not a digit\");
printf(\"\ \");
A = \'B\';
printf(\"%c%s\",A,isdigit(A)? \" is a digit\" : \" is not a digit\");
printf(\"\ \");
return 0;
}
Sample Output:
1 is a digit
B is not a digit.
Lab08Lab08.cppLab08Lab08.cpp.docx
Lab08/Lab08.cppLab08/Lab08.cpp//**************************************************************************************************************
// FILE: Lab08.cpp
//
// DESCRIPTION: Contains the main() function. Instantiates a PointTest object which tests the Point class.
//
// AUTHORS: your-name (your-email-address)
// your-partner's-name (your-partners-email-address)
//
// COURSE: CSE100 Principles of Programming with C++, Fall 2015
//
// LAB INFO: Lab 8 Date/Time: your-lab-date-and-time TA: your-lab-ta
//--------------------------------------------------------------------------------------------------------------
// TESTING:
//
// TEST CASE 1:
// ------------
// TEST CASE INPUT DATA:
// Point p1 x = 11
// Point p1 y = 22
// Point p2 x = -33
// Point p2 y = -44
//
// EXPECTED OUTPUT GIVEN THE INPUT:
// The point p1 is (11, 22)
// The point p2 is (-33, -44)
// The distance between the points is 79.322
// Moving point p1...The point p1 is now at (100, 200)
// The distance between the points is 277.894
// Moving point p2...The point p2 is now at (300, 400)
// The distance between the points is 282.843
//
// OBSERVED OUTPUT:
// Document the output from your program when you perform this test case
//
// TEST CASE RESULT: Document PASS or FAIL
//
// TEST CASE 2:
// ------------
// TEST CASE INPUT DATA:
// Point p1 x = ???
// Point p1 y = ???
// Point p2 x = ???
// Point p2 y = ???
//
// EXPECTED OUTPUT GIVEN THE INPUT:
// ??? Document the expected output ???
//
// OBSERVED OUTPUT:
// ??? Document the output from your program when you perform this test case ???
//
// TEST CASE RESULT: ??? Document PASS or FAIL ???
//**************************************************************************************************************
#include"PointTest.hpp"
//--------------------------------------------------------------------------------------------------------------
// FUNCTION: main()
//
// DESCRIPTION
// Starting point for the program.
//
// PSEUDOCODE
// Define a PointTest object named pointTest calling the default ctor.
// Call run() on the pointTest object.
// Return 0.
//--------------------------------------------------------------------------------------------------------------
???
Lab08/Point.cppLab08/Point.cpp//**************************************************************************************************************
// FILE: Point.cpp
//
// DESCRIPTION: Implementation of the Point class. See Point.hpp for the class declaration.
//
// AUTHORS: your-name (your-email-address)
// your-partner's-name (your-partners-email-address)
//
// COURSE: CSE100 Principles of Programming with C++, Fall 2015
//
// LAB INFO: Lab 8 Date/Time: your-lab-date-and-time TA: your-lab-ta
//**************************************************************************************************************
#include<cmath>// For sqrt()
#include<sstream>// For stringstre ...
Степан Кольцов — Rust — лучше, чем C++
Rust — это современный, практический, быстрый и безопасный язык программирования. Некоторые говорят, что Rust — это как C++, если бы его писал человек, знающий Haskell.
Система типов Rust решает главную проблему C++ — небезопасность. C++ очень легко сделать ошибки, которые приведут к поломкам (например, use after free). Rust позволяет писать безопасный код, сохраняя при этом выразительность и околонулевые накладные расходы C++. В докладе будут подробно описаны механизмы языка, которые контролируют безопасность программы.
Хотя в данный момент Rust ещё не подходит для использования в продакшне, его всё равно стоит изучать. Во-первых, потому что это очень интересный подход к программированию, а во-вторых, потому что через несколько лет для разработки требовательных к ресурсам программ будет необходим именно Rust или другой похожий инструмент.
Need help with the TODO's (DONE IN C++) #pragma once #include -funct.pdf
Need help with the TODO's (DONE IN C++)
#pragma once
#include <functional> // std::less
#include <iostream>
#include <queue> // std::queue
#include <utility> // std::pair
template <typename K, typename V, typename Comparator = std::less<K>>
class BinarySearchTree
{
public:
using key_type = K;
using value_type = V;
using key_compare = Comparator;
using pair = std::pair<key_type, value_type>;
using pointer = pair*;
using const_pointer = const pair*;
using reference = pair&;
using const_reference = const pair&;
using difference_type = ptrdiff_t;
using size_type = size_t;
private:
struct BinaryNode
{
pair element;
BinaryNode *left;
BinaryNode *right;
BinaryNode( const_reference theElement, BinaryNode *lt, BinaryNode *rt )
: element{ theElement }, left{ lt }, right{ rt } { }
BinaryNode( pair && theElement, BinaryNode *lt, BinaryNode *rt )
: element{ std::move( theElement ) }, left{ lt }, right{ rt } { }
};
using node = BinaryNode;
using node_ptr = node*;
using const_node_ptr = const node*;
node_ptr _root;
size_type _size;
key_compare comp;
public:
BinarySearchTree() {
// TODO
}
BinarySearchTree( const BinarySearchTree & rhs ) {
// TODO
}
BinarySearchTree( BinarySearchTree && rhs ) {
// TODO
}
~BinarySearchTree() {
// TODO
}
const_reference min() const { return min( _root )->element; }
const_reference max() const { return max( _root )->element; }
const_reference root() const {
// TODO
}
bool contains( const key_type & x ) const { return contains( x, _root ); }
value_type & find( const key_type & key ) { return find( key, _root )->element.second; }
const value_type & find( const key_type & key ) const { return find( key, _root )-
>element.second; }
bool empty() const {
// TODO
}
size_type size() const {
// TODO
}
void clear() {
clear( _root );
_size = 0;
}
void insert( const_reference x ) { insert( x, _root ); }
void insert( pair && x ) { insert( std::move( x ), _root ); }
void erase( const key_type & x ) { erase(x, _root); }
BinarySearchTree & operator=( const BinarySearchTree & rhs ) {
// TODO
}
BinarySearchTree & operator=( BinarySearchTree && rhs ) {
// TODO
}
private:
void insert( const_reference x, node_ptr & t ) {
// TODO
}
void insert( pair && x, node_ptr & t ) {
// TODO
}
void erase( const key_type & x, node_ptr & t ) {
// TODO
}
const_node_ptr min( const_node_ptr t ) const {
// TODO
}
const_node_ptr max( const_node_ptr t ) const {
// TODO
}
bool contains( const key_type & x, const_node_ptr t ) const {
// TODO
}
node_ptr find( const key_type & key, node_ptr t ) {
// TODO
}
const_node_ptr find( const key_type & key, const_node_ptr t ) const {
// TODO
}
void clear( node_ptr & t ) {
// TODO
}
node_ptr clone ( const_node_ptr t ) const {
// TODO
}
public:
template <typename KK, typename VV, typename CC>
friend void printLevelByLevel( const BinarySearchTree<KK, VV, CC>& bst, std::ostream & out
);
template <typename KK, typename VV, typename CC>
friend std::ostream& printNode(std::ostream& o, const typename BinarySearchTree<KK, VV,
CC>::node& bn);.
Please read the comment ins codeExpressionTree.java-------------.pdf
Please read the comment ins code
ExpressionTree.java
----------------------------------
/**
* This is the class for Expression Tree.
* Used to create Expression Tree and Evaluate it
*/
/**
* Following logic is used to construct a Tree
* Here we use stack for Preparing Tree
* Loop through given Expression String
* If Character is Operand , Create node and push to stack
* If Character is Operator then
* 1)Create Node for Operator
* 2)Pop 2 nodes from Stack and Made
* OpretorNode--> left == first node pop
* OpretorNode--> right == second node pop
* At the end of creation of Expression Tree, Stack have only one node , which is root of
Expression tree
*/
/** Class ExpressionTree **/
class ExpressionTree
{
/** class TreeNode
* Stored Character ==> Digit(0..9) or a Operator +,-,*,/
* Left Node and Right Node
*
* **/
class TreeNode
{
char data;
TreeNode left, right;
/** constructor **/
public TreeNode(char data)
{
this.data = data;
this.left = null;
this.right = null;
}
}
/** class StackNode **/
class StackNode
{
TreeNode treeNode;
StackNode next;
/** constructor **/
public StackNode(TreeNode treeNode)
{
this.treeNode = treeNode;
next = null;
}
}
private static StackNode top;
/** constructor
* Constructor takes input string like \"+-+7*935*82*625\"
* Input should be in Prefix notation
* **/
public ExpressionTree(String expression)
{
top = null;
//Call Method for prepare expression tree
buildTree(expression);
}
/** function to clear tree **/
public void clear()
{
top = null;
}
/** function to push a node **/
private void push(TreeNode ptr)
{
if (top == null)
top = new StackNode(ptr);
else
{
StackNode nptr = new StackNode(ptr);
nptr.next = top;
top = nptr;
}
}
/** function to pop a node
* When it find operator pop 2 elements from Stack
*
* **/
private TreeNode pop()
{
if (top == null)
throw new RuntimeException(\"Underflow\");
else
{
TreeNode ptr = top.treeNode;
top = top.next;
return ptr;
}
}
/** function to get top node **/
private TreeNode peek()
{
return top.treeNode;
}
/** function to insert character **/
private void insert(char val)
{
try
{
//If Operand , Create node and push to Stack
if (isDigit(val))
{
TreeNode nptr = new TreeNode(val);
push(nptr);
}
//If Operator , Create node and popup 2 elements and make them its right and left
else if (isOperator(val))
{
TreeNode nptr = new TreeNode(val);
nptr.left = pop();
nptr.right = pop();
push(nptr);
}
}
catch (Exception e)
{
System.out.println(\"Invalid Expression\");
}
}
/** function to check if digit **/
private boolean isDigit(char ch)
{
return ch >= \'0\' && ch <= \'9\';
}
/** function to check if operator **/
private boolean isOperator(char ch)
{
return ch == \'+\' || ch == \'-\' || ch == \'*\' || ch == \'/\';
}
/** function to convert character to digit **/
private int toDigit(char ch)
{
return ch - \'0\';
}
/** function to build tree from input */
public void buildTree(String eqn)
{
for (int i = eqn.length() - 1; i >= 0; i--)
insert(eqn.charAt(i));
}
/** function to evaluate tree */
public dou.
C++ extension methods
The document discusses different approaches for extending classes with new methods in various programming languages and paradigms. It covers approaches used in dynamic languages like Python and Objective-C, as well as static languages like C++ and C#. It also proposes a template-based approach to add extension methods to C++ classes in a way that mimics how extensions work in C#.
C++ projectMachine Problem 7 - HashingWrite a program to do the .pdf
C++ project
Machine Problem 7 - Hashing
Write a program to do the following:
loads username/password sets from the file password.txt and insert them into the hash table until
the end of file is reached on password.txt. The password.txt file will look something like this
with one username/password set per line.
mary changeMe!
The program will then present a login prompt, read one username, present a password prompt,
and after looking up the username\'s password in the hash table, will print either \"Authentication
successful\" or \"Authentication failure\".
The above step will be repeated until the end of the input data (EOF) is reached on the console
input stream (cin). The EOF character on the PC\'s is the CTRL Z character.
To convert from a string to an integer, we can add the ascii value of each character together. For
instance, Mary\'s conversion from string to integer might look something like this:
109(\'m\') + 97(\'a\') + 114(\'r\') + 121(\'y\')=441
We\'ve converted the string to an integer, but we still need to convert the integer to an index. For
an array of 10 elements we can divide by 10 and use the remainder as an index. Combining these
two hash functions, we will get Mary\'s index to be: 441 % 10 = 1
Your primary tasks for this homework are to edit the login.cpp to replace the comments with
lines so that it does the following:
Insert passwords into the Hash Table.
Retrieve one user\'s Password structure from the Hash Table.
Compare retrieved user password to input password and print \"Authentication failure\" or
\"Authentication successful.\"
//--------------------------------------------------------------------
//
// listlnk.h
//
//--------------------------------------------------------------------
#pragma warning( disable : 4290 )
#include
#include
#include
#include
#include
#include
#include
using namespace std;
template < class T > // Forward declaration of the List class
class List;
template < class T >
class ListNode // Facilitator class for the List class
{
private:
ListNode(const T &nodeData, ListNode *nextPtr);
T dataItem; // List data item
ListNode *next; // Pointer to the next list node
friend class List;
};
//--------------------------------------------------------------------
template < class T >
class List
{
public:
List(int ignored = 0);
~List();
void insert(const T &newData) throw (bad_alloc); // Insert after cursor
void remove() throw (logic_error); // Remove data item
void replace(const T &newData) throw (logic_error); // Replace data item
void clear();
bool isEmpty() const;
bool isFull() const;
// List iteration operations
void gotoBeginning() throw (logic_error);
void gotoEnd() throw (logic_error);
bool gotoNext();
bool gotoPrior();
T getCursor() const throw (logic_error); // Return item
void showStructure() const;
void moveToBeginning() throw (logic_error); // Move to beginning
void insertBefore(const T &newElement) throw (bad_alloc); // Insert before cursor
private:
ListNode *head, // Pointer to the beginni.
Please complete the assignment listed below.Define and explain, us.docx
Please complete the assignment listed below.
Define and explain, using at least five sentence or on-task bullet notes for each. Each answer earns up to five points. For each answer, please make five different substantive points, earning one point each.
Transnational corporation
Gentrification
Renewable resources
Desertification
Photochemical smog
Biodiversity
Barriers to migration
Hierarchical diffusion
Militant fundamentalism
Urbanization
Eastern European cities
Hazardous waste
The Endangered Species Act
Subsidence
Water Quality
Deforestation
Wetlands
Central place theory
Soil degradation
Hydraulic fracturing (fracking)
Wind power
Oil sands
Models of urban form
Hinterland
Agglomeration economies
.
Please cite sources for each question. Do not use the same sources f.docx
Please cite sources for each question. Do not use the same sources for each question. Minimum of 2 resources and 300 words.
Briefly contrast the views of Locke and Rousseau on how children develop.
a) What do ethologists, such as Lorenz, mean by imprinting on a parent-figure?
b) What observations led Bowlby to suggest that imprinting occurs in human infants? That is, what parallels between human infants and other species did he point to?
"For children to learn, we must praise their correct responses and correct their mistakes." Would Montessori agree? Explain.
What did Werner mean by "microgenesis" and "microgenetic mobility?" Give examples. Discuss some valuable aspects of these concepts.
Piaget's critics charge that he made development appear too slow. Discuss this criticism with respect to either: a) object permanence, b) conservation training, or c) Kamii's teaching methods. Then, describe the Piagetian approach.
Compare conventional and postconventional morality in Kohlberg's theory.
.
More Related Content
Similar to Complete the C++ program and implement the routines that are n.docx
RightTrianglerightTriangle.cppRightTrianglerightTriangle.cpp.docx
RightTriangle/rightTriangle.cppRightTriangle/rightTriangle.cpp// This file includes implementations for functions of the right
// triangle class.
#include<iostream>
#include<cmath>
usingnamespace std;
#include"rightTriangle.h"
// Default constructor
RightTriangle::RightTriangle()
{
base =0;
height =0;
}
// SET functions (for storing data in private data members)
voidRightTriangle::setHeight(double h)
{
height = h;
}
voidRightTriangle::setBase(double b)
{
base = b;
}
// Calculate length of hypotenuse using
// Pythagorean Theorem
doubleRightTriangle::calcHypotenuse()
{
return sqrt (base * base + height * height);
}
__MACOSX/RightTriangle/._rightTriangle.cpp
RightTriangle/rightTriangle.h
// This file defines the specifications for a class to store
// attributes of a right triangle
class RightTriangle
{
private: // PRIVATE data members
double base;
double height;
public: // PUBLIC member functions
RightTriangle(); // Default constructor
void setHeight(double h); // SET functions
void setBase(double b);
// Calculate length of hypotenuse
double calcHypotenuse();
};
__MACOSX/RightTriangle/._rightTriangle.h
RightTriangle/testTriangle.cppRightTriangle/testTriangle.cpp// This program calculates various parameters of a
// right triangle.
#include<iostream>
usingnamespace std;
#include"rightTriangle.h"
int main()
{
// Declaration
double base,height;
RightTriangle aTriangle;
// Input
cout <<"Enter the base of the triangle: ";
cin >> base;
cout <<"Enter the height of the triangle: ";
cin >> height;
// Move data to object
aTriangle.setBase(base);
aTriangle.setHeight(height);
// Calculations and output
cout << endl;
cout <<"Length of hypotenuse: "
<< aTriangle.calcHypotenuse()<< endl;
return0;
}// end main function
__MACOSX/RightTriangle/._testTriangle.cpp
c++practice3a3b/._rightTriangle.cpp
c++practice3a3b/._rightTriangle.h
c++practice3a3b/._testTriangle.cpp
c++practice3a3b/partList.txt
2345 Snoozle 15.4 29.95
1234 Widget 5.4 9.99
3456 Bludger 9.1 15.49
5678 Zeeter 7.7 1.99
6789 Sub_Tweezer 12.3 5.25
4567 Woofle 3.7 49.79
c++practice3a3b/partMgr.cppc++practice3a3b/partMgr.cpp// This program manages a list of parts.
#include<iostream>
#include<iomanip>
#include<fstream>
usingnamespace std;
// Attributes for one part
struct partInfo
{
int number;
char name[30];
double weight;
double price;
};
constint MAX_LIST_SIZE =100;
// Function prototypes
int menu();
void buildPartsList(partInfo partList[],int& listSize);
void searchParts(partInfo partList[],int numParts);
void listParts(partInfo partList[],int& numParts);
void insertPart(partInfo list[],int& numElems);
void deletePart(partInfo list[],int& numElems);
partInfo getPartInfo();
v ...
I just need code for processQueue function using iterators from the .pdf
I just need code for processQueue function using iterators from the linkedList class.
#include
#include
#include
#include
#include "Queuecpp.h"
#include "Songcpp.h"
#include "RequestCpp.h"
void populateRequests(Queue& q);
void populateSongDataBase(LinkedList &list);
void processQueue(LinkedList &list,Queue& q);
void processRequest(std::string action, std::string title,std::string singer,int chartPos);
//GIVEN
int main() {
LinkedList list;
Queue q;
populateSongDataBase(list); // fill the Songs Data Base into Linked List
std::cout<<"*************************************\n";
list.printList(); //
std::cout<<"*************************************\n";
populateRequests(q); // fill the request q
std::cout<<"\n";
std::cout<<"---------------PRINTING QUEUE-------------------\n";
q.printList();
std::cout<<"------------------------------------\n";
processQueue(list,q); // process the requests
std::cout<<"*************************************\n";
list.printList();
std::cout<<"*************************************\n";
}
//GIVEN
//Requires an empty linked list
//Effects fills the list with request by reading from the RequestData.txt
//Modifies the queue by filling it
void populateRequests(Queue &q){
}
//GIVEN
//Requires Filled data base , song to play
//Effects Finds song using get, if found plays it
//Modifies nothing
std::string playSong(LinkedList&list, Song s){
if (list.get(s)>=0){
return "PLAYING :"+ s.toString()+"\n";
}
else{
return "SONG NOT FOUND\n";
}
}
//GIVEN
//Requires filled database
//Effects calls print methood to print top ten songs
//Modifies nothing
void printTopTenSongs(LinkedList& list){
std::cout<<"PLAYING TOP TEN SONG __________\n";
list.print(10);
;
}
//Requires filled Song Database, a Song to add. The chart position given in the song is where it
will get added. Note this is a Song that is not supposed to exist in database.
//Effects adds the song from its original chart position
//Modifies the Song database. Adjust chart position of all Songs affected by this addition- this
adjustment is done in insert method using adjustPosition method. If the Process Queue adds a
Song that already is in the database, then a duplicate entry can occur.
//TODO
void addThisSong(LinkedList &list, Song s){
//TODO
/* Use this code
if (found>=0) {std::cout<<"ADDED THIS SONG "< &list, Song s){
/* Use this code
if (found>=0) {std::cout<<"SORRY CANNOT REMOVE THIS SONG - STILL FOUND AT
"< &list, Song s, int pos){
int chartPos=list.get(s);
std::cout<<"MOVING SONG "< &list,std::string action, std::string title,std::string singer,int
chartPos){
Song s(title,singer,chartPos);
char ch =action[0];
switch(ch){
case 'P' : std::cout< &list ,Queue& q){
int requestNumber=1;
//Create an iterator for the Queue to iteratate through requests
std::cout<<"-------------------------------------------------------------------------\n";
// call processRequest
std::cout<<"-------------------------------------------------------------------------\n"
std::cout<<"------------------------.
Using C++I keep getting messagehead does not name a type.pdf
Using C++
I keep getting message:
\'head does not name a type\'
\'teal does not name a type\'
Where do I place this code in my program:
/*search and delete with respect to location as current, head and tail
//define below 2 lines in LinkedList() function
head = new NodeType;
tail = new NodeType;
void UnsorderedType::DeleteItem(ItemType item)
{
NodeType *tempLocation, *location;
bool stop = false;
if(!isEmpty())
{
location = head;
tempLocation = head->link;
while (templocation != tail && !stop)
{
if (templocation->info == item)
stop = true;
else
{
location = templocation;
templocation = templocation->link;
}
}
if (!stop)
cout << \"The node to delete is not in the list!\" << endl;
else
{
location->link = templocation->link;
delete templocation;
count--;
}
}
else
{
cout << \"The list is empty!\" << endl;
}
}*/
/Problem and code:
Implement the UnsortedList class to store a list of strings that are input into the list from
data2.txt.
- create a main.cpp file that gets the numbers from the file
- insert the word \"cat\" into the list
- insert another word \"antibacterial\" into the list
- delete the word \"letter\" from the list
- print out the following:
--the entire list
- the greatest
- the least
2. Attach the main.cpp, UnsortedList.cpp, the ItemType.h, and the output file one called
outfile1.txt
- Yes you need to make your program output an \"outfile1.txt\"
3. Implement the UnsortedList class to store a list of numbers that are input into the list from
data.txt.
- create a main.cpp file that gets the numbers from the file
- insert the number 7 into the list
- insert another number 300 into the list
- delete the number 6 from the list
- print out the following:
--the entire list
- the greatest
- the least
2. Attach the main.cpp, UnsortedList.cpp, the ItemType.h, and the output file two called
outfile2.txt
- Yes you need to make your program output an \"outfile2.txt\"
data.txt
super formula travel free thick Josephine Clara education
data2.txt
super formula travel free thick Josephine Clara education
//My main.cpp
//--------------------------------------------------------------
// Test driver for Linked List UnsortedType list
// Navarr Barnier
// Your class CS3350 TTh 1:00
// Due date: Thursday, September 13, 2012
//
// Compile command: g++ hw2.cpp ch03-UnsortedType.cpp ch03-ItemType.cpp
// Input file name: hw2.txt
// Contains list of commands to add items to list, split original
// list into two lists, print each list and get the length of
// each list.
// Output: The result of each command is displayed on the screen.
// Filename: hw2.cpp
//--------------------------------------------------------------
#include
#include
#include
#include
#include
#include \"ItemType.h\"
using namespace std;
void PrintList(UnsortedType&);
void SplitList(UnsortedType&, ItemType);
ItemType GetItem(ItemType& item, bool& found);
int main()
{
ifstream inFile; // file containing operations
ofstream outFS; // Output file stream
string data; // operation to be executed
s.
Were writing code for a project that dynamically allocates an arra.pdf
We\'re writing code for a project that dynamically allocates an array stack. My other code works,
but my Min(), Max(), and Peek() functions fail. I\'ve provided my code for those functions at the
end of the post.
main.cpp
_________________________________________
#include
#include
#include
#include
#include \"stack.h\"
using namespace std;
int main(int argc, char* argv[])
{
ifstream inputs; // Input file for commands
char op; // Hold operation and optional char input
int value; // Value input from file
string comment; // Holds comment from file
Stack* sPtr = NULL; // Will point to TemplateQ object
// Output usage message if one input file name is not provided
if (argc != 2)
{
cout << \"Usage:\ project03 \ \";
return 1;
}
// Attempt to open input file -- terminate if file does not open
inputs.open(argv[1]);
if (!inputs)
{
cout << \"Error - unable to open input file\" << endl;
return 1;
}
// Input and echo header comment from file
getline(inputs, comment); // Input and echo the comment appearing in the test file
cout << endl << \'#\' << comment << endl;
// Process commands from input file
inputs >> op; // Attempt to input first command
while (inputs)
{
switch (op) // Process operation input from file
{
case \'#\': // Test file comment
getline(inputs, comment); // Input and echo the comment appearing in the test
file
cout << \'#\' << comment << endl;
break;
case \'c\': // Parameterized Constructor
inputs >> value;
cout << endl << \"Stack(\" << value << \")\";
try
{
sPtr = new Stack(value); // Attempt to create a stack object with array size
value
cout << \" -- completed\" << endl;
}
catch ( std::bad_alloc )
{
cout << \"Failed : Terminating now...\" << endl;
return 1;
}
break;
case \'+\': // Push
inputs >> value;
cout << \"Push(\" << value << \") -- \";
try
{
sPtr->Push(value);
cout << \"completed\";
}
catch (StackFull)
{
cout << \"Failed Full Stack\";
}
catch (...)
{
cout << \"operation failed\" << endl;
}
cout << endl;
break;
case \'-\': // Pop
cout << \"Pop() -- \";
try
{
sPtr->Pop();
cout << \"completed\";
}
catch (StackEmpty)
{
cout << \"Failed Empty Stack\";
}
catch (...)
{
cout << \"operation failed\" << endl;
}
cout << endl;
break;
case \'f\': // IsFull
cout << \"IsFull() -- \";
try
{
if (sPtr->IsFull())
cout << \"true\";
else
cout << \"false\";
}
catch ( ... )
{
cout << \"operation failed\";
}
cout << endl;
break;
case \'e\': // IsEmpty
cout << \"IsEmpty() -- \";
try
{
if (sPtr->IsEmpty())
cout << \"true\";
else
cout << \"false\";
}
catch ( ... )
{
cout << \"operation failed\";
}
cout << endl;
break;
case \'m\': // Make Empty
cout << \"MakeEmpty() -- \";
try
{
sPtr->MakeEmpty();
cout << \"completed\" << endl;
}
catch (...)
{
cout << \"operation failed\" << endl;
}
break;
case \'p\': // Print Stack
cout << \"Print() -- \";
sPtr->Print();
break;
case \'t\': // Top of Stack
try
{
cout << \"Top() -- \" << sPtr->Top() << endl;
}
catch (StackEmpty)
{
cout << \"Top() -- Failed Empty Stack\" << endl;
}
catch (...)
{
cout << \"operation failed\" .
complete the following functions in c++ singleRotation putNo.pdf
complete the following functions in c++
singleRotation
putNode: Insert or update the entry in the extended AVL tree map (TreeMapStats) using
the inputted key and value. In addition, efficiently update the statistics information of only
the nodes affected by the insertion of the new entry into the map
eraseNode: Remove the entry in the extended AVL tree map (TreeMapStats) with the
inputted key, if the key is in the map, if necessary. In addition, efficiently update the statistics
information of only the nodes affected by the removal of the new entry from the map
also right a function updateStats
class TreeMapStats : public AVLTreeMap {
public:
// embedded node class extension of an AVL-Tree node
class Node : public AVLTreeMap::Node {
private:
// stats class to account for basic statistics/information of subtree rooted at each node
class Stats {
private:
// data members: number of nodes/map entries stored in the subtree; sum of all the map values of
map entries stored in the subtree; the minimum map value of all the map entries stored in the
subtree; the maximum map value of the map entries stored in the subtree
int num;
int sum;
int min;
int max;
public:
// stats constructors
Stats() { };
Stats(int v, Node *l, Node* r) : num(1), sum(v), min(v), max(v) {
};
// stats destructor
~Stats() { };
// overloading output stream for a representation of stats s
friend ostream& operator<<(ostream& os, const Stats& s) {
os << "{" << s.num << "," << s.sum << "," << s.min << "," << s.max << "}";
return os;
};
};
// data member: node info/stats
Stats *info;
public:
// tree node constructors
Node() : AVLTreeMap::Node() { };
Node(int k, int v, Node* l, Node* r, Node* p) : AVLTreeMap::Node(k,v,l,r,p) {
info = new Stats(v, l, r);
};
// tree node destructor
virtual ~Node() { if (this->info) delete this->info; };
// overloading output stream for a representation of TreeMapStats node w
friend ostream& operator<<(ostream& os, const Node& w) {
os << ((AVLTreeMap::Node) w) << *(w.info) ;
return os;
};
// (overloading) print utility for a node, including map entry and additional info and stats
void printStats() { cout << *this << endl; }
/*
# PRECONDITION: the info values for the left and right nodes for the children of the node have
been properly set, consistent with the subtree that they root
# POSTCONDITION: the info values for the node have been properly set, consistent with the
subtree that it roots
*/
};
// print utilities
void printTreeMapStats();
void printTreeMapStats(Node* w);
void printTreeMap();
// tree constructor
TreeMapStats() { };
// tree desctructor
virtual ~TreeMapStats() { };
protected:
// (overloadable) auxiliary node creation utility
virtual Node* createNode(int k, int v, BSTMap::Node* l, BSTMap::Node* r, BSTMap::Node* p) {
return new Node(k,v,(Node*) l, (Node*) r, (Node*) p); };
// prints a representation of AVL node w
// (overloadable)
// INPUT: node w
virtual void printNode(const BSTMap::Node* w) const { if (w) cout << *((Node*) w); };
// (overloa.
in this assignment you are asked to write a simple driver program an.pdf
in this assignment you are asked to write a simple driver program and set of functions (maybein
a library) that can be performed on a binary search tree.
Your program should allow user to insert/delete integer values into the binary search tree along
with several other operations on the binary search tree. You can use the code given in slides. But
this time your key will be int! Specifically, your program will ask user to enter a command and
related parameters (if any) in a loop, and then perform the given commands. Here is the list of
commands that your program must implement:
* insert
*find\'
*delete
*list inorder
*list preorder
*list postorder
*list levelorder
* max
* min
* height
*count
* sum
*quit
As always, make sure you release (free) the dynamically allocated memories if you allocate any
memory in your programs. So, before submitting your program, run it with valgrind to see if
there is any memory leakage
//my proggram in C
struct tree_node {
int data;
struct tree_node *left, *right;
}
typedef struct nodeT {
int key;
struct nodeT *left, *right;
} nodeT, *treeT;
int main(){
while (TRUE) {
printf(\"> \");
line = GetLine();
ch = toupper(line[0]);
switch (ch) {
case \'I\': insert(); break;
case \'F\': find(); break;
case \'D\': delete(); break;
case \'LI\': listInorder; break;
case \'LPR\': listPreorder(); break;
case \'LPO\': listPostorder(); break;
case \'MAX\': max(); break;
case \'min\': min(); break;
case \'H\': height(); break;
case \'C\': count(); break;
case \'S\': sum(); break;
case \'Q\': exit(0);
default:printf(\"Illegal command\ \"); break;
}
}
}
nodeT *FindNode(nodeT *t, int key){
while(t !=NULL) {
if (key == t->key) return t;
if (key < t->key) {
t = t->left;
} else {
t = t->right;
}
return NULL;
}
void delete(nodeT **p){
nodeT
*target;
target=*p;
if (target->left==NULL && target->right==NULL) {
*p=NULL;
} else if (target->left == NULL) {
*p=target->right;
} else
if (target->right == NULL) {
*p=target->left;
} else {
/* target has two children, see next slide */
}
free(target);
}
void listInorder(nodeT *T){
if (t != NULL) {
DisplayTree(t->left);
printf(“%d “, t->key);
DisplayTree(t->right);
}
}
void listPreorder(nodeT *t) {
if (t != NULL) {
printf(“%d “, t->key);
DisplayTree(t->left);
DisplayTree(t->right);
}
}
void listPostOrder(nodeT *t){
if (t != NULL) {
DisplayTree(t->left);
DisplayTree(t->right);
printf(“%d “, t->key);
}
}
void intsert(nodeT **tptr, int key){
nodeT*t, *tmp;
t=*tptr;
if (t == NULL) {
tmp=New(nodeT*);
tmp->key = key;
tmp->left=tmp->right=NULL;
*tptr=tmp;
return;
}
if (key < t->key) {
InsertNode
(&t->left, key);
} else {
InsertNode(&t->right, key);
}
}
int height(nodeT *t){
if (t == NULL)
return 0;
else
return (1 + maximumof(
height(t->left),
height(t->right)) );
}
int sum(struct tree_node *p){
if (p == NULL)
return 0;
else
return (p->data +
sum(p->left) +
sum(p->right) );
}
Solution
1. /*
2. * Java Program to Implement Binary Search Tree
3. */
4.
5. import java.util.Scanner;
6.
7. /* Class BSTNode */
8. cl.
-- Task 2- Debugging a program with stacks- queues- and doubly-linked.docx
/* Task 2: Debugging a program with stacks, queues, and doubly-linked lists There are a number of errors in the following program. All errors are located in main() and structure definitions. Function declarations and definitions are correct! Locate all errors, fix them (as shown below), run the program and save its output as a comment at the end of the source file. Example: int num = 10; int *ptr; num = &ptr; // <== Error: Comment the line and write the correct line below // Write a short justification where appropriate // num = &ptr; // Error #1 ptr = # Name: */ #include #include #include #include #define DUMMY_TRAILER '\177' // octal ASCII code of the // last character in the ASCII table #define NUM_CITIES 10 typedef struct { char name[12]; int temperature[5]; } CITY; // Stack and Queue Node typedef struct node NODE; struct node { CITY city; node *next; }; // Doubly Linked List Node typedef struct d_node D_NODE; struct d_node { CITY city; NODE *forw; NODE *back; }; // Stack Functions NODE *push(NODE *stack, const CITY *pStu); NODE *pop(NODE **stack); // Queue Functions void enqueue(NODE **queue, NODE **rear, const CITY *pStu); NODE *dequeue(NODE **queue, NODE **rear); // Doubly Linked List Functions D_NODE *init_list(void); int insert(D_NODE *list, const CITY *pStu); void traverse_forw(D_NODE *list); void traverse_back(D_NODE *list); // Other Functions void printCity(const CITY *pCity); int main (void) { CITY cList[NUM_CITIES] = { {"Cupertino", {88, 89, 87, 85, 89}}, {"Flagstaff", {81, 80, 88, 89, 89}}, {"Los Angeles", {87, 88, 89, 89, 90}}, {"Philadelphia", {96, 99, 99, 90, 95}}, {"Phoenix", {106, 109, 109, 100, 105}}, {"Portland", {89, 90, 85, 89, 90}}, {"Reno", {108, 105, 109, 100, 108}}, {"Salem", {85, 90, 85, 89, 90}}, {"Tucson", {107, 100, 109, 100, 108}}, {"Yreka", {101, 109, 100, 108, 109}} }; NODE *stack = NULL; NODE *top = NULL; NODE *queue = NULL, *rear = NULL; NODE *front; D_NODE *list; list = init_list(); // build stack and queue with data from an array of CITY structures srand((unsigned int)time(NULL)); int count = rand() % 10; for ( int n = 0; n < count; n++) { int i = rand() % NUM_CITIES; int duplicate = insert(list, &cList[i]); if(duplicate) { // already in the list! push(stack, &cList[i]); enqueue(&queue, &rear, cList[i]); } } // display list printf("\nLIST contents (forwards):\n"); traverse_forw(list); printf("\nLIST contents (backwards):\n"); traverse_back(list); // display stack if (top) { printf("\nSTACK contents from top to bottom:\n"); while ((top = pop(stack))) { printCity(top->city); } } else printf ("Empty Stack!\n"); // display queue if (front) { printf("\nQUEUE contents from front to rear:\n"); while ((front = dequeue( queue, rear))) { printCity(front->city); } } else printf ("Empty Queue!\n"); return 0; } /*************************************************** Displays the fileds of a CIS_CLASS structure Pre pCls - a pointer to a CIS_CLASS structure Post */ void printCity(const CITY *pCity) { printf("%-20s %3d\n",.
Notes for SQLite3 Usage
This document provides notes and code samples for using SQLite3 in C applications. It includes information on resolving link errors when building SQLite3 applications, the two forms of the LIMIT clause, using the sqlite3_get_table() function to retrieve and iterate through query results, and using the Firefox SQLite Manager add-on to view and edit SQLite databases. Code samples demonstrate getting the total record count of a table, iterating through retrieved records in different ways, and connecting and querying a SQLite database.
Start with the inclusion of libraries#include iostream .docx
// Start with the inclusion of libraries
#include <iostream> //The library of io functions
#include <fstream> //The library of external stream functions
#include <cstdlib> //The library for external errors
#include <string> //The library for string functions
#include <cmath> //The library of C math functions
#include <iomanip> //Allows setting widths, etc. for I/O
#include <stdlib.h>
#include <stdio.h>
#include<vector>
using namespace std;
// Define all of the prototypes for functions used in the program
// Counts the number of unique letters seen
int countunique(int *array, int size);
// Creates the input file and formats it for use by the cipher section.
void createinput(string ifile, string ofile);
// Creates the encoded input file
void createcipher(int key, string ifile, string ofile);
// Finds and counts the number of digrams
int digram(int *pointer, string ifile);
// Counts the letter frequency in the encoded input file
int lettercount(int*, string ifile, string ofile);
// Finds the highest count in the singlton (or any other) array
int singleton(int*, int size);
// Trims an input file to the right size starting at an offset
void trimfile(string ifile, string ofile, int offset, int size);
// Begin the main function for testing
int main(int argc, char* argv[])
{
int count = 0;
int second = 0;
int singlefreq[26];
int *single = singlefreq;
int delta;
int loop; //The loop counter for arguments
int final = 0;
int totalcnt;
int key = -1; //Sets the key value
int len = 0; //The length to investigate for testing
int off; //Holds the offset into the file
double m; //Holds the metric error value
char loopletter;
float percent;
string ifile1 = "";
string ofile1 = "";
string deflt = "c:\\dissertation\\ShiftandSubcipherC++files\\clean.txt";
string ifile2 = "";
string ofile2 = ""; //Holds selected file path names
string cmdarg; //Holds the command line argument
string stop = "l"; //Gives the stop condition, assumes l
string reportfile = "c:\\dissertation\\test\\report.txt";
ofstream outs; //Declare an output stream for reporting
int digramc[676]; //Set up the digram array
int *two = digramc; //Point to the digram array
int dicount = 0; //Holds the count of the number of digrams
int total = 0; //Counts the total number of letters seen for analysis
for (loop = 1; loop<argc; loop++) //Decide if we have arguments or must use defaults
{
if (!argv[1])
{
// cout << "No argument found.\n";
ifile1 = deflt;
}
else
{
cmdarg = argv[loop];
if (cmdarg == "-k")
{
loop++;
key = atoi(argv[loop]);
cout << "key = " << key << endl;
}
if (cmdarg == "-l")
{
loop++;
len = atoi(argv[loop]);
cout << "Run for " << len << " characters.\n";
}
if (cmdarg == "-m")
{
loop++;
m = atof(argv[loop]);
cout << "Run until and error of " << m << "\n";
}
if (cmdarg == "-off")
{
loop++;
off = atoi(argv[loop]);
cout << ...
Memory Manglement in Raku
The document discusses monitoring and analyzing memory usage in Raku processes. It describes using the getrusage(2) system call to retrieve resident set size (RSS) and other memory statistics for a process. It then presents the ProcStats module, which allows periodically sampling getrusage(2) data over time to track RSS and detect changes from an initial baseline. The module outputs differences in memory statistics compared to the first sample, ignoring unchanged values. This provides a concise way to monitor for increases in a process's memory footprint over time.
Binary Tree in C++ coding in the data structure
This document discusses binary trees and binary search trees in C++. It includes functions to create and traverse binary trees in preorder, inorder, and postorder fashion. For binary search trees, it includes functions to insert nodes, perform inorder traversal, find the minimum value node, and delete nodes. These data structures and functions provide ways to organize and manipulate tree-based data in C++ programs.
(1)Objective Binary Search Tree traversal (2 points)Use traversal.pdf
(1)Objective: Binary Search Tree traversal (2 points)
Use traversal.pptx as guidance to write a program to build a binary search tree Dictionary. I of
BST have the same data from each input record.
Download traversal-lab.pptx, inventory.txt, BinNode.java, BSTNode.java, BST.java,
Dictionary.java .
Perform specifications as follow:
(a)Provide Add, Delete and Retrieve functions for user to access the database. Reject duplicate
record when add a new record.
(b)Modify BST.java to add printpostOrder, printpreOrder methods.
(c)At the end, display inorder, postorder and preorder of the tree.
Codes:
/** Source code example for \"A Practical Introduction to Data
Structures and Algorithm Analysis, 3rd Edition (Java)\"
by Clifford A. Shaffer
Copyright 2008-2011 by Clifford A. Shaffer
*/
/** ADT for binary tree nodes */
public interface BinNode {
/** Get and set the element value */
public E element();
public void setElement(E v);
/** @return The left child */
public BinNode left();
/** @return The right child */
public BinNode right();
/** @return True if a leaf node, false otherwise */
public boolean isLeaf();
}
//********************************************************************
// StringTree.java
//
//********************************************************************
import java.util.*;
public class StringTree
{
private Node root;
//----------------------------------------------------------------
// Creates an initially empty tree.
//----------------------------------------------------------------
public StringTree()
{
root = null;
}
//----------------------------------------------------------------
// Adds a string to the tree.
//----------------------------------------------------------------
public void addString (String str)
{
root = addStringToSubTree(str, root);
}
//----------------------------------------------------------------
// Adds a string to the subtree with the given root node
//----------------------------------------------------------------
private Node addStringToSubTree (String str, Node node)
{
Node result = node;
if (node == null)
result = new Node(str);
// If the new string comes before the string in the node, add
// the new string to the left child. Otherwise, add it to the
// right child.
else
if (str.compareTo(node.value) < 0)
node.left = addStringToSubTree(str, node.left);
else
node.right = addStringToSubTree(str, node.right);
return result;
}
//----------------------------------------------------------------
// Prints the result of a depth-first traversal of the tree using
// recursion.
//----------------------------------------------------------------
public void traverseWithRecursion()
{
traverseWithRecursion(root);
}
//----------------------------------------------------------------
// Prints the elements in the specified tree using recursion.
//----------------------------------------------------------------
private void traverseWithRecursion (Node node)
{
if (node != null)
{
traverseWithRecursion (node.left);
System.
Can you finish and write the int main for the code according to the in.pdf
Can you finish and write the int main for the code according to the instruction Thank you so
much.
Here's the code for the BSTNode ADT and BST implementation:
#include <iostream>
#include <fstream>
#include <queue>
using namespace std;
// Krone class
class Krone {
private:
int wholeValue;
int fractionalValue;
public:
Krone() {}
Krone(int whole, int fraction) : wholeValue(whole), fractionalValue(fraction) {}
int getWhole() const { return wholeValue; }
int getFraction() const { return fractionalValue; }
bool operator<(const Krone& other) const {
if (wholeValue < other.wholeValue) {
return true;
} else if (wholeValue == other.wholeValue) {
return fractionalValue < other.fractionalValue;
} else {
return false;
}
}
friend ostream& operator<<(ostream& out, const Krone& krone) {
out << "Kr " << krone.wholeValue << "." << krone.fractionalValue;
return out;
}
};
// BST Node class
class BSTNode {
private:
Krone data;
BSTNode* left;
BSTNode* right;
public:
BSTNode() {}
BSTNode(const Krone& krone) : data(krone), left(nullptr), right(nullptr) {}
Krone getData() const { return data; }
BSTNode* getLeft() const { return left; }
BSTNode* getRight() const { return right; }
void setData(const Krone& krone) { data = krone; }
void setLeft(BSTNode* node) { left = node; }
void setRight(BSTNode* node) { right = node; }
};
// BST class
class BST {
private:
BSTNode* root;
public:
BST() : root(nullptr) {}
BSTNode* getRoot() const { return root; }
bool isEmpty() const { return root == nullptr; }
int countNodes(BSTNode* node) const {
if (node == nullptr) {
return 0;
} else {
return 1 + countNodes(node->getLeft()) + countNodes(node->getRight());
}
}
void empty(BSTNode* node) {
if (node != nullptr) {
empty(node->getLeft());
empty(node->getRight());
delete node;
}
}
void insertNode(const Krone& krone) {
BSTNode* node = new BSTNode(krone);
if (isEmpty()) {
root = node;
} else {
BSTNode* currNode = root;
while (true) {
if (krone < currNode->getData()) {
if (currNode->getLeft() == nullptr) {
currNode->setLeft(node);
break;
} else {
currNode = currNode->getLeft();
}
} else {
if (currNode->getRight() == nullptr) {
currNode->setRight(node);
break;
} else {
currNode = currNode->getRight();
}
}
}
}
}
BSTNode* searchNode(const Krone& krone) const {
BSTNode* currNode = root;
while (currNode != nullptr) {
Declare and implement a BSTNode ADT with a data attribute and two pointer attributes, one for
the left child and the other for the right child. Implement the usual getters/setters for these
attributes.
Declare and implement a BST as a link-based ADT whose data will be Krone objects - the data
will be inserted based on the actual money value of your Krone objects as a combination of the
whole value and fractional value attributes.
For the BST, implement the four traversal methods as well as methods for the usual search,
insert, delete, print, count, isEmpty, empty operations and any other needed.
Your pgm will use the following 20 Krone objects to be created in the exact order in your.
Need help implementing the skeleton code below, I have provided the .pdf
I need help with this practice problem?
Execute the following coding segment and identify the errors in the program. Debug the program
and provide the correct version of the code. Hinclude int main() printf(\"%s\", isdigit(\'A\') ? \"A
is digit\" \"A is not digit\"); a : a printf(\"Inlnln\") return return e;
Solution
in range [0,9]. If it\'s not then this function returns 0.
Given program compiles successfully, compiler does not give any error.
But If the input of isdigit(\'A\') is changed then the program will always print
\"A is a digit\" or
\"A is not a digit\" .
It will not print exact value of char A.
So, correct code is given below.
#include
int main()
{
char A = \'1\';
printf(\"%c%s\",A,isdigit(A)? \" is a digit\" : \" is not a digit\");
printf(\"\ \");
A = \'B\';
printf(\"%c%s\",A,isdigit(A)? \" is a digit\" : \" is not a digit\");
printf(\"\ \");
return 0;
}
Sample Output:
1 is a digit
B is not a digit.
Lab08Lab08.cppLab08Lab08.cpp.docx
Lab08/Lab08.cppLab08/Lab08.cpp//**************************************************************************************************************
// FILE: Lab08.cpp
//
// DESCRIPTION: Contains the main() function. Instantiates a PointTest object which tests the Point class.
//
// AUTHORS: your-name (your-email-address)
// your-partner's-name (your-partners-email-address)
//
// COURSE: CSE100 Principles of Programming with C++, Fall 2015
//
// LAB INFO: Lab 8 Date/Time: your-lab-date-and-time TA: your-lab-ta
//--------------------------------------------------------------------------------------------------------------
// TESTING:
//
// TEST CASE 1:
// ------------
// TEST CASE INPUT DATA:
// Point p1 x = 11
// Point p1 y = 22
// Point p2 x = -33
// Point p2 y = -44
//
// EXPECTED OUTPUT GIVEN THE INPUT:
// The point p1 is (11, 22)
// The point p2 is (-33, -44)
// The distance between the points is 79.322
// Moving point p1...The point p1 is now at (100, 200)
// The distance between the points is 277.894
// Moving point p2...The point p2 is now at (300, 400)
// The distance between the points is 282.843
//
// OBSERVED OUTPUT:
// Document the output from your program when you perform this test case
//
// TEST CASE RESULT: Document PASS or FAIL
//
// TEST CASE 2:
// ------------
// TEST CASE INPUT DATA:
// Point p1 x = ???
// Point p1 y = ???
// Point p2 x = ???
// Point p2 y = ???
//
// EXPECTED OUTPUT GIVEN THE INPUT:
// ??? Document the expected output ???
//
// OBSERVED OUTPUT:
// ??? Document the output from your program when you perform this test case ???
//
// TEST CASE RESULT: ??? Document PASS or FAIL ???
//**************************************************************************************************************
#include"PointTest.hpp"
//--------------------------------------------------------------------------------------------------------------
// FUNCTION: main()
//
// DESCRIPTION
// Starting point for the program.
//
// PSEUDOCODE
// Define a PointTest object named pointTest calling the default ctor.
// Call run() on the pointTest object.
// Return 0.
//--------------------------------------------------------------------------------------------------------------
???
Lab08/Point.cppLab08/Point.cpp//**************************************************************************************************************
// FILE: Point.cpp
//
// DESCRIPTION: Implementation of the Point class. See Point.hpp for the class declaration.
//
// AUTHORS: your-name (your-email-address)
// your-partner's-name (your-partners-email-address)
//
// COURSE: CSE100 Principles of Programming with C++, Fall 2015
//
// LAB INFO: Lab 8 Date/Time: your-lab-date-and-time TA: your-lab-ta
//**************************************************************************************************************
#include<cmath>// For sqrt()
#include<sstream>// For stringstre ...
Степан Кольцов — Rust — лучше, чем C++
Rust — это современный, практический, быстрый и безопасный язык программирования. Некоторые говорят, что Rust — это как C++, если бы его писал человек, знающий Haskell.
Система типов Rust решает главную проблему C++ — небезопасность. C++ очень легко сделать ошибки, которые приведут к поломкам (например, use after free). Rust позволяет писать безопасный код, сохраняя при этом выразительность и околонулевые накладные расходы C++. В докладе будут подробно описаны механизмы языка, которые контролируют безопасность программы.
Хотя в данный момент Rust ещё не подходит для использования в продакшне, его всё равно стоит изучать. Во-первых, потому что это очень интересный подход к программированию, а во-вторых, потому что через несколько лет для разработки требовательных к ресурсам программ будет необходим именно Rust или другой похожий инструмент.
Need help with the TODO's (DONE IN C++) #pragma once #include -funct.pdf
Need help with the TODO's (DONE IN C++)
#pragma once
#include <functional> // std::less
#include <iostream>
#include <queue> // std::queue
#include <utility> // std::pair
template <typename K, typename V, typename Comparator = std::less<K>>
class BinarySearchTree
{
public:
using key_type = K;
using value_type = V;
using key_compare = Comparator;
using pair = std::pair<key_type, value_type>;
using pointer = pair*;
using const_pointer = const pair*;
using reference = pair&;
using const_reference = const pair&;
using difference_type = ptrdiff_t;
using size_type = size_t;
private:
struct BinaryNode
{
pair element;
BinaryNode *left;
BinaryNode *right;
BinaryNode( const_reference theElement, BinaryNode *lt, BinaryNode *rt )
: element{ theElement }, left{ lt }, right{ rt } { }
BinaryNode( pair && theElement, BinaryNode *lt, BinaryNode *rt )
: element{ std::move( theElement ) }, left{ lt }, right{ rt } { }
};
using node = BinaryNode;
using node_ptr = node*;
using const_node_ptr = const node*;
node_ptr _root;
size_type _size;
key_compare comp;
public:
BinarySearchTree() {
// TODO
}
BinarySearchTree( const BinarySearchTree & rhs ) {
// TODO
}
BinarySearchTree( BinarySearchTree && rhs ) {
// TODO
}
~BinarySearchTree() {
// TODO
}
const_reference min() const { return min( _root )->element; }
const_reference max() const { return max( _root )->element; }
const_reference root() const {
// TODO
}
bool contains( const key_type & x ) const { return contains( x, _root ); }
value_type & find( const key_type & key ) { return find( key, _root )->element.second; }
const value_type & find( const key_type & key ) const { return find( key, _root )-
>element.second; }
bool empty() const {
// TODO
}
size_type size() const {
// TODO
}
void clear() {
clear( _root );
_size = 0;
}
void insert( const_reference x ) { insert( x, _root ); }
void insert( pair && x ) { insert( std::move( x ), _root ); }
void erase( const key_type & x ) { erase(x, _root); }
BinarySearchTree & operator=( const BinarySearchTree & rhs ) {
// TODO
}
BinarySearchTree & operator=( BinarySearchTree && rhs ) {
// TODO
}
private:
void insert( const_reference x, node_ptr & t ) {
// TODO
}
void insert( pair && x, node_ptr & t ) {
// TODO
}
void erase( const key_type & x, node_ptr & t ) {
// TODO
}
const_node_ptr min( const_node_ptr t ) const {
// TODO
}
const_node_ptr max( const_node_ptr t ) const {
// TODO
}
bool contains( const key_type & x, const_node_ptr t ) const {
// TODO
}
node_ptr find( const key_type & key, node_ptr t ) {
// TODO
}
const_node_ptr find( const key_type & key, const_node_ptr t ) const {
// TODO
}
void clear( node_ptr & t ) {
// TODO
}
node_ptr clone ( const_node_ptr t ) const {
// TODO
}
public:
template <typename KK, typename VV, typename CC>
friend void printLevelByLevel( const BinarySearchTree<KK, VV, CC>& bst, std::ostream & out
);
template <typename KK, typename VV, typename CC>
friend std::ostream& printNode(std::ostream& o, const typename BinarySearchTree<KK, VV,
CC>::node& bn);.
Please read the comment ins codeExpressionTree.java-------------.pdf
Please read the comment ins code
ExpressionTree.java
----------------------------------
/**
* This is the class for Expression Tree.
* Used to create Expression Tree and Evaluate it
*/
/**
* Following logic is used to construct a Tree
* Here we use stack for Preparing Tree
* Loop through given Expression String
* If Character is Operand , Create node and push to stack
* If Character is Operator then
* 1)Create Node for Operator
* 2)Pop 2 nodes from Stack and Made
* OpretorNode--> left == first node pop
* OpretorNode--> right == second node pop
* At the end of creation of Expression Tree, Stack have only one node , which is root of
Expression tree
*/
/** Class ExpressionTree **/
class ExpressionTree
{
/** class TreeNode
* Stored Character ==> Digit(0..9) or a Operator +,-,*,/
* Left Node and Right Node
*
* **/
class TreeNode
{
char data;
TreeNode left, right;
/** constructor **/
public TreeNode(char data)
{
this.data = data;
this.left = null;
this.right = null;
}
}
/** class StackNode **/
class StackNode
{
TreeNode treeNode;
StackNode next;
/** constructor **/
public StackNode(TreeNode treeNode)
{
this.treeNode = treeNode;
next = null;
}
}
private static StackNode top;
/** constructor
* Constructor takes input string like \"+-+7*935*82*625\"
* Input should be in Prefix notation
* **/
public ExpressionTree(String expression)
{
top = null;
//Call Method for prepare expression tree
buildTree(expression);
}
/** function to clear tree **/
public void clear()
{
top = null;
}
/** function to push a node **/
private void push(TreeNode ptr)
{
if (top == null)
top = new StackNode(ptr);
else
{
StackNode nptr = new StackNode(ptr);
nptr.next = top;
top = nptr;
}
}
/** function to pop a node
* When it find operator pop 2 elements from Stack
*
* **/
private TreeNode pop()
{
if (top == null)
throw new RuntimeException(\"Underflow\");
else
{
TreeNode ptr = top.treeNode;
top = top.next;
return ptr;
}
}
/** function to get top node **/
private TreeNode peek()
{
return top.treeNode;
}
/** function to insert character **/
private void insert(char val)
{
try
{
//If Operand , Create node and push to Stack
if (isDigit(val))
{
TreeNode nptr = new TreeNode(val);
push(nptr);
}
//If Operator , Create node and popup 2 elements and make them its right and left
else if (isOperator(val))
{
TreeNode nptr = new TreeNode(val);
nptr.left = pop();
nptr.right = pop();
push(nptr);
}
}
catch (Exception e)
{
System.out.println(\"Invalid Expression\");
}
}
/** function to check if digit **/
private boolean isDigit(char ch)
{
return ch >= \'0\' && ch <= \'9\';
}
/** function to check if operator **/
private boolean isOperator(char ch)
{
return ch == \'+\' || ch == \'-\' || ch == \'*\' || ch == \'/\';
}
/** function to convert character to digit **/
private int toDigit(char ch)
{
return ch - \'0\';
}
/** function to build tree from input */
public void buildTree(String eqn)
{
for (int i = eqn.length() - 1; i >= 0; i--)
insert(eqn.charAt(i));
}
/** function to evaluate tree */
public dou.
C++ extension methods
The document discusses different approaches for extending classes with new methods in various programming languages and paradigms. It covers approaches used in dynamic languages like Python and Objective-C, as well as static languages like C++ and C#. It also proposes a template-based approach to add extension methods to C++ classes in a way that mimics how extensions work in C#.
C++ projectMachine Problem 7 - HashingWrite a program to do the .pdf
C++ project
Machine Problem 7 - Hashing
Write a program to do the following:
loads username/password sets from the file password.txt and insert them into the hash table until
the end of file is reached on password.txt. The password.txt file will look something like this
with one username/password set per line.
mary changeMe!
The program will then present a login prompt, read one username, present a password prompt,
and after looking up the username\'s password in the hash table, will print either \"Authentication
successful\" or \"Authentication failure\".
The above step will be repeated until the end of the input data (EOF) is reached on the console
input stream (cin). The EOF character on the PC\'s is the CTRL Z character.
To convert from a string to an integer, we can add the ascii value of each character together. For
instance, Mary\'s conversion from string to integer might look something like this:
109(\'m\') + 97(\'a\') + 114(\'r\') + 121(\'y\')=441
We\'ve converted the string to an integer, but we still need to convert the integer to an index. For
an array of 10 elements we can divide by 10 and use the remainder as an index. Combining these
two hash functions, we will get Mary\'s index to be: 441 % 10 = 1
Your primary tasks for this homework are to edit the login.cpp to replace the comments with
lines so that it does the following:
Insert passwords into the Hash Table.
Retrieve one user\'s Password structure from the Hash Table.
Compare retrieved user password to input password and print \"Authentication failure\" or
\"Authentication successful.\"
//--------------------------------------------------------------------
//
// listlnk.h
//
//--------------------------------------------------------------------
#pragma warning( disable : 4290 )
#include
#include
#include
#include
#include
#include
#include
using namespace std;
template < class T > // Forward declaration of the List class
class List;
template < class T >
class ListNode // Facilitator class for the List class
{
private:
ListNode(const T &nodeData, ListNode *nextPtr);
T dataItem; // List data item
ListNode *next; // Pointer to the next list node
friend class List;
};
//--------------------------------------------------------------------
template < class T >
class List
{
public:
List(int ignored = 0);
~List();
void insert(const T &newData) throw (bad_alloc); // Insert after cursor
void remove() throw (logic_error); // Remove data item
void replace(const T &newData) throw (logic_error); // Replace data item
void clear();
bool isEmpty() const;
bool isFull() const;
// List iteration operations
void gotoBeginning() throw (logic_error);
void gotoEnd() throw (logic_error);
bool gotoNext();
bool gotoPrior();
T getCursor() const throw (logic_error); // Return item
void showStructure() const;
void moveToBeginning() throw (logic_error); // Move to beginning
void insertBefore(const T &newElement) throw (bad_alloc); // Insert before cursor
private:
ListNode *head, // Pointer to the beginni.
Similar to Complete the C++ program and implement the routines that are n.docx (20)
RightTrianglerightTriangle.cppRightTrianglerightTriangle.cpp.docx
RightTrianglerightTriangle.cppRightTrianglerightTriangle.cpp.docx
I just need code for processQueue function using iterators from the .pdf
I just need code for processQueue function using iterators from the .pdf
Using C++I keep getting messagehead does not name a type.pdf
Using C++I keep getting messagehead does not name a type.pdf
Were writing code for a project that dynamically allocates an arra.pdf
Were writing code for a project that dynamically allocates an arra.pdf
complete the following functions in c++ singleRotation putNo.pdf
complete the following functions in c++ singleRotation putNo.pdf
in this assignment you are asked to write a simple driver program an.pdf
in this assignment you are asked to write a simple driver program an.pdf
-- Task 2- Debugging a program with stacks- queues- and doubly-linked.docx
-- Task 2- Debugging a program with stacks- queues- and doubly-linked.docx
Start with the inclusion of libraries#include iostream .docx
Start with the inclusion of libraries#include iostream .docx
(1)Objective Binary Search Tree traversal (2 points)Use traversal.pdf
(1)Objective Binary Search Tree traversal (2 points)Use traversal.pdf
Can you finish and write the int main for the code according to the in.pdf
Can you finish and write the int main for the code according to the in.pdf
Need help implementing the skeleton code below, I have provided the .pdf
Need help implementing the skeleton code below, I have provided the .pdf
Need help with the TODO's (DONE IN C++) #pragma once #include -funct.pdf
Need help with the TODO's (DONE IN C++) #pragma once #include -funct.pdf
Please read the comment ins codeExpressionTree.java-------------.pdf
Please read the comment ins codeExpressionTree.java-------------.pdf
C++ projectMachine Problem 7 - HashingWrite a program to do the .pdf
C++ projectMachine Problem 7 - HashingWrite a program to do the .pdf
More from ajoy21
Please complete the assignment listed below.Define and explain, us.docx
Please complete the assignment listed below.
Define and explain, using at least five sentence or on-task bullet notes for each. Each answer earns up to five points. For each answer, please make five different substantive points, earning one point each.
Transnational corporation
Gentrification
Renewable resources
Desertification
Photochemical smog
Biodiversity
Barriers to migration
Hierarchical diffusion
Militant fundamentalism
Urbanization
Eastern European cities
Hazardous waste
The Endangered Species Act
Subsidence
Water Quality
Deforestation
Wetlands
Central place theory
Soil degradation
Hydraulic fracturing (fracking)
Wind power
Oil sands
Models of urban form
Hinterland
Agglomeration economies
.
Please cite sources for each question. Do not use the same sources f.docx
Please cite sources for each question. Do not use the same sources for each question. Minimum of 2 resources and 300 words.
Briefly contrast the views of Locke and Rousseau on how children develop.
a) What do ethologists, such as Lorenz, mean by imprinting on a parent-figure?
b) What observations led Bowlby to suggest that imprinting occurs in human infants? That is, what parallels between human infants and other species did he point to?
"For children to learn, we must praise their correct responses and correct their mistakes." Would Montessori agree? Explain.
What did Werner mean by "microgenesis" and "microgenetic mobility?" Give examples. Discuss some valuable aspects of these concepts.
Piaget's critics charge that he made development appear too slow. Discuss this criticism with respect to either: a) object permanence, b) conservation training, or c) Kamii's teaching methods. Then, describe the Piagetian approach.
Compare conventional and postconventional morality in Kohlberg's theory.
.
Please choose one of the following questions to answer for this week.docx
Please choose one of the following questions to answer for this week's assignment. When you respond to your fellow classmates this week, please choose someone who answered a different question than your own. This will help you familiarize yourself with more of the material. Remember, you need to post at least three responses to receive full credit for this assignment.
1. The French revolutionaries claimed that they were inspired by the Enlightenment
philosophes
. Would the
philosophes
we studied back in Week 2 have approved of how the Revolution started? What about how it developed through the 1790s?
2. In his
Reflections on the Revolutions in France,
British member of Parliament Edmund Burke predicted the Terror. Was this a lucky guess on his part or were the seeds of of the Terror part of the Revolution from the beginning? Why?
3. The French Revolution had a profound impact on the world, not just within the borders of France. Why were some nations willing to accept its gains-at least, partially-while others resisted them? Which country do you think was the most unwilling to accept the new ideas of
liberte,
e
galite,
and
fraternite
? Other than France, which was most willing to embrace the Revolutionary ideals? Why?
4. Although no historian doubts the importance of the reign of Napoleon in European (and even world) history, they do argue over the interpretation of these events. For example, they are torn on the role Napoleon played in the Revolution. Some argue that he continued the spirit of the Revolution, despite creating an Empire. Others believe he murdered it. Some include Napoleon's reign as a stage of the actual Revolution, while others consider it its own separate event. What do you think? Do you think Napoleon continued and spread the Revolution? Or do you think he destroyed its ideals when creating his empire? Do you think his reign should qualify as a separate historical event from the Revolution? Or was it simply another stage in a long process?
.
Please check the attachment for my paper.Please add citations to a.docx
Please check the attachment for my paper.
Please add citations to all paragraphs.
Also, please check the paper for plagiarism and please add two more pages on (Social Media & In person Communication) to make it fit the essay so far.
And please use 5 more sources in the paper. (1 Article, 1 Book, 1 Encyclopedia, 1 Newspaper and 1 magazine).
Finally, please correct all the grammar mistakes in the first 3 pages.
And please get rid of the first person used. (I,we etc...)
.
Please answer to this discussion post. No less than 150 words. Refer.docx
Please answer to this discussion post. No less than 150 words. Reference and APA style needed. Please no plagiarism. Similarity is <20%. Thanks
The most interesting thing about this chapter is that it helps people and scholars to develop skills to influence strategy in nowadays changing healthcare environment. The topic also contributes an extensive range of themes in strategies and politics, offering more complete contextual that can be in other policies textbook in the market (Mason, Leavitt, & Chaffee, 2013). The topics also entail up-to-date updates concerning conflict organization, health economics, politicization, use of media as well as working with societies for change. Reviewed copy take account of new supplement with coverage of advanced reasonably priced care act. According to this perceptions and strategies, every individual will be equipped and ready to play a leadership role under four spheres where nurses are governmentally efficient, the workstation, government, specialized organization as well as the community (American Nurses Association, 2010). The topic has helped me to know more of nursing and healthcare policies and politics.
In thus, have understood that the concept of nursing policies influences can be defined as a nursing ability to have active, effective on decision making as well as affairs connected to health care by use of power, support, and strategy capability, and establishing or strengthening images. The nursing policy and politics within a healthcare connect to my clinical practices because as a nurse, I should view myself as a professional with the ability and being responsible for influencing recent and forthcoming health care conveyance system. But to attain this, there must be the presence of policies that define and assimilate suitable standards for healthcare delivery as well as addressing essential conditions for that care to happen.
References
American Nurses Association. (2010).
Nursing's social policy statement: The essence of the profession
. Nursesbooks. org.
Mason, D. J., Leavitt, J. K., & Chaffee, M. W. (2013).
Policy and Politics in Nursing and Healthcare-Revised Reprint
. Elsevier Health Sciences.
.
Please attach Non-nursing theorist summaries.JigsawExecutive .docx
Please attach Non-nursing theorist summaries.
Jigsaw/Executive Summary Grading Criteria
Albert Bandura: Self-Efficacy
Points Possible
Your Points
Summary Paper
Introduction/Conclusion
2
History/Origins of Theory
3
Major Precepts of Theory
Current Application(s) of Theory
Mechanics
Grammar/form/spelling/punctuation/ Logical flow/readability/APA format
3
Citations and references
2
Total Points
10
.
Please answer the question .There is no work count. PLEASE NUMBER .docx
Please answer the question .There is no work count. PLEASE NUMBER THE ANSWERS.
1-How does the value of individual freedom effect the ethics of our American society differently than the value of family and religious loyalty?
What are some other values of contemporary American society?
How are they in conflict with the values of the 1950's?
Is one set of values superior to another?
Why?
2-Islam means, at its root, surrender.
How does Islamic belief and practice reflect the importance of surrendering to Allah?
3-What do you think about this focus on prayer?
What is the standard of prayer in Judaism?
What about in Christianity?
What about in your own life?
Are you humbled and challenged by the knowledge that Muslims stop 5 times to pray?
4-Do you think the call to prayer is a call to obedience or a reminder for devotion?
5-Please answer this question and discuss the implications, probe for assumptions, draw out evidence and clarify perspectives.
What was the influence of Islam on the arts and sciences in its Golden Age, which is when Europe was experiencing the Medieval Period, sometimes called the Dark Ages?
6a- You mention the art form of mosaic (you called it "geometric pieces") and I want to draw the class' attention to the idea of unity in diversity within this art form.
First, the main theological point of Islam is that Allah is one.
As the Muslim scientists and artists searched to make discoveries in their given fields of study, they were constantly looking for the unity of Allah in the diversity of the creation.
The artist brought out that unity in mosaic and in textiles.
The mosaic is a pattern that is derived by putting thousands of small colored stones together to make one design.
The individual pieces of stone lose their importance within the whole, but without each piece the whole would not be complete.
So their concept of God came through in their art.
6b-How else did the Muslims bring out unity in diversity?
7a-Because they were prohibited from figures in art, the Muslims developed other art forms and calligraphy is one of those art forms.
They believed that the words of the Qur'an were beautiful (to hear and for life) so they started to write them in a beautiful way and thus calligraphy developed.
Art is one of those things that cannot be totally squelched.
If you contain an artist in one area, their emotion will burst forth in another area.
7b What do you think about the Muslims' use of calligraphy?
The Muslim religion started very rapidly.
8--Class, Based on the information about Muhammad and the early spread of Islam, what do you think was the most important factor in the amazing way that Islam grew so quickly?
.
Please answer the following questions. Please cite your references..docx
Please answer the following questions. Please cite your references.
According to Section I readings, Democracy: what it is and what it is not? (15 points) (See attached PDF)
Is the U.S. a democratic country? Has your view/opinion changed or unchanged now comparing to your answer at the beginning of the class? (15 points)
What does democracy mean to you personally? What will you do/participate/take action to ensure/protect your definition of democracy? (15 points)
Has the United States been a positive or negative influence on global democracy? (15 points)
Identify yourself as either a municipal, state or federal lawmaker, discuss your action/plan for democracy in the United States and her role as it pertains to the spread of democracy and democratic values throughout the world in the 21
st
Century. (40 points)
.
Please answer the following questions.1. 1. Are you or.docx
Please answer the following questions.
1.
1.
Are you or your immediate supervisor involved with staffing decisions?
If so, describe how staffing forecasts are prepared.
2.
2.
Does your organization use a flexible or a static budget?
Explain and provide examples.
Note: I work at a hospital as a psychiatric technician
.
Please answer the following question with 200-300 words.Q. Discu.docx
Please answer the following question with 200-300 words.
Q. Discuss why Hurston's assertions in "Characteristics of Negro Expression" would have been frowned upon by middle and upper class blacks.
Source:
Zora Neale Hurston -
"Characteristics of Negro Expression"
Please don't forget to include at least one quote from the passage.
.
Please answer the following question Why do you think the US ha.docx
Please answer the following question:
Why do you think the US has such a high homicide rate compared to other Western countries? What would you do to change that?
The paper needs to be 3-4 pages long, 12 point font, Times New Roman, and double spaced. The paper needs to be in
APA format. All sources must be cited.
Due on April 7, 2017 @ 12:30pm.
Anything after 12:30pm will not be accepted.
.
Please answer the following questions. Define tunneling in the V.docx
Please answer the following questions.
Define tunneling in the VPN environment and explain the difference between voluntary and compulsory tunnels.
How does the VPN technology provides security to a corporate network? You may also choose to compare two or more VPN technologies.
Consider the VPN technologies studied in this session, including IPSec in the Tunnel mode, L2TP over IPsec, PPTP and SSL/TLS VPN. Which one would you choose for your company? Can you discuss its advantages and its weakness or drawbacks? Do you know some products that are based on that technology?
Discuss the specific techniques for securing the remote client and the remote access server and the common concerns of each.
.
Please answer the following questions1. How can you stimulate the.docx
Please answer the following questions:
1. How can you stimulate the brain development of an infant?
2. How do parents cope with the growing autonomy of toddlers and what should be done about temper tantrums?
3. How do children in these stages of development change the life style of their parents?
Observation:
Have a conversation with the parent of a toddler. What are the differences of dealing with an infant and a toddler?
.
Please answer the following questions very deeply and presicely .docx
Please answer the following questions very deeply and presicely :
"Ziff"
!)
As Ziff define artwork, what do you think would consider as an artwork, and who do you think is capable of deciding if the work is art or not?
"Danto"
2) Why do you think Danto compares Socrates and Hamlet in the beginning? Do you feel as if it was an imitation of nature? How would you describe the word "art" with these two philosophers?
* The answer should be (4-8 sentences)
.
Please answer the following questions in an informal 1 ½ - 2-page es.docx
Please answer the following questions in an informal 1 ½ - 2-page essay:
Describe Hubert’s characterization of white society in New York City during the Harlem Renaissance.
What does this essay reveal about black culture in Harlem?
Why does Hubert describe the Harlem Renaissance as “the golden age for Negro writers, artists, and musicians?”
Black writer Alain Locke used the term “New Negro” to describe individuals such as Hubert. What did that mean?
Please conclude your essay with at least one question for discussion. Choose a question that you think will both enlighten and enliven your discussion section.
.
Please answer the following questions in a response of 150 to 200 wo.docx
Please answer the following questions in a response of 150 to 200 words each, and submit your responses in a Word attachment no later than Sunday of this week at 11:59 p.m. EST.
Discuss the reasons for the Iranian hostage crisis in 1979, and how that has impacted US-Iranian relations since.
Examine the motives of both the United States and the Soviet Union during the Cold War. Provide at least two examples in which these motives led to potential conflict between the two superpowers and/or their proxies (smaller nations in their respective spheres of influence).
Evaluate the assumption that the East European revolutions of 1989-90 that led to the breakup of the Warsaw Pact were a direct cause for the collapse of the Soviet Union. To what extent did these events influence the latter? Could the USSR have relinquished control of Eastern Europe yet remained intact?
.
Please answer these questions regarding the (TILA) Truth in Lending .docx
Please answer these questions regarding the (TILA) Truth in Lending Act.
1-Did the legislation or regulation solve the problem(s)? How?
2-Who were the major stakeholders?
The answers need to be complete, through and supported by evidence.
The length should as much as needed to answer the questions but not less than three quarters of a page for each question.
.
Please answer the following question pertaining to psychology. Inc.docx
Please answer the following question pertaining to psychology.
Include references/cites
at least 175 words each question.
1. 12
Despite much effort, a definition of personality has been elusive. Why do you think this is the case? How does this influence the relationship between personality theory and personality assessment?
13
What are the differences in test construction between the Minnesota Multiphasic Personality Inventory (MMPI) and the NEO Personality Inventory? Which do you think is more valid? Explain your responses.
16
How are assessments used in the workplace? How can assessments be misused in the workplace?
Analyze the relationship between the major theories of personality and assessments of personality.
Evaluate the strengths and weaknesses of personality assessment methods.
Describe the application of psychological assessments in the workplace.
.
Please answer the following questions in a response of 250 to 300 .docx
Please answer the following questions in a response of
250 to 300 words each
, and submit your responses in a Word attachment no later than Sunday of this week at 11:59 p.m. EST.
Identify the causes, key battles, and outcome of World War II in both Europe and the Pacific.
Identify the causes of the Cold War, and explain whether you think the Cold War was inevitable or not following World War II. How did the conflict between communist and non-communist powers manifest in China and Korea?
Pollard, E., Rosenberg, C., & Tignor, R. (2015). Worlds Together Worlds Apart. From 1000 CE to the Present (1st ed., Vol. 2). New York, NY: W.W. Norton & Company.
.
Please answer the three questions completly. I have attached the que.docx
Please answer the three questions completly. I have attached the questions in excel where they need to be answered.
1)
XYZ Company had three defined benefit plans with the following information:
12 Points
Plan 1
Plan 2
Plan 3
Expected Payment over next year
3,500,000
3,500,000
3,500,000
Fair Value of Plan Assets
5,000,000
6,000,000
3,000,000
Projected Benefit Obligation
7,000,000
5,500,000
4,500,000
Record the over/(under) funded status of each plan. Then determine the balance sheet presentation based on the over/(under) funded status. (Input an amount in each yellow cell. If zero, input zero.)
Plan 1
Plan 2
Plan 3
Over/ (Under) Funded Status
Noncurrent Asset
Current Liability**
Noncurrent Liability
** Think about the expected payment over the next year compared to the Plan Assets available.
2)
XYZ Company received the following information from its actuary team for the
10 points
year pertaining to one of its defined benefit plans:
Service Cost
120,000
Interest on Projected Benefit Obligation
55,000
Expected Return on Plan Assets
30,000
Amortization of Prior Service Cost
15,000
Amortization of Actuarial Gain
10,000
Calculate the Pension Expense for the year (show all items included in the calculation):
3)
At the end of year, XYZ Corporation had the following pension related information in addition to the above information:
12 points
12/31/X1
12/31/X2
Fair Value of Plan Assets
405,000
505,000
Projected Benefit Obligation
1,065,000
1,035,000
Funded Status
(660,000)
(530,000)
Record the Necessary Journal Entries:
Entry to record Service Cost, Interest Cost and Return on Plan Assets:
Account Name:
Debit
Credit
Amortization of Prior Service Cost and/or Actuarial Losses:
Account Name:
Debit
Credit
Amortization of Actuarial Gains:
Account Name:
Debit
Credit
4)
a) Identify a US Company that offers a Defined Benefit Plan and review the 10K information for 2016 of the identified company and provide a brief analysis based on footnotes related to the plan.
3 points
b) Include screenshots to report the Funded Status and Pension Expense information for the selected plan.
1 Points
c) Record the associated journal entries based on the screenshots for that company.
12 points
Entry to record Service Cost, Interest Cost and Return on Plan Assets:
Account Name:
Debit
Credit
Amortization of Prior Serv.
More from ajoy21 (20)
Please complete the assignment listed below.Define and explain, us.docx
Please complete the assignment listed below.Define and explain, us.docx
Please cite sources for each question. Do not use the same sources f.docx
Please cite sources for each question. Do not use the same sources f.docx
Please choose one of the following questions to answer for this week.docx
Please choose one of the following questions to answer for this week.docx
Please check the attachment for my paper.Please add citations to a.docx
Please check the attachment for my paper.Please add citations to a.docx
Please answer to this discussion post. No less than 150 words. Refer.docx
Please answer to this discussion post. No less than 150 words. Refer.docx
Please attach Non-nursing theorist summaries.JigsawExecutive .docx
Please attach Non-nursing theorist summaries.JigsawExecutive .docx
Please answer the question .There is no work count. PLEASE NUMBER .docx
Please answer the question .There is no work count. PLEASE NUMBER .docx
Please answer the following questions. Please cite your references..docx
Please answer the following questions. Please cite your references..docx
Please answer the following questions.1. 1. Are you or.docx
Please answer the following questions.1. 1. Are you or.docx
Please answer the following question with 200-300 words.Q. Discu.docx
Please answer the following question with 200-300 words.Q. Discu.docx
Please answer the following question Why do you think the US ha.docx
Please answer the following question Why do you think the US ha.docx
Please answer the following questions. Define tunneling in the V.docx
Please answer the following questions. Define tunneling in the V.docx
Please answer the following questions1. How can you stimulate the.docx
Please answer the following questions1. How can you stimulate the.docx
Please answer the following questions very deeply and presicely .docx
Please answer the following questions very deeply and presicely .docx
Please answer the following questions in an informal 1 ½ - 2-page es.docx
Please answer the following questions in an informal 1 ½ - 2-page es.docx
Please answer the following questions in a response of 150 to 200 wo.docx
Please answer the following questions in a response of 150 to 200 wo.docx
Please answer these questions regarding the (TILA) Truth in Lending .docx
Please answer these questions regarding the (TILA) Truth in Lending .docx
Please answer the following question pertaining to psychology. Inc.docx
Please answer the following question pertaining to psychology. Inc.docx
Please answer the following questions in a response of 250 to 300 .docx
Please answer the following questions in a response of 250 to 300 .docx
Please answer the three questions completly. I have attached the que.docx
Please answer the three questions completly. I have attached the que.docx
Recently uploaded
How to Fix the Import Error in the Odoo 17
An import error occurs when a program fails to import a module or library, disrupting its execution. In languages like Python, this issue arises when the specified module cannot be found or accessed, hindering the program's functionality. Resolving import errors is crucial for maintaining smooth software operation and uninterrupted development processes.
How to Add Chatter in the odoo 17 ERP Module
In Odoo, the chatter is like a chat tool that helps you work together on records. You can leave notes and track things, making it easier to talk with your team and partners. Inside chatter, all communication history, activity, and changes will be displayed.
LAND USE LAND COVER AND NDVI OF MIRZAPUR DISTRICT, UP
This Dissertation explores the particular circumstances of Mirzapur, a region located in the
core of India. Mirzapur, with its varied terrains and abundant biodiversity, offers an optimal
environment for investigating the changes in vegetation cover dynamics. Our study utilizes
advanced technologies such as GIS (Geographic Information Systems) and Remote sensing to
analyze the transformations that have taken place over the course of a decade.
The complex relationship between human activities and the environment has been the focus
of extensive research and worry. As the global community grapples with swift urbanization,
population expansion, and economic progress, the effects on natural ecosystems are becoming
more evident. A crucial element of this impact is the alteration of vegetation cover, which plays a
significant role in maintaining the ecological equilibrium of our planet.Land serves as the foundation for all human activities and provides the necessary materials for
these activities. As the most crucial natural resource, its utilization by humans results in different
'Land uses,' which are determined by both human activities and the physical characteristics of the
land.
The utilization of land is impacted by human needs and environmental factors. In countries
like India, rapid population growth and the emphasis on extensive resource exploitation can lead
to significant land degradation, adversely affecting the region's land cover.
Therefore, human intervention has significantly influenced land use patterns over many
centuries, evolving its structure over time and space. In the present era, these changes have
accelerated due to factors such as agriculture and urbanization. Information regarding land use and
cover is essential for various planning and management tasks related to the Earth's surface,
providing crucial environmental data for scientific, resource management, policy purposes, and
diverse human activities.
Accurate understanding of land use and cover is imperative for the development planning
of any area. Consequently, a wide range of professionals, including earth system scientists, land
and water managers, and urban planners, are interested in obtaining data on land use and cover
changes, conversion trends, and other related patterns. The spatial dimensions of land use and
cover support policymakers and scientists in making well-informed decisions, as alterations in
these patterns indicate shifts in economic and social conditions. Monitoring such changes with the
help of Advanced technologies like Remote Sensing and Geographic Information Systems is
crucial for coordinated efforts across different administrative levels. Advanced technologies like
Remote Sensing and Geographic Information Systems
9
Changes in vegetation cover refer to variations in the distribution, composition, and overall
structure of plant communities across different temporal and spatial scales. These changes can
occur natural.
How to Setup Warehouse & Location in Odoo 17 Inventory
In this slide, we'll explore how to set up warehouses and locations in Odoo 17 Inventory. This will help us manage our stock effectively, track inventory levels, and streamline warehouse operations.
Advanced Java[Extra Concepts, Not Difficult].docx
This is part 2 of my Java Learning Journey. This contains Hashing, ArrayList, LinkedList, Date and Time Classes, Calendar Class and more.
Digital Artifact 1 - 10VCD Environments Unit
Digital Artifact 1 - 10VCD Environments Unit - NGV Pavilion Concept Design
Your Skill Boost Masterclass: Strategies for Effective Upskilling
Your Skill Boost Masterclass: Strategies for Effective UpskillingExcellence Foundation for South Sudan
Strategies for Effective Upskilling is a presentation by Chinwendu Peace in a Your Skill Boost Masterclass organisation by the Excellence Foundation for South Sudan on 08th and 09th June 2024 from 1 PM to 3 PM on each day.Natural birth techniques - Mrs.Akanksha Trivedi Rama University
Natural birth techniques - Mrs.Akanksha Trivedi Rama UniversityAkanksha trivedi rama nursing college kanpur.
Natural birth techniques are various type such as/ water birth , alexender method, hypnosis, bradley method, lamaze method etcBBR 2024 Summer Sessions Interview Training
Qualitative research interview training by Professor Katrina Pritchard and Dr Helen Williams
RPMS TEMPLATE FOR SCHOOL YEAR 2023-2024 FOR TEACHER 1 TO TEACHER 3
RPMS Template 2023-2024 by: Irene S. Rueco
Exploiting Artificial Intelligence for Empowering Researchers and Faculty, In...
Exploiting Artificial Intelligence for Empowering Researchers and Faculty, In...Dr. Vinod Kumar Kanvaria
Exploiting Artificial Intelligence for Empowering Researchers and Faculty,
International FDP on Fundamentals of Research in Social Sciences
at Integral University, Lucknow, 06.06.2024
By Dr. Vinod Kumar KanvariaDRUGS AND ITS classification slide share
Any substance (other than food) that is used to prevent, diagnose, treat, or relieve symptoms of a
disease or abnormal condition
Pollock and Snow "DEIA in the Scholarly Landscape, Session One: Setting Expec...
Pollock and Snow "DEIA in the Scholarly Landscape, Session One: Setting Expec...National Information Standards Organization (NISO)
This presentation was provided by Steph Pollock of The American Psychological Association’s Journals Program, and Damita Snow, of The American Society of Civil Engineers (ASCE), for the initial session of NISO's 2024 Training Series "DEIA in the Scholarly Landscape." Session One: 'Setting Expectations: a DEIA Primer,' was held June 6, 2024.Pengantar Penggunaan Flutter - Dart programming language1.pptx
Pengantar Penggunaan Flutter - Dart programming language1.pptx
South African Journal of Science: Writing with integrity workshop (2024)
South African Journal of Science: Writing with integrity workshop (2024)Academy of Science of South Africa
A workshop hosted by the South African Journal of Science aimed at postgraduate students and early career researchers with little or no experience in writing and publishing journal articles.Recently uploaded (20)
Pride Month Slides 2024 David Douglas School District
Pride Month Slides 2024 David Douglas School District
LAND USE LAND COVER AND NDVI OF MIRZAPUR DISTRICT, UP
LAND USE LAND COVER AND NDVI OF MIRZAPUR DISTRICT, UP
How to Setup Warehouse & Location in Odoo 17 Inventory
How to Setup Warehouse & Location in Odoo 17 Inventory
Your Skill Boost Masterclass: Strategies for Effective Upskilling
Your Skill Boost Masterclass: Strategies for Effective Upskilling
Natural birth techniques - Mrs.Akanksha Trivedi Rama University
Natural birth techniques - Mrs.Akanksha Trivedi Rama University
RPMS TEMPLATE FOR SCHOOL YEAR 2023-2024 FOR TEACHER 1 TO TEACHER 3
RPMS TEMPLATE FOR SCHOOL YEAR 2023-2024 FOR TEACHER 1 TO TEACHER 3
Exploiting Artificial Intelligence for Empowering Researchers and Faculty, In...
Exploiting Artificial Intelligence for Empowering Researchers and Faculty, In...
Pollock and Snow "DEIA in the Scholarly Landscape, Session One: Setting Expec...
Pollock and Snow "DEIA in the Scholarly Landscape, Session One: Setting Expec...
Pengantar Penggunaan Flutter - Dart programming language1.pptx
Pengantar Penggunaan Flutter - Dart programming language1.pptx
South African Journal of Science: Writing with integrity workshop (2024)
South African Journal of Science: Writing with integrity workshop (2024)
Liberal Approach to the Study of Indian Politics.pdf
Liberal Approach to the Study of Indian Politics.pdf
Complete the C++ program and implement the routines that are n.docx
- 1. // Complete the C++ program and implement the routines that are not implemented #include <iostream> #include <iomanip> #include <fstream> #include <string> #include <vector> using namespace std; class TreeStruct; class Tree; class Stack; class Queue; typedef TreeStruct* TreeStructPtr; typedef Tree* TreePtr; class Stack { private: vector<TreeStructPtr> s; public: void push(TreeStructPtr ptr) {s.insert(s.begin(), ptr);} TreeStructPtr pop(){ TreeStructPtr ptr = s[0]; s.erase(s.begin()); return ptr;} bool empty(){return (s.size()==0);} }; class Queue { private: vector<TreeStructPtr> q; public: void push(TreeStructPtr ptr) {q.push_back(ptr);} TreeStructPtr pop(){ TreeStructPtr ptr = q[0]; q.erase(q.begin()); return ptr;} bool empty(){return (q.size()==0);} }; class TreeStruct { public: int Number; TreeStructPtr Left; TreeStructPtr Right; }; class Tree { public: TreeStructPtr TreeRoot; Tree(); void InsertIntoTree(TreeStructPtr& Root, int num); int FindMaxLen(TreeStructPtr Root); int FindMinLen(TreeStructPtr Root); int CountNodes(TreeStructPtr Root); void Copy(TreeStructPtr Root1, TreeStructPtr& Root2); //copies one tree into another bool Search(TreeStructPtr Root, int n); void PrintInOrderTree(TreeStructPtr Root); void PrintPreOrderTree(TreeStructPtr Root); void PrintPostOrderTree(TreeStructPtr Root); void PrintPreOrderTreeWithStack(TreeStructPtr Root); void PrintBreadthFirstWithQueue(TreeStructPtr Root); }; // ---------- ------------------------------------------------------ // tree constructor Tree::Tree() { TreeRoot = NULL; } //---------------- ------------------------------------------------ void Copy(TreeStructPtr Root1, TreeStructPtr& Root2) //copies one tree into another { } //---------------------------------------------- ------------------ // Inserting into the tree using recursion void Tree::InsertIntoTree(TreeStructPtr& Root, int x) { } //---------- ------------------------------------------------------ int
- 2. Tree::FindMaxLen(TreeStructPtr Root) { return 0; } // ---- ------------------------------------------------------------ int Tree::FindMinLen(TreeStructPtr Root) { if (Root==NULL) return(0); else if (Root->Right==NULL) return(1+FindMinLen(Root->Left)); else if (Root- >Left==NULL) return(1+FindMinLen(Root->Right)); else { int CountLeft = 1 + FindMinLen(Root->Left); int CountRight = 1 + FindMinLen(Root->Right); if (CountLeft < CountRight) return(CountLeft); else return(CountRight); } } //------------------------- --------------------------------------- int Tree::CountNodes(TreeStructPtr Root) { return 0; } //----- ----------------------------------------------------------- bool Tree::Search(TreeStructPtr Root, int n) { return " "; } //- --------------------------------------------------------------- void Tree::PrintInOrderTree(TreeStructPtr Root) { } //----------------- ----------------------------------------------- void Tree::PrintPreOrderTree(TreeStructPtr Root) { } // ---------------- ------------------------------------------------ void Tree::PrintPostOrderTree(TreeStructPtr Root) { } //-------------- -------------------------------------------------- void Tree::PrintPreOrderTreeWithStack(TreeStructPtr Root) { Stack stk; TreeStructPtr p = Root; if (p != NULL) { stk.push(p); while (!stk.empty()) { p = stk.pop(); cout << p->Number << "-->"; if (p->Right != NULL) stk.push(p->Right); if (p->Left != NULL) stk.push(p->Left); } } } //------------------------------------------------------------ ---- void Tree::PrintBreadthFirstWithQueue(TreeStructPtr Root) { } //---------------------------------------------------------------- void main() { Tree t; t.InsertIntoTree(t.TreeRoot, 15); t.InsertIntoTree(t.TreeRoot, 20); t.InsertIntoTree(t.TreeRoot, 10); t.InsertIntoTree(t.TreeRoot, 8); t.InsertIntoTree(t.TreeRoot, 9); t.InsertIntoTree(t.TreeRoot, 17); t.InsertIntoTree(t.TreeRoot, 21);
- 3. t.InsertIntoTree(t.TreeRoot, 22); t.InsertIntoTree(t.TreeRoot, 23); t.InsertIntoTree(t.TreeRoot, 24); t.InsertIntoTree(t.TreeRoot, 25); t.InsertIntoTree(t.TreeRoot, 26); t.InsertIntoTree(t.TreeRoot, 11); cout << " Printing Pre Order " << endl; t.PrintPreOrderTree(t.TreeRoot); cout << " -----------------------------------------------" << endl; getchar(); cout << "Printing Post Order " << endl; t.PrintPostOrderTree(t.TreeRoot); cout << " -------------------- ---------------------------" << endl; getchar(); cout << "Printing In Order " << endl; t.PrintInOrderTree(t.TreeRoot); cout << " -----------------------------------------------" << endl; getchar(); cout << boolalpha << endl << endl; cout << " Searching 30: " << t.Search(t.TreeRoot, 30) << endl; cout << " Searching 8: " << t.Search(t.TreeRoot, 8) << endl; cout << " Searching 10: " << t.Search(t.TreeRoot, 10) << endl; cout << "-------------------------------------------" << endl; getchar(); cout << "Printing Pre Order with Stack " << endl; t.PrintPreOrderTreeWithStack(t.TreeRoot); cout << " --------- --------------------------------------" << endl; getchar(); cout << "Printing level by level BreathFirst Traversal " << endl; t.PrintBreadthFirstWithQueue(t.TreeRoot); cout << " ---------- -------------------------------------" << endl; getchar(); cout << endl; int MaxLen = t.FindMaxLen(t.TreeRoot); int MinLen = t.FindMinLen(t.TreeRoot); int TotalNodes = t.CountNodes(t.TreeRoot); cout << "Max is " << MaxLen << endl; cout << "Min is " << MinLen << endl; cout << "Num of Nodes is " << TotalNodes << endl; cout << "----------------- ------------------------------" << endl; getchar(); Tree t2; Copy(t.TreeRoot, t2.TreeRoot); cout << "Printing In Order the copy of the tree" << endl; t2.PrintInOrderTree(t2.TreeRoot); cout << " -----------------------------------------------" << endl; } //---------------------------------------------------------------- /* Your output should look like the foolowing Printing Pre Order 15-->10-->8-->9-->11-->20-->17-->21-->22-->23-->24-->25-- >26--> ----------------------------------------------- Printing Post Order 9-->8-->11-->10-->17-->26-->25-->24-->23-->22-->21--
- 4. >20-->15--> ----------------------------------------------- Printing In Order 8-->9-->10-->11-->15-->17-->20-->21-->22-->23-- >24-->25-->26--> ----------------------------------------------- Searching 30: false Searching 8: true Searching 10: true ------- ------------------------------------ Printing Pre Order with Stack 15-->10-->8-->9-->11-->20-->17-->21-->22-->23-->24-->25-- >26--> ----------------------------------------------- Printing level by level BreathFirst Traversal 15-->10-->20-->8-->11-->17-- >21-->9-->22-->23-->24-->25-->26--> ----------------------------- ------------------ Max is 8 Min is 3 Num of Nodes is 13 --------- -------------------------------------- Printing In Order the copy of the tree 8-->9-->10-->11-->15-->17-->20-->21-->22-->23-->24- ->25-->26--> ----------------------------------------------- Press any key to continue */ Solution Implemented the following 4 functions void Tree::InsertIntoTree(TreeStructPtr& Root, int x) { if (Root == NULL) { TreeStructPtr node = new TreeStruct(); node->Number = x; node->Left = NULL; node->Right = NULL; Root = node; } else {
- 5. if (x <= Root->Number) { if (Root->Left != NULL) InsertIntoTree(Root->Left, x); else { TreeStructPtr node = new TreeStruct(); node->Number = x; node->Left = NULL; node->Right = NULL; Root->Left = node; } } else { if (Root->Right != NULL) InsertIntoTree(Root->Right, x); else { TreeStructPtr node = new TreeStruct(); node->Number = x; node->Left = NULL; node->Right = NULL; Root->Right = node; } } } } //---------------------------------------------------------------- void Tree::PrintInOrderTree(TreeStructPtr Root) {
- 6. if (Root != NULL) { PrintInOrderTree(Root->Left); cout << Root->Number << "->"; PrintInOrderTree(Root->Right); } } //---------------------------------------------------------------- void Tree::PrintPreOrderTree(TreeStructPtr Root) { if (Root != NULL) { cout << Root->Number << "->"; PrintPreOrderTree(Root->Left); PrintPreOrderTree(Root->Right); } } //---------------------------------------------------------------- void Tree::PrintPostOrderTree(TreeStructPtr Root) { if (Root != NULL) { PrintPostOrderTree(Root->Left); PrintPostOrderTree(Root->Right); cout << Root->Number << "->"; } } --output with your main code for these 4 methods---------------
- 7. Printing Pre Order 15->10->8->9->11->20->17->21->22->23->24->25->26-> Printing Post Order 9->8->11->10->17->26->25->24->23->22->21->20->15-> Printing In Order 8->9->10->11->15->17->20->21->22->23->24->25->26->