Program Plan: 1.The below-mentioned variables are used: Two global variables such as k and an array unit[] is declared which is accessed globally. A variable Latin to store the string type of value that is used to store the Latin words. A variable English to store the string type of value that is used to store the English words. Two pointer types of variablesleft and right to store the left and right tree. 2.The below-mentioned functions are used in the program: createNode()function to create the nodes in the tree. inorderTraversal() function to display English words in alphabetical order checkNodee() function to check the English word is present in the tree. addLatinWord()to find the node of which Latin word has to be added. addList() function to add any Latin word at the end of the linked list. insertTree() function to add Latin words. readFile() function to read the content from a file. Program description: To write a program that helps in converting the Latin-English vocabularies stored in the file Latin. Modified Program: // Include the header files #include <stdio.h> #include <string.h> #include <stdlib.h> #include <fstream> #include <iostream> using namespace std; // Declare global variables int k=0; string unit[10]; /* Structure definition for linked list to store the Latin words */ struct LatinWords { // Data part of the node in the linked list string Latin; // Pointer of linked list struct LatinWords *next; }; /* Define a structure for node in a tree to store the English words */ struct Tree_node { // Data part of the node string English; // Linked list to store the equivalent Latin words struct LatinWords *head; // Two pointers of the node struct Tree_node *left,*right; }*root; // Function to create a node in the tree struct Tree_node * createNode(string English, string Latin) { // Create a new node temp of type Tree_node struct Tree_node *temp = new Tree_node(); // Create a new node tmp of type LatinWords struct LatinWords * tmp=new LatinWords(); // Given English word is assigned to temp temp->English=English; // Set left pointer of temp as null temp->left=NULL; // Set the right pointer of temp as null temp->right=NULL; // Given Latin word is assigned to tmp tmp->Latin=Latin; // Set next pointer of tmp as null tmp->next=NULL; // Assign tmp to head of temp node temp->head=tmp; // Return created node return temp; } // Function to check the English word is present in the tree bool checkNode( Tree_node *tree_node, string English ) { // If tree is empty if ( tree_node == NULL ) { // Return false since there is no node return false; } /* If the current node English word is same as that of English word to be searched */ else if ( English == tree_node->English ) { /* Return true since tree contain the searched node */ return true; } /* If the English word to be searched is less than current node English word*/ else if ( English<tree_node->English ) { /* Call the recursive function checkNode() with left subtree as parameter */ return checkNode( tree_node->left, English); } /* If the English word to be searched is equal or greater than current node English word */ else { /* Call the recursive function checkNode() with right subtree as parameter */ return checkNode( tree_node->right, English ); } } // Function to add the Latin words to the linked list void addList(struct LatinWords *head,string Latin) { // Create a new node temp of type LatinWords struct LatinWords * temp=new LatinWords(); // Assign Latin word to temp temp->Latin=Latin; // Set next pointer of temp as null temp->next=NULL; // Declare a ponter and assign head to it struct LatinWords *p=head; // Loop untill the last node while(p->next!=NULL) { // Assign next node to p p=p->next; } // Assign temp to next of p p->next=temp; } /* Function to find the node of which Latin word has to be added */ void addLatinWord(string English,string Latin) { // Declare a pointer p and assign root to it struct Tree_node *p=root; // Loop until all the nodes are traversed while(p) { /* If current node English word is same as that of given English word */ if(p->English==English) { /* Call function addList() and break from the loop */ addList(p->head,Latin); break; } /* If English word to be searched is less than current node English word */ else if (English>English) // Assign left child of p to p p=p->left; /* If English word to be searched is greater than current node English word */ else // Assign right child of p to p p=p->right; } } // Function to insert node in the tree struct Tree_node* insertTree(struct Tree_node* node, string English,string Latin) { // Declare varaiable bool found; // Check given English word is there in the tree found=checkNode(root,English); // If English word is present the tree if(found==true) { /* Call function addLatinWord() to add the Latin word to list */ addLatinWord(English,Latin); // Return the node return node; } // If English word is not present in the tree else { /* Create a new node temp with given English and Latin word */ struct Tree_node * temp=createNode(English,Latin); // If tree is empty assign new node to it if (node == NULL) { // Assign temp to node node=temp; // Return node return node; } /* If English word is less than current node English word */ if (English< node->English) { /* Call recursive function insertTree() with left sub tree as parameter */ node->left = insertTree(node->left, English,Latin); } /* If English word is greater than current node English word */ else /* Call recursive function insertTree() with right sub tree as parameter */ node->right = insertTree(node->right, English,Latin); // Return the node return node; } } // Function to display nodes in the tree in in-order void inorderTraversal(Tree_node *tree_node ) { // If tree is empty if( tree_node == NULL ) // Return return; // Traveres the left subtree of node inorderTraversal( tree_node->left ); // Output the Enhlish word in the node std::cout<English<<" : "; // Decalre a pointer p and assign head of node to it struct LatinWords *p=tree_node->head; // loop all the nodes in linked list while(p->next!=NULL) { // Display the Latin words cout<Latin<<", "; // Assign next node of p to p p=p->next; } // Print the last Latin word cout<Latin<<endl;< p="" style="box-sizing: border-box;"></endl;<> // Traverse the right subtree of the node inorderTraversal( tree_node->right ); } /* Function to read the file and insert each English word into the tree */ void readFile() { // Declare variables string name; ifstreaminfile; string fin1; // Declare variables int i=0,j=0; string line; string latin,english; // Open the input file infile.open("input.txt"); /* Until the file is empty read each line and extract the name of the software and version then assign it to the name*/ while(getline(infile, line)) { // Declare variable string token; // Assign each line to string stream istringstreamiss(line); // Set i equal to 0 i=0; // Split the line based on ":" while (getline(iss,token,':')) { /* If the first chracter is "%" store that word into unit */ if(token[0]=='%') { // Store toke into unit unit[k]=token; /* If it is not first unit then output and empty the tree */ if(j!=0) { // Display the unit cout<<unit[k-1]<<endl;< p="" style="box-sizing: border-box;"></unit[k-1]<<endl;<> /* Display the tree in alphabetical order */ inorderTraversal(root); // Outout new line character cout<<endl<<endl;< p="" style="box-sizing: border-box;"></endl<<endl;<> // Empty the tree root=NULL; } // Increment index of unit array k++; // Set j as 1 j=1; // Break from the loop break; } // If the word is first word , it is latin if(i==0) { // Store the token to latin latin=token; // Set i as 1 i=1; } /* If the word is not the first word, it is English words of Latin */ else { // Assign token to string stream istringstream is(token); // Split the token based on "," while(getline(is,english,',')) { /* Insert the English word along with it's Latin word into tree */ root=insertTree(root,english,latin); } } } } } // Main function definition int main() { // Call function readFile() readFile(); // Display last unit cout<<unit[k-1]<<endl;< p="" style="box-sizing: border-box;"></unit[k-1]<<endl;<> /* Call function inorderTraversal() to display last tree */ inorderTraversal(root); // Pause the output console system("pause"); // Return 0 return 0; } Latin.txt Output: %Unit 5 ancient: antiquus arms: arma be on fire: ardeo before: ante burn: ardeo desire: ardeo gold: aurum golden: aureus in front of: ante of gold: aureus previously: ante weapons: arma %Unit 6 Athens: Athenae and: atque, ac animal: animal dawn: aurora %Unit 7 Asia: Asia love: amo, amor year: annus Explanation: In this code, first of all a binary search tree is defined that contains the English words and a linked list is created that will store the Latin words. Only one node should be there for each English word. After the creation of a tree for a specific word and contents are stored in the output file then that tree will be deleted and the same process will be repeated for next word and so on.

EBK DATA STRUCTURES AND ALGORITHMS IN C

4th Edition

ISBN: 9781285415017

Author: DROZDEK

Publisher: YUZU

See similar textbooks

Videos

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Chapter 6, Problem 5PA

Chapter 6, Problem 8PA

Students have asked these similar questions

Write a C++ program that opens three files (i.e. s1.txt, s2.txt, and s3.txt) and reads the data of three students. Each file contains the student first name and last name separated by a space and the student grades in three subjects as double floating-point numbers on the next line. The program should output the data in table format such that the data of each student is displayed on one line. The data of the students is ordered in the table alphabatically according to their names. The last column in the table contains the average grade of each student. The last row in the table contains the maximum grade in each subject. Notice that the width of the first column in the table is 20 and its is aligned to the left. All remaining columns have width of 7 and their data is aligned to the right. Also Notice, that all the numbers in the table must be displayed with exactly two decimal digits. IMPORTANT NOTES . Do not add any cout statements except for the final outputs as shown in the sample…

In a text file, I have two numbers each line. The numbers are the employee ID and the number of hours the employee work. My goal of this program is to read the both employee ID and the number of hours the employee work and print it out in the main program. If the list of employee id is not in order, sort it in order and still print it out in the main program. Additionally, after printing them out, print out the total number of employees and the total number of hours all the employee work. Write this in java For example File.txt EmployeeID Number of Hours Work 3 12 2 20 1 40 5 20 7 9 In the main program print: EmployeeID Number of Hours Work 1 40 2 20 3 12 5 20 7 9

create a program in C++ that does the extraction and analysis described above except that the tasks shall be made somewhat simpler. The program shall read from a file "inputdata.txt" containing a name and exactly five values of floating point numbers per line in the file. The first line of the file shall contain the name of the person (first and last) that gathered the data i.e. Joe Jones. The second line of the file shall be the first row of data. Your program will process all the lines in the file as described below. As the program reads each row of data, it shall do two things: it shall keep a running sum of the values read for that row, and shall also write the average of that row to a file "averages.txt". The program will continue reading from the file until it reaches the end of the file. This will entail using a "while" loop and the eof() function that is talked about in Chapter 13 of the text book. The person's name is to be read in at one time using "getline" and stored under…

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Solution Summary: The author describes how to write a program that helps in converting the Latin-English vocabularies stored in the file Latin.

Videos

Want to see the full answer?

Chapter 6 Solutions