Write the code for the function printRoster, it should print out the contacts in a format similar to the example. You can use a range-based for-loop and auto to simplify the solution, if you wish. #include #include #include map> using namespace std; void printRoster(map»& roster) { /i Fill code here int main() { map>> roster; roster["ELCO"]["cS-30"]. emplace_back("Anthony Davis"): roster["ElCo"]["CS-30"]. emplace_back("Talen Horton-Tucker"); roster["ElCo"Ï"BUS-101"].emplace_back("LeBron James"); roster["SMC"Ï¨CHEM-101"j. emplace_back("Russell Westbrook"): printRoster(roster); return 0; Here is the sample output: ELCO BUS-101: LeBron James CS-30: Anthony Davis Talen Horton-Tucker SMC CНEM-101: Russell Westbrook

Write the code for the function printRoster, it should print out the contacts in a format similar to the example. You can use a range-based for-loop and auto to simplify the solution, if you wish. #include #include #include map> using namespace std; void printRoster(map»& roster) { /i Fill code here int main() { map>> roster; roster["ELCO"]["cS-30"]. emplace_back("Anthony Davis"): roster["ElCo"]["CS-30"]. emplace_back("Talen Horton-Tucker"); roster["ElCo"Ï"BUS-101"].emplace_back("LeBron James"); roster["SMC"Ï¨CHEM-101"j. emplace_back("Russell Westbrook"): printRoster(roster); return 0; Here is the sample output: ELCO BUS-101: LeBron James CS-30: Anthony Davis Talen Horton-Tucker SMC CНEM-101: Russell Westbrook

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

Write a user defined function named as “length_list” function that finds the length of a list of list_node_t nodes. This code should fit with the following code.Partial Code: #include <stdio.h> #include <stdlib.h> /* gives access to malloc */ #define SENT -1 typedef struct list_node_s { int digit; struct list_node_s *restp; } list_node_t; list_node_t *get_list(void); int main(void) { list_node_t *x;int y; x=get_list(); printf("%d\n",x->digit); printf("%d\n",x->restp->digit); printf("%d\n",x->restp->restp->digit); // your length_list function should be called from here printf("Length is: %d",y); } /* * Forms a linked list of an input list of integers * terminated by SENT */ list_node_t * get_list(void) { int data; list_node_t *ansp; [20]scanf("%d", &data); if (data == SENT) { ansp = NULL; } else { ansp = (list_node_t *)malloc(sizeof (list_node_t)); ansp->digit = data; ansp->restp = get_list(); } return (ansp);
] ] has_perfect You are to write a function has "perfect (graph)" that takes in a BIPARTITE graph as its input, and then determintes whether or not the graph has a perfect matching. In other words, it will return the Boolean value True if it has one, and False if it does not. After compiling the above cell, you should be able to compile the following cell and obtain the desired outputs. print (has perfect({"A" : ["B", "C"], "B" : ["A", "D"], "C" : ["A", "D"], "D" : ["B", "C"]}), has perfect ( {"A" : ["B"], "B" : ["A", "D", "E"], "C" : ["E"], "D":["B"], "E": ["B","C","F"], "F":["E"]})) This should return True False Python Python
C++ code please: Create a generic functionprint_if(start, stop, condition, out)that prints to output stream out all the elements in the range[start,stop) that satisfy the unary predicate condition. The elements are printed on separate lines. The arguments start and stopare bidirectional iterators. Test your function by printing all the stringsmore than 3 characters long in some vector of strings
JS Write a function named list_concat that has a single parameter. This parameter will be a list/array. The parameter's entries will be strings. Your function needs to return a string. The returned string's value should be the concatention of all of the entries in the parameter with a space after each entry. Sample test cases: list_concat(["single"]) evaluates to "single list_concat(["limit", "break", "ready"]) evaluates to "limit break ready
Exercise 1 Write a function called nested_sum that takes a list of lists of integers and adds up the elements from all of the nested lists. For example: >>> t = [[1, 2], [3], [4, 5, 6]] >>> nested_sum(t) 21
Create a flowchart for this program in c++, #include <iostream>#include <vector> // for vectors#include <algorithm>#include <cmath> // math for function like pow ,sin, log#include <numeric>using std::vector;using namespace std;int main(){ vector <float> x, y;//vector x for x and y for y float x_tmp = -2.5; // initial value of x float my_function(float x); while (x_tmp <= 2.5) // the last value of x { x.push_back(x_tmp); y.push_back(my_function(x_tmp)); // calculate function's value for given x x_tmp += 1;// add step } cout << "my name's khaled , my variant is 21 ," << " my function is y = 0.05 * x^3 + 6sin(3x) + 4 " << endl; cout << "x\t"; for (auto x_tmp1 : x) cout << '\t' << x_tmp1;//printing x values with tops cout << endl; cout << "y\t"; for (auto y_tmp1 : y) cout << '\t' << y_tmp1;//printing y values with tops…
Use iterators to print each element of v separted by spaces. #include <iostream>#include <vector> using namespace std; int main(){vector<int> v = {1, 3, 5}; (.....) }
c++ program please don't use any builtin function
] ] get_nhbr In the cell below, you are to write a function called "get_nhbr(Ist, graph)" that takes in two inputs: a list of vertices and a graph. The function is to return a list that contains the neighborhood of the vertices in 'Ist' (remember that this means you are finding the union of the individual vertices' neighborhoods). + Code + Markdown After compiling the above cell, you should be able to compile the following cell and obtain the desired outputs. print (get_nhbr(["A", "D"], {"A" : ["B"], "B" : ["A", "D", "E"], "C" : ["E"], "D":["B"], "E":["B","C","F"], "F":["E"]}), get_nhbr(["B", "C", "F"], {"A" : ["B"], "B" : ["A", "D", "E"], "C" : ["E"], "D":["B"], "E":["B","C","F"], "F":["E"]})) This should return ["B"] ["A", "D", "E"] Python Python
function [P, A] = rect(L, W) P= 2 (L+ W); A =L*W; end Above function is defined to find perimeter and area of a rectangle. If a rectangle has length 10 mm and width 7 mm then the correct way to get perimeter and area of a given rectangle by executing this function is Select one: a. [A, B] = rect(10, 7) b. rect(7, 10) c. [A, B] = rect(7, 10) d. rect(10, 7)
//main.cpp #include<iostream>#include<cmath>#include<string>#include<cstring>#include<algorithm>#include<list>using namespace std; #include "Dog.h" void popDogs(list<Dog>&); /** Change NOTHING above this line **/ //TODO, overload << operator//here's a startostream& operator<<(ostream& os, Dog& d){ //Insert code here so that when a Dog is output, it is done as: //dogName weighs weight pounds. //Like: //Spot weighs 28 pounds. //Don't forget the period at the end. Do NOT include an endl at the end of the line. os<< d.dogName<< " weighs " << d.weight << " pounds."; return os; } int main(){ //TODO, instantiate list of Dog variable called kennel. list<Dog> kennel; //TODO, call the popDogs function passing the kennel variable declared above popDogs(kennel); //This code will sort the list of Dog using the less-than operator kennel.sort();…
C programming fill in the following code #include "graph.h" #include <stdio.h>#include <stdlib.h> /* initialise an empty graph *//* return pointer to initialised graph */Graph *init_graph(void){} /* release memory for graph */void free_graph(Graph *graph){} /* initialise a vertex *//* return pointer to initialised vertex */Vertex *init_vertex(int id){} /* release memory for initialised vertex */void free_vertex(Vertex *vertex){} /* initialise an edge. *//* return pointer to initialised edge. */Edge *init_edge(void){} /* release memory for initialised edge. */void free_edge(Edge *edge){} /* remove all edges from vertex with id from to vertex with id to from graph. */void remove_edge(Graph *graph, int from, int to){} /* remove all edges from vertex with specified id. */void remove_edges(Graph *graph, int id){} /* output all vertices and edges in graph. *//* each vertex in the graphs should be printed on a new line *//* each vertex should be printed in the following format:…