c++ Use the "natural split" algorithm on the file split.txt and answer the following question: How many elements are in the first list? display first list and second list split file: 200 494 774 644 345 521 61 27 28 584 569 66 857 210 2 211 675 548 596 188 647 671 517 408 475 615 113 731 522 850 17 640 940 556 517 602 935 76 578 880 428 168 394 381 497 247 368 137 138 619 973 895 106 838 45 921 800 681 660 490 427 937 917 786 959 152 604 837 749 684 963 926 963 988 492 385 458 788 7 62 46 932 996 787 634 34 616 71 128 686 578 923 532 933 545 100 224 895 595 342 933 934 797 120 565 495 884 237 648 843 599 157 843 192 279 301 649 382 881 667 178 126 746 44 601 22 52 769 708 991 83 447 786 525 168 328 922 153 367 22 689 834 774 93 110 547 597 644 726 237 20 370 573 391 225 750 897 956 839 951 455 8 509 746 338 576 276 277 341 274 891 723 53 966 271 50 990

c++ Use the "natural split" algorithm on the file split.txt and answer the following question: How many elements are in the first list? display first list and second list split file: 200 494 774 644 345 521 61 27 28 584 569 66 857 210 2 211 675 548 596 188 647 671 517 408 475 615 113 731 522 850 17 640 940 556 517 602 935 76 578 880 428 168 394 381 497 247 368 137 138 619 973 895 106 838 45 921 800 681 660 490 427 937 917 786 959 152 604 837 749 684 963 926 963 988 492 385 458 788 7 62 46 932 996 787 634 34 616 71 128 686 578 923 532 933 545 100 224 895 595 342 933 934 797 120 565 495 884 237 648 843 599 157 843 192 279 301 649 382 881 667 178 126 746 44 601 22 52 769 708 991 83 447 786 525 168 328 922 153 367 22 689 834 774 93 110 547 597 644 726 237 20 370 573 391 225 750 897 956 839 951 455 8 509 746 338 576 276 277 341 274 891 723 53 966 271 50 990

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter17: Linked Lists

Section: Chapter Questions

Problem 16PE

See similar textbooks

Similar questions

In C++, you are going to write a program that implements a doubly linked list. The data must be read from the files and you can put the file names in your program. Letters.txt contains 26 English Letters: Copy the following exactly as it is into own .txt file to test: ABCDEFGHIJKLMNOPQRSTUVWXYZ Sequence.txt contains a list of numbers. Copy the following exactly as is into another .txt file3,-3,19,-19,18,1,-2,3,-18,17,1,-3,-13,14 You need to 1. Create a doubly linked list by reading the 26 letters from Letters.txt. 2. Sequence.txt file contains a sequence of relative letter positions. The initial position is at the beginning of the list which is ‘A’. The first number in the sequence is ‘3’. So the current position will move forward for three steps. Then the first letter to output is ‘D’ and now the current position is at ‘D’ as well. The second number in the sequence is ‘-3’. Then the second letter to output is the third element backward from the current position which is ‘A’. You…
We have to write Code in C language with the help of Linked list That perform following tasks . Search and display the contents of file based on name, age and salary of employees. Sort the data in ascending order based on the name (alphabetical order), age or salaryof employees.Edit the records and write the updated records back on the file.The file is in text mode, the user should be able to save this file (with a different name) in the binary mode.
Modify the following program to read dictionary items from a file and write the inverted dictionary to a file: characters = {'Bugs':['Rabbit', 1940, 'boy'], 'Garfield': ['Cat', 1978, 'boy'], 'Tweety': ['Bird', 1942, 'girl'], 'Sandy': ['Squirrel', 1999, 'female']} print("Printing the original dictionary") print(characters) print("") def invert_dict(characters): inverse = dict() for key in characters: val = characters[key] for list_item in val: if list_item not in inverse: inverse[list_item] = [key] else: inverse[list_item].append(key) return inverse my_invert = invert_dict(characters) print("Printing the inverted dictionary") print(my_invert) Include the following: 1) The input file for your original dictionary (with at least six items).2) The Python program to read from a file, invert the dictionary, and write to a different file.3) The output file for your inverted dictionary.…
JUST ONLY USE <iostream>. Write a program that reads 10 pairs of Cartesian coordinates from a file called "points.txt" and sorts them by increasing x-values, decreasing y-values, and increasing distance from the origin. Use only one sorting routine. Use an enumerated data type to keep track of the field on which the list is being sorted. The number of pairs should be in a global constant c++
The following Python code is a partially written function that attempts to read a file's contents into a dictionary. Fill in the missing code in the make_dictionary function. You do not need to copy any of the existing code. Just write the code that would go in place of "YOUR CODE HERE". def make_dictionary(filename):'''Function -- make_dictionaryCreates a dictionary from a file's contents. Each line in the file is split into a list at commas.If, after splitting, the list contains exactly 2 parts,the first item is added to the dictionary as a keyand the second item is the value. If the providedfile doesn't exist, the message "File doesn'texist" is printed to the terminal and anempty dictionary is returned.Parameter:filename -- The name of the file to open.Returns:A dictionary of the file's contents, if thefile matches the expected format. Otherwise, anempty dictionary is returned.'''contents = {}# YOUR CODE HEREreturn contents Example If the contents of the file passed to the function…
In C++, you are going to write a program that implements a doubly linked list. The data must be read from the files and you can put the file names in your program. With a NEW solution for a like! Letters.txt contains 26 English Letters: Copy the following exactly as it is into own .txt file to test: A B C D E F G H I J K L M N O P Q R S T U V W X Y Z Sequence.txt contains a list of numbers. Copy the following exactly as is into another .txt file 3,-3,19,-19,18,1,-2,3,-18,17,1,-3,-13,14 You need to 1. Create a doubly linked list by reading the 26 letters from Letters.txt. 2. Sequence.txt file contains a sequence of relative letter positions. The initial position is at the beginning of the list which is ‘A’. The first number in the sequence is ‘3’. So the currentp osition will move forward for three steps. Then the first letter to output is ‘D’ and now the current position is at ‘D’ as well. The second number in the sequence is ‘-3’. Then the second letter to output is the third…
C++ ONLY Add the following functions to the linked list. int getSize() -> This function will return the number of elements in the linked-list. This function should work in O(1). For this keep track of a size variable and update it when we insert a new value in the linked-list. int getValue(index) -> This function will return the value present in the input index. If the index is greater or equal to the size of the linked-list return -1. void printReverse() -> This function will print the linked list in reverse order. You don’t need to reverse the linked list. Just need to print it in reverse order. You need to do this recursively. You cannot just take the elements in an array or vector and then print them in reverse order. void swapFirst() -> This function will swap the first two nodes in the linked list. If the linked-list contains less than 2 elements then just do nothing and return. To check your code add the following code in your main function. LinkedList l;…
I'm trying to delete a node after inputting data for 2-3 checks but the node I try to delete remains in the list. How do I fix my deleteCheck() function to run correctly with the rest of my code? Thank you. #include <stdio.h>#include <stdlib.h>// Austin Chong// The core concept of this assignment is to use a linked list in a C program.// 07 March 2020 struct checkNode{int checkNumber;char date[8];char paidTo[100];char description[100];double amount;struct checkNode *head;struct checkNode *next;}; struct checkNode *checkBook = NULL; /* Functions */ void addCheck(){int checkNumber;double amount;char temp;struct checkNode *newCheck = (struct checkNode*) malloc(sizeof(struct checkNode));printf("Please enter the check number: ");scanf("%d", &checkNumber);newCheck -> checkNumber = checkNumber;printf("Please enter the amount: ");scanf("%lf", &amount);newCheck -> amount = amount;printf("Please enter the date: ");scanf("%c", &temp);scanf("%[^\n]", newCheck ->…
JAVA: Use the "natural split" algorithm on the file split.txt and answer the following question: How many elements are in the first list? Split.txt file 200494 774 644 345 521 61 27 28 584 569 66 857 210 2 211 675 548 596 188 647 671 517 408 475 615 113 731 522 850 17 640 940 556 517 602 935 76 578 880 428 168 394 381 497 247 368 137 138 619 973 895 106 838 45 921 800 681 660 490 427 937 917 786 959 152 604 837 749 684 963 926 963 988 492 385 458 788 7 62 46 932 996 787 634 34 616 71 128 686 578 923 532 933 545 100 224 895 595 342 933 934 797 120 565 495 884 237 648 843 599 157 843 192 279 301 649 382 881 667 178 126 746 44 601 22 52 769 708 991 83 447 786 525 168 328 922 153 367 22 689 834 774 93 110 547 597 644 726 237 20 370 573 391 225 750 897 956 839 951 455 8 509 746 338 576 276 277 341 274 891 723 53 966 271 50 990 493 823 833 306 619 461 768 832 736 759 920 451 549 833 911 123 907 225 252 179 177 272 747 859
Please write a full C++ code and name every file The function insert of the class orderedLinkedList does not check if the item to be inserted is already in the list; that is, it does not check for duplicates. Rewrite the definition of the function insert so that before inserting the item, it checks whether the item to be inserted is already in the list. If the item to be inserted is already in the list, the function outputs an appropriate error message. Also, write a program to test your function Also please allow the code to be copied. Don't provide a screenshot
What is the output of the following C++ code? unorderedLinkedList<int> list; unorderedLinkedList<int> copyList; int num; cin >> num; while (num != -999) { if (num % 5 == 0 || num % 5 == 3) list.insertFirst(num); else list.insertLast(num); cin >> num; } list.print(); cout << endl; copyList = list; copyList.deleteNode(78); copyList.deleteNode(35); cout << "Copy List = "; copyList.print(); cout << endl;
The question should be done in C++, please give explanation and running result. 1. For this question, we need to provide more information about where the mismatch of the text file is happening. Write a recursive function called list_mismatched_lines that takes 2 filenames as input arguments and displays to the screen all mismatched lines in those files. This function should use hashing techniques and shall not compare strings to detect mismatch. The signature of this function should be: void list_mismatched_lines(std::string file1, std::string file2); In file1.txt, it contains "My dear C++ class. I hope that you enjoy this assignment. " In file2.txt, it contains "My dear C++ class. I hope that you like this assignment. " Example: Running the following line of code, should print to the screen the mismatched lines only, from both files. list_mismatched_lines(file1, file2); The following output should be seen on the screen: file1.txt: I hope that you enjoy this assignment.file2.txt:…