logic

Doctor -signature:String -doctorID:int - medicine:Arraylist +Doctor(signature:String,doctorID:int) +PrescribeMedicine():void + salary () +checkRecords():void Medicine Pharmacist -medName:String -startTime:int -dosage :int -endTime:int -date_prescribed:int - medicine:Arraylist +Medicine(medName:String,-dosage :int,date_prescribed:int) +Pharmacist (startTime:int,endTime:int) +checkForConflict():double +confirm_prescription():String +getStartTime():int +getEndTime():int +setStartTime(time:int):void +setEndTime(time1:int).void

c++

Concatenate Map This function will be given a single parameter known as the Map List. The Map List is a list of maps. Your job is to combine all the maps found in the map list into a single map and return it. There are two rules for addingvalues to the map. You must add key-value pairs to the map in the same order they are found in the Map List. If the key already exists, it cannot be overwritten. In other words, if two or more maps have the same key, the key to be added cannot be overwritten by the subsequent maps.   Signature:   public static HashMap<String, Integer> concatenateMap(ArrayList<HashMap<String, Integer>> mapList) Example: INPUT: [{b=55, t=20, f=26, n=87, o=93}, {s=95, f=9, n=11, o=71}, {f=89, n=82, o=29}]OUTPUT: {b=55, s=95, t=20, f=26, n=87, o=93} INPUT: [{v=2, f=80, z=43, k=90, n=43}, {d=41, f=98, y=39, n=83}, {d=12, v=61, y=44, n=30}]OUTPUT: {d=41, v=2, f=80, y=39, z=43, k=90, n=43} INPUT: [{p=79, b=10, g=28, h=21, z=62}, {p=5, g=87, h=38}, {p=29,…

Unique Words Summary Specifications:You are tasked to implement an abstract data type class which takes in a given input file called input.txt, and processes, identifies and sorts all unique word instances found in the file. Sample InputHi hello hi good bye goodbye Bye bye good say Sample OutputBye Hi bye hello hi say The input.txt file is found along with the zip folder where this instructions file also came along with. Note: you are not allowed to use pythonic lists, and its methods and functions, and string methods. However the use of the file handling methods (read readlines and readline) are allowed for this project.

Q3 / create multiple graphs with single call to plot, these statements plot three related functions of x : t1 = 2sinc (x), t2 = sinc (x), and t3 = 0.5sinc (x), in the interval O < x < 2n . The graphs must be contain desired title , axis labels , and annotations , with symbols for color , style , and marker respectively.

main.cc file #include <iostream>#include <memory> #include "train.h" int main() {  // Creates a train, with the locomotive at the front of the train.  // LinkedList diagram:  //   Locomotive -> First Class -> Business Class -> Cafe Car -> Carriage 1 ->  //   Carriage 2  std::shared_ptr<Train> carriage2 = std::make_shared<Train>(100, 100, nullptr);  std::shared_ptr<Train> carriage1 =      std::make_shared<Train>(220, 220, carriage2);  std::shared_ptr<Train> cafe_car =      std::make_shared<Train>(250, 250, carriage1);  std::shared_ptr<Train> business_class =      std::make_shared<Train>(50, 50, cafe_car);  std::shared_ptr<Train> first_class =      std::make_shared<Train>(20, 20, business_class);  std::shared_ptr<Train> locomotive =      std::make_shared<Train>(1, 1, first_class);   std::cout << "Total passengers in the train: ";  // =================== YOUR CODE HERE…

class BinaryImage:       def __init__(self):           pass             def compute_histogram(self, image):           """Computes the histogram of the input image           takes as input:           image: a grey scale image           returns a histogram as a list"""                 hist = [0]*256                 return hist             def find_otsu_threshold(self, hist):           """analyses a histogram it to find the otsu's threshold assuming that the input hstogram is bimodal histogram           takes as input           hist: a bimodal histogram           returns: an optimal threshold value (otsu's threshold)"""                 threshold = 0                 return threshold             def binarize(self, image):           """Comptues the binary image of the the input image based on histogram analysis and thresholding           take as input           image: an grey scale image           returns: a binary image"""                 bin_img = image.copy()                 return…

What function does this Syntax perform? function myMap() {var map Canvas = document.getElementById("map");var mapOptions = {center: new google.maps.LatLng(51.5, -0.2),zoom: 10};var map = new google.maps.Map(mapCanvas, mapOptions);}

Bar Graph, v 1.0 Purpose. The purpose of this lab is to produce a bar graph showing the population growth of a city called Prairieville, California. The bar graph should show the population growth of the city in 20 year increments for the last 100 years. The bar graph should be printed using a loop. The loop can be either a while loop or a for loop. Write a program called cityPopulation Graph.cpp to produce the bar graph. Requirements. 1. Use these population values with their corresponding years: 1922, 2000 people 1942, 5000 people 1962, 6000 people 1982, 9000 people 2002, 14,000 people 2012, 15,000 people 2022, 17,000 people 2. For each year, the program should display the year with a bar consisting of one asterisk for each 1000 people. 3. Each time the loop is performed (that is, each time the loop iterates) one of the year values is displayed with asterisks next to it. That is: 1st time loop is performed/iterates the year 1922 and the correct number of asterisks should be…

Fix an error and show it please?

flip_matrix(mat:list)->list You will be given a single parameter a 2D list (A list with lists within it) this will look like a 2D matrix when printed out, see examples below. Your job is to flip the matrix on its horizontal axis. In other words, flip the matrix horizontally so that the bottom is at top and the top is at the bottom. Return the flipped matrix. To print the matrix to the console:  print('\n'.join([''.join(['{:4}'.format(item) for item in row]) for row in mat])) Example: Matrix:
W R I T X
H D R L G
L K F M V
G I S T C
W N M N F
Expected:
W N M N F
G I S T C
L K F M V
H D R L G
W R I T X Matrix:
L C
S P
Expected:
S P
L C Matrix:
A D J
A Q H
J C I
Expected:
J C I
A Q H
A D J

C++

A map interface's list collection views

Write the definitions of the functions to overload the assignment operator and copy constructor for the class queueType. Also, write a program (in main.cpp) to test these operations.   HEADER FILE FOR queueAsArray.h //Header file QueueAsArray #ifndef H_QueueAsArray #define H_QueueAsArray #include<iostream> #include <cassert> #include "queueADT.h" using namespace std; template <class Type> class queueType: public queueADT<Type> { public: const queueType<Type>& operator=(const queueType<Type>&); //Overload the assignment operator. bool isEmptyQueue() const; //Function to determine whether the queue is empty. //Postcondition: Returns true if the queue is empty, // otherwise returns false. bool isFullQueue() const; //Function to determine whether the queue is full. //Postcondition: Returns true if the queue is full, // otherwise returns false. void initializeQueue(); //Function to initialize the queue to an empty state. //Postcondition:…

# define stemmer functionstemmer = SnowballStemmer('english') # tokenise datatokeniser = TreebankWordTokenizer()tokens = tokeniser.tokenize(data) # define lemmatiserlemmatizer = WordNetLemmatizer() # bag of wordsdef bag_of_words_count(words, word_dict={}):    """ this function takes in a list of words and returns a dictionary         with each word as a key, and the value represents the number of         times that word appeared"""    for word in words:        if word in word_dict.keys():            word_dict[word] += 1        else:            word_dict[word] = 1    return word_dict # remove stopwordstokens_less_stopwords = [word for word in tokens if word not in stopwords.words('english')] # create bag of wordsbag_of_words = bag_of_words_count(tokens_less_stopwords) Use the stemmer and lemmatizer functions (defined in the cells above) from the relevant library to find the stem and lemma of the nth word in the token list. Function Specifications: Should take a list as input and…

A "generic" data structure cannot use a primitive type as its generic type. O True False

Two-dimensional list tictactoe represents a 3x3 tic-tac-toe game board read from input. List tictactoe contains three lists, each representing a row. Each list has three elements representing the three columns on the board. Each element in the tic-tac-toe game board is 'x', 'o', or '-'. If all the elements at column index 0 are 'o', output 'A win at column 0.' Otherwise, output 'No win at column 0.'

Bishops on a binge def safe_squares_bishops(n, bishops): A generalized n-by-n chessboard has been taken over by some bishops, each represented as a tuple (row, column) of the row and the column of the square the bishop stands on. Same as in the earlier version of this problem with rampaging rooks, the rows and columns are numbered from 0 to n - 1. Unlike a chess rook whose moves are axis-aligned, a chess bishop covers all squares that are on the same diagonal with that bishop arbitrarily far into any of the four diagonal compass directions. Given the board size n and the list of bishops on that board, count the number of safe squares that are not covered by any bishop. To determine whether two squares (r1, c1) and (r2, c2) are reachable from each other in one diagonal move, use abs(r1-r2) == abs(c1-c2) to check whether the horizontal distance between those squares equals their vertical distance, which is both necessary and sufficient for the squares to lie on the same diagonal. This…

#include <bits/stdc++.h>#include<unordered_map>#include <string> using namespace std; struct Student{string firstName;string lastName;string studentId;double gpa;}; class MyClass{public:unordered_map<string, int>classHoursInfo;vector<Student> students;unordered_map<string, int> creditValue = {{"A", 4}, {"B", 3}, {"C", 2}, {"D", 1}, {"F", 0}}; void readStudentData(string filepath){cout << "reading student data \n";ifstream inpStream(filepath);string text;string tmp[4];while (getline (inpStream, text)) {string str = "", prevKey = ""; int j= 0;unordered_map<string, int> curStudentClassInfo;for(int i=0; i<text.length(); i++){if(isspace(text[i])){if(j>3){if(prevKey.length()==0){curStudentClassInfo[str] = 0;prevKey = str;str.clear();}else{curStudentClassInfo[prevKey] = creditValue[str];prevKey = "";str.clear();}}else{tmp[j++] = str;str.clear();}}else{str = str+text[i];}}if(str.length() != 0){curStudentClassInfo[prevKey] =…

Q8 Hive Minds: Migrating Birds You again control a single insect, but there are B birds flying along known paths. Specifically, at time t each bird b will be at position (x¿(t), Yb(t)). The tuple of bird positions repeats with period T. Birds might move up to 3 squares per time step. An example is shown below, but keep in mind that you should answer for a general instance of the problem, not simply the map and path shown below. Your insect can share squares with birds and it can even hitch a ride on them! On any time step that your insect shares a square with a bird, the insect may either move as normal or move directly to the bird's next location (either action has cost 1, even if the bird travels farther than one square).

using namespace std; class SinglyLinkedListNode { // INSERT YOUR CODE HERE }; class SinglyLinkedList { public: SinglyLinkedListNode *head; SinglyLinkedListNode *tail; SinglyLinkedList() { this->head = nullptr; this->tail = nullptr; } voidinsert_node(intnode_data) { // INSERT YOUR CODE HERE } }; void free_singly_linked_list(SinglyLinkedListNode* node) { // INSERT YOUR CODE HERE } // Complete the has_cycle function below. /* * For your reference: * * SinglyLinkedListNode { * int data; * SinglyLinkedListNode* next; * }; * */ bool has_cycle(SinglyLinkedListNode* head) { SinglyLinkedListNode* temp = head; bool isCycle = false; while (temp != nullptr) { // INSERT YOUR CODE HERE } } int main() { // INSERT YOUR CODE HERE TO TEST YOUR CODE return0; }

using namespace std; class SinglyLinkedListNode { // INSERT YOUR CODE HERE }; class SinglyLinkedList { public: SinglyLinkedListNode *head; SinglyLinkedListNode *tail; SinglyLinkedList() { this->head = nullptr; this->tail = nullptr; } voidinsert_node(intnode_data) { // INSERT YOUR CODE HERE } }; void free_singly_linked_list(SinglyLinkedListNode* node) { // INSERT YOUR CODE HERE } // Complete the has_cycle function below. /* * For your reference: * * SinglyLinkedListNode { * int data; * SinglyLinkedListNode* next; * }; * */ bool has_cycle(SinglyLinkedListNode* head) { SinglyLinkedListNode* temp = head; bool isCycle = false; while (temp != nullptr) { // INSERT YOUR CODE HERE } } int main() { // INSERT YOUR CODE HERE TO TEST YOUR CODE return0; }

Strings all_colors and updated_value are read from input. Perform the following tasks: Split all_colors into tokens using a comma (',') as the separator and assign color_list with the result. Replace the first element in color_list with updated_value.

CONVERT TO USE CASE DIAGRAM

C++ program  Reverse Phone Book you are given map<string,int> object named phone_book. write a program that produces a map<int,set<string>> object from it named reverse_phone_book.The data is that for each phone number, the reverse phone book contains all the names who have that phone number.

String Pair   // Problem Description   // One person hands over the list of digits to Mr. String, But Mr. String understands only strings. Within strings also he understands only vowels. Mr. String needs your help to find the total number of pairs which add up to a certain digit D.       // The rules to calculate digit D are as follow       // Take all digits and convert them into their textual representation       // Next, sum up the number of vowels i.e. {a, e, i, o, u} from all textual representation       // This sum is digit D       // Now, once digit D is known find out all unordered pairs of numbers in input whose sum is equal to D. Refer example section for better understanding.       // Constraints   // 1 <= N <= 100       // 1 <= value of each element in second line of input <= 100       // Number 100, if and when it appears in input should be converted to textual representation as hundred and not as one hundred. Hence number…

True or true: False or true: Map-reduce is just applications.

C Language Title : Tennis Game

dict_graph = {}     # Read the data.txt file with open('data.txt', 'r') as f:     for l in f:         city_a, city_b, p_cost = l.split()         if city_a not in dict_graph:             dict_graph[city_a] = {}         dict_graph[city_a][city_b] = int(p_cost)         if city_b not in dict_graph:             dict_graph[city_b] = {}         dict_graph[city_b][city_a] = int(p_cost)     # Breadth First Search Method def BreadthFirstSearch(graph, src, dst):     q = [(src, [src], 0)]     visited = {src}     while q:         (node, path, cost) = q.pop(0)         for temp in graph[node].keys():             if temp == dst:                 return path + [temp], cost + graph[node][temp]             else:                 if temp not in visited:                     visited.add(temp)                     q.append((temp, path + [temp], cost + graph[node][temp]))     # Depth First Search Method def DepthFirstSearch(graph, src, dst):     stack = [(src, [src], 0)]     visited = {src}     while stack:…

Language is C++

Data structure/ C language /  Graph /  Dijkstra’s algorithm implement a solution of a very common issue: how to get from one town to another using the shortest route.* design a solution that will let you find the shortest paths between two input points in a graph, representing cities and towns, using Dijkstra’s algorithm. Your program should allow the user to enter the input file containing information of roads connecting cities/towns. The program should then construct a graph based on the information provided from the file. The user should then be able to enter pairs of cities/towns and the algorithm should compute the shortest path between the two cities/towns entered.Attached a file containing a list of cities/towns with the following data:Field 1: Vertex ID of the 1st end of the segmentField 2: Vertex ID of the 2nd of the segmentField 3: Name of the townField 4: Distance in Kilometer Please note that all roads are two-ways. Meaning, a record may represent both the roads from…

struct insert_into_hash_table { // Function takes a constant Book as a parameter, inserts that book indexed by // the book's ISBN into a hash table, and returns nothing. void operator()(const Book& book) { ///// /// TO-DO (8) ||||. // Write the lines of code to insert the key (book's ISBN) and value // ("book") pair into "my_hash_table". /// END-TO-DO (8) // } std::unordered_map& my_hash_table; };