Assignment-6 (2).docx

•Download as DOCX, PDF•

0 likes•2 views

assignment

$Assignment-6 Data Structures and Algorithms lab Write a program to implement the following recursive functions for Binary Search Tree. You may choose any programming language. Define a class or structure for defining the node structure. Sample One: typedef struct NODE { int data; struct NODE *left, *right; }node; Implement the following recursive functions with the given prototypes: 1.node* insert(node *root, int ele); // Insert an element into the Binary Search Tree 2.node* delete(node *root, int element_to_delete); // Delete a specified element 3.int findheight(node *root); // Find the height of a given node 4.int count_leaf_nodes(node *root); // Count the No. of leaf nodes present in the Tree 5.void inOrderTraversal(node *root); // Inorder Traversal of the Tree 6. node* findMaxElementTree(node *root); // Find the maximum element of the Tree 7. node* findMinimumElement(node *root); // Find the minimum element of the Tree 8.node* search (node *root, int SearchEle); // Search an element 9.node* findkthSmallestElement(node *root, int k); // Find kth Smallest element of the Tree Write a main() and do the following operations in the main() in the order given below: 1. Insert 500, 400, 300, 700, 600, 650, 550, 450, 350, 200, 100, 50, 25, 375, 475 2. Print the inOrder Traversal 3. Delete 25 4. Print the InOrder Traversal 5. Find the Height of 500 (root node) 6. Delete 600 7. Print the InOrder Traversal 8. Delete 350 9. Print the InOrder Traversal 10. Delete 400 11. Print the InOrder Traversal 12. Search 300 13. Search 800 14. Search 75 15. Find the 3rd Smallest element 16. Count the number of leaf nodes and print it 17. Find the height of right subtree of 500 18. Find the maximum element of the Tree 19. Find the minimum element of the Tree$

Similar to Assignment-6 (2).docx

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.

C Assignment Help

Programming Homework Help

C programming. Answer question only in C code Ninth: Deletion with Binary Search Tree (20 points) In the ninth part, you will extend the binary search tree in the eighth part to support the deletion of a node. The deletion of a node is slightly trickier compared to the search and insert in the eighth The deletion is straightforward if the node to be deleted has only one child. You make the parent of the node to be deleted point to that child. In this scenario, special attention must be paid only when the node to be deleted is the root Deleting a node with two children requires some more work. In this case, you must find the minimum element in the right subtree of the node to be deleted. Then you insert that node in the place where the node to be deleted was. This process needs to be repeated to delete the minimum node that was just moved In either case, if the node to be deleted is the root, you must update the pointer to the root to point to the new root node Input format: This program takes a file name as argument from the command line. The file is either blank or contains successive lines of input. Each line contains a character, \'i or \'d\' followed by a tab and an integer. For each line that starts with \'i\', your program should insert that number in the binary search tree if it is not already there. If the line starts with a \'s, your program should search for that value. If the line starts with a \'d\', your program should delete that value from the tree output format: For each line in the input file, your program should print the status/result of the operation. For insert and search, the output is the same as in the Eighth Part: For an insert operation, the program should print either \"inserted\" with a single space followed by a number the height of the inserted mode in the tree, or \"duplicate\" if the value is already present in the tree. The height of the root node is 1. For a search, the program should either print \"present\" followed by the height of the node, or absent\" based on the outcome of the search. For a delete, the program should print \"success or \"fail\" based on the whether the value was present or not. Again, as in the Eight Part, your program should print \"error\" (and nothing else) if the file does not exist or for input lines with improper structure Example Execution: Lets assume we have a file filel.txt with the following contents: i 5 i 3 i 4 i 1 i 6 i 2 s 1 d 3 s 2 Executing the program in the following fashion should produce the output shown below: Solution // C program to demonstrate delete operation in binary search tree #include #include struct node { int key; struct node *left, *right; }; // A utility function to create a new BST node struct node *newNode(int item) { struct node *temp = (struct node *)malloc(sizeof(struct node)); temp->key = item; temp->left = temp->right = NULL; return temp; } // A utility function to do inorder traversal of BST void inorder(struct node *root) { if (root != NULL) .

C programming. Answer question only in C code Ninth Deletion with B.pdf

info309708

Create an implementation of a binary tree using the recursive appr.pdf

federaleyecare

Instructions write a c program to solve the following problem. Upload your source code file to Canvas. The file name must be of the form hwloop your name.c Substitute your first and last name for \"your name\" in the file name. Example: Student\'s name is Sparky Watts. The file name is hwloop sparky watts.c Problem Statement create a program that calculates twelve month\'s interest and principle loan balance. Your program will ask the user for the starting principle balance, annual interest rate, and monthly payment amount. Your program will verify the input is reasonable, as described in the Error checking section below. After obtaining reasonable the program will process 12 months of payments. The will show the accrued interest and updated loan balance after each month\'s payment. The total interest paid and total payment amounts for the 12 month period will also be calculated and displayed. Your program output should resemble the output below. AUsers williidialDesktoplhw04MbinlDebuglhw04.exe Enter loan anount: 32000.00 Enter annual interest rate 7.99 Enter monthly payment 752.84 Solution #include #include int main() { double loan_amount = 0; printf(\"Enter loan amount :\"); if (scanf(\"%lf\", &loan_amount) != 1) { printf(\"Please enter loan amount correctly\ \"); return -1; } if (loan_amount < 500) { printf(\"Loan amount should be greater than 500\ \"); return 1; } if (loan_amount > 100000) { printf(\"Loan amount should be less than 100000\ \"); return -1; } printf(\"Enter annual interest rate: \"); double interest_rate; if (scanf(\"%lf\", &interest_rate) != 1) { printf(\"Please enter interest rate correctly\ \"); return -1; } if (interest_rate < 0 || interest_rate > 8.99) { printf(\"Interest rate should be in range of 0 to 8.99\ \"); return -1; } double monthly_payments; printf(\"Enter monthly payment: \"); if (scanf(\"%lf\", &monthly_payments) != 1) { printf(\"Please monthly payment correctly\ \"); return -1; } double first_month_interest = (loan_amount * interest_rate)/(12*100); if (monthly_payments < first_month_interest) { printf(\"Monthly payment should be greater than %f\ \", first_month_interest); return -1; } double total_interest = 0; double total_paid = 0; printf(\"\ \"); printf(\"Begin \\t\\t\\t\\tMonthly\\tEnd\ \"); printf(\"Loan\\t\\tAccured\\t\\tPayment\\tLoan\ \"); printf(\"Balance\\t\\tInterest\\tAmount\\tBalance\ \"); printf(\"\ \"); int i; for(i = 0; i <= 12; i++) { printf(\"%0.2f\\t\", loan_amount); double interest = (loan_amount*interest_rate)/(1200); printf(\"%0.2f\\t\\t\", interest); printf(\"%0.2f\\t\", monthly_payments); loan_amount = loan_amount + interest; if (loan_amount < monthly_payments) { total_paid -= loan_amount; loan_amount = 0; printf(\"%0.2f\ \", loan_amount); break; } else { loan_amount -= monthly_payments; total_paid += monthly_payments; } printf(\"%0.2f\ \", loan_amount); total_interest += interest; } printf(\"\ \"); printf(\"Annual total\\t%.2f\\t\\t%.2f\ \", total_interest, total_paid); return 0; }.

Please i need help on following program using C++ Language.Add the.pdf

ezzi552

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

[Laporan ai kelas b] 14102055 deprilana ego prakasa_modul 4

Deprilana Ego Prakasa

Chtp412

giovanniveitch

Add these three functions to the class binaryTreeType (provided). Write the definition of the function, nodeCount, that returns the number of nodes in the binary tree. Write the definition of the function, leavesCount, that takes as a parameter a pointer to the root node of a binary tree and returns the number of leaves in a binary tree. Write a function, swapSubtrees, that swaps all of the left and right subtrees of a binary tree. Print the original tree and the resulting tree using a pre-order traversal. Write a program to test your new functions. Use the data provided to build your binary search tree (-999 is the sentinel): (C++) Data: 65 55 22 44 61 19 90 10 78 52 -999 Already completed code is below: //Header File Binary Search Tree #ifndef H_binarySearchTree #define H_binarySearchTree #include \"binaryTree.h\" #include using namespace std; template class bSearchTreeType: public binaryTreeType { public: bool search(const elemType& searchItem) const; //Function to determine if searchItem is in the binary //search tree. //Postcondition: Returns true if searchItem is found in // the binary search tree; otherwise, // returns false. void insert(const elemType& insertItem); //Function to insert insertItem in the binary search tree. //Postcondition: If there is no node in the binary search // tree that has the same info as // insertItem, a node with the info // insertItem is created and inserted in the // binary search tree. void deleteNode(const elemType& deleteItem); //Function to delete deleteItem from the binary search tree //Postcondition: If a node with the same info as deleteItem // is found, it is deleted from the binary // search tree. // If the binary tree is empty or deleteItem // is not in the binary tree, an appropriate // message is printed. private: void deleteFromTree(nodeType* &p); //Function to delete the node to which p points is //deleted from the binary search tree. //Postcondition: The node to which p points is deleted // from the binary search tree. }; template bool bSearchTreeType::search (const elemType& searchItem) const { nodeType *current; bool found = false; if (this->root == NULL) cout << \"Cannot search an empty tree.\" << endl; else { current = this->root; while (current != NULL && !found) { if (current->info == searchItem) found = true; else if (current->info > searchItem) current = current->lLink; else current = current->rLink; }//end while }//end else return found; }//end search template void bSearchTreeType::insert (const elemType& insertItem) { nodeType *current; //pointer to traverse the tree nodeType *trailCurrent; //pointer behind current nodeType *newNode; //pointer to create the node newNode = new nodeType; newNode->info = insertItem; newNode->lLink = NULL; newNode->rLink = NULL; if (this->root == NULL) this->root = newNode; else { current = this->root; while (current != NULL) { trailCurrent = current; if (current->info == insertItem) { cout << \"The item to be inserted is already \"; cout << \"in the t.

Add these three functions to the class binaryTreeType (provided).W.pdf

indiaartz

Required to augment the author's Binary Search Tree (BST) code to support these new operations. Method names below are merely suggestions. (The author’s class is attached separately in the file called “authordoc”. I just built a simple test tree in the author’s main method which can be used to test the various operations. ) 1. AnyType nthElement(int n) -- returns the n-th element (starting from 1) of the in-order traversal of the BST. 2. int rank( AnyType x ) -- returns the "rank" of x. The rank of an element is its position (starting with 1) in an in-order traversal. 3. AnyType median( ) -- returns the median (middle) element in the BST. If the BST contains an even number of elements, returns the smaller of the two medians. 4. boolean isPerfect( ) -- returns true if the BST is a perfect binary tree. 5. boolean isComplete( ) -- returns true if the BST is a complete binary tree. 6. String toString( int nrLevels ) -- generates the level-order output described in the sample output below. Most of these operations could easily be implemented by performing an in-order traversal inside the BST and perhaps placing the results in an ArrayList. However, such a method is extremely inefficient. Instead, we are going to achieve faster performance by "augmenting" the BST nodes. You will add a new private integer data member ("tree size") to the BinaryNode which stores the size of the tree rooted at that node (including the root). You must develop your own algorithms for these operations, but obviously you will use the new tree size data member to guide your search. Think before you code and think recursively! These items cover those topics not addressed elsewhere in the project description. (R) indicates a requirement, (H) indicates a hint, and (N) indicates a note. 1. (R) Although we are only using the BST for integers, the BST must remain a generic class. 2. (R) Duplicate values are not allowed. Attempts to insert a duplicate value should be ignored. 3. (R) Attempts to remove non-existent values should be ignored. 4. (R) From a coding perspective, the easiest way to avoid duplicate insertions or attempting to remove non-existent elements is to first call find( ). However, this technique is NOT permitted for two reasons. Calling find( ) before each insert/remove doubles the running time for these operations and is therefore inefficient. Recusively coding the insert/remove methods to handle these situations is a great learning experience. 5. (R) The level order print (PRINT command) outputs the value of each node, the size of the tree rooted at that node, and the value of the node's parent in that order, inside parenthesis, separated by commas. (node value, tree size, parent value). Since the root has no parent, print NULL for the root's parent value. For readability, separate the levels with a blank line and print no more than 6 node/size/parent values per line. If a level requires multiple lines, use consecutive lines (without a blank line between the ...

Required to augment the authors Binary Search Tree (BST) code to .docx

debishakespeare

Given a newly created Binary Search Tree with the following numerical key input sequence (from left to right): 9, 4, 12, 7, 5, 2, 20, 14, 11, 13, 19, 16, 17, 42, 24 a.) We are asked to add a function Position lowestKey(const Position& v) const to the class SearchTree. Function prototype: Position lowestKey(const Position& v); input argument: position of the starting node in the binary search tree to calculate from. For the whole tree this would be the position for the root of the tree. return value: position of the node having the lowest key value. i. Describe strategy with reasonings and examples to convince that it will work. ii. Implement the function using C++ and show the source code listing. b) We are also asked to add a function Position highestKey(const Position& v) const to the class SearchTree. Function prototype: Position highestKey(const Position& v) const; input argument: position of the node in the binary search tree to calculate from. For the whole tree this would be the position for the root of the tree. return value: position of the node having the highest key value. i. Describe strategy with reasonings and examples to convince that it will work. ii. Implement the function using C++ and show the source code listing. Solution #include #include /* A binary tree node has data, pointer to left child and a pointer to right child */ struct node { int data; struct node* left; struct node* right; }; /* Helper function that allocates a new node with the given data and NULL left and right pointers. */ struct node* newNode(int data) { struct node* node = (struct node*) malloc(sizeof(struct node)); node->data = data; node->left = NULL; node->right = NULL; return(node); } /* Give a binary search tree and a number, inserts a new node with the given number in the correct place in the tree. Returns the new root pointer which the caller should then use (the standard trick to avoid using reference parameters). */ struct node* insert(struct node* node, int data) { /* 1. If the tree is empty, return a new, single node */ if (node == NULL) return(newNode(data)); else { /* 2. Otherwise, recur down the tree */ if (data <= node->data) node->left = insert(node->left, data); else node->right = insert(node->right, data); /* return the (unchanged) node pointer */ return node; } } /* Given a non-empty binary search tree, return the minimum data value found in that tree. Note that the entire tree does not need to be searched. */ int minValue(struct node* node) { struct node* current = node; /* loop down to find the leftmost leaf */ while (current->left != NULL) { current = current->left; } return(current->data); } /* Driver program to test sameTree function*/ int main() { struct node* root = NULL; root = insert(root, 4); insert(root, 2); insert(root, 1); insert(root, 3); insert(root, 6); insert(root, 5); printf(\"\ Minimum value in BST is %d\", minValue(root)); getchar(); return 0; } #include #include /* A binary tree node has data, pointer to left child .

Given a newly created Binary Search Tree with the following numerica.pdf

hadpadrrajeshh

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 */.

write recursive function that calculates and returns the length of a.pdf

arpitcomputronics

COMP2710: Software Construction - Linked list exercises

Xiao Qin

IT6801-Service Oriented Architecture-Unit-2-notes

Ramco Institute of Technology, Rajapalayam, Tamilnadu, India

Assignment is : \"Page 349-350 #4 and #5 Use the \"Linked List lab\" you have been working on in class and add the two functions the questions are asking you to develop: divideMid and divideAt. Be sure to include comments Use meaningful identifier names (constants where appropriate) Do not work together; no two people should have identical work!?!? Turn in .cpp file AND Turn in a \"print- screen\' of your output (press \"print-screen\' on keyboard, then \'paste\' in MS-Word)\" How do you solve QUESTION #5 in the book data structures using c++ by D.S. Malik in Visiual Studios using the linked list below with what is being asked? Please need help Linked list : #include #include using namespace std; struct nodeType { int info; nodeType *link; }; void createList(nodeType*& first, nodeType*& last); void printList(nodeType*& first); void insertFront(nodeType*& first); void insertBack(nodeType*& last); void deleteFirst(nodeType*& first); void deleteLast(nodeType*& last, nodeType* first); int main() { nodeType *first, *last; int num; createList(first, last); int choice; while(true) { cout<<\"1. Insert Front.\ 2. Insert Last.\ 3. Delete Front.\ 4. Delete Last.\ 5. Print List.\ 6. Exit.\ \"; cout<<\"Enter your choice: \"; cin>>choice; switch(choice) { case 1: insertFront(first); break; case 2: insertBack(last); break; case 3: deleteFirst(first); break; case 4: deleteLast(last, first); break; case 5: printList(first); break; case 6: return 0; default: cout<<\"Invalid menu option. Try again.\"<>number; while (number != -999) { newNode = new nodeType; // create new node newNode->info = number; newNode->link = NULL; if (first == NULL) { first = newNode; last = newNode; } else { last->link = newNode; last = newNode; } cout<<\"Enter an integer (-999 to stop): \"; cin>>number; } // end of while-loop } // end of build list function void deleteFirst(nodeType*& first) { nodeType *temp; temp= first; first= temp->link; delete temp; return; } void deleteLast(nodeType*& last, nodeType* current) { nodeType *temp; while(current->link != NULL) { temp=current; current=current->link; } temp=last; current->link=NULL; delete temp; last = current; return; } void insertFront(nodeType*& front) { int num; cout<<\"\ Enter the number to insert: \"; cin>>num; nodeType *newNode = new nodeType; newNode->info=num; newNode->link= front; front= newNode; return; } void insertBack(nodeType*& last) { int num; cout<<\"\ Enter the number to insert: \"; cin>>num; nodeType *newNode = new nodeType; newNode->info=num; newNode->link= NULL; last->link= newNode; last = newNode; return; } void printList(nodeType*& first) { cout<<\"Inside printList...printing linked list...\ \"<info << \" \"; current = current->link; } cout< #include using namespace std; struct nodeType { int info; nodeType *link; }; void createList(nodeType*& first, nodeType*& last); void printList(nodeType*& first); void insertFront(nodeType*& first); void insertBack(nodeType*& last); void deleteFirst(nodeType*& first); void dele.

Assignment is Page 349-350 #4 and #5 Use the Linked Lis.pdf

formicreation

The TCP/IP Stack in the Linux Kernel

Divye Kapoor

Data Structures_Linked List

ThenmozhiK5

Page Cache in Linux 2.6.pdf

ycelgemici1

Write a program in Java to implement the ADT Binary Tree part of whose definition is given below. You are also to write a driver program that demonstrates the correctness of your implementation by way of taking a series of commands from a text file and carrying them out. In each binary tree that you will deal with, the values are distinct (i.e. there are no duplicates). Note: Code for binary tree that I discussed in class is available on Isidore. Feel free to use it but you will assume responsibility for the correctness. The ADT Binary Tree The only (private) data member you can use is root, as given below. However, feel free to use as many private member functions as you need. /* Class BinaryTree */ public class BinaryTree> { /* Class BinaryNode */ static private class BinaryNode> { T BinaryNode BinaryNode element; // data part left; // left child right; // right child // Add appropriate constructors for BinaryNode } // end of BinaryNode private BinaryNode root; // root of the tree private final int LCHILD = 1; // constant for left child private final int RCHILD = 2; // constant for right child // constructor for BinaryTree public BinaryTree() { root = null; // construct an empty tree } // Below are the methods that you must implement // // Create a tree with the given item as the root with its // subtrees being empty. // Post: Previous value of the tree is lost. // public void insertRoot (T item) // If node containing parent exists, and if the specified // child is absent, create the specified child of parent // with item as data element and return true; otherwise // return false. // // Pre: data items in the tree are distinct, i.e., no duplicates. // item, if it can be successfully inserted, is different from // each value in the tree. // Post: if insertion were successful, item is the specified child of // parent. // Parameters: // item: data item to be inserted // parent: data item of the potential parent // child == 1 => item is to be inserted as left child of parent // child == 2 => item is to be inserted as right child of parent // Return Value: // true, if insertion succeeded, and false otherwise. public boolean insertItem (T item, T parent, int child) // Print the tree contents in inorder to the stream // associated with the printwriter output public void printTree(PrintWriter output) // Returns true if val1 exists, val2 exists, and they are // siblings; otherwise, returns false public boolean siblings (T val1, T val2) // print to the given printwriter the frontier of the tree, // i.e., all the leaves in a "right to left reading of the // leaves” order; consecutive items are separated by a space public void printFrontier (PrintWriter output) // delete subtree rooted at item, if item is present; // otherwise, tree remains unchanged public void deleteSubtree (T item) // Post: if item is present, returns refer.

Write a program in Java to implement the ADT Binary Tree part of who.docx

rochellwa9f

UNIT 3a.pptx

jack881

please navigate to cs112 webpage and go to assignments --> Trees. This will give you the directions for the assignment. Please do the last 2 methods in huffman.java called encode() and decode() Code is provided below: HuffmanCoding.java package huffman; import java.io.File; import java.io.FileInputStream; import java.io.FileOutputStream; import java.util.ArrayList; import java.util.Collections; /** * This class contains methods which, when used together, perform the * entire Huffman Coding encoding and decoding process * * @author Ishaan Ivaturi * @author Prince Rawal */ public class HuffmanCoding { private String fileName; private ArrayList sortedCharFreqList; private TreeNode huffmanRoot; private String[] encodings; /** * Constructor used by the driver, sets filename * DO NOT EDIT * @param f The file we want to encode */ public HuffmanCoding(String f) { fileName = f; } /** * Reads from filename character by character, and sets sortedCharFreqList * to a new ArrayList of CharFreq objects with frequency > 0, sorted by frequency */ public void makeSortedList() { StdIn.setFile(fileName); /* Your code goes here */ } /** * Uses sortedCharFreqList to build a huffman coding tree, and stores its root * in huffmanRoot */ public void makeTree() { /* Your code goes here */ } /** * Uses huffmanRoot to create a string array of size 128, where each * index in the array contains that ASCII character's bitstring encoding. Characters not * present in the huffman coding tree should have their spots in the array left null. * Set encodings to this array. */ public void makeEncodings() { /* Your code goes here */ } /** * Using encodings and filename, this method makes use of the writeBitString method * to write the final encoding of 1's and 0's to the encoded file. * * @param encodedFile The file name into which the text file is to be encoded */ public void encode(String encodedFile) { StdIn.setFile(fileName); /* Your code goes here */ } /** * Writes a given string of 1's and 0's to the given file byte by byte * and NOT as characters of 1 and 0 which take up 8 bits each * DO NOT EDIT * * @param filename The file to write to (doesn't need to exist yet) * @param bitString The string of 1's and 0's to write to the file in bits */ public static void writeBitString(String filename, String bitString) { byte[] bytes = new byte[bitString.length() / 8 + 1]; int bytesIndex = 0, byteIndex = 0, currentByte = 0; // Pad the string with initial zeroes and then a one in order to bring // its length to a multiple of 8. When reading, the 1 signifies the // end of padding. int padding = 8 - (bitString.length() % 8); String pad = ""; for (int i = 0; i < padding-1; i++) pad = pad + "0"; pad = pad + "1"; bitString = pad + bitString; // For every bit, add it to the right spot in the corresponding byte, // and store bytes in the array when finished for (char c : bitString.toCharArray()) { if (c != '1' && c != '0') { System.out.println("Invalid characters in bitstring"); return; } if (c .

please navigate to cs112 webpage and go to assignments -- Trees. Th.pdf

aioils

Similar to Assignment-6 (2).docx (20)

C Assignment Help

C programming. Answer question only in C code Ninth Deletion with B.pdf

Create an implementation of a binary tree using the recursive appr.pdf

Please i need help on following program using C++ Language.Add the.pdf

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

[Laporan ai kelas b] 14102055 deprilana ego prakasa_modul 4

Chtp412

Add these three functions to the class binaryTreeType (provided).W.pdf

Required to augment the authors Binary Search Tree (BST) code to .docx

Given a newly created Binary Search Tree with the following numerica.pdf

write recursive function that calculates and returns the length of a.pdf

COMP2710: Software Construction - Linked list exercises

IT6801-Service Oriented Architecture-Unit-2-notes

Assignment is Page 349-350 #4 and #5 Use the Linked Lis.pdf

The TCP/IP Stack in the Linux Kernel

Data Structures_Linked List

Page Cache in Linux 2.6.pdf

Write a program in Java to implement the ADT Binary Tree part of who.docx

UNIT 3a.pptx

please navigate to cs112 webpage and go to assignments -- Trees. Th.pdf

Recently uploaded

Instruct Nirmaana 24-Smart and Lean Construction Through Technology.pdf

Er.Sonali Nasikkar

Raashid final report on Embedded Systems

RaashidFaiyazSheikh

Operating System chapter 9 (Virtual Memory)

NareenAsad

Final DBMS Manual (2).pdf final lab manual

BalamuruganV28

Software Engineering Practical File Front Pages.pdf

ssuser5c9d4b1

Diploma Engineering Drawing Qp-2024 Ece .pdf

JNTUA

Explore the revolutionary concept of microkernel architecture in operating systems with this comprehensive presentation. From its inception to its contemporary applications, this PowerPoint provides a deep dive into the essence and significance of microkernels. Covering the following key aspects: Understanding Microkernel Architecture: Delve into the core principles of microkernel design, distinguishing it from monolithic kernels. Learn how microkernels streamline the operating system by delegating essential functions to user-space processes. Advantages of Microkernels: Uncover the myriad benefits of microkernel architecture, including increased system stability, modularity, and flexibility. Explore how microkernels facilitate easier maintenance, extensibility, and customization of operating systems. Challenges and Trade-offs: Navigate through the challenges and trade-offs associated with microkernel design, such as performance overhead and complexity. Gain insights into strategies for mitigating these challenges and optimizing microkernel-based systems. Real-world Implementations: Explore notable examples of operating systems built on microkernel architecture, including GNU Hurd, MINIX, and QNX. Understand how these systems leverage microkernels to achieve specific goals in terms of reliability, security, and real-time performance. Whether you're a budding operating system enthusiast or a seasoned developer exploring alternative system architectures, this PowerPoint presentation offers a comprehensive overview of microkernel technology. Download now and embark on a journey to reimagine the future of operating systems with microkernels.

Microkernel in Operating System | Operating System

Sampad Kar

Dynamo Scripts for Task IDs and Space Naming.pptx

Mustafa Ahmed

analog-vs-digital-communication (concept of analog and digital).pptx

Karpagam Institute of Teechnology

In this study, using the fuzzy logic method, a stress detection tool was created with body temperature and blood pressure parameters as indicators to determine a person's stress level. This tool uses the LM35DZ sensor to detect body temperature, the MPX5100GP sensor to read blood pressure values, and Arduino Uno as a data processor from sensor readings which are then calculated using the fuzzy logic method as a stress level decisionmaker. The resulting output measures blood pressure, body temperature, and the stress level experienced by a person, which will be displayed on the liquid crystal display. Based on the results of testing the body temperature parameter, the highest error generated was 1.17%, and for the blood pressure parameter, the highest error was 2.5% for systole and 0.93% for diastole. Furthermore, testing the stress level displayed on the tool is compared to the depression, anxiety, and stress scales 42 (DASS 42), a psychological stress measuring instrument. From the results of testing the tool with the questionnaire, the average conformity level is 74%.

Fuzzy logic method-based stress detector with blood pressure and body tempera...

IJECEIAES

Research Methodolgy & Intellectual Property Rights Series 2

T.D. Shashikala

Geometric constructions Engineering Drawing.pdf

JNTUA

In this short lecture, I explain the fundamentals of electromagnetic compatibility (EMC), the basic coupling model and coupling paths via cables, electric fields, magnetic fields and wave fields. We also look at electric vehicles as an example of systems with many conducted EMC problems due to power electronic devices such as rectifiers and inverters with non-linear components such as diodes and fast switching components such as MOSFETs or IGBTs. After a brief review of circuit analysis fundamentals and an experimental investigation of the frequency-dependent impedance of resistors, capacitors and inductors, we look at a simple low-pass filter. The transfer function is derived and measured.

Filters for Electromagnetic Compatibility Applications

Mathias Magdowski

electrical installation and maintenance.

benjamincojr

Low Altitude Air Defense (LAAD) Gunner’s Handbook

PeterJack13

Basics of Relay for Engineering Students

kannan348865

According to the World Health Organization (WHO), seventy million individuals worldwide suffer from epilepsy, a neurological disorder. While electroencephalography (EEG) is crucial for diagnosing epilepsy and monitoring the brain activity of epilepsy patients, it requires a specialist to examine all EEG recordings to find epileptic behavior. This procedure needs an experienced doctor, and a precise epilepsy diagnosis is crucial for appropriate treatment. To identify epileptic seizures, this study employed a convolutional neural network (CNN) based on raw scalp EEG signals to discriminate between preictal, ictal, postictal, and interictal segments. The possibility of these characteristics is explored by examining how well timedomain signals work in the detection of epileptic signals using intracranial Freiburg Hospital (FH), scalp Children's Hospital Boston-Massachusetts Institute of Technology (CHB-MIT) databases, and Temple University Hospital (TUH) EEG. To test the viability of this approach, two types of experiments were carried out. Firstly, binary class classification (preictal, ictal, postictal each versus interictal) and four-class classification (interictal versus preictal versus ictal versus postictal). The average accuracy for stage detection using CHB-MIT database was 84.4%, while the Freiburg database's time-domain signals had an accuracy of 79.7% and the highest accuracy of 94.02% for classification in the TUH EEG database when comparing interictal stage to preictal stage.

Seizure stage detection of epileptic seizure using convolutional neural networks

IJECEIAES

Research Methodolgy & Intellectual Property Rights Series 1

T.D. Shashikala

NO1 Best Powerful Vashikaran Specialist Baba Vashikaran Specialist For Love V...

Amil baba

AI in healthcare revolutionizes patient care by enhancing diagnostics, personalizing treatments, and improving operational efficiency. Machine learning algorithms analyze vast medical data to predict diseases, optimize treatment plans, and facilitate early intervention. AI-powered tools like chatbots and virtual assistants streamline administrative tasks, while advanced imaging analysis improves accuracy in detecting conditions like cancer. Integrating AI in healthcare not only accelerates research and drug development but also ensures better patient outcomes and reduced healthcare costs. Embrace the future of medicine with AI, driving innovation and transforming the healthcare landscape for a healthier, smarter tomorrow. https://www.leewayhertz.com/ai-use-cases-in-healthcare/

AI in Healthcare Innovative use cases and applications.pdf

mahaffeycheryld

Recently uploaded (20)

Instruct Nirmaana 24-Smart and Lean Construction Through Technology.pdf

Raashid final report on Embedded Systems

Operating System chapter 9 (Virtual Memory)

Final DBMS Manual (2).pdf final lab manual

Software Engineering Practical File Front Pages.pdf

Diploma Engineering Drawing Qp-2024 Ece .pdf

Microkernel in Operating System | Operating System

Dynamo Scripts for Task IDs and Space Naming.pptx

analog-vs-digital-communication (concept of analog and digital).pptx

Fuzzy logic method-based stress detector with blood pressure and body tempera...

Research Methodolgy & Intellectual Property Rights Series 2

Geometric constructions Engineering Drawing.pdf

Filters for Electromagnetic Compatibility Applications

electrical installation and maintenance.

Low Altitude Air Defense (LAAD) Gunner’s Handbook

Basics of Relay for Engineering Students

Seizure stage detection of epileptic seizure using convolutional neural networks

Research Methodolgy & Intellectual Property Rights Series 1

NO1 Best Powerful Vashikaran Specialist Baba Vashikaran Specialist For Love V...

AI in Healthcare Innovative use cases and applications.pdf

Assignment-6 (2).docx

1. Assignment-6 Data Structures and Algorithms lab Write a program to implement the following recursive functions for Binary Search Tree. You may choose any programming language. Define a class or structure for defining the node structure. Sample One: typedef struct NODE { int data; struct NODE *left, *right; }node; Implement the following recursive functions with the given prototypes: 1.node* insert(node *root, int ele); // Insert an element into the Binary Search Tree 2.node* delete(node *root, int element_to_delete); // Delete a specified element 3.int findheight(node *root); // Find the height of a given node 4.int count_leaf_nodes(node *root); // Count the No. of leaf nodes present in the Tree 5.void inOrderTraversal(node *root); // Inorder Traversal of the Tree 6. node* findMaxElementTree(node *root); // Find the maximum element of the Tree 7. node* findMinimumElement(node *root); // Find the minimum element of the Tree 8.node* search (node *root, int SearchEle); // Search an element 9.node* findkthSmallestElement(node *root, int k); // Find kth Smallest element of the Tree Write a main() and do the following operations in the main() in the order given below: 1. Insert 500, 400, 300, 700, 600, 650, 550, 450, 350, 200, 100, 50, 25, 375, 475 2. Print the inOrder Traversal 3. Delete 25 4. Print the InOrder Traversal 5. Find the Height of 500 (root node) 6. Delete 600 7. Print the InOrder Traversal 8. Delete 350 9. Print the InOrder Traversal 10. Delete 400 11. Print the InOrder Traversal 12. Search 300 13. Search 800 14. Search 75 15. Find the 3rd Smallest element 16. Count the number of leaf nodes and print it 17. Find the height of right subtree of 500 18. Find the maximum element of the Tree 19. Find the minimum element of the Tree

Assignment-6 (2).docx

Recommended

Recommended

More Related Content

Similar to Assignment-6 (2).docx

Similar to Assignment-6 (2).docx (20)

Recently uploaded

Recently uploaded (20)

Assignment-6 (2).docx