Can someone help me with this question in C++ and not any other programming language No library functions that leverage hash and maps can be used except to make it all lowercase List sentence(s) with the maximum no. of occurrences of the word "the" in the entire file and also list the corresponding frequency. List sentence(s) with the maximum no. of occurrences of the word "of" in the entire file and also list the corresponding frequency. List sentence(s) with the maximum no. of occurrences of the word "was" in the entire file and also list the corresponding frequency.

C++ help

Write the following function in PYTHON a) display_PHU_summary() takes three input parameters, a 2D-list (similar to database), a dictionary (similar to dict), and an integer for the PHU_ID. Your function must print the following information, the id, name, city, website, and the total number of cases reported at this PHU. If the given PHU_ID is invalid, it should print a message and exit the function. >>> display_PHU_summary(database, dict, 2241) PHU id: 2241 PHU name: Kingston Frontenac and Lennox & Addington Public Health PHU city: Kingston, K7M 1V5 PHU website: www.kflaph.ca Total cases: 1 >>> display_PHU_summary(database, dict, 3895) PHU id: 3895 PHU name: Toronto Public Health PHU city: Toronto, M5B 1W2 PHU website: www.toronto.ca/community-people/health-wellness-care/ Total cases: 2 >>> display_PHU_summary(database, dict, 3800) The PHU Id is invalid

Write a function find_key(input_dict, target_value) that takes as parameters a dictionary and a target value and returns the key in the dictionary that maps to the target value or None if no such key exists. In other words, the function finds the key such that input_dict[key] == target_value. Notes: You may assume that the target_value only appears once in the dictionary and therefore there will be only one key that maps to the target. Hint: You need to iterate over all the keys, as this task is effectively using the dictionary backwards. For example: Test Result test_dictionary = {100:'a', 20:'b', 3:'c', 400:'d'} print(find_key(test_dictionary, 'b')) 20 test_dictionary = {100:'a', 20:'b', 3:'c', 400:'d'} print(find_key(test_dictionary, 'e')) None

When working with enumeration types, such as the arithmetic operators and the stream operators, is it possible to rapidly access operators that are often used, such as the arithmetic operators and the stream operators? Is it conceivable, for instance, to overload these operators in order to arrive at a result that is satisfactory? What are the arguments for and against doing so?

Write a function create_task that creates a dictionary to store the information for a single task. This function takes two parameters: a list with the keys and a list with the corresponding values and returns a dictionary with the provided keys mapping to the corresponding values. In our main program, we will create a list with the keys that allow us to capture: the name of the task (a string) description (a string) due date (a list) priority (an integer) In the main program, create a list called task_fields that stores these keys: task_fields = ["name", "description", "due date", "priority"] Do not hardcode these fields in the function -- they are provided as the argument into the function. Loop over each key to ask the user to input the corresponding information. Assemble it into a new list. Call create_task with these two lists as an input to get the dictionary with the task information. Print the resulting dictionary from the main program. When running the program, you could see...

This exercise asks you to define some functions for manipulating linked structures. You should use the Node and TwoWayNode classes, as defined in this chapter. Create a tester module in the testnode.py file that contains your function definitions and your code for testing them. In the testnode.py file, complete the following: Complete the implementation of the length() function (not len). This function expects a singly linked structure as an argument. Returns the number of items in the structure. To test your program run the main() method in the testnode.py file. Your program's output should look like the following: 0: 0 5: 5

Python

Please written by computer source 16 In this lab, you need to implement a simple linked list using dynamic memory allocation. The structure of node in the linked list has been declared in "lab3.h". Also, the functions of linked list have been declared in "lab3.h" as well. In "main.c", these functions are called. Your work is to finish these function implementations in a separate C source file, and create a makefile which can compile your separate C source file along with "main.c" and "lab3.h". You can follow the comments in "main.c" and "lab3.h" to finish this lab. Please do not change "main.c" and "lab3.h", because your separate C source file will be compiled with these two files posted on BlackBoard. When you test your program, please put "main.c", "lab3.h", your separate C source file and your makefile in the same directory and compile. Code provided: lab3.h #include<stdio.h> #include<stdlib.h> #ifndef LAB3_H #define LAB3_H struct node { int data; struct...

Create a generic function print(ls, n) that prints to standard output the first n elements of list ls. The elements are printed on separate lines. If ls has less than n elements, then the entire list is printed. I attached a picture of what I have so far. I'm having a hard time figuring out how I would make it print a certain number of elements that I specify.

Please just use main.cpp,sequence.cpp and sequence.h. It has provided the sample insert()function. No documentation (commenting) is required for this assignment. This assignment is based on an assignment from "Data Structures and Other Objects Using C++" by Michael Main and Walter Savitch. Use linked lists to implement a Sequence class that stores int values. Specification The specification of the class is below. There are 9 member functions (not counting the big 3) and 2 types to define. The idea behind this class is that there will be an internal iterator, i.e., an iterator that the client cannot access, but that the class itself manages. For example, if we have a Sequence object named s, we would use s.start() to set the iterator to the beginning of the list, and s.advance() to move the iterator to the next node in the list. (I'm making the analogy to iterators as a way to help you understand the point of what we are doing. If trying to think in terms of iterators is confusing,...

Write a struct ‘Student’ that has member variables: (string) first name, (int) age and (double) fee. Create a sorted (in ascending order according to the age) linked list of three instances of the struct Student. The age of the students must be 21, 24 and 27. Write a function to insert the new instances (elements of the linked list), and insert three instance whose member variable have age (i) 20, (ii) 23 and (iii) 29. Write a function to remove the instances from the linked list, and remove the instances whose member variables have age (i) 21 and (ii) 29. Write a function to count the elements of the linked list. Write a function to search the elements from the linked list, and implement the function to search an element whose age is 23. Write a function to print the linked list on the console. Consider the Student struct as defined above. Create a stack of 5objects of the class. Implement the following (i) push an element to the stack (ii) pop an element from the stack (iii) get the...

Complete the function: bool search(vector<int> v, int key). This function searches for value key in vector v and return true if key is found else return false. In C++