Help implement BST- The code must follow the instruction below as well.pdf
•
0 likes•6 views
Help implement BST. The code must follow the instruction below as well as produce the correct output when testing with the input file I'll provide at the end. Please fill-in the TODO parts in the bst.cc code: INSTRUCTIONS: 3. First, implement the BST (declared in bst.h) and use the unittest_bst() function to test it. DO NOT CHANGE THIS CODE FOR YOUR SUBMISSION, as it will be used to test your code against the answers (with different seed values). 4. Implement the DB and use the unittest_db() function to test it. DO NOT CHANGE THIS CODE FOR YOUR SUBMISSION, as it will be used to test your code against the answers (with different input files). a) The student ID should be the base class's key member. b) The student ID should be automatically assigned such that the ID/key should be n if the student is the nth student to join the school. If the student later leaves (i.e., deleted from the BST), the ID does NOT get reassigned to another student. Thus, the student ID of the last student to join the school should reflect the TOTAL number of students that have joined this school since its reception (regardless of whether some have left). 5. Test your code against the provided input and output files. a) The provided answer for the BST unit test is in "unittest_ans_t100_s100.txt". The s100 refers to the seed of 100 (-s 100), and t100 refers to the number of elements to add to the BST (-t 100). b) The provided answer for the DB is in "students_1_ans.txt" for the "students_1.txt" input file. 6. Make sure your code has no memory leaks (using valgrind). 7. Your code should work beyond the provided unit tests. That is, even if it does work for all the given tests, if the code has an identifiable bug (i.e., by reading the source code), points WILL be deducted. For example, if I were to change unittest_bst(num_test, seed, cout, 5); -> unittest_bst(num_test, seed, cout, 100); it should still work. BST.H #ifndef BST_H_ #define BST_H_ #include <iostream> using namespace std; class Node { private: int key; Node* parent; Node* left; Node* right; public: // Default constructor Node(); // Constructor Node(int in); // Destructor // a virtual constructor is required for inheritance virtual ~Node(); // Add to parent of current node void add_parent(Node* in); // Add to left of current node void add_left(Node* in); // Add to right of current node void add_right(Node* in); // Get key int get_key(); // Get parent node Node* get_parent(); // Get left node Node* get_left(); // Get right node Node* get_right(); virtual void print_info(ostream& to); }; class BST { private: Node* root; // Walk the subtree from the given node void inorder_walk(Node* in, ostream& to); // Get the minimum node from the subtree of given node Node* get_min(Node* in); // Get the maximum node from the subtree of given node Node* get_max(Node* in); public: // Constructor and Destructor BST(); ~BST(); // Modify tree void insert_node(Node* in); void delete_node(Node* out); // Find nodes in the tree Node* t.
Report
Share
Report
Share
Download to read offline
Recommended
Complete DB code following the instructions Implement the D.pdf
Complete DB code following the instructions:
Implement the DB and use the unittest_db() function to test it. DO NOT CHANGE THIS CODE
FOR YOUR SUBMISSION, as it will be used to test your code against the answers (with different
input files).
a) The student ID should be the base class's key member.
b) The student ID should be automatically assigned such that the ID/key should be n if the student
is the nth student to join the school. If the student later leaves (i.e., deleted from the BST), the ID
does NOT get reassigned to another student. Thus, the student ID of the last student to join the
school should reflect the TOTAL number of students that have joined this school since its
reception (regardless of whether some have left).
5. Test your code against the provided input and output files.
a) The provided answer for the BST unit test is in "unittest_ans_t100_s100.txt". The s100 refers to
the seed of 100 (-s 100), and t100 refers to the number of elements to add to the BST (-t 100).
b) The provided answer for the DB is in "students_1_ans.txt" for the "students_1.txt" input file.
6. Make sure your code has no memory leaks (using valgrind).
7. Your code should work beyond the provided unit tests. That is, even if it does work for all the
given tests, if the code has an identifiable bug (i.e., by reading the source code), points WILL be
deducted.
For example, if I were to change
unittest_bst(num_test, seed, cout, 5); ->
unittest_bst(num_test, seed, cout, 100);
it should still work.
db.h
#ifndef DB_H_
#define DB_H_
#include <iostream>
#include "bst.h"
using namespace std;
class SNode : public Node {
private:
string first;
string last;
unsigned int age;
static unsigned int num_students;
public:
// Constructors and destructor
SNode();
SNode(string f_, string l_, unsigned int a_);
~SNode();
// public interface
void change_first(string f_);
void change_last(string l_);
string get_first();
string get_last();
unsigned int get_age();
void print_info(ostream& to);
};
#endif
main.cc
#include <iostream>
#include <fstream>
#include <string>
#include <sstream>
#include <vector>
#include <algorithm>
#include <getopt.h>
#include "bst.h"
#include "db.h"
using namespace std;
const char* const short_opt = ":ht:s:i:o:";
const struct option long_opt[] = {
{"help", 0, NULL, 'h'},
{"test", 1, NULL, 't'},
{"seed", 1, NULL, 's'},
{"input", 1, NULL, 'i'},
{"output", 1, NULL, 'o'},
{NULL, 0, NULL, 0}
};
void usage(char* argv);
void unittest_bst(unsigned int n, unsigned int seed, ostream& to,
unsigned int remain);
bool read_db(const string file_name, vector<string>& firsts,
vector<string>& lasts, vector<unsigned int>& ages);
void create_db(BST& db, const vector<string> f_, const vector<string> l_,
const vector<unsigned int> a_);
bool unittest_db(string ifile_name, string ofile_name);
/* Main function
*/
int main(int argc, char **argv)
{
int c = 0;
string test = "0";
string seed_str = "0";
string ifile_name;
string ofile_name;
if(argc < 2) {
usage(argv[0]);
return 0;
}
whil.
Help to implement delete_node get_succ get_pred walk and.pdf
Help to implement delete_node, get_succ, get_pred, walk, and tree_search in the script
following the given structure:
#include "bst.h"
// ---------------------------------------
// Node class
// Default constructor
Node::Node() {
// TODO: Implement this
key = 0;
parent = nullptr;
left = nullptr;
right = nullptr;
}
// Constructor
Node::Node(int in) {
// TODO: Implement this
key = in;
parent = nullptr;
left = nullptr;
right = nullptr;
}
// Destructor
Node::~Node() {
// TODO: Implement this
delete left;
delete right;
}
// Add parent
void Node::add_parent(Node* in) {
// TODO: Implement this
parent = in;
}
// Add to left of current node
void Node::add_left(Node* in) {
// TODO: Implement this
left = in;
if (in != nullptr) {
in->add_parent(this);
}
}
// Add to right of current node
void Node::add_right(Node* in) {
// TODO: Implement this
right = in;
if (in != nullptr) {
in->add_parent(this);
}
}
// Get key
int Node::get_key()
{
// TODO: Implement this
return key;
}
// Get parent node
Node* Node::get_parent()
{
// TODO: Implement this
return parent;
}
// Get left node
Node* Node::get_left()
{
// TODO: Implement this
return left;
}
// Get right node
Node* Node::get_right()
{
// TODO: Implement this
return right;
}
// Print the key to ostream to
// Do not change this
void Node::print_info(ostream& to)
{
to << key << endl;
}
// ---------------------------------------
// ---------------------------------------
// BST class
// Walk the subtree from the given node
void BST::inorder_walk(Node* in, ostream& to)
{
// TODO: Implement this
if (in != nullptr) {
inorder_walk(in->get_left(), to);
in->print_info(to);
inorder_walk(in->get_right(), to);
}
}
// Constructor
BST::BST()
{
// TODO: Implement this
root = nullptr;
}
// Destructor
BST::~BST()
{
// TODO: Implement this
delete root;
}
// Insert a node to the subtree
void BST::insert_node(Node* in)
{
// TODO: Implement this
Node* curr = root;
Node* par = nullptr;
while (curr != nullptr) {
par = curr;
if (in->get_key() < curr->get_key()) {
curr = curr->get_left();
} else {
curr = curr->get_right();
}
}
in->add_parent(par);
if (par == nullptr) {
root = in;
} else if (in->get_key() < par->get_key()) {
par->add_left(in);
} else {
par->add_right(in);
}
}
// Delete a node to the subtree
void BST::delete_node(Node* out)
{
// TODO: Implement this
}
// minimum key in the BST
Node* BST::tree_min()
{
// TODO: Implement this
return get_min(root);
}
// maximum key in the BST
Node* BST::tree_max()
{
// TODO: Implement this
return get_max(root);
}
// Get the minimum node from the subtree of given node
Node* BST::get_min(Node* in)
{
// TODO: Implement this
if (in == nullptr) {
return nullptr;
}
while (in->get_left() != nullptr) {
in = in->get_left();
}
return in;
}
// Get the maximum node from the subtree of given node
Node* BST::get_max(Node* in)
{
// TODO: Implement this
if (in == nullptr) {
return nullptr;
}
while (in->get_right() != nullptr) {
in = in->get_right();
}
return in;
}
// Get successor of the given node
Node* BS.
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.
Recursion to iteration automation.
A class that automates conversion from a C++ recursive function to an iterative function. It allow the recursive function to preserve its structure by reproducing the "call stack" on an std::stack. The examples use combinatorics to illustrate usage.
Imugi: Compiler made with Python
[PyConKR 2018] Imugi: Compiler made with Python.
https://www.pycon.kr/2018/program/2/
GitHub: https://github.com/hahnlee/imugi
C Assignment Help
I am Bernard. I am a C Assignment Expert at programminghomeworkhelp.com. I hold a Ph.D. in Programming from, University of Leeds, UK. I have been helping students with their homework for the past 9 years. I solve assignments related to C Programming.
Visit programminghomeworkhelp.com or email support@programminghomeworkhelp.com. You can also call on +1 678 648 4277 for any assistance with C Programming Assignments.
Assg 12 Binary Search Trees COSC 2336assg-12.cppAssg 12 Binary .docx
Assg 12 Binary Search Trees COSC 2336/assg-12.cppAssg 12 Binary Search Trees COSC 2336/assg-12.cpp/**
* @author Jane Programmer
* @cwid 123 45 678
* @class COSC 2336, Spring 2019
* @ide Visual Studio Community 2017
* @date April 8, 2019
* @assg Assignment 12
*
* @description Assignment 12 Binary Search Trees
*/
#include<cassert>
#include<iostream>
#include"BinaryTree.hpp"
usingnamespace std;
/** main
* The main entry point for this program. Execution of this program
* will begin with this main function.
*
* @param argc The command line argument count which is the number of
* command line arguments provided by user when they started
* the program.
* @param argv The command line arguments, an array of character
* arrays.
*
* @returns An int value indicating program exit status. Usually 0
* is returned to indicate normal exit and a non-zero value
* is returned to indicate an error condition.
*/
int main(int argc,char** argv)
{
// -----------------------------------------------------------------------
cout <<"--------------- testing BinaryTree construction ----------------"<< endl;
BinaryTree t;
cout <<"<constructor> Size of new empty tree: "<< t.size()<< endl;
cout << t << endl;
assert(t.size()==0);
cout << endl;
// -----------------------------------------------------------------------
cout <<"--------------- testing BinaryTree insertion -------------------"<< endl;
//t.insert(10);
//cout << "<insert> Inserted into empty tree, size: " << t.size() << endl;
//cout << t << endl;
//assert(t.size() == 1);
//t.insert(3);
//t.insert(7);
//t.insert(12);
//t.insert(15);
//t.insert(2);
//cout << "<insert> inserted 5 more items, size: " << t.size() << endl;
//cout << t << endl;
//assert(t.size() == 6);
cout << endl;
// -----------------------------------------------------------------------
cout <<"--------------- testing BinaryTree height -------------------"<< endl;
//cout << "<height> Current tree height: " << t.height() << endl;
//assert(t.height() == 3);
// increase height by 2
//t.insert(4);
//t.insert(5);
//cout << "<height> after inserting nodes, height: " << t.height()
// << " size: " << t.size() << endl;
//cout << t << endl;
//assert(t.height() == 5);
//assert(t.size() == 8);
cout << endl;
// -----------------------------------------------------------------------
cout <<"--------------- testing BinaryTree clear -------------------"<< endl;
//t.clear();
//cout << "<clear> after clearing tree, height: " << t.height()
// << " size: " << t.size() << endl;
//cout << t << endl;
//assert(t.size() == 0);
//assert(t.height() == 0);
cout << endl;
// return 0 to indicate successful completion
return0;
}
Assg 12 Binary Search Trees COSC 2336/assg-12.pdf
Assg 12: Binary Search Trees
COSC 2336 Spring 2019
April 10, 2019
Dates:
Due: Sunday April 21, by Midnight
Objectives
� Practice recursive algorithms
� Learn how to construct a binary tree usi ...
1)(JAVA) Extend the Binary Search Tree ADT to include a public metho.pdf
The document extends a Binary Search Tree (BST) interface to include a new public method called leafCount that returns the number of leaf nodes in the tree. It also provides the BinarySearchTree and BSTInterface files that implement the BST with methods for common operations like adding and removing nodes, and traversing the tree in different orders.
Recommended
Complete DB code following the instructions Implement the D.pdf
Complete DB code following the instructions:
Implement the DB and use the unittest_db() function to test it. DO NOT CHANGE THIS CODE
FOR YOUR SUBMISSION, as it will be used to test your code against the answers (with different
input files).
a) The student ID should be the base class's key member.
b) The student ID should be automatically assigned such that the ID/key should be n if the student
is the nth student to join the school. If the student later leaves (i.e., deleted from the BST), the ID
does NOT get reassigned to another student. Thus, the student ID of the last student to join the
school should reflect the TOTAL number of students that have joined this school since its
reception (regardless of whether some have left).
5. Test your code against the provided input and output files.
a) The provided answer for the BST unit test is in "unittest_ans_t100_s100.txt". The s100 refers to
the seed of 100 (-s 100), and t100 refers to the number of elements to add to the BST (-t 100).
b) The provided answer for the DB is in "students_1_ans.txt" for the "students_1.txt" input file.
6. Make sure your code has no memory leaks (using valgrind).
7. Your code should work beyond the provided unit tests. That is, even if it does work for all the
given tests, if the code has an identifiable bug (i.e., by reading the source code), points WILL be
deducted.
For example, if I were to change
unittest_bst(num_test, seed, cout, 5); ->
unittest_bst(num_test, seed, cout, 100);
it should still work.
db.h
#ifndef DB_H_
#define DB_H_
#include <iostream>
#include "bst.h"
using namespace std;
class SNode : public Node {
private:
string first;
string last;
unsigned int age;
static unsigned int num_students;
public:
// Constructors and destructor
SNode();
SNode(string f_, string l_, unsigned int a_);
~SNode();
// public interface
void change_first(string f_);
void change_last(string l_);
string get_first();
string get_last();
unsigned int get_age();
void print_info(ostream& to);
};
#endif
main.cc
#include <iostream>
#include <fstream>
#include <string>
#include <sstream>
#include <vector>
#include <algorithm>
#include <getopt.h>
#include "bst.h"
#include "db.h"
using namespace std;
const char* const short_opt = ":ht:s:i:o:";
const struct option long_opt[] = {
{"help", 0, NULL, 'h'},
{"test", 1, NULL, 't'},
{"seed", 1, NULL, 's'},
{"input", 1, NULL, 'i'},
{"output", 1, NULL, 'o'},
{NULL, 0, NULL, 0}
};
void usage(char* argv);
void unittest_bst(unsigned int n, unsigned int seed, ostream& to,
unsigned int remain);
bool read_db(const string file_name, vector<string>& firsts,
vector<string>& lasts, vector<unsigned int>& ages);
void create_db(BST& db, const vector<string> f_, const vector<string> l_,
const vector<unsigned int> a_);
bool unittest_db(string ifile_name, string ofile_name);
/* Main function
*/
int main(int argc, char **argv)
{
int c = 0;
string test = "0";
string seed_str = "0";
string ifile_name;
string ofile_name;
if(argc < 2) {
usage(argv[0]);
return 0;
}
whil.
Help to implement delete_node get_succ get_pred walk and.pdf
Help to implement delete_node, get_succ, get_pred, walk, and tree_search in the script
following the given structure:
#include "bst.h"
// ---------------------------------------
// Node class
// Default constructor
Node::Node() {
// TODO: Implement this
key = 0;
parent = nullptr;
left = nullptr;
right = nullptr;
}
// Constructor
Node::Node(int in) {
// TODO: Implement this
key = in;
parent = nullptr;
left = nullptr;
right = nullptr;
}
// Destructor
Node::~Node() {
// TODO: Implement this
delete left;
delete right;
}
// Add parent
void Node::add_parent(Node* in) {
// TODO: Implement this
parent = in;
}
// Add to left of current node
void Node::add_left(Node* in) {
// TODO: Implement this
left = in;
if (in != nullptr) {
in->add_parent(this);
}
}
// Add to right of current node
void Node::add_right(Node* in) {
// TODO: Implement this
right = in;
if (in != nullptr) {
in->add_parent(this);
}
}
// Get key
int Node::get_key()
{
// TODO: Implement this
return key;
}
// Get parent node
Node* Node::get_parent()
{
// TODO: Implement this
return parent;
}
// Get left node
Node* Node::get_left()
{
// TODO: Implement this
return left;
}
// Get right node
Node* Node::get_right()
{
// TODO: Implement this
return right;
}
// Print the key to ostream to
// Do not change this
void Node::print_info(ostream& to)
{
to << key << endl;
}
// ---------------------------------------
// ---------------------------------------
// BST class
// Walk the subtree from the given node
void BST::inorder_walk(Node* in, ostream& to)
{
// TODO: Implement this
if (in != nullptr) {
inorder_walk(in->get_left(), to);
in->print_info(to);
inorder_walk(in->get_right(), to);
}
}
// Constructor
BST::BST()
{
// TODO: Implement this
root = nullptr;
}
// Destructor
BST::~BST()
{
// TODO: Implement this
delete root;
}
// Insert a node to the subtree
void BST::insert_node(Node* in)
{
// TODO: Implement this
Node* curr = root;
Node* par = nullptr;
while (curr != nullptr) {
par = curr;
if (in->get_key() < curr->get_key()) {
curr = curr->get_left();
} else {
curr = curr->get_right();
}
}
in->add_parent(par);
if (par == nullptr) {
root = in;
} else if (in->get_key() < par->get_key()) {
par->add_left(in);
} else {
par->add_right(in);
}
}
// Delete a node to the subtree
void BST::delete_node(Node* out)
{
// TODO: Implement this
}
// minimum key in the BST
Node* BST::tree_min()
{
// TODO: Implement this
return get_min(root);
}
// maximum key in the BST
Node* BST::tree_max()
{
// TODO: Implement this
return get_max(root);
}
// Get the minimum node from the subtree of given node
Node* BST::get_min(Node* in)
{
// TODO: Implement this
if (in == nullptr) {
return nullptr;
}
while (in->get_left() != nullptr) {
in = in->get_left();
}
return in;
}
// Get the maximum node from the subtree of given node
Node* BST::get_max(Node* in)
{
// TODO: Implement this
if (in == nullptr) {
return nullptr;
}
while (in->get_right() != nullptr) {
in = in->get_right();
}
return in;
}
// Get successor of the given node
Node* BS.
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.
Recursion to iteration automation.
A class that automates conversion from a C++ recursive function to an iterative function. It allow the recursive function to preserve its structure by reproducing the "call stack" on an std::stack. The examples use combinatorics to illustrate usage.
Imugi: Compiler made with Python
[PyConKR 2018] Imugi: Compiler made with Python.
https://www.pycon.kr/2018/program/2/
GitHub: https://github.com/hahnlee/imugi
C Assignment Help
I am Bernard. I am a C Assignment Expert at programminghomeworkhelp.com. I hold a Ph.D. in Programming from, University of Leeds, UK. I have been helping students with their homework for the past 9 years. I solve assignments related to C Programming.
Visit programminghomeworkhelp.com or email support@programminghomeworkhelp.com. You can also call on +1 678 648 4277 for any assistance with C Programming Assignments.
Assg 12 Binary Search Trees COSC 2336assg-12.cppAssg 12 Binary .docx
Assg 12 Binary Search Trees COSC 2336/assg-12.cppAssg 12 Binary Search Trees COSC 2336/assg-12.cpp/**
* @author Jane Programmer
* @cwid 123 45 678
* @class COSC 2336, Spring 2019
* @ide Visual Studio Community 2017
* @date April 8, 2019
* @assg Assignment 12
*
* @description Assignment 12 Binary Search Trees
*/
#include<cassert>
#include<iostream>
#include"BinaryTree.hpp"
usingnamespace std;
/** main
* The main entry point for this program. Execution of this program
* will begin with this main function.
*
* @param argc The command line argument count which is the number of
* command line arguments provided by user when they started
* the program.
* @param argv The command line arguments, an array of character
* arrays.
*
* @returns An int value indicating program exit status. Usually 0
* is returned to indicate normal exit and a non-zero value
* is returned to indicate an error condition.
*/
int main(int argc,char** argv)
{
// -----------------------------------------------------------------------
cout <<"--------------- testing BinaryTree construction ----------------"<< endl;
BinaryTree t;
cout <<"<constructor> Size of new empty tree: "<< t.size()<< endl;
cout << t << endl;
assert(t.size()==0);
cout << endl;
// -----------------------------------------------------------------------
cout <<"--------------- testing BinaryTree insertion -------------------"<< endl;
//t.insert(10);
//cout << "<insert> Inserted into empty tree, size: " << t.size() << endl;
//cout << t << endl;
//assert(t.size() == 1);
//t.insert(3);
//t.insert(7);
//t.insert(12);
//t.insert(15);
//t.insert(2);
//cout << "<insert> inserted 5 more items, size: " << t.size() << endl;
//cout << t << endl;
//assert(t.size() == 6);
cout << endl;
// -----------------------------------------------------------------------
cout <<"--------------- testing BinaryTree height -------------------"<< endl;
//cout << "<height> Current tree height: " << t.height() << endl;
//assert(t.height() == 3);
// increase height by 2
//t.insert(4);
//t.insert(5);
//cout << "<height> after inserting nodes, height: " << t.height()
// << " size: " << t.size() << endl;
//cout << t << endl;
//assert(t.height() == 5);
//assert(t.size() == 8);
cout << endl;
// -----------------------------------------------------------------------
cout <<"--------------- testing BinaryTree clear -------------------"<< endl;
//t.clear();
//cout << "<clear> after clearing tree, height: " << t.height()
// << " size: " << t.size() << endl;
//cout << t << endl;
//assert(t.size() == 0);
//assert(t.height() == 0);
cout << endl;
// return 0 to indicate successful completion
return0;
}
Assg 12 Binary Search Trees COSC 2336/assg-12.pdf
Assg 12: Binary Search Trees
COSC 2336 Spring 2019
April 10, 2019
Dates:
Due: Sunday April 21, by Midnight
Objectives
� Practice recursive algorithms
� Learn how to construct a binary tree usi ...
1)(JAVA) Extend the Binary Search Tree ADT to include a public metho.pdf
The document extends a Binary Search Tree (BST) interface to include a new public method called leafCount that returns the number of leaf nodes in the tree. It also provides the BinarySearchTree and BSTInterface files that implement the BST with methods for common operations like adding and removing nodes, and traversing the tree in different orders.
Data Structures and Agorithm: DS 14 Binary Expression Tree.pptx
Data Structures and Agorithm: DS 14 Binary Expression Tree.pptx
(Parent reference for BST) Redefine TreeNode by adding a reference to.pdf
(Parent reference for BST) Redefine TreeNode by adding a reference to a node\'s parent, as
shown below\': Reimplement the insert and delete methods in the BST class to update the parent
for each node in the tree. Add the following new method in BST:/** Returns the node for the
specified element. * Returns null if the element is not in the tree. */private TreeNode getNode(E
element)/** Returns true if the node for the element is a leaf */private boolean isLeaf(E
element)/** Returns the path of elements from the specified element * to the root in an array
list. */public ArrayList getPath(E e) Write a test program that prompts the user to enter 10
integers, adds them to the tree, deletes the first integer from the tree, and displays the paths for
all leaf nodes. Here is a sample run:
Solution
#include
#include
void swap(char *x, char *y)
{
char temp;
temp = *x;
*x = *y;
*y = temp;
void permute(char *a, int l, int r)
{
int i;
if (l == r)
printf(\"%s\ \", a);
else
{
for (i = l; i <= r; i++)
{
swap((a+l), (a+i));
permute(a, l+1, r);
swap((a+l), (a+i)); //backtrack
}
}
}
int main()
{
char str[] = \"ABC\";
int n = strlen(str);
permute(str, 0, n-1);
return 0;
}
part ii radix sort:
c++
#include
using namespace std;
int getMax(int arr[], int n)
{
int mx = arr[0];
for (int i = 1; i < n; i++)
if (arr[i] > mx)
mx = arr[i];
return main()
void countSort(int arr[], int n, int exp
for (i = 0; i < n; i++)
count[ (arr[i]/exp)%10 ]++;
for (i = 1; i < 10; i++)
count[i] += count[i - 1];
for (i = n - 1; i >= 0; i--)
{
output[count[ (arr[i]/exp)%10 ] - 1] = arr[i];
count[ (arr[i]/exp)%10 ]--;
}
for (i = 0; i < n; i++)
arr[i] = output[i];
}
adixsort(int arr[], int n)
{
int m = getMax(arr, n);
for (int exp = 1; m/exp > 0; exp *= 10)
countSort(arr, n, exp);
}
void print(int arr[], int n)
{
for (int i = 0; i < n; i++)
cout << arr[i] << \" \";
}
int main()
{
int arr[] = {170, 45, 75, 90, 802, 24, 2, 66};
int n = sizeof(arr)/sizeof(arr[0]);
radixsort(arr, n);
print(arr, n);
return 0;
}
java:
import java.io.*;
import java.util.*;
class Radix {
static int getMax(int arr[], int n)
{
int mx = arr[0];
for (int i = 1; i < n; i++)
if (arr[i] > mx)
mx = arr[i];
return mx;
}
static void countSort(int arr[], int n, int exp)
{
int output[] = new int[n]; // output array
int i;
int count[] = new int[10];
Arrays.fill(count,0);
for (i = 0; i < n; i++)
count[ (arr[i]/exp)%10 ]++;
for (i = 1; i < 10; i++)
count[i] += count[i - 1];
for (i = n - 1; i >= 0; i--)
{
output[count[ (arr[i]/exp)%10 ] - 1] = arr[i];
count[ (arr[i]/exp)%10 ]--;
}
for (i = 0; i < n; i++)
arr[i] = output[i];
}
static void radixsort(int arr[], int n)
{
int m = getMax(arr, n);
for (int exp = 1; m/exp > 0; exp *= 10)
countSort(arr, n, exp);
}
static void print(int arr[], int n)
{
for (int i=0; i
#include
void swap(char *x, char *y)
{
char temp;
temp = *x;
*x = *y;
*y = temp;
void permute(char *a, int l, int r)
{
int i;
if (l == r)
printf(\"%s\ \", a);
else
{
for (i = l; i <= r; i++)
{
swap((a+l), (a+i));
permute(a, l+1, .
BSTNode.Java Node class used for implementing the BST. .pdf
BSTNode.Java:
/**
* Node class used for implementing the BST.
*
* DO NOT MODIFY THIS FILE!!
*
* @author CS 1332 TAs
* @version 1.0
*/
public class BSTNode> {
private T data;
private BSTNode left;
private BSTNode right;
/**
* Constructs a BSTNode with the given data.
*
* @param data the data stored in the new node
*/
BSTNode(T data) {
this.data = data;
}
/**
* Gets the data.
*
* @return the data
*/
T getData() {
return data;
}
/**
* Gets the left child.
*
* @return the left child
*/
BSTNode getLeft() {
return left;
}
/**
* Gets the right child.
*
* @return the right child
*/
BSTNode getRight() {
return right;
}
/**
* Sets the data.
*
* @param data the new data
*/
void setData(T data) {
this.data = data;
}
/**
* Sets the left child.
*
* @param left the new left child
*/
void setLeft(BSTNode left) {
this.left = left;
}
/**
* Sets the right child.
*
* @param right the new right child
*/
void setRight(BSTNode right) {
this.right = right;
}
}
BST.Java:
import java.util.NoSuchElementException;
/**
* Your implementation of a BST.
*/
public class BST> {
/*
* Do not add new instance variables or modify existing ones.
*/
private BSTNode root;
private int size;
/*
* Do not add a constructor.
*/
/**
* Adds the data to the tree.
*
* This must be done recursively.
*
* The new data should become a leaf in the tree.
*
* Traverse the tree to find the appropriate location. If the data is
* already in the tree, then nothing should be done (the duplicate
* shouldn't get added, and size should not be incremented).
*
* Should be O(log n) for best and average cases and O(n) for worst case.
*
* @param data The data to add to the tree.
* @throws java.lang.IllegalArgumentException If data is null.
*/
public void add(T data) {
// WRITE YOUR CODE HERE (DO NOT MODIFY METHOD HEADER)!
}
/**
* Removes and returns the data from the tree matching the given parameter.
*
* This must be done recursively.
*
* There are 3 cases to consider:
* 1: The node containing the data is a leaf (no children). In this case,
* simply remove it.
* 2: The node containing the data has one child. In this case, simply
* replace it with its child.
* 3: The node containing the data has 2 children. Use the SUCCESSOR to
* replace the data. You should use recursion to find and remove the
* successor (you will likely need an additional helper method to
* handle this case efficiently).
*
* Do NOT return the same data that was passed in. Return the data that
* was stored in the tree.
*
* Hint: Should you use value equality or reference equality?
*
* Must be O(log n) for best and average cases and O(n) for worst case.
*
* @param data The data to remove.
* @return The data that was removed.
* @throws java.lang.IllegalArgumentException If data is null.
* @throws java.util.NoSuchElementException If the data is not in the tree.
*/
public T remove(T data) {
// WRITE YOUR CODE HERE (DO NOT MODIFY METHOD HEADER)!
}
/**
* Returns the root of the tree.
*
* For grading purposes only. You shouldn't need to use this met.
Introduction to CUDA C: NVIDIA : Notes
Highlighted notes of:
Introduction to CUDA C: NVIDIA
Author: Blaise Barney
From: GPU Clusters, Lawrence Livermore National Laboratory
https://computing.llnl.gov/tutorials/linux_clusters/gpu/NVIDIA.Introduction_to_CUDA_C.1.pdf
Blaise Barney is a research scientist at Lawrence Livermore National Laboratory.
write recursive function that calculates and returns the length of a.pdf
write recursive function that calculates and returns the length of a linked list
Solution
// C code to determine length of linked list recursively
#include
#include
// node of linked list
struct node
{
int key;
struct node* next;
};
// push key to linked list
void push(struct node** root, int new_element)
{
struct node* nodeNew = (struct node*) malloc(sizeof(struct node));
nodeNew->key = new_element;
nodeNew->next = (*root);
(*root) = nodeNew;
}
// recursively get length of linked list
int lengthLinkedlist(struct node* root)
{
// base case
if (root == NULL)
return 0;
// recursively call the function
return 1 + lengthLinkedlist(root->next);
}
int main()
{
struct node* root = NULL;
push(&root, 11);
push(&root, 34);
push(&root, 4);
push(&root, 23);
push(&root, 14);
push(&root, 88);
push(&root, 56);
push(&root, 84);
push(&root, 6);
/* Check the count function */
printf(\"Length of Linked list: %d\ \", lengthLinkedlist(root));
return 0;
}
/*
output:
Length of Linked list: 9
*/.
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.
Virtual Function and Polymorphism.ppt
This code will generate a compile time error as Base is an abstract class due to pure virtual function show(). An abstract class cannot be instantiated.
Algorithms devised for a google interview
Google interviewer asked for an algorithm to extract the k smallest elements from a set of ordered arrays. I suggested a vectorised bucket sort and merge sort approach. I took the problem offline and produced this analysis and C++.
In c++ format please, for each function in the code, using the comme.pdf
In c++ format please, for each function in the code, using the comments fill in the function to
write the whole program.
#include
#include
using namespace std;
template
class BST
{
private:
struct Node
{
bstdata data;
Node* left;
Node* right;
Node(bstdata newdata): data(newdata), left(NULL), right(NULL) {}
};
typedef struct Node* NodePtr;
NodePtr root;
/**Private helper functions*/
void insertHelper(NodePtr root, bstdata value);
//private helper function for insert
//recursively inserts a value into the BST
void destructorHelper(NodePtr root);
//private helper function for the destructor
//recursively frees the memory in the BST
void inOrderPrintHelper(NodePtr root);
//private helper function for inOrderPrint
//recursively prints tree values in order from smallest to largest
void preOrderPrintHelper(NodePtr root);
//private helper function for preOrderPrint
//recursively prints tree values in preorder
void postOrderPrintHelper(NodePtr root);
//private helper function for postOrderPrint
//recursively prints tree values in postorder
/**Public functions*/
public:
BST();
//Instantiates a new Binary Search Tree
//post: a new Binary Search Tree object
~BST();
//frees the memory of the BST object
//All memory has been deallocated
bool isEmpty();
//determines whether the Binary Search Tree is empty
void insert(bstdata value);
//inserts a new value into the Binary Search Tree
//post: a new value inserted into the Binary Search Tree
bstdata getRoot();
//returns the value stored at the root of the Binary Search Tree
//pre: the Binary Search Tree is not empty
void inOrderPrint();
//calls the inOrderPrintHelper function to print out the values
//stored in the Binary Search Tree
//If the tree is empty, prints nothing
void preOrderPrint();
//calls the preOrderPrintHelper function to print out the values
//stored in the Binary Search Tree
//If the tree is empty, prints nothing
void postOrderPrint();
//calls the postOrderPrintHelper function to print out the values
//stored in the Binary Search Tree
//If the tree is empty, prints nothing
};
Solution
Below code is completed with the function prototypes :
#include
#include
using namespace std;
template
class BST
{
private:
struct Node
{
bstdata data;
Node* left;
Node* right;
Node(bstdata newdata): data(newdata), left(NULL), right(NULL) {}
};
typedef struct Node* NodePtr;
NodePtr root;
/**Private helper functions*/
void insertHelper(NodePtr root, bstdata value){
if(root==NULL)
{
NodePtr *newnode=new node;
newnode->data=value;
root=newnode;
}
else{
if(valuedata)
insertHelper(value,root->left);
else
insertHelper(value,root->right);
}
}
//private helper function for insert
//recursively inserts a value into the BST
void destructorHelper(NodePtr root);
//private helper function for the destructor
//recursively frees the memory in the BST
void inOrderPrintHelper(NodePtr root){
if (root != NULL)
{
inorder(root->left);
cout<data<right);
}
}
//private helper function for inOrderPrint
//recursively prints tree values in .
C1320prespost
The document provides an overview of common topics that confuse new C programmers, including control structures, variable types, pointers, arrays, structs, linked lists, and recursion. It discusses each concept in 1-3 paragraphs, explaining what they are and providing basic examples. It also covers debugging strategies such as printing variables, reducing complexity, and inserting early returns to isolate issues.
C++11
A brief presentation on the C++11 standard, including lambda functions, rvalue references, automatic variables, and more.
Question In C Programming In mathematics, a set is a colle...Sav.pdf
Question: In C Programming: In mathematics, a set is a colle...
Save
In C Programming:
In mathematics, a set is a collection of distinct elements (say integer numbers). For example,
A={2, 5, 7} and B={3, 5, 8, 10} are two different sets. There are several basic operations for
constructing new sets from given two sets, but let\'s just consider three basic ones:
C = union(A,B); ---> C = A B={2, 5, 7, 8, 10} C = intersection(A,B); ---> C = A B={5}
C = difference(A,B); ---> C = A-B = A \\ B ={2, 7} also aka. complement
You are asked to develop a set library (using two different representations: array and link list)
and then implement a driver program that gets two sets and one of the above operation as a
command to apply, then it prints the resulting set...
Developing set library: For interface, create an interface file set.h which contains boiler plate and
the followings:
typedef int setElementT;
typedef struct setCDT *setADT;
setADT setNew(); /* create a new empty set */
void setFree(setADT S); /* free the space allocated for the set S */
int setInsertElementSorted(setADT S, setElementT E);
/* if not successful, return 0; otherwise, return the num of elements after the insertion. Also note
that the elements might be given in different orders, but your function should always keep the set
in a sorted manner after each insertion */
setADT setUnion(setADT A, setADT B);
/* returns a new set containing A B */
setADT setIntersection(setADT A, setADT B);
/* returns a new set containing A B */
setADT setDifference(setADT A, setADT B);
/* returns a new set containing A \\ B */
int setCardinality(setADT S);
/* return the number of elements in S */
void setPrint(setADT S, char *name);
/* print elements of S, A = {2, 5, 7} */
For implementation, you will be asked to have two different implementations:
(40pt) First implement set library as setArrayImp.c which uses a constant size array to store set
elements (suppose max set size is 100). [hint: see ch2 slides 72-78 ]
(40pt) Second implement this library as setLinkedListImp.c which uses a dynamic single linked
list to store set elements.
Develop a driver.c program and compile it with two different imp of set library (20 pt)
1. Create two sets called A and B.
2. Ask user to enter positive integers for set A (end input when user enters -1)
3. Ask user to enter positive integers for set B (end input when user enters -1)
4. In a loop 4.1. Ask user to enter a command:
4.2 If Q is entered, quit from this loop.
4.3 If U, I, or D is entered, compute set C as union, intersection, or difference. setPrint(A, \"A\");
setPrint(A, \"B\"); setPrint(C, \"C\"); print the number of elements in C setFree(C);
5. free A and B
Compile/execute driver.c with setArrayImp.c as well as setListImp.c
//no include files needed
Solution
Create set.h first with the following
typedef int setElementT;
typedef struct setCDT *setADT;
setADT setNew(); /* Creates a new empty set */
void setFree(setADT S); /* Frees the space allocated for the set .
Linked list
The document discusses self-referential structures in C. It begins by showing how a struct cannot directly contain a member of its own type, as this would cause infinite recursion. It then demonstrates how to make a struct self-referential by using a pointer to the struct as a member, rather than the struct itself. This allows the compiler to correctly allocate memory for the pointer. Linked lists are provided as an example application of self-referential structures. The document also covers dynamic memory allocation functions like malloc(), calloc(), free() and realloc() in C.
C++11 - STL Additions
This presentation considers certain specific features of C++11 and additions to STL library (uniform initialization, new containers and methods, move semantics).
Presentation by Taras Protsiv (Software Engineer, GlobalLogic), Kyiv, delivered at GlobalLogic C++ TechTalk in Lviv, September 18, 2014.
More details -
http://www.globallogic.com.ua/press-releases/lviv-cpp-techtalk-coverage
This is a c++ binary search program I worked so far but still cant g.pdf
This is a c++ binary search program I worked so far but still cant get it right.
Can anyone help me? Big thanks!!
the client should not be modified
/*
*File: client.cpp
*Author: Yingwu Zhu
*Warning: do not change this file and use it as is.
*Last Modififcation: 10/21/2016
*/
#include
#include
#include
#include
#include
#include \"bst.h\"
using namespace std;
int main(int argc, char* argv[]) {
if (argc != 2) {
cout << \"Format: \" << argv[0] << \" [data file]\" << endl;
return 0;
}
ifstream fin(argv[1]);
int cases;
fin >> cases;
int passed = 0;
for (int i = 1; i <= cases; i++) {
cout << \"Checking test case #\" << i << \" ... \";
BST T;
set S;
int n, x;
fin >> n;
bool ok = true;
vector tmp;
int rem = 0;
for (int j = 0; j < n; j++) {
fin >> x;
T.Insert(x);
S.insert(x);
ok &= (T.Search(x) && T.RecurSearch(x));
if (tmp.empty())
tmp.push_back(x);
if (rand()%10 < 3) {
T.Erase(tmp[0]);
S.erase(tmp[0]);
ok &= (T.Search(tmp[0]) == false);
tmp.pop_back();
rem++;
}
}
if (rem
ok &= (T.MaxElement() == *S.rbegin());
while (!S.empty() && !T.Empty()) {
int x = T.MinElement();
ok &= (x == *S.begin());
T.Erase(x);
S.erase(S.begin());
}
cout << (ok ? \"Passed!\" : \"Failed\") << endl;
passed += ok;
}
cout << passed << \" of \" << cases << \" test cases have passed!\ \";
if (passed == cases)
cout << endl << \"Congratulations! Good to Submit Your Code\ \";
else if ((double)passed/cases >= 0.95)
cout << endl << \"You are almost there, but need to fix some bugs.\ \";
else
cout << endl << \"Your code needs a lot of fixes for submission\ \";
return 0;
}
=====================================================================
=======
//bst.h
#ifndef _BST_H_
#define _BST_H_
#include
using namespace std;
class BST {
private:
class Node {
public:
int data;
Node* left;
Node* right;
};
Node* root; //root node pointer
//you may add your auxiliary functions here!
public:
BST(); //constructor
~BST(); //destructor
bool Empty() const;
void Insert(int val);
int MinElement() const;
int MaxElement() const;
bool Search(int val) const;
bool RecurSearch(int val) const;
void Erase(int val);
};
#endif
=====================================================================
=======
/*
bst.cpp
Subject: Binary Seach Tree
Modification Time:10/26/2016
*/
#include
#include\"bst.h\"
using namespace std;
BST::BST(){
root= NULL;
}
BST::~BST(){
delete root;
delete root->left;
delete root->right;
}
bool BST::Empty() const {
return data;
}
void BST::Insert(int val){
Node* p= new Node;
p->data= val;
Node* cur = root;
if(val < cur->data){
cur = cur -> left;
}
else{
right->next=val;
}
}
int BST::MinElement() const {
Node* cur;
while(cur->left != NULL){
cur = cur->left;
}
return(cur->data);
}
int BST::MaxElement() const{
if(root==NULL){
return 0;
}
if(root->left>root->data){
root->data=root->right;
}
else if(root->right>root->data){
root->data=root->right;
}
return root->data;
}
bool BST:: Search(int val) const{
Node* cur;
cur = root;
while(cur!=NULL){
if(cur->data == val){
return true;
}
else if(cur->data .
"Optimization of a .NET application- is it simple ! / ?", Yevhen Tatarynov
Optimization of .NET application seems complex and tied full task, but don’t hurry up with conclusions. Let’s look on several cases from real projects.
For this we:
look under the hood of an application from a real project;
define the metric for optimization;
choose the necessary tools;
find bottlenecks /memory leaks and best practice to resolve them.
We'll improve the application step by step and we’ll what with simple analysis and simple best practice we can significantly reduce total resources usage.
String searching
An O(n+m) in time and O(1) in space search-algorithm for substr, length m, in target string, length n. Simpler than trie or Knuth-Morris-Pratt. Can be reduced to O(n) using Group Theoretic O(1)-updatable hash that replaces the cumulative sum, which requires an O(m) verification step because "+" is commutative and cannot distinguish between anagrams: a+b+c = a+c+b = c+a+b etc. I am not uploading the hash, because it means giving away R&D I do in quantum simulations.
The TCP/IP Stack in the Linux Kernel
The document discusses various data structures and functions related to network packet processing in the Linux kernel socket layer. It describes the sk_buff structure that is used to pass packets between layers. It also explains the net_device structure that represents a network interface in the kernel. When a packet is received, the interrupt handler will raise a soft IRQ for processing. The packet will then traverse various protocol layers like IP and TCP to be eventually delivered to a socket and read by a userspace application.
COW
The document discusses Copy-On-Write (COW) in C++ to avoid unnecessary object copying. It explains passing by reference/pointer, smart pointers, and introduces COW using an example DataBuffer class. COW shares a single copy of the data between objects until one object needs to modify it, at which point it makes a copy so the objects remain independent. The document shows how to implement COW in DataBuffer and Employee classes using smart pointers, making a backup copy before writing, and rolling back if an exception occurs. It notes COW is best for large objects with many copies but few writes.
Lab 13
This document discusses declaring and using multidimensional arrays, 2D dynamic arrays, and structures in C++. It explains that multidimensional arrays can be declared to have multiple indices, like int arr[rows][columns]. 2D dynamic arrays can be declared using pointers, by allocating memory for an array of pointers and each pointer. Structures allow grouping of different data types and functions together under one name. Members are accessed using the dot operator.
7- Match the astronomer to his accomplishment a- Ptolemy i- Made very.pdf
7. In humans, the allele for normal blood clotting, H , is dominant to the allele for hemophilia, h .
This is a sex-linked trait found on the X chromosome. A woman with normal blood clotting has
four children: a normal son, a hemophiliac son, and two normal daughters. The father has normal
blood clotting. What is the genotype for each member of the family? 8. Red-green color
blindness (b) is a recessive sex-linked trait. A colorblind male marries a normal female. Their
daughter is colorblind. a)What are the genotypes of both parents and the daughter? b) Can a
colorblind father have daughters who are not colorblind? Explain. c) If a normal sighted woman
whose father was color-blind marries a color-blind man, what is the probability that they will
have a colorblind child?.
7- In a multiple linear regression model y-X+-XN(0-2In)- the OLS estim (1).pdf
7. For the circuit in Figure 6-71, assume the inputs are A dd / S u b t . = 1 , A = 1001 and B =
1100 . What is the output?.
More Related Content
Similar to Help implement BST- The code must follow the instruction below as well.pdf
Data Structures and Agorithm: DS 14 Binary Expression Tree.pptx
Data Structures and Agorithm: DS 14 Binary Expression Tree.pptx
(Parent reference for BST) Redefine TreeNode by adding a reference to.pdf
(Parent reference for BST) Redefine TreeNode by adding a reference to a node\'s parent, as
shown below\': Reimplement the insert and delete methods in the BST class to update the parent
for each node in the tree. Add the following new method in BST:/** Returns the node for the
specified element. * Returns null if the element is not in the tree. */private TreeNode getNode(E
element)/** Returns true if the node for the element is a leaf */private boolean isLeaf(E
element)/** Returns the path of elements from the specified element * to the root in an array
list. */public ArrayList getPath(E e) Write a test program that prompts the user to enter 10
integers, adds them to the tree, deletes the first integer from the tree, and displays the paths for
all leaf nodes. Here is a sample run:
Solution
#include
#include
void swap(char *x, char *y)
{
char temp;
temp = *x;
*x = *y;
*y = temp;
void permute(char *a, int l, int r)
{
int i;
if (l == r)
printf(\"%s\ \", a);
else
{
for (i = l; i <= r; i++)
{
swap((a+l), (a+i));
permute(a, l+1, r);
swap((a+l), (a+i)); //backtrack
}
}
}
int main()
{
char str[] = \"ABC\";
int n = strlen(str);
permute(str, 0, n-1);
return 0;
}
part ii radix sort:
c++
#include
using namespace std;
int getMax(int arr[], int n)
{
int mx = arr[0];
for (int i = 1; i < n; i++)
if (arr[i] > mx)
mx = arr[i];
return main()
void countSort(int arr[], int n, int exp
for (i = 0; i < n; i++)
count[ (arr[i]/exp)%10 ]++;
for (i = 1; i < 10; i++)
count[i] += count[i - 1];
for (i = n - 1; i >= 0; i--)
{
output[count[ (arr[i]/exp)%10 ] - 1] = arr[i];
count[ (arr[i]/exp)%10 ]--;
}
for (i = 0; i < n; i++)
arr[i] = output[i];
}
adixsort(int arr[], int n)
{
int m = getMax(arr, n);
for (int exp = 1; m/exp > 0; exp *= 10)
countSort(arr, n, exp);
}
void print(int arr[], int n)
{
for (int i = 0; i < n; i++)
cout << arr[i] << \" \";
}
int main()
{
int arr[] = {170, 45, 75, 90, 802, 24, 2, 66};
int n = sizeof(arr)/sizeof(arr[0]);
radixsort(arr, n);
print(arr, n);
return 0;
}
java:
import java.io.*;
import java.util.*;
class Radix {
static int getMax(int arr[], int n)
{
int mx = arr[0];
for (int i = 1; i < n; i++)
if (arr[i] > mx)
mx = arr[i];
return mx;
}
static void countSort(int arr[], int n, int exp)
{
int output[] = new int[n]; // output array
int i;
int count[] = new int[10];
Arrays.fill(count,0);
for (i = 0; i < n; i++)
count[ (arr[i]/exp)%10 ]++;
for (i = 1; i < 10; i++)
count[i] += count[i - 1];
for (i = n - 1; i >= 0; i--)
{
output[count[ (arr[i]/exp)%10 ] - 1] = arr[i];
count[ (arr[i]/exp)%10 ]--;
}
for (i = 0; i < n; i++)
arr[i] = output[i];
}
static void radixsort(int arr[], int n)
{
int m = getMax(arr, n);
for (int exp = 1; m/exp > 0; exp *= 10)
countSort(arr, n, exp);
}
static void print(int arr[], int n)
{
for (int i=0; i
#include
void swap(char *x, char *y)
{
char temp;
temp = *x;
*x = *y;
*y = temp;
void permute(char *a, int l, int r)
{
int i;
if (l == r)
printf(\"%s\ \", a);
else
{
for (i = l; i <= r; i++)
{
swap((a+l), (a+i));
permute(a, l+1, .
BSTNode.Java Node class used for implementing the BST. .pdf
BSTNode.Java:
/**
* Node class used for implementing the BST.
*
* DO NOT MODIFY THIS FILE!!
*
* @author CS 1332 TAs
* @version 1.0
*/
public class BSTNode> {
private T data;
private BSTNode left;
private BSTNode right;
/**
* Constructs a BSTNode with the given data.
*
* @param data the data stored in the new node
*/
BSTNode(T data) {
this.data = data;
}
/**
* Gets the data.
*
* @return the data
*/
T getData() {
return data;
}
/**
* Gets the left child.
*
* @return the left child
*/
BSTNode getLeft() {
return left;
}
/**
* Gets the right child.
*
* @return the right child
*/
BSTNode getRight() {
return right;
}
/**
* Sets the data.
*
* @param data the new data
*/
void setData(T data) {
this.data = data;
}
/**
* Sets the left child.
*
* @param left the new left child
*/
void setLeft(BSTNode left) {
this.left = left;
}
/**
* Sets the right child.
*
* @param right the new right child
*/
void setRight(BSTNode right) {
this.right = right;
}
}
BST.Java:
import java.util.NoSuchElementException;
/**
* Your implementation of a BST.
*/
public class BST> {
/*
* Do not add new instance variables or modify existing ones.
*/
private BSTNode root;
private int size;
/*
* Do not add a constructor.
*/
/**
* Adds the data to the tree.
*
* This must be done recursively.
*
* The new data should become a leaf in the tree.
*
* Traverse the tree to find the appropriate location. If the data is
* already in the tree, then nothing should be done (the duplicate
* shouldn't get added, and size should not be incremented).
*
* Should be O(log n) for best and average cases and O(n) for worst case.
*
* @param data The data to add to the tree.
* @throws java.lang.IllegalArgumentException If data is null.
*/
public void add(T data) {
// WRITE YOUR CODE HERE (DO NOT MODIFY METHOD HEADER)!
}
/**
* Removes and returns the data from the tree matching the given parameter.
*
* This must be done recursively.
*
* There are 3 cases to consider:
* 1: The node containing the data is a leaf (no children). In this case,
* simply remove it.
* 2: The node containing the data has one child. In this case, simply
* replace it with its child.
* 3: The node containing the data has 2 children. Use the SUCCESSOR to
* replace the data. You should use recursion to find and remove the
* successor (you will likely need an additional helper method to
* handle this case efficiently).
*
* Do NOT return the same data that was passed in. Return the data that
* was stored in the tree.
*
* Hint: Should you use value equality or reference equality?
*
* Must be O(log n) for best and average cases and O(n) for worst case.
*
* @param data The data to remove.
* @return The data that was removed.
* @throws java.lang.IllegalArgumentException If data is null.
* @throws java.util.NoSuchElementException If the data is not in the tree.
*/
public T remove(T data) {
// WRITE YOUR CODE HERE (DO NOT MODIFY METHOD HEADER)!
}
/**
* Returns the root of the tree.
*
* For grading purposes only. You shouldn't need to use this met.
Introduction to CUDA C: NVIDIA : Notes
Highlighted notes of:
Introduction to CUDA C: NVIDIA
Author: Blaise Barney
From: GPU Clusters, Lawrence Livermore National Laboratory
https://computing.llnl.gov/tutorials/linux_clusters/gpu/NVIDIA.Introduction_to_CUDA_C.1.pdf
Blaise Barney is a research scientist at Lawrence Livermore National Laboratory.
write recursive function that calculates and returns the length of a.pdf
write recursive function that calculates and returns the length of a linked list
Solution
// C code to determine length of linked list recursively
#include
#include
// node of linked list
struct node
{
int key;
struct node* next;
};
// push key to linked list
void push(struct node** root, int new_element)
{
struct node* nodeNew = (struct node*) malloc(sizeof(struct node));
nodeNew->key = new_element;
nodeNew->next = (*root);
(*root) = nodeNew;
}
// recursively get length of linked list
int lengthLinkedlist(struct node* root)
{
// base case
if (root == NULL)
return 0;
// recursively call the function
return 1 + lengthLinkedlist(root->next);
}
int main()
{
struct node* root = NULL;
push(&root, 11);
push(&root, 34);
push(&root, 4);
push(&root, 23);
push(&root, 14);
push(&root, 88);
push(&root, 56);
push(&root, 84);
push(&root, 6);
/* Check the count function */
printf(\"Length of Linked list: %d\ \", lengthLinkedlist(root));
return 0;
}
/*
output:
Length of Linked list: 9
*/.
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.
Virtual Function and Polymorphism.ppt
This code will generate a compile time error as Base is an abstract class due to pure virtual function show(). An abstract class cannot be instantiated.
Algorithms devised for a google interview
Google interviewer asked for an algorithm to extract the k smallest elements from a set of ordered arrays. I suggested a vectorised bucket sort and merge sort approach. I took the problem offline and produced this analysis and C++.
In c++ format please, for each function in the code, using the comme.pdf
In c++ format please, for each function in the code, using the comments fill in the function to
write the whole program.
#include
#include
using namespace std;
template
class BST
{
private:
struct Node
{
bstdata data;
Node* left;
Node* right;
Node(bstdata newdata): data(newdata), left(NULL), right(NULL) {}
};
typedef struct Node* NodePtr;
NodePtr root;
/**Private helper functions*/
void insertHelper(NodePtr root, bstdata value);
//private helper function for insert
//recursively inserts a value into the BST
void destructorHelper(NodePtr root);
//private helper function for the destructor
//recursively frees the memory in the BST
void inOrderPrintHelper(NodePtr root);
//private helper function for inOrderPrint
//recursively prints tree values in order from smallest to largest
void preOrderPrintHelper(NodePtr root);
//private helper function for preOrderPrint
//recursively prints tree values in preorder
void postOrderPrintHelper(NodePtr root);
//private helper function for postOrderPrint
//recursively prints tree values in postorder
/**Public functions*/
public:
BST();
//Instantiates a new Binary Search Tree
//post: a new Binary Search Tree object
~BST();
//frees the memory of the BST object
//All memory has been deallocated
bool isEmpty();
//determines whether the Binary Search Tree is empty
void insert(bstdata value);
//inserts a new value into the Binary Search Tree
//post: a new value inserted into the Binary Search Tree
bstdata getRoot();
//returns the value stored at the root of the Binary Search Tree
//pre: the Binary Search Tree is not empty
void inOrderPrint();
//calls the inOrderPrintHelper function to print out the values
//stored in the Binary Search Tree
//If the tree is empty, prints nothing
void preOrderPrint();
//calls the preOrderPrintHelper function to print out the values
//stored in the Binary Search Tree
//If the tree is empty, prints nothing
void postOrderPrint();
//calls the postOrderPrintHelper function to print out the values
//stored in the Binary Search Tree
//If the tree is empty, prints nothing
};
Solution
Below code is completed with the function prototypes :
#include
#include
using namespace std;
template
class BST
{
private:
struct Node
{
bstdata data;
Node* left;
Node* right;
Node(bstdata newdata): data(newdata), left(NULL), right(NULL) {}
};
typedef struct Node* NodePtr;
NodePtr root;
/**Private helper functions*/
void insertHelper(NodePtr root, bstdata value){
if(root==NULL)
{
NodePtr *newnode=new node;
newnode->data=value;
root=newnode;
}
else{
if(valuedata)
insertHelper(value,root->left);
else
insertHelper(value,root->right);
}
}
//private helper function for insert
//recursively inserts a value into the BST
void destructorHelper(NodePtr root);
//private helper function for the destructor
//recursively frees the memory in the BST
void inOrderPrintHelper(NodePtr root){
if (root != NULL)
{
inorder(root->left);
cout<data<right);
}
}
//private helper function for inOrderPrint
//recursively prints tree values in .
C1320prespost
The document provides an overview of common topics that confuse new C programmers, including control structures, variable types, pointers, arrays, structs, linked lists, and recursion. It discusses each concept in 1-3 paragraphs, explaining what they are and providing basic examples. It also covers debugging strategies such as printing variables, reducing complexity, and inserting early returns to isolate issues.
C++11
A brief presentation on the C++11 standard, including lambda functions, rvalue references, automatic variables, and more.
Question In C Programming In mathematics, a set is a colle...Sav.pdf
Question: In C Programming: In mathematics, a set is a colle...
Save
In C Programming:
In mathematics, a set is a collection of distinct elements (say integer numbers). For example,
A={2, 5, 7} and B={3, 5, 8, 10} are two different sets. There are several basic operations for
constructing new sets from given two sets, but let\'s just consider three basic ones:
C = union(A,B); ---> C = A B={2, 5, 7, 8, 10} C = intersection(A,B); ---> C = A B={5}
C = difference(A,B); ---> C = A-B = A \\ B ={2, 7} also aka. complement
You are asked to develop a set library (using two different representations: array and link list)
and then implement a driver program that gets two sets and one of the above operation as a
command to apply, then it prints the resulting set...
Developing set library: For interface, create an interface file set.h which contains boiler plate and
the followings:
typedef int setElementT;
typedef struct setCDT *setADT;
setADT setNew(); /* create a new empty set */
void setFree(setADT S); /* free the space allocated for the set S */
int setInsertElementSorted(setADT S, setElementT E);
/* if not successful, return 0; otherwise, return the num of elements after the insertion. Also note
that the elements might be given in different orders, but your function should always keep the set
in a sorted manner after each insertion */
setADT setUnion(setADT A, setADT B);
/* returns a new set containing A B */
setADT setIntersection(setADT A, setADT B);
/* returns a new set containing A B */
setADT setDifference(setADT A, setADT B);
/* returns a new set containing A \\ B */
int setCardinality(setADT S);
/* return the number of elements in S */
void setPrint(setADT S, char *name);
/* print elements of S, A = {2, 5, 7} */
For implementation, you will be asked to have two different implementations:
(40pt) First implement set library as setArrayImp.c which uses a constant size array to store set
elements (suppose max set size is 100). [hint: see ch2 slides 72-78 ]
(40pt) Second implement this library as setLinkedListImp.c which uses a dynamic single linked
list to store set elements.
Develop a driver.c program and compile it with two different imp of set library (20 pt)
1. Create two sets called A and B.
2. Ask user to enter positive integers for set A (end input when user enters -1)
3. Ask user to enter positive integers for set B (end input when user enters -1)
4. In a loop 4.1. Ask user to enter a command:
4.2 If Q is entered, quit from this loop.
4.3 If U, I, or D is entered, compute set C as union, intersection, or difference. setPrint(A, \"A\");
setPrint(A, \"B\"); setPrint(C, \"C\"); print the number of elements in C setFree(C);
5. free A and B
Compile/execute driver.c with setArrayImp.c as well as setListImp.c
//no include files needed
Solution
Create set.h first with the following
typedef int setElementT;
typedef struct setCDT *setADT;
setADT setNew(); /* Creates a new empty set */
void setFree(setADT S); /* Frees the space allocated for the set .
Linked list
The document discusses self-referential structures in C. It begins by showing how a struct cannot directly contain a member of its own type, as this would cause infinite recursion. It then demonstrates how to make a struct self-referential by using a pointer to the struct as a member, rather than the struct itself. This allows the compiler to correctly allocate memory for the pointer. Linked lists are provided as an example application of self-referential structures. The document also covers dynamic memory allocation functions like malloc(), calloc(), free() and realloc() in C.
C++11 - STL Additions
This presentation considers certain specific features of C++11 and additions to STL library (uniform initialization, new containers and methods, move semantics).
Presentation by Taras Protsiv (Software Engineer, GlobalLogic), Kyiv, delivered at GlobalLogic C++ TechTalk in Lviv, September 18, 2014.
More details -
http://www.globallogic.com.ua/press-releases/lviv-cpp-techtalk-coverage
This is a c++ binary search program I worked so far but still cant g.pdf
This is a c++ binary search program I worked so far but still cant get it right.
Can anyone help me? Big thanks!!
the client should not be modified
/*
*File: client.cpp
*Author: Yingwu Zhu
*Warning: do not change this file and use it as is.
*Last Modififcation: 10/21/2016
*/
#include
#include
#include
#include
#include
#include \"bst.h\"
using namespace std;
int main(int argc, char* argv[]) {
if (argc != 2) {
cout << \"Format: \" << argv[0] << \" [data file]\" << endl;
return 0;
}
ifstream fin(argv[1]);
int cases;
fin >> cases;
int passed = 0;
for (int i = 1; i <= cases; i++) {
cout << \"Checking test case #\" << i << \" ... \";
BST T;
set S;
int n, x;
fin >> n;
bool ok = true;
vector tmp;
int rem = 0;
for (int j = 0; j < n; j++) {
fin >> x;
T.Insert(x);
S.insert(x);
ok &= (T.Search(x) && T.RecurSearch(x));
if (tmp.empty())
tmp.push_back(x);
if (rand()%10 < 3) {
T.Erase(tmp[0]);
S.erase(tmp[0]);
ok &= (T.Search(tmp[0]) == false);
tmp.pop_back();
rem++;
}
}
if (rem
ok &= (T.MaxElement() == *S.rbegin());
while (!S.empty() && !T.Empty()) {
int x = T.MinElement();
ok &= (x == *S.begin());
T.Erase(x);
S.erase(S.begin());
}
cout << (ok ? \"Passed!\" : \"Failed\") << endl;
passed += ok;
}
cout << passed << \" of \" << cases << \" test cases have passed!\ \";
if (passed == cases)
cout << endl << \"Congratulations! Good to Submit Your Code\ \";
else if ((double)passed/cases >= 0.95)
cout << endl << \"You are almost there, but need to fix some bugs.\ \";
else
cout << endl << \"Your code needs a lot of fixes for submission\ \";
return 0;
}
=====================================================================
=======
//bst.h
#ifndef _BST_H_
#define _BST_H_
#include
using namespace std;
class BST {
private:
class Node {
public:
int data;
Node* left;
Node* right;
};
Node* root; //root node pointer
//you may add your auxiliary functions here!
public:
BST(); //constructor
~BST(); //destructor
bool Empty() const;
void Insert(int val);
int MinElement() const;
int MaxElement() const;
bool Search(int val) const;
bool RecurSearch(int val) const;
void Erase(int val);
};
#endif
=====================================================================
=======
/*
bst.cpp
Subject: Binary Seach Tree
Modification Time:10/26/2016
*/
#include
#include\"bst.h\"
using namespace std;
BST::BST(){
root= NULL;
}
BST::~BST(){
delete root;
delete root->left;
delete root->right;
}
bool BST::Empty() const {
return data;
}
void BST::Insert(int val){
Node* p= new Node;
p->data= val;
Node* cur = root;
if(val < cur->data){
cur = cur -> left;
}
else{
right->next=val;
}
}
int BST::MinElement() const {
Node* cur;
while(cur->left != NULL){
cur = cur->left;
}
return(cur->data);
}
int BST::MaxElement() const{
if(root==NULL){
return 0;
}
if(root->left>root->data){
root->data=root->right;
}
else if(root->right>root->data){
root->data=root->right;
}
return root->data;
}
bool BST:: Search(int val) const{
Node* cur;
cur = root;
while(cur!=NULL){
if(cur->data == val){
return true;
}
else if(cur->data .
"Optimization of a .NET application- is it simple ! / ?", Yevhen Tatarynov
Optimization of .NET application seems complex and tied full task, but don’t hurry up with conclusions. Let’s look on several cases from real projects.
For this we:
look under the hood of an application from a real project;
define the metric for optimization;
choose the necessary tools;
find bottlenecks /memory leaks and best practice to resolve them.
We'll improve the application step by step and we’ll what with simple analysis and simple best practice we can significantly reduce total resources usage.
String searching
An O(n+m) in time and O(1) in space search-algorithm for substr, length m, in target string, length n. Simpler than trie or Knuth-Morris-Pratt. Can be reduced to O(n) using Group Theoretic O(1)-updatable hash that replaces the cumulative sum, which requires an O(m) verification step because "+" is commutative and cannot distinguish between anagrams: a+b+c = a+c+b = c+a+b etc. I am not uploading the hash, because it means giving away R&D I do in quantum simulations.
The TCP/IP Stack in the Linux Kernel
The document discusses various data structures and functions related to network packet processing in the Linux kernel socket layer. It describes the sk_buff structure that is used to pass packets between layers. It also explains the net_device structure that represents a network interface in the kernel. When a packet is received, the interrupt handler will raise a soft IRQ for processing. The packet will then traverse various protocol layers like IP and TCP to be eventually delivered to a socket and read by a userspace application.
COW
The document discusses Copy-On-Write (COW) in C++ to avoid unnecessary object copying. It explains passing by reference/pointer, smart pointers, and introduces COW using an example DataBuffer class. COW shares a single copy of the data between objects until one object needs to modify it, at which point it makes a copy so the objects remain independent. The document shows how to implement COW in DataBuffer and Employee classes using smart pointers, making a backup copy before writing, and rolling back if an exception occurs. It notes COW is best for large objects with many copies but few writes.
Lab 13
This document discusses declaring and using multidimensional arrays, 2D dynamic arrays, and structures in C++. It explains that multidimensional arrays can be declared to have multiple indices, like int arr[rows][columns]. 2D dynamic arrays can be declared using pointers, by allocating memory for an array of pointers and each pointer. Structures allow grouping of different data types and functions together under one name. Members are accessed using the dot operator.
Similar to Help implement BST- The code must follow the instruction below as well.pdf (20)
Data Structures and Agorithm: DS 14 Binary Expression Tree.pptx
Data Structures and Agorithm: DS 14 Binary Expression Tree.pptx
(Parent reference for BST) Redefine TreeNode by adding a reference to.pdf
(Parent reference for BST) Redefine TreeNode by adding a reference to.pdf
BSTNode.Java Node class used for implementing the BST. .pdf
BSTNode.Java Node class used for implementing the BST. .pdf
write recursive function that calculates and returns the length of a.pdf
write recursive function that calculates and returns the length of a.pdf
C++, Implement the class BinarySearchTree, as given in listing 16-4 .pdf
C++, Implement the class BinarySearchTree, as given in listing 16-4 .pdf
In c++ format please, for each function in the code, using the comme.pdf
In c++ format please, for each function in the code, using the comme.pdf
Question In C Programming In mathematics, a set is a colle...Sav.pdf
Question In C Programming In mathematics, a set is a colle...Sav.pdf
This is a c++ binary search program I worked so far but still cant g.pdf
This is a c++ binary search program I worked so far but still cant g.pdf
"Optimization of a .NET application- is it simple ! / ?", Yevhen Tatarynov
"Optimization of a .NET application- is it simple ! / ?", Yevhen Tatarynov
More from a2zmobiles
7- Match the astronomer to his accomplishment a- Ptolemy i- Made very.pdf
7. In humans, the allele for normal blood clotting, H , is dominant to the allele for hemophilia, h .
This is a sex-linked trait found on the X chromosome. A woman with normal blood clotting has
four children: a normal son, a hemophiliac son, and two normal daughters. The father has normal
blood clotting. What is the genotype for each member of the family? 8. Red-green color
blindness (b) is a recessive sex-linked trait. A colorblind male marries a normal female. Their
daughter is colorblind. a)What are the genotypes of both parents and the daughter? b) Can a
colorblind father have daughters who are not colorblind? Explain. c) If a normal sighted woman
whose father was color-blind marries a color-blind man, what is the probability that they will
have a colorblind child?.
7- In a multiple linear regression model y-X+-XN(0-2In)- the OLS estim (1).pdf
7. For the circuit in Figure 6-71, assume the inputs are A dd / S u b t . = 1 , A = 1001 and B =
1100 . What is the output?.
7- In addition to a pH imbalance- prolonged vomiting is also causing D.pdf
7. Identify multi-valued or composite fields, partial dependencies, transitive dependencies and
the current normal form for the following relational tables. a. BOOK (isbn title nublisher
address) Note: Book is published with a specific ISBN. The publisher can chanse addiesses after
book is published. c. BOOK (isbn, title, publisher) PUBLISHER (publisher, street1, street2, city,
state, zip) ivote: Ins example allows each publisher to have a single address. How would you
modify the table(s) if a publisher could have multiple addresses? d. ORDFR (nrder num nradunt
id nend Aacorintion) 8. Your customer had a spreadsheet with the following columns and sample
data. a. The person before you, who was fired, had created the following relational table in which
to import the spreadsheet. b. Explain the disadvantages of modeling the spreadsheet in this
manner. What are you going to do, if anything, to change this? CSCI 2020: Database
Management Page 16.
7- The temperature at which a certain substance boils is normally dist.pdf
7. The length of time necessary to complete a specific task is exponentially distributed with mean
= 0.5 hrs . If the task is to be done twice and the time to do the tasks are independent, what is the
probability that the total time for these two tasks will exceed 1.5 hours?.
7- The length of time necessary to complete a specific task is exponen.pdf
7. The diagrams below show two nonhomologous chromosomes. Each contains a copy of a
transposable element (orange). In panel A, the transposable element is inserted in the two
chromosomes in the same orientation. In panel B, the transposable element is oriented in
opposite directions. For both panels, draw diagrams illustrating the consequences of
recombination following alignment to these transposable elements (instead of homologous
chromosomes). 8. Reverse transcription is a phenomenon that is important in cellular processes
and biotechnology. How does it differ from transcription in gene expression? Give three
examples of reverse transcription. One as it is used in biotechnology. One as it operates enables
retrotransposons to fill the genome. One regarding its intergral role in the protection of linear
chromosomes..
7- The following data have been collected for a British healthcare IT.pdf
7. Suppose X 1 and X 2 are independent N ( , 1 ) random variables, for an unknown parameter .
(a) Find a sufficient statistic for . (b) Show that X 1 2 1 is an unbiased estimator of 2 . (c) Find a
MVUE estimator of 2 . You may use the fact that X 1 ( X 1 + X 2 = y ) N ( 2 y , 2 1 ) ..
7- Many news organizations conduct polls asking adults in the United S.pdf
7. In his book, Alfred Wegener presented many lines of evidence that Earth's continents have
"drifted" through time. Name and briefly explain four lines of evidence cited by Wegener. (6)
Since Wegener's death, many more types of data confirmed his ideas that continents are not
stationary. Names two important lines of evidence discovered/developed after Wegener's death.
(4).
7- Calculate - DV for the following foed label (For carbohydrate and F.pdf
The document provides instructions to calculate the percent daily value (% DV) for carbohydrates and fat using nutrition information from a food label. It asks the reader to take the amount of carbohydrates or fat in a serving and divide it by the daily reference value, then multiply by 100 to determine the percent.
7- With the help of suitable examples- Explain how the application of.pdf
7. Using the income elasticity of demand to characterize goods A survey taken by residents from
the imaginary town of Draw City tells economists that the following changes result from a 10%
fall in income: Compute the income elastioty of demand for each good and use the dropdown
menus to complete the first column in the following cable. Then, Bused on the income
elastioties, classily each good as either a normal good or an inferior good. (Hint: Be careful to
keep track of the direction of change. The sign of the income elssticity of demand can be postive
or negative, and the sign gives important information.) ework (Ch 05) - A 38% decrease in the
quantity of clubs demanded Compute the income elasticity of demand for each good and use the
dropdown menus to complete the first column in the following table. Then, based on the income
elasticties, classily each good as either a normal good or an infenor good. (Hint: Be careful to
keep track of the direction of change. The sign of the income elasticty of demand can be positive
or negative, and the sign gives important information.) Which of the following three goods is
most likely to be classified as a luxury good? Tokens Clabs Krigs.
7- A taxpayer's wife died in 2021 and he has not remarried- He has two.pdf
7. A taxpayer's wife died in 2021 and he has not remarried. He has two children, ages 6 and 8 ,
living at home. He provides all the support for his children. What is his most advantageous filing
status for 2022, 2023 and 2024 ? surviving spouse, surviving spouse, head of household
surviving spouse for all three years surviving spouse, surviving spouse, single head of household
for all three years.
7- In his book- Alfred Wegener presented many lines of evidence that E.pdf
7. If a lactase persistent person mated with a lactose intolerant person, what phenotype do you
think the off spring would have? Explain your reasoning. 8. Both A and B below refer to lactase.
Explain these figures and how they were derived. (A). (B).
7- In humans- the allele for normal blood clotting- H- is dominant to.pdf
7. In a multiple linear regression model y = X + , X N ( 0 , 2 I n ) , the OLS estimator of is b = (
X X ) 1 X y , find E ( b X ) , E ( b ) , Var ( b X ) ..
7- Examine the map of the Murky Mists Mountain- - D- INote tne strike.pdf
7. Determinants of market interest rates Some characteristics of the determinants of nominal
interest rates are listed as follows. Identify the components (determinants) and the symbols
associated with each characteristic: 7. Determinants of market interest rates Some characteristics
of the determinants of nominal interest rates are listed as follows. Identify the components
(determinants) and the symbo associated with each characteristic: 7. Determinants of market
interest rates Some characteristics of the determinants of nominal interest rates are listed as
follows. Identify the components (determinants) and the symbols associated with each
characteristic:.
7- 7- Caleulating Returns and Variability (LO1) Usine the followine re.pdf
7. 7. Caleulating Returns and Variability (LO1) Usine the followine returns, calculate the
arithmetic average returns, the variances, and the standard deviations for X and Y ..
7- A perpetuity-immediate pays 1500 per year- Alice receives the first.pdf
7. A perpetuity-immediate pays 1500 per year. Alice receives the first 20 payments and Denise
receives the remaining payments. Alice's share of the present value of the original perpetuity is
30% . The annual effective rate of interest is a same constant for each year. Calculate the present
value of the payments received by Denise..
7- A cohort study employs a- Subjects known at the start to have the d.pdf
7. A cohort study employs
a. Subjects known at the start to have the disease
b. Subjects known at the start to be disease-free
c. Subjects whose exposure to a suspected risk factor is comparable to that of the control group at
the onset of the study
d. Comparison groups of equal size.
7- When I present the German Tank Problem- the most popular proposals.pdf
7. Use of discretionary policy to stabilize the economy Should the government use monetary and
fiscal policy in an effort to stabilize the economy? The following questions address the issue of
how monetary and fiscal policies affect the economy, as well as the pros and cons of using these
tools to combat economic fiuctuations. The following graph plots hypothetical aggregate demand
(AD), short-run aggregate supply (AS), and long-run aggregate supply (LRAS) curves for the
U.S. economy in January 2026. Suppose the government chooses to intervene in order to return
the economy to the natural level of output by using Depending on which curve is affected by the
government policy, shift either the AS curve or the AD curve to reflect the change that would
successfully restore the natural level of output. Suppose that in January 2026 the government
successfully carries out the type of policy necessary to restore the natural level of output
desoribed in the previous question. In March 2026, U.S. exports increase because india
eliminates all trade restrictions on U.S. goods. Oue to the ascociated with implementing
monetary and fiscal polic, the impact of the govemment's new policy will ikely once the effects
of the poligy are fully realized..
7- (Microsoft Visual Basic) Display a triangle Hints- The following co.pdf
7. (Microsoft Visual Basic)
Display a triangle
Hints:
The following codes display a upside-down triangle with dots.
Modify it to display a standing triangle with symbol *.
(Microsoft Visual Basic).
HELPPP Which of the following are differences in the recommendations.pdf
HELPPP
Which of the following are differences in the recommendations for cardiorespiratory exercise
between HIV-infected and non-infected individuals? (select all that apply) The goal of training is
to improve cardiorespiratory fitness only for those without HIV infection The frequency of
exercise should be higher for those with HIV infection to make up for the lower intensity The
initial prescription should begin at lower intensities for those with HIV infection Progression
should occur at a slower rate for those with HIV infection Question 14 1 pts Progressive
resistance training (PRT) is contraindicated for patients with HIV due to HAART. True False.
Hemophilia is due to a recessive allele (h) linked to the X chromosome (1).pdf
Hemophilia is due to a recessive allele (h) linked to the X chromosome (XH= normal allele;
Xh=hemophilia allele). David has the condition but his parents do not. David marries Angela,
whose parents do not have the condition. This couple have two children (1 daughter and 1 son).
Their son has hemophilia but their daughter does not.
If the couple had another girl, could this child have the hemophilia condition? If yes, what is the
probability that she has the hemophilia condition? Draw a Punnett square.
If the couple had another boy, would it be possible that he have a normal phenotype (not have
the hemophilia condition)? If yes, what would be the theoretical percentage that does he not have
the condition? Draw a Punnett square..
More from a2zmobiles (20)
7- Match the astronomer to his accomplishment a- Ptolemy i- Made very.pdf
7- Match the astronomer to his accomplishment a- Ptolemy i- Made very.pdf
7- In a multiple linear regression model y-X+-XN(0-2In)- the OLS estim (1).pdf
7- In a multiple linear regression model y-X+-XN(0-2In)- the OLS estim (1).pdf
7- In addition to a pH imbalance- prolonged vomiting is also causing D.pdf
7- In addition to a pH imbalance- prolonged vomiting is also causing D.pdf
7- The temperature at which a certain substance boils is normally dist.pdf
7- The temperature at which a certain substance boils is normally dist.pdf
7- The length of time necessary to complete a specific task is exponen.pdf
7- The length of time necessary to complete a specific task is exponen.pdf
7- The following data have been collected for a British healthcare IT.pdf
7- The following data have been collected for a British healthcare IT.pdf
7- Many news organizations conduct polls asking adults in the United S.pdf
7- Many news organizations conduct polls asking adults in the United S.pdf
7- Calculate - DV for the following foed label (For carbohydrate and F.pdf
7- Calculate - DV for the following foed label (For carbohydrate and F.pdf
7- With the help of suitable examples- Explain how the application of.pdf
7- With the help of suitable examples- Explain how the application of.pdf
7- A taxpayer's wife died in 2021 and he has not remarried- He has two.pdf
7- A taxpayer's wife died in 2021 and he has not remarried- He has two.pdf
7- In his book- Alfred Wegener presented many lines of evidence that E.pdf
7- In his book- Alfred Wegener presented many lines of evidence that E.pdf
7- In humans- the allele for normal blood clotting- H- is dominant to.pdf
7- In humans- the allele for normal blood clotting- H- is dominant to.pdf
7- Examine the map of the Murky Mists Mountain- - D- INote tne strike.pdf
7- Examine the map of the Murky Mists Mountain- - D- INote tne strike.pdf
7- 7- Caleulating Returns and Variability (LO1) Usine the followine re.pdf
7- 7- Caleulating Returns and Variability (LO1) Usine the followine re.pdf
7- A perpetuity-immediate pays 1500 per year- Alice receives the first.pdf
7- A perpetuity-immediate pays 1500 per year- Alice receives the first.pdf
7- A cohort study employs a- Subjects known at the start to have the d.pdf
7- A cohort study employs a- Subjects known at the start to have the d.pdf
7- When I present the German Tank Problem- the most popular proposals.pdf
7- When I present the German Tank Problem- the most popular proposals.pdf
7- (Microsoft Visual Basic) Display a triangle Hints- The following co.pdf
7- (Microsoft Visual Basic) Display a triangle Hints- The following co.pdf
HELPPP Which of the following are differences in the recommendations.pdf
HELPPP Which of the following are differences in the recommendations.pdf
Hemophilia is due to a recessive allele (h) linked to the X chromosome (1).pdf
Hemophilia is due to a recessive allele (h) linked to the X chromosome (1).pdf
Recently uploaded
How to Manage Your Lost Opportunities in Odoo 17 CRM
Odoo 17 CRM allows us to track why we lose sales opportunities with "Lost Reasons." This helps analyze our sales process and identify areas for improvement. Here's how to configure lost reasons in Odoo 17 CRM
Pengantar Penggunaan Flutter - Dart programming language1.pptx
Pengantar Penggunaan Flutter - Dart programming language1.pptx
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.Traditional Musical Instruments of Arunachal Pradesh and Uttar Pradesh - RAYH...
Traditional Musical Instruments of Arunachal Pradesh and Uttar Pradesh
ISO/IEC 27001, ISO/IEC 42001, and GDPR: Best Practices for Implementation and...
Denis is a dynamic and results-driven Chief Information Officer (CIO) with a distinguished career spanning information systems analysis and technical project management. With a proven track record of spearheading the design and delivery of cutting-edge Information Management solutions, he has consistently elevated business operations, streamlined reporting functions, and maximized process efficiency.
Certified as an ISO/IEC 27001: Information Security Management Systems (ISMS) Lead Implementer, Data Protection Officer, and Cyber Risks Analyst, Denis brings a heightened focus on data security, privacy, and cyber resilience to every endeavor.
His expertise extends across a diverse spectrum of reporting, database, and web development applications, underpinned by an exceptional grasp of data storage and virtualization technologies. His proficiency in application testing, database administration, and data cleansing ensures seamless execution of complex projects.
What sets Denis apart is his comprehensive understanding of Business and Systems Analysis technologies, honed through involvement in all phases of the Software Development Lifecycle (SDLC). From meticulous requirements gathering to precise analysis, innovative design, rigorous development, thorough testing, and successful implementation, he has consistently delivered exceptional results.
Throughout his career, he has taken on multifaceted roles, from leading technical project management teams to owning solutions that drive operational excellence. His conscientious and proactive approach is unwavering, whether he is working independently or collaboratively within a team. His ability to connect with colleagues on a personal level underscores his commitment to fostering a harmonious and productive workplace environment.
Date: May 29, 2024
Tags: Information Security, ISO/IEC 27001, ISO/IEC 42001, Artificial Intelligence, GDPR
-------------------------------------------------------------------------------
Find out more about ISO training and certification services
Training: ISO/IEC 27001 Information Security Management System - EN | PECB
ISO/IEC 42001 Artificial Intelligence Management System - EN | PECB
General Data Protection Regulation (GDPR) - Training Courses - EN | PECB
Webinars: https://pecb.com/webinars
Article: https://pecb.com/article
-------------------------------------------------------------------------------
For more information about PECB:
Website: https://pecb.com/
LinkedIn: https://www.linkedin.com/company/pecb/
Facebook: https://www.facebook.com/PECBInternational/
Slideshare: http://www.slideshare.net/PECBCERTIFICATION
How to Make a Field Mandatory in Odoo 17
In Odoo, making a field required can be done through both Python code and XML views. When you set the required attribute to True in Python code, it makes the field required across all views where it's used. Conversely, when you set the required attribute in XML views, it makes the field required only in the context of that particular view.
How to deliver Powerpoint Presentations.pptx
"How to make and deliver dynamic presentations by making it more interactive to captivate your audience attention"
BÀI TẬP DẠY THÊM TIẾNG ANH LỚP 7 CẢ NĂM FRIENDS PLUS SÁCH CHÂN TRỜI SÁNG TẠO ...
BÀI TẬP DẠY THÊM TIẾNG ANH LỚP 7 CẢ NĂM FRIENDS PLUS SÁCH CHÂN TRỜI SÁNG TẠO ...Nguyen Thanh Tu Collection
https://app.box.com/s/qhtvq32h4ybf9t49ku85x0n3xl4jhr15clinical examination of hip joint (1).pdf
described clinical examination all orthopeadic conditions .
How to Create a More Engaging and Human Online Learning Experience
How to Create a More Engaging and Human Online Learning Experience Wahiba Chair Training & Consulting
Wahiba Chair's Talk at the 2024 Learning Ideas Conference. Hindi varnamala | hindi alphabet PPT.pdf
हिंदी वर्णमाला पीपीटी, hindi alphabet PPT presentation, hindi varnamala PPT, Hindi Varnamala pdf, हिंदी स्वर, हिंदी व्यंजन, sikhiye hindi varnmala, dr. mulla adam ali, hindi language and literature, hindi alphabet with drawing, hindi alphabet pdf, hindi varnamala for childrens, hindi language, hindi varnamala practice for kids, https://www.drmullaadamali.com
Chapter wise All Notes of First year Basic Civil Engineering.pptx
Chapter wise All Notes of First year Basic Civil Engineering
Syllabus
Chapter-1
Introduction to objective, scope and outcome the subject
Chapter 2
Introduction: Scope and Specialization of Civil Engineering, Role of civil Engineer in Society, Impact of infrastructural development on economy of country.
Chapter 3
Surveying: Object Principles & Types of Surveying; Site Plans, Plans & Maps; Scales & Unit of different Measurements.
Linear Measurements: Instruments used. Linear Measurement by Tape, Ranging out Survey Lines and overcoming Obstructions; Measurements on sloping ground; Tape corrections, conventional symbols. Angular Measurements: Instruments used; Introduction to Compass Surveying, Bearings and Longitude & Latitude of a Line, Introduction to total station.
Levelling: Instrument used Object of levelling, Methods of levelling in brief, and Contour maps.
Chapter 4
Buildings: Selection of site for Buildings, Layout of Building Plan, Types of buildings, Plinth area, carpet area, floor space index, Introduction to building byelaws, concept of sun light & ventilation. Components of Buildings & their functions, Basic concept of R.C.C., Introduction to types of foundation
Chapter 5
Transportation: Introduction to Transportation Engineering; Traffic and Road Safety: Types and Characteristics of Various Modes of Transportation; Various Road Traffic Signs, Causes of Accidents and Road Safety Measures.
Chapter 6
Environmental Engineering: Environmental Pollution, Environmental Acts and Regulations, Functional Concepts of Ecology, Basics of Species, Biodiversity, Ecosystem, Hydrological Cycle; Chemical Cycles: Carbon, Nitrogen & Phosphorus; Energy Flow in Ecosystems.
Water Pollution: Water Quality standards, Introduction to Treatment & Disposal of Waste Water. Reuse and Saving of Water, Rain Water Harvesting. Solid Waste Management: Classification of Solid Waste, Collection, Transportation and Disposal of Solid. Recycling of Solid Waste: Energy Recovery, Sanitary Landfill, On-Site Sanitation. Air & Noise Pollution: Primary and Secondary air pollutants, Harmful effects of Air Pollution, Control of Air Pollution. . Noise Pollution Harmful Effects of noise pollution, control of noise pollution, Global warming & Climate Change, Ozone depletion, Greenhouse effect
Text Books:
1. Palancharmy, Basic Civil Engineering, McGraw Hill publishers.
2. Satheesh Gopi, Basic Civil Engineering, Pearson Publishers.
3. Ketki Rangwala Dalal, Essentials of Civil Engineering, Charotar Publishing House.
4. BCP, Surveying volume 1
Leveraging Generative AI to Drive Nonprofit Innovation
In this webinar, participants learned how to utilize Generative AI to streamline operations and elevate member engagement. Amazon Web Service experts provided a customer specific use cases and dived into low/no-code tools that are quick and easy to deploy through Amazon Web Service (AWS.)
Recently uploaded (20)
How to Manage Your Lost Opportunities in Odoo 17 CRM
How to Manage Your Lost Opportunities in Odoo 17 CRM
Pengantar Penggunaan Flutter - Dart programming language1.pptx
Pengantar Penggunaan Flutter - Dart programming language1.pptx
Pollock and Snow "DEIA in the Scholarly Landscape, Session One: Setting Expec...
Pollock and Snow "DEIA in the Scholarly Landscape, Session One: Setting Expec...
NEWSPAPERS - QUESTION 1 - REVISION POWERPOINT.pptx
NEWSPAPERS - QUESTION 1 - REVISION POWERPOINT.pptx
Traditional Musical Instruments of Arunachal Pradesh and Uttar Pradesh - RAYH...
Traditional Musical Instruments of Arunachal Pradesh and Uttar Pradesh - RAYH...
ISO/IEC 27001, ISO/IEC 42001, and GDPR: Best Practices for Implementation and...
ISO/IEC 27001, ISO/IEC 42001, and GDPR: Best Practices for Implementation and...
BÀI TẬP DẠY THÊM TIẾNG ANH LỚP 7 CẢ NĂM FRIENDS PLUS SÁCH CHÂN TRỜI SÁNG TẠO ...
BÀI TẬP DẠY THÊM TIẾNG ANH LỚP 7 CẢ NĂM FRIENDS PLUS SÁCH CHÂN TRỜI SÁNG TẠO ...
Liberal Approach to the Study of Indian Politics.pdf
Liberal Approach to the Study of Indian Politics.pdf
spot a liar (Haiqa 146).pptx Technical writhing and presentation skills
spot a liar (Haiqa 146).pptx Technical writhing and presentation skills
How to Create a More Engaging and Human Online Learning Experience
How to Create a More Engaging and Human Online Learning Experience
Chapter wise All Notes of First year Basic Civil Engineering.pptx
Chapter wise All Notes of First year Basic Civil Engineering.pptx
Leveraging Generative AI to Drive Nonprofit Innovation
Leveraging Generative AI to Drive Nonprofit Innovation
Help implement BST- The code must follow the instruction below as well.pdf
- 1. Help implement BST. The code must follow the instruction below as well as produce the correct output when testing with the input file I'll provide at the end. Please fill-in the TODO parts in the bst.cc code: INSTRUCTIONS: 3. First, implement the BST (declared in bst.h) and use the unittest_bst() function to test it. DO NOT CHANGE THIS CODE FOR YOUR SUBMISSION, as it will be used to test your code against the answers (with different seed values). 4. Implement the DB and use the unittest_db() function to test it. DO NOT CHANGE THIS CODE FOR YOUR SUBMISSION, as it will be used to test your code against the answers (with different input files). a) The student ID should be the base class's key member. b) The student ID should be automatically assigned such that the ID/key should be n if the student is the nth student to join the school. If the student later leaves (i.e., deleted from the BST), the ID does NOT get reassigned to another student. Thus, the student ID of the last student to join the school should reflect the TOTAL number of students that have joined this school since its reception (regardless of whether some have left). 5. Test your code against the provided input and output files. a) The provided answer for the BST unit test is in "unittest_ans_t100_s100.txt". The s100 refers to the seed of 100 (-s 100), and t100 refers to the number of elements to add to the BST (-t 100). b) The provided answer for the DB is in "students_1_ans.txt" for the "students_1.txt" input file. 6. Make sure your code has no memory leaks (using valgrind). 7. Your code should work beyond the provided unit tests. That is, even if it does work for all the given tests, if the code has an identifiable bug (i.e., by reading the source code), points WILL be deducted. For example, if I were to change unittest_bst(num_test, seed, cout, 5); -> unittest_bst(num_test, seed, cout, 100); it should still work. BST.H #ifndef BST_H_
- 2. #define BST_H_ #include <iostream> using namespace std; class Node { private: int key; Node* parent; Node* left; Node* right; public: // Default constructor Node(); // Constructor Node(int in); // Destructor // a virtual constructor is required for inheritance virtual ~Node(); // Add to parent of current node void add_parent(Node* in); // Add to left of current node void add_left(Node* in); // Add to right of current node void add_right(Node* in);
- 3. // Get key int get_key(); // Get parent node Node* get_parent(); // Get left node Node* get_left(); // Get right node Node* get_right(); virtual void print_info(ostream& to); }; class BST { private: Node* root; // Walk the subtree from the given node void inorder_walk(Node* in, ostream& to); // Get the minimum node from the subtree of given node Node* get_min(Node* in); // Get the maximum node from the subtree of given node Node* get_max(Node* in); public: // Constructor and Destructor BST(); ~BST();
- 4. // Modify tree void insert_node(Node* in); void delete_node(Node* out); // Find nodes in the tree Node* tree_min(); // minimum key value Node* tree_max(); // maximum key value Node* get_succ(Node* in); // successor for a given node Node* get_pred(Node* in); // predecessor for a given node void walk(ostream& to); // Traverse the tree from min to max recursively Node* tree_search(int search_key); }; #endif COMLPETE THIS PART, BST.CC #include "bst.h" // --------------------------------------- // Node class // Default constructor Node::Node() { // TODO: Implement this } // Constructor Node::Node(int in) { // TODO: Implement this
- 5. } // Destructor Node::~Node() { // TODO: Implement this } // Add parent void Node::add_parent(Node* in) { // TODO: Implement this } // Add to left of current node void Node::add_left(Node* in) { // TODO: Implement this } // Add to right of current node void Node::add_right(Node* in) { // TODO: Implement this } // Get key int Node::get_key() { // TODO: Implement this } // Get parent node
- 6. Node* Node::get_parent() { // TODO: Implement this } // Get left node Node* Node::get_left() { // TODO: Implement this } // Get right node Node* Node::get_right() { // TODO: Implement this } // Print the key to ostream to // Do not change this void Node::print_info(ostream& to) { to << key << endl; } // --------------------------------------- // ---------------------------------------
- 7. // BST class // Walk the subtree from the given node void BST::inorder_walk(Node* in, ostream& to) { // TODO: Implement this } // Constructor BST::BST() { // TODO: Implement this } // Destructor BST::~BST() { // TODO: Implement this } // Insert a node to the subtree void BST::insert_node(Node* in) { // TODO: Implement this } // Delete a node to the subtree void BST::delete_node(Node* out)
- 8. { // TODO: Implement this } // minimum key in the BST Node* BST::tree_min() { // TODO: Implement this } // maximum key in the BST Node* BST::tree_max() { // TODO: Implement this } // Get the minimum node from the subtree of given node Node* BST::get_min(Node* in) { // TODO: Implement this } // Get the maximum node from the subtree of given node Node* BST::get_max(Node* in) { // TODO: Implement this }
- 9. // Get successor of the given node Node* BST::get_succ(Node* in) { // TODO: Implement this } // Get predecessor of the given node Node* BST::get_pred(Node* in) { // TODO: Implement this } // Walk the BST from min to max void BST::walk(ostream& to) { // TODO: Implement this } // Search the tree for a given key Node* BST::tree_search(int search_key) { // TODO: Implement this } // --------------------------------------- INPUT FILE: Noel Cummings 83 Kian Avery 86
- 10. Eliana Knox 77 Paisley Peck 15 Michael Mcgrath 93 Makayla Dixon 35 Mara Singh 86 Aaliyah Arias 92 Hector Nicholson 49 Leo Holder 21 Dangelo Ball 62 Dario Kaufman 27 Brett Ho 90 Jamarcus Castro 59 Sheldon Burnett 63 Van Bautista 26 Gabriel Kelley 40 Kristin Walker 26 Stephany Figueroa 72 Carsen Mullen 36 Wendy Singh 11 Ava Carlson 68 Vaughn Boone 67 Grant Simpson 29 Urijah Oneal 82 Melissa Larson 30 Javier George 62 Roland Walters 23 Brooklyn Mcpherson 67 Cayden Mccarthy 35 Dixie Parrish 29 Jaslyn Hinton 2 Rory Hahn 22 Diamond Lawson 58 Jasper Franco 69 Kendal Wheeler 67 Odin Browning 93 Kenna Benson 56 Reese Walters 11 Thalia Tran 42 Chad Horton 29 Asher Cardenas 73 Angel Finley 21 Charlotte Gray 19 Delilah Hoover 84 Drew Mckenzie 37 Brandon Mahoney 98 Cristian Chandler 24
- 11. Leonel Briggs 15 Gracie Buchanan 70