Hi,BST question I was wondering why my insert function works p.pdf

•

0 likes•2 views

Hi, BST question I was wondering why my insert function works perfectly to insert file data in the tree but doesnt when i insert single one here is my function int BSTInsert(BST *tree, BSTKey key, BSTValue value) { BSTNode *prev = NULL; BSTNode *cur = tree->Root; // // first we search the tree to see if it already contains key: // while (cur != NULL) { if (BSTCompareKeys(key, cur->Key) == 0) // already in tree, failed: return 0; else if (BSTCompareKeys(key, cur->Key) < 0) // smaller, go left: { prev = cur; cur = cur->Left; } else // larger, go right: { prev = cur; cur = cur->Right; } } // // If we get here, tree does not contain key, so insert new node // where we fell out of tree: // BSTNode *T = (BSTNode *)malloc(sizeof(BSTNode)); T->Key = key; T->Value = value; T->Left = NULL; T->Right = NULL; // // link T where we fell out of tree -- after prev: // if (prev == NULL) // tree is empty, insert @ root: { tree->Root = T; } else if (BSTCompareKeys(key, prev->Key) < 0) // smaller, insert to left: { prev->Left = T; } else // larger, insert to right: { prev->Right = T; } tree->Count++; return 1; // success: } here i insert data from file fgets(buf, sizeof(buf), fp); buf[strcspn(buf, \"\ \ \")] = \'\\0\'; token = strtok(buf, \"\\t\"); y=atoi(token); value.Y = y; token=strtok(NULL, \"\ \"); strcpy(x,token); value.X = (char *)malloc((strlen(x) + 1) * sizeof(char)); strcpy(value.X, x); BSTInsert(tree, value.X, value); while (fgets(buf, sizeof(buf), fp) != NULL) { buf[strcspn(buf, \"\ \ \")] = \'\\0\'; token = strtok(buf, \"\\t\"); y=atoi(token); value.Y = y; token=strtok(NULL, \"\ \"); strcpy(x,token); value.X = (char *)malloc((strlen(x) + 1) * sizeof(char)); strcpy(value.X, x); BSTInsert(tree, value.X, value); } here i insert data from keyboard BSTValue value1; long long int weight; char part2[512]; int part2size = sizeof(part2) / sizeof(part2[0]); // // add weight text // scanf(\"%lld %s\", &weight, phrase); fgets(part2, part2size, stdin); part2[strcspn(part2, \"\ \ \")] = \'\\0\'; // strip EOL char(s): strcat(phrase, part2); value1.Y = weight; value1.X = (char *)malloc((strlen(phrase) + 1) * sizeof(char)); strcpy(value1.X, phrase); BSTInsert(tree, value1.X, value1); if(BSTInsert(tree, value1.X, value1)==1){ printf(\"**Added\ \"); } else { printf(\"**Not dded\ \"); } thanks in advance Solution int BSTInsert(BST *tree, BSTKey key, BSTValue value) { BSTNode *prev = NULL; BSTNode *cur = tree->Root; // // first we search the tree to see if it already contains key: // while (cur != NULL) { if (BSTCompareKeys(key, cur->Key) == 0) // already in tree, failed: return 0; else if (BSTCompareKeys(key, cur->Key) < 0) // smaller, go left: { prev = cur; cur = cur->Left; } else // larger, go right: { prev = cur; cur = cur->Right; } } // // If we get here, tree does not contain key, so insert new node // where we fell out of tree: // BSTNode *T = (BSTNode *)malloc(sizeof(BSTNode)); T->Key = key; T->Value = value; T->Left = NULL; T->Right = NULL; // // link T where w.

Education

T->Left = NULL;
T->Right = NULL;
//
// link T where we fell out of tree -- after prev:
//
if (prev == NULL) // tree is empty, insert @ root:
{
tree->Root = T;
}
else if (BSTCompareKeys(key, prev->Key) < 0) // smaller, insert to left:
{
prev->Left = T;
}
else // larger, insert to right:
{
prev->Right = T;
}
tree->Count++;
return 1; // success:
}
here i insert data from file
fgets(buf, sizeof(buf), fp);
buf[strcspn(buf, " ")] = '0';
token = strtok(buf, "t");
y=atoi(token);
value.Y = y;
token=strtok(NULL, " ");
strcpy(x,token);
value.X = (char *)malloc((strlen(x) + 1) * sizeof(char));
strcpy(value.X, x);
BSTInsert(tree, value.X, value);
while (fgets(buf, sizeof(buf), fp) != NULL)
{

buf[strcspn(buf, " ")] = '0';
token = strtok(buf, "t");
y=atoi(token);
value.Y = y;
token=strtok(NULL, " ");
strcpy(x,token);
value.X = (char *)malloc((strlen(x) + 1) * sizeof(char));
strcpy(value.X, x);
BSTInsert(tree, value.X, value);
}
here i insert data from keyboard
BSTValue value1;
long long int weight;
char part2[512];
int part2size = sizeof(part2) / sizeof(part2[0]);
//
// add weight text
//
scanf("%lld %s", &weight, phrase);
fgets(part2, part2size, stdin);
part2[strcspn(part2, " ")] = '0'; // strip EOL char(s):
strcat(phrase, part2);
value1.Y = weight;
value1.X = (char *)malloc((strlen(phrase) + 1) * sizeof(char));
strcpy(value1.X, phrase);
BSTInsert(tree, value1.X, value1);
if(BSTInsert(tree, value1.X, value1)==1){
printf("**Added ");
}
else
{

printf("**Not dded ");
}
thanks in advance
Solution
int BSTInsert(BST *tree, BSTKey key, BSTValue value)
{
BSTNode *prev = NULL;
BSTNode *cur = tree->Root;
//
// first we search the tree to see if it already contains key:
//
while (cur != NULL)
{
if (BSTCompareKeys(key, cur->Key) == 0) // already in tree, failed:
return 0;
else if (BSTCompareKeys(key, cur->Key) < 0) // smaller, go left:
{
prev = cur;
cur = cur->Left;
}
else // larger, go right:
{
prev = cur;
cur = cur->Right;
}
}
//
// If we get here, tree does not contain key, so insert new node
// where we fell out of tree:
//
BSTNode *T = (BSTNode *)malloc(sizeof(BSTNode));
T->Key = key;
T->Value = value;
T->Left = NULL;

T->Right = NULL;
//
// link T where we fell out of tree -- after prev:
//
if (prev == NULL) // tree is empty, insert @ root:
{
tree->Root = T;
}
else if (BSTCompareKeys(key, prev->Key) < 0) // smaller, insert to left:
{
prev->Left = T;
}
else // larger, insert to right:
{
prev->Right = T;
}
tree->Count++;
return 1; // success:
}
here i insert data from file
fgets(buf, sizeof(buf), fp);
buf[strcspn(buf, " ")] = '0';
token = strtok(buf, "t");
y=atoi(token);
value.Y = y;
token=strtok(NULL, " ");
strcpy(x,token);
value.X = (char *)malloc((strlen(x) + 1) * sizeof(char));
strcpy(value.X, x);
BSTInsert(tree, value.X, value);
while (fgets(buf, sizeof(buf), fp) != NULL)
{
buf[strcspn(buf, " ")] = '0';

token = strtok(buf, "t");
y=atoi(token);
value.Y = y;
token=strtok(NULL, " ");
strcpy(x,token);
value.X = (char *)malloc((strlen(x) + 1) * sizeof(char));
strcpy(value.X, x);
BSTInsert(tree, value.X, value);
}
here i insert data from keyboard
BSTValue value1;
long long int weight;
char part2[512];
int part2size = sizeof(part2) / sizeof(part2[0]);
//
// add weight text
//
scanf("%lld %s", &weight, phrase);
fgets(part2, part2size, stdin);
part2[strcspn(part2, " ")] = '0'; // strip EOL char(s):
strcat(phrase, part2);
value1.Y = weight;
value1.X = (char *)malloc((strlen(phrase) + 1) * sizeof(char));
strcpy(value1.X, phrase);
BSTInsert(tree, value1.X, value1);
if(BSTInsert(tree, value1.X, value1)==1){
printf("**Added ");
}
else
{
printf("**Not dded ");

Similar to Hi,BST question I was wondering why my insert function works p.pdf

I need to fill-in //TODO\'s in .cpp file and in .h file Could someone help me at least with few of them to give me an idea how deal with it. ***SinglyLinkedList.cpp #include #include #include \"SinglyLinkedList.h\" void test_constructor() { SinglyLinkedList lst = {100, 200, 300, 400, 500}; assert(*lst.at(0) == 100); assert(*lst.at(1) == 200); assert(*lst.at(2) == 300); assert(*lst.at(3) == 400); assert(*lst.at(4) == 500); assert(lst.size() == 5); } void test_remove() { SinglyLinkedList lst = {100, 200, 300, 400, 500}; lst.remove(2); assert(*lst.at(0) == 100); assert(*lst.at(1) == 200); assert(*lst.at(2) == 400); assert(*lst.at(3) == 500); assert(lst.size() == 4); } void test_insert() { // TODO } void test_push_back() { // TODO } void test_push_front() { // TODO } void test_append() { // TODO } void test_sum() { // TODO } int main() { test_constructor(); test_remove(); test_insert(); test_push_back(); test_push_front(); test_append(); test_sum(); } ***SinglyLinkedList.h #include #include template class SinglyLinkedList { // Nested class representing the nodes in the list. class SinglyLinkedListNode { public: // The value stored in this node. T value; // The next node in the sequence. SinglyLinkedListNode *next; SinglyLinkedListNode(T value) : value(value), next(nullptr) {} SinglyLinkedListNode(T value, SinglyLinkedListNode *next) : value(value), next(next) {} // Return the size (length) of the linked list. std::size_t size(); }; SinglyLinkedListNode *head; SinglyLinkedListNode *tail; public: // Constructs a new SinglyLinkedList from an initializer_list of type T[]. // This is mostly for convenience, especially when testing. SinglyLinkedList(std::initializer_list items) : head(nullptr), tail(nullptr) { if (items.size() == 0) { return; } // initializer_lists were designed to be used iteratively, // so thats what we do. // Can you think of how to write this recursively? auto it = items.begin(); while (it != items.end()) { this->push_back(*it++); } } // Return a pointer to the value at the given index. // If the index is larger than the size of the list, // return a nullptr. // // ASIDE: We will cover exceptions later. T* at(std::size_t i); // Pushes a new node onto the back of the list. void push_back(T value); // Pushes a new node onto the front of the list. void push_front(T value); // Return the size (length) of the linked list. std::size_t size(); // Remove the specified node from the list. void remove(std::size_t i); // Insert the value at the index. void insert(std::size_t i, T value); // Append the given list to this one. void append(SinglyLinkedList list); }; template T* SinglyLinkedList::at(std::size_t i) { // TODO } template void SinglyLinkedList::push_back(T value) { // TODO // Make sure that this is a O(1) operation! } template void SinglyLinkedList::push_front(T value) { // TODO // Make sure that this is a O(1) operation! } template void SinglyLinkedList::remove(std::size_t i) { // TODO // Don\'t forget to not only unlink the node, b.

I need to fill-in TODOs in .cpp file and in .h file Could some.pdf

forladies

Tree Traversals A tree traversal is the process of "visiting" each node of a tree in some particular order. For a binary search tree, we can talk about an inorder traversal and a preorder traversal. For this assignment you are to implement both of these traversals in the code that was started in class. File bstree.h contains the BSTree class that was developed during class (with the addition of comments which were omitted by your instructor due to time constraints). The class contains two inorder functions, one public and one private, and two preorder functions, also one public and one private. As was the case with other functions implemented for this class, the public versions of these functions simply call the private versions passing the root node (pointer) as a parameter. The private versions carry out their actions on the subtree rooted at the given node. The code provided in bstree.h is missing the implementations for the private inorder and preorder functions. The coding part of this assignment is to implement these two functions. When completed, the test program provided should produce the following output: Values stored in the tree are: bird cat deer dog giraffe groundhog horse snake turtle The structure of the tree is as follows: dog -bird --cat ---deer -turtle --giraffe ---snake ----groundhog -----horse Copied! Written Part In addition to the coding noted above, give an analysis of all public member functions of the class, including all constructors, the destructor, and the overload of the assignment operator. For your analysis you may assume a well-balanced tree (whereas a lopsided tree might lead to a different analysis). bstree.h #pragma once // A Binary Search Tree implementation. template <typename T> class BSTree { private: // A node in the tree. Each node has pointers to its left and right nodes // as well as its parent. When a node is created, the parent and data item // must be provided. class node { public: T data; node* left; node* right; node* parent; node (const T& d, node* p) { parent = p; data = d; left = right = nullptr; } }; // Pointer to the root node. Initially this is null for an empty tree. node* root; // Copy the subtree of another BSTree object into this object. Used by // the copy constructor and assignment operator. void copy (node* p) { if (p) { // If p points to a node... insert(p->data); // Insert data item copy(p->left); // Copy the left subtree copy(p->right); // Copy the right subtree } } // Destroy a node and all nodes in both subtrees. Called by the // destructor. void destroy (node* p) { if (p) { // If p is not null... destroy(p->left); // Destroy the left subtree destroy(p->right); // Destroy the right subtree delete p; // Destroy the node } } // Helper function to determine if a data value is contained in the tree. // Takes the data value being searched and a pointer to the node in the // tree. Returns pointer to node in which data item is found, a null // pointer otherwise. node* find (const T& .

Tree Traversals A tree traversal is the process of visiting.pdf

ajayadinathcomputers

1)(JAVA) Extend the Binary Search Tree ADT to include a public method leafCount that returns the number of leaf nodes in the tree. Thank You in Advanced. Below, I also have attached the BinarySearchTree and the Interface File. BinarySearchTree: //---------------------------------------------------------------------------- // BinarySearchTree.java by Dale/Joyce/Weems Chapter 8 // // Defines all constructs for a reference-based BST //---------------------------------------------------------------------------- package ch08.trees; import ch05.queues.*; import ch03.stacks.*; import support.BSTNode; public class BinarySearchTree> implements BSTInterface { protected BSTNode root; // reference to the root of this BST boolean found; // used by remove // for traversals protected LinkedUnbndQueue inOrderQueue; // queue of info protected LinkedUnbndQueue preOrderQueue; // queue of info protected LinkedUnbndQueue postOrderQueue; // queue of info public BinarySearchTree() // Creates an empty BST object. { root = null; } public boolean isEmpty() // Returns true if this BST is empty; otherwise, returns false. { return (root == null); } private int recSize(BSTNode tree) // Returns the number of elements in tree. { if (tree == null) return 0; else return recSize(tree.getLeft()) + recSize(tree.getRight()) + 1; } public int size() // Returns the number of elements in this BST. { return recSize(root); } public int size2() // Returns the number of elements in this BST. { int count = 0; if (root != null) { LinkedStack> hold = new LinkedStack>(); BSTNode currNode; hold.push(root); while (!hold.isEmpty()) { currNode = hold.top(); hold.pop(); count++; if (currNode.getLeft() != null) hold.push(currNode.getLeft()); if (currNode.getRight() != null) hold.push(currNode.getRight()); } } return count; } private boolean recContains(T element, BSTNode tree) // Returns true if tree contains an element e such that // e.compareTo(element) == 0; otherwise, returns false. { if (tree == null) return false; // element is not found else if (element.compareTo(tree.getInfo()) < 0) return recContains(element, tree.getLeft()); // Search left subtree else if (element.compareTo(tree.getInfo()) > 0) return recContains(element, tree.getRight()); // Search right subtree else return true; // element is found } public boolean contains (T element) // Returns true if this BST contains an element e such that // e.compareTo(element) == 0; otherwise, returns false. { return recContains(element, root); } private T recGet(T element, BSTNode tree) // Returns an element e from tree such that e.compareTo(element) == 0; // if no such element exists, returns null. { if (tree == null) return null; // element is not found else if (element.compareTo(tree.getInfo()) < 0) return recGet(element, tree.getLeft()); // get from left subtree else if (element.compareTo(tree.getInfo()) > 0) return recGet(element, tree.getRight()); // get from right subtree else return tree.getInfo(); // element is found } public T get(T.

1)(JAVA) Extend the Binary Search Tree ADT to include a public metho.pdf

petercoiffeur18

Hash table and heaps

Katang Isip

Add to BST.java a method height() that computes the height of the tree. Develop two implementations: a recursive method (which takes linear time and space proportional to the height), and method like size() that adds a field to each node in the tree (and takes linear space and constant time per query) Solution Answer: /*BST.java a method height() that computes the height of the tree. Developing two implementations: a recursive method, and method like size() that adds a field to each node in the tree **/ public class SplayBST, Value> { private Node root; // root of the BST // BST helper node data type private class Node { private Key key; // key private Value value; // associated data private Node left, right; // left and right subtrees public Node(Key key, Value value) { this.key = key; this.value = value; } } public boolean contains(Key key) { return get(key) != null; } // return value associated with the given key // if no such value, return null public Value get(Key key) { root = splay(root, key); int cmp = key.compareTo(root.key); if (cmp == 0) return root.value; else return null; } /* * Splay tree insertion. **/ public void put(Key key, Value value) { // splay key to root if (root == null) { root = new Node(key, value); return; } root = splay(root, key); int cmp = key.compareTo(root.key); // Insert new node at root if (cmp < 0) { Node n = new Node(key, value); n.left = root.left; n.right = root; root.left = null; root = n; } // Insert new node at root else if (cmp > 0) { Node n = new Node(key, value); n.right = root.right; n.left = root; root.right = null; root = n; } // It was a duplicate key. Simply replace the value else { root.value = value; } } /* * Splay tree deletion. **/ /* *This splays the key, then does a slightly modified Hibbard deletion on the root (if it is the node to be deleted, if it is not, the key was not in the tree). *The modification is that rather than swapping the root (call it node A) with its successor, it\'s successor (call it Node B) is moved to the root position *by splaying for the deletion key in A\'s right subtree. Finally, A\'s right child is made the new root\'s right child. */ public void remove(Key key) { if (root == null) return; // empty tree root = splay(root, key); int cmp = key.compareTo(root.key); if (cmp == 0) { if (root.left == null) { root = root.right; } else { Node x = root.right; root = root.left; splay(root, key); root.right = x; } } // else: it wasn\'t in the tree to remove } /* * Splay tree function. **/ // splay key in the tree rooted at Node h. If a node with that key exists, // it is splayed to the root of the tree. If it does not, the last node // along the search path for the key is splayed to the root. private Node splay(Node h, Key key) { if (h == null) return null; int cmp1 = key.compareTo(h.key); if (cmp1 < 0) { // key not in tree, so we\'re done if (h.left == null) { return h; } int cmp2 = key.compareTo(h.left.key); if (cmp2 < 0) { h.left.left = splay(h.left.left, key); h = rot.

Add to BST.java a method height() that computes the height of the tr.pdf

flashfashioncasualwe

1. Add a breadth-first (level-order) traversal function to the binar.pdf

arjuncp10

(C++ exercise) 1.Implement a circular, doubly linked list with a has.docx

ajoy21

Similar to Hi,BST question I was wondering why my insert function works p.pdf (7)

I need to fill-in TODOs in .cpp file and in .h file Could some.pdf

Tree Traversals A tree traversal is the process of visiting.pdf

1)(JAVA) Extend the Binary Search Tree ADT to include a public metho.pdf

Hash table and heaps

Add to BST.java a method height() that computes the height of the tr.pdf

1. Add a breadth-first (level-order) traversal function to the binar.pdf

(C++ exercise) 1.Implement a circular, doubly linked list with a has.docx

More from venkatesh24685

java programming 5th edition chapter 8 user defined classes and ADTs use with strings. 1. Write the definition of a class called SwimmingPool, to implement the properties of a swimming pool. instance variables: length (in feet) width (in feet) depth (in feet) fillRate (rate at which water fills pool in gallons per minute) drainRate (rate at which water drains from pool in gallons per minute) currentGallons (current number of gallons to fill the pool) totalGallons (number of gallons to fill the pool) Constructor methods: default constructor values constructor Member methods: separate \'set\' methods for all instance variables, except totalGallons, which will always be calculated separate \'get\' methods for all instance variables Determine number of gallons the pool will hold (hint: the total gallons a rectangular pool will hold is the pool\'s volume * 7.5) The time needed to completely fill the pool (based on the current gallons) The time needed to completely drain the pool (based on the current gallons) Modify the gallons if water is added or drained for a specific number of minutes Output the values of all instance variables 2. Create a client that will do each of the following: Instantiate a pool1 object with the default constructor. Instantiate a pool2 object with the values constructor, use length = 16, width = 32, depth = 4.5, fillRate = 4, drainRate = 8, and currentGallons = 12000. Use the output method to print all attribute values for both pools. Use the set methods to assign length = 20, width = 40, depth = 5.5, fillrate = 4.5, drainrate = 10, and currentGallons = 25000 to pool1\'s attributes. Calculate the totalGallons for pool1 and pool2. Use the output methods to print the attribute\'s values for both pools. Use the member method to calculate the time it will take to completely fill pool1. Use get methods to output the current gallons and additional gallons needed to fill the pool, along with the fill time. Use the member method to calculate the time it will take to completly drain pool2. Use the get method to output the number of gallons along with the drain time. Modify the currentGallons in pool1 if water is added for 5 hours Modify the currentGallons in pool2 if water is drained for 10 hours Use the output methods to print the attribute\'s values for both pools output: Pool 1 - Swimming Pool Attributes Length: 0.0 feet Width: 0.0 feet Depth: 0.0 feet Fill rate: 0.0 gallons/minute Drain rate: 0.0 gallons/minute Current gallons: 0.0 gallons Total capacity: 0.0 gallons Pool 2 - Swimming Pool Attributes: Length: 16.0 feet Width: 32.0 feet Depth: 4.5 feet Fill rate:4.0 gallons/minute Drain rate: 8.0 gallons/minute Current gallons: 12000.0 gallons Total capacity: 0.0 gallons Pool 1 - Swimming Pool Attributes: Length: 20.0 feet Width: 40.0 feet Depth: 5.5 feet Fill rate: 4.5 gallons/minute Drain rate: 10.0 gallons/minute Current gallons: 25000.0 gallons Total capacity: 33000.0 gallons Pool 2 - Swimming Pool Attributes: Length: 16.0f.

java programming 5th edition chapter 8 user defined classes and ADTs.pdf

venkatesh24685

I need the code for a Java programming project. Allow the user to type in a integer or floating point decimal number. calculate and display the binary equivalent. Use 2’s complement for negative numbers. For floating point numbers use simplified format Solution Answer: import java.io.*; class ComplementProgram { public static void main(String args[]) throws IOException { int read[]=new int[32]; int input1,input2,i=0,carryflag=0,j=0,k=0,m,n; BufferedReader br=new BufferedReader(new InputStreamReader(System.in)); input1=Integer.parseInt(br.readLine()); input2=input1; i=31; while(input1!=0) { read[i]=Math.abs(input1%2); input1=input1/2; i=i-1; } while(i>=0) { read[i]=0; i=i-1; } System.out.println(\"\"); for(k=0;k<32;k++) System.out.print(read[k]); if(input2<0) { for(i=0;i<32;i++) { if(read[i]==1) read[i]=0; else read[i]=1; } carryflag=1; for(i=31;i>=0;i--) { if(read[i]==1 && carryflag==1) { carryflag=1; read[i]=0; } else if(carryflag==1) { read[i]=1; carryflag=0; break; } } } System.out.println(\"\"); if(input2<0) { System.out.println(\"The 2\'s Complement of a positive number is:\"); for(k=0;k<32;k++) System.out.print(read[k]); } else System.out.println(\"For this number there is no 2\'s complement\"); } }.

I need the code for a Java programming project. Allow the user to ty.pdf

venkatesh24685

How each of the main themes of The Fifth Discipline are related to each other ? Solution The five discipline are as follows-system thinking,personal mastery,mental model,building shared vision ,team learning. Each discipline consists of principle ,proposition or concepts.so its hardly matters from where to start.each discipline has its impact on other discipline .each made up of set of tools and practices for building the sustainning leadership nature in organisation..

How each of the main themes of The Fifth Discipline are related to e.pdf

venkatesh24685

Favor Composition does what and how? Solution We know what is inheritance, inheritance is an oops feature, acquiring existing properties form the existing class isknow as inheritance. when a Field’s type is a class, the field will hold a reference to another object, thus creating an association relationship between them. Without getting into the nuances of the difference between simple association, aggregation, and composition, let’s intuitively define composition as when the class uses another object to provide some or all of its functionality. Favor composition over inheritance is a one of the popular object-oriented design principles, which helps to create flexible and maintainable code in Java and other object-oriented languages A super class reference variable can refer to an instance of sub class. By using composition, you don’t get this behavior, but still it offers a lot more to tilde the balance in its side. Inheritance and composition relationships are also referred as IS-A and HAS-A relationships. Favor composition give.

Favor Composition does what and howSolutionWe know what is in.pdf

venkatesh24685

Explain how character displacement can influence the speciation process. Explain how character displacement can influence the speciation process. Solution Disruptive selection leads to sympatric speciation. Sympatric speciation defined as the evolution of novel species with spatial isolation or distribution of the common similar ancestral species without any continental drift of separation that means from the species of same geographical area. In this kind of speciation, we can observe no continental separation for interbreeding between species and thereby no divergence in the resultant species. Disruptive selection predominantly is depending on severe competition between same niches for resource partitioning & character displacement that influence the speciation process. This competition result in sexually reproductive isolation lastly sympatric speciation. Heritability based on predation pressure and allelic frequency to represent the selection and evolutionary change. It has illustrated that the same evolutionary features have associated with normal populations in which a few genetic traits have passed from one generation to another generation based on reproductive fitness and environmental adaptation. It has profoundly found from these simulations that any heritable genetic trait for character displacement, which meticulously increases species biological, phenotypic and reproductive fitness, referred as an “adaptation” acquired by that species to the environment..

Explain how character displacement can influence the speciation p.pdf

venkatesh24685

astronomy One Nineteenth Century observation which convinced many of the existence of at least plant life on Man was the behavior of the polar caps and dark areas. What was this behavior? An attempted invasion during the 1930\'s which was broadcast on the radio. The northern polar cap grows during the northern winter while the dork areas in the northern hemisphere begin to radiate x-ray and radio waves. The polar caps are connected to the dark areas by a network of canal v The dark areas in the northern hemisphere grow during the northern summer as the northern polar cap recedes. Solution D) is the answeer. The planet Mars has two permanent polar ice caps. During a pole\'s winter, it lies in continuous darkness, chilling the surface https://en.wikipedia.org/wiki/Martian_polar_ice_caps.

astronomy One Nineteenth Century observation which convinced many.pdf

venkatesh24685

A) For bipyridine (bipy) determine the maximum number of coordinatio.pdf

venkatesh24685

Describe two (2) attributes of a globally aware Engineer/Engineering Associate. Solution 1. To Express and Exhibit an understanding of Technology Fundamentals and engineering science political, social, and economic evaluations Product lifecycle Phases and its stages (introduction, growth, maturity, and decline) Planning and Impacts of Project on various stakeholder groups (project team members, project promoter, project client, customers, etc.) 2. Acquaring the skill and talent to visualize both critically and productively, to visualize both cooperatively and independently..

Describe two (2) attributes of a globally aware EngineerEngineering.pdf

venkatesh24685

C# This program lets you pick from a choice of 8 items Circle, Squ.pdf

venkatesh24685

“Our communication capabilities have raced ahead of our communication abilities. Our communication is getting worse” Base on the above quotation: 1. Do you find this true in the workplace? 2. Support your claim with examples. Solution Communication Communication is the process of exchanging the thoughts by one person with another person or group of persons. The communication needs to be effective so that the followers can understand it properly and can understand the subject. The communication needs to be in a common language between the speaker and listeners so that both can have effective interaction between them and understand the topic effectively. Effective communication can only make the listener to understand the topic. If the language is inappropriate then the listeners will not be able to understand it properly. If the speaker will not be able to speak properly, then he will not be able to communicate effectively and he will not be able to explain the topic the listeners group. The message or information cannot be transferred without the effective communication between the listeners and the speaker. Effective communication can help to understand the topics in one go; otherwise it will take long time for the learners to understand the topic in absence of proper communication. Communication Capabilities vs Abilities: Our communication capabilities have raced ahead of our communication abilities. Our communication is getting worse” This is the right statement as our communication capabilities means the process of communications improved to an higher level with the help of latest technologies in communications like email, video-calling, voice- calling, animated learning/communicative models, branding and marketing means etc. All these communication processes are improved a large scale. Our communication abilities are reduced to very high level due to lack of proper communications between the people or group of people. Thus people used to communicate less thus their communication abilities are reduced while the way of communication i.e. capabilities improved to a large extent due to advancement in communication technologies. This is a true statement from the workplace point of view. At the work place the communication between the employees and between the manager and employees are reduced. The one of the reason for reduction in communication is due to the reduction in the abilities of communication among employees. Employees are not skilled in communication. This effects the reduction in communication. Examples:.

“Our communication capabilities have raced ahead of our communicatio.pdf

venkatesh24685

18. The density of a noble gas at STP is 1.784 gL. Identify the nobl.pdf

venkatesh24685

You have identified a mutation in E. coli K-12 that causes it to become sensitive to the the antibiotic azithromycin (azi). You sequence the chromosome of the aziS strain and localize the mutation to genX and near the cysABC operon that encodes the only genes required for cysteine biosynthesis (see diagram). In order to study the impact of the genX* mutation in a pathogenic strain, you would like to move this allele into a uropathogenic E. coli (UPEC) strain background. Design a strategy to move your genX* mutation from E. coli K-12 into the UPEC strain using the strains and plasmids described below. Use point form to describe your strategy. Include a description of all conditions used for selections and/or screens and be clear, but brief about how you will carry out each step. Hint: your answer will require the use of transformation, transposition, and transduction and should include a protocol for a genetic screen for a transposon mutant & the use of generalized transduction to move alleles between strains (9 marks): •Suicide plasmid pMUT: plasmid that encodes the transposon Tn5 & ampicillin resistance; can only replicate at 30oC, not 37oC. the Tn5 element contains a gene that confers a kanamycin resistant phenotype (KnR) •E. coli K-12 genX* : E. coli K-12 strain carrying your genX* mutation that confers azithromycin sensitivity •UPEC wild-type strain •Generalized transducing phage P1, which can infect both E. coli K-12 and UPEC (all information is given: need to design an experiment with non-mobilizable/ suicide vectors/ transposons/ selection process etc). UPEC chromosome genX cySA cysB *cySA, B, Care only genes required for biosynthesis of cysteine EC Ampicillin Ori pMUT Tn5 (KnR Solution 1. Transduction and Experimental steps for transduction:- Transduction is the heritable transfer of bacterial DNA from one cell (donor, here it is E Coli K12) to another (recipient, EColi, UPEC) by a bacteriophage. Tansducing bacteriophage particles are formed in donor bacterial cells during phage development. Generalized transducing phage particles carry a random fragment of host chromosomal DNA approximately the same length as P1 DNA. The phage particles completely lack DNA originating from the phage genome and contain instead oly Bacterila DNA sequesnces. New genotypes in the recipient cells result from homoogous recombination, which can lead to the replacement of a recipient gene by an allele acquired from the donor genome via the transducing phage. a. Ecoli K 12 (Host cell) infected by phage b. Host cell DNA broken down into smaller pieces and proteins and phage DNA synthesized c. Bacterial host DNA is packaged in some viral capsids that are released through lysis of bacterial cell. d. Transducing phage with host DNA infest new recipient cell. e. Recombinant new cell contain mixture of donor DNA and its own DNA. 2. Transformation:- It is genetic alteration of a cell resulting from the direct uptake and incorporation of exogenous genetic material fr.

You have identified a mutation in E. coli K-12 that causes it to bec.pdf

venkatesh24685

Why are the EROI values for U.S. ethanol fuel from corn different in the studies performed by Shapouri, et al. (2004), Pimentel and Patzek (2005), and Farrell, et al. (2006)? Explain in terms of input energy and co-product energy. Solution Why are the EROI values for U.S. ethanol fuel from corn different in the studies performed by Shapouri, et al. (2004), Pimentel and Patzek (2005), and Farrell, et al. (2006): Over the past decade there has been considerable debate on corn ethanol, most focused on whether it is a net energy yielder. The argument is generally that “if the Energy Return on Investment (EROI) of corn ethanol is positive then it should be pursued. On one side are Pimentel (2003) and Patzek (2004) who claim that corn ethanol has an EROI below one energy unit returned per energy unit invested, and on the other side are a number of studies claiming that the EROI is positive, reported variously as between 1.08 and 1.45.Even with numerous publications on this issue, disagreement remains as to whether corn ethanol is a net energy yielder. We believe that focus within the literature on whether or not corn ethanol yields a positive net energy gain has diverted attention from more fundamental issues. Following is a brief description of some of these issues: First, none of the major studies of the EROI of corn ethanol account for statistical error within their analysis. Error is associated with all measurements, and we should expect there to be error associated with EROI as well. Yet each of Farrell et al. (2006), Wang et al. (2007), Patzek (2004), Pimentel (2003), and Shapouri et al. (2002) fail to report even general error statistics associated with their calculation of EROI. Considering that the range of published values for the EROI of corn ethanol is so small (from 0.8 to 1.5) one would expect that even a relatively small amount of error could be meaningful. Second, most analyses to date, including those referenced above, use optimal values for corn yield, fertilizer, and irrigation, despite the fact that each of these have large geographical variation. Because of this they fail to represent the variable nature of corn production across space, and by extension the subsequent variability in the EROI of corn ethanol. Our spatial analysis addressed this issue by examining the impacts of the natural geographic variability of corn inputs and yields on the EROI of corn ethanol production within the U.S. We performed four major analyses in this research: The rst was a meta-error analysis, in which we quantied the error associated with the calculation of EROI of corn ethanol based on various estimates of the energy inputs and outputs found in the literature. This analysis was based on the five main studies in corn ethanol: Wang et al. (1997), Shapouri et al. (2002), Pimentel (2003), Patzek (2004), and Farrell et al. (2006). Second was a spatial analysis of the EROI of corn ethanol. Third was a sensitivity analysis; wherein we assess the degre.

Why are the EROI values for U.S. ethanol fuel from corn different in.pdf

venkatesh24685

Which of the following are parts of a bond Choose one or more A. t.pdf

venkatesh24685

When we decide to make something \"compensable\" we assert its value, relative to other factors. For your response, consider the following two questions: 1) As you observe our society what are some of the key compensable factors that affect who gets paid what? 2) Given those factors, what can you surmise/deduce are some of the key assumptions (about work and pay or about society in general) underlying the relative distribution of values? Solution These 10 elements describe the specific job requirements in terms of compensable factors. The primary compensable factors that affects are: 1. Experience- How long should the incumbent have workrd in this job or in closely related jobs to be fully qualified? It is important that the experience be within or outside the organisation. 2. Education- What does the job require in terms of formal schooling, training, certificate or knowledge of a specialized field? 3. Responsibility- Is the employee responsible for the safety of other employees or for the loss or damage to tools, materials or equipement? 4. Complexity of duties- Does the job require the incumbent to show judgement and initiative or to make independent decisions? 5. Supervision received- How closely does the incumbent\'s immediate suoervisor or manager check his or her work? 6. Supervision exercised- How many people does the incumbent\'s supervise, directly or indirectly? 7. Consequences of error- If the incumbent made an error, what dollar loss would be likely to result? 8. Working conditions- Is there anything in the work environment that is unusually hazardous or uncomfortable? 9. Mental, Physical and visual demands- What degree of concentration is required? Are there special physical demands? 10. Confidential data- To what extent is the incumbent responsible for confidential information? To what extent are integrity and discretion important?.

When we decide to make something compensable we assert its value.pdf

venkatesh24685

What is the role of ports for global commerce and why is that roe important? Is our current port infrastructure sufficient? Solution Ports play major role in the global commerce of the country as major imports and exports are done from the port. It is the source of transport for many countries . Heavy material cannot be taken in and out of the country without these ports. The ports are also major part of the economy of the country and employement source. Many people work here and extract their living. The ports of the country are well developed and have every latest technology incorporated and are considered one of the best . However they need to be updated and maintained inorder to continue the effciency..

What is the role of ports for global commerce and why is that roe im.pdf

venkatesh24685

What are the stages of team development? Why is it important for a supervisor to understand these stages? Solution Team can be defined as group of people who work together with a high degree of interdependence in order to complete a task or project. The team will exhibit highest level of performance if they have the same purpose, there is an open communication within the team, members trust each other, create positive working environment, resolve conflict effectively, flexible and adaptable to change and focus on learning new things. The stages of team formation are as follows: - Forming – Storming – Norming – Performing – Adjourning – Effective team development is important for supervisor because: -.

What are the stages of team development Why is it important for a s.pdf

venkatesh24685

Two numbers together add to 300. One number is twice the size of the.pdf

venkatesh24685

This Question 2 Pts The primary goal of financial accounting is to p.pdf

venkatesh24685

The irregularity of innovations and the variability of business profits contribute to the instability of investment expenditures. Solution Answer: Irregularity of innovations: Irregularity of innovations means the highly variable technological process, which contributes the instabilities in the decisions of investment spending. Variability of business profits: This will lead to encourage or discourage investment in the perspective of high or low profits. This makes the instability of investment expenditures. thus, the statement is tru.

The irregularity of innovations and the variability of business prof.pdf

venkatesh24685

More from venkatesh24685 (20)