Write a program calculate the average for 20 student that havethese information. using structureaverag summatiSt_na stage Year depstudydegreesemesO.R.Prog.ArbMathon65.66 65.66 65.66 65.66 65.66 ali12020- 1202165.66 65.66 65.66 65.66 65.66 ahme 12020-20211d.65.66 65.66 65.66 65.66 65.66 abba12020- 12021

#include <iostream>using namespace std; struct Student{ double summation; double…

Answered: Write a program calculate the average…

Engineering

Computer Science

Write a program calculate the average for 20 student that have these information. using structure dogrood otogo Yoar

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 program to build a calculator. Instead of a typical calculator which reads in-order expressions and evaluates them, build a calculator that takes in numbers and assigns the operations to yield the highest value expression. The current operations on the calculator only handle pairs of parentheses, and the operators for addition, subtraction, multiplication, and division. The calculator can rearrange the numbers if it helps find the optimal value. For example, the list:4.0 5.0 3.0 2.0 1.0using the calculator should find the optimal expression yielding the maximum value to be:4.0 * 5.0 * 3.0 * (2.0 + 1.0) = 180Input from the keyboard a list of up to 10 floating-point values from-100000.0to100000.0. Output to the screen a single floating-point value rounded to two decimal places representing the highest value expression that the calculator could create by inserting the symbols( ) + - * /into the given expression. Assume at least one number in the list and only the operators listed…
Analyze the time complexity of this program in big-O notation, assuming the size of L1 is n and the size of L2 is n too public static <AnyType extends Comparable<? super AnyType>>void intersection(List<AnyType> L1, List<AnyType> L2,List<AnyType> Intersect){ ListIterator<AnyType> iterL1 = L1.listIterator();ListIterator<AnyType> iterL2 = L2.listIterator(); AnyType itemL1=null, itemL2=null; // get first item in each listif ( iterL1.hasNext() && iterL2.hasNext() ){itemL1 = iterL1.next();itemL2 = iterL2.next();} while ( itemL1 != null && itemL2 != null ){int compareResult = itemL1.compareTo(itemL2); if ( compareResult == 0 ){Intersect.add(itemL1);itemL1 = iterL1.hasNext()?iterL1.next():null;itemL2 = iterL2.hasNext()?iterL2.next():null;}else if ( compareResult < 0 ){itemL1 = iterL1.hasNext()?iterL1.next():null;}else{itemL2 = iterL2.hasNext()?iterL2.next():null;}}
Given an JavaScript object list of books that each have a pages attribute to define the number of pages in the book, find the sum of all the pages in the object list of books using recursion. Keep in mind: The input list object may be completely empty (ex. {}) The next attribute may not be defined function getPageCount(list) {// your code here// returns an integer}Example test case:Input: {"book":"A","pages":1,"next":{"book":"B","pages":2,"next":{"book":"C","pages":3,"next": null}}}Output: 6Reasoning: 1 + 2 + 3 pages
Write a simulation of T20 match. There are two teams, Team A and Team B. For every balldelivered generate a random number from -1 to 6 (both inclusive). A -1 means that batsmanis out, any other number is the runs scored on that delivery. A 0 in this case represent a dot ball.After every 12 balls, generate a random value which represents the weather conditions.Random Number Weather Condition Score Limits0 Sunny 0-61 Cloudy 0-42 Windy 0-33 Drizzle 0-24 Rain Match stoppedTeam A plays continuously until all players are out or 120 balls are delivered or match is stoppeddue to the rain.Team B plays continuously until all players are out or 120 balls are delivered they have scoredmore than Team A or match is stopped due to rain. Every time a rain event occurs, deduct 12balls from both innings. A match result should be draw if any of the innings is less than 18 balls.You have to maintain 2d array, store player id and player score. Count total scores of teamsdepending upon preceding…
Write a program that lists all ways people can line up for a photo (all permutations of a list of strings). The program will read a list of one word names (until -1), and use a recursive method to create and output all possible orderings of those names, one ordering per line. When the input is: Julia Lucas Mia -1 then the output is (must match the below ordering): Julia Lucas Mia Julia Mia Lucas Lucas Julia Mia Lucas Mia Julia Mia Julia Lucas Mia Lucas Julia partial code below, only lines 9-11, and 18 can be added onto, the rest must stay the same. #include <vector>#include <string>#include <iostream> using namespace std; // TODO: Write method to create and output all permutations of the list of names.void AllPermutations(const vector<string> &permList, const vector<string> &nameList) { } int main(int argc, char* argv[]) { vector<string> nameList; vector<string> permList; string name; // TODO: Read in a list of names; stop…
Write a simulation of T20 match. There are two teams, Team A and Team B. For every balldelivered generate a random number from -1 to 6 (both inclusive). A -1 means that batsman isout, any other number is the runs scored on that delivery. A 0 in this case represent a dot ball.After every 12 balls, generate a random value which represents the weather conditions.Random Number Weather Condition Score Limits0 Sunny 0-61 Cloudy 0-42 Windy 0-33 Drizzle 0-24 Rain Match stoppedTeam A plays continuously until all players are out or 120 balls are delivered or match is stoppeddue to the rain.Team B plays continuously until all players are out or 120 balls are delivered they have scoredmore than Team A or match is stopped due to rain. Every time a rain event occurs, deduct 12balls from both innings. A match result should be draw if any of the innings is less than 18balls. You have to maintain 2d array, store player id and player score. Count total scores ofteams depending upon preceding…
Write a program that benchmarks QuickSort and InsertionSort. You should use at least 5 different data sets and record the performance of each algorithm on the same sets under the same conditions. Write a short report that compares the two algorithms based your results. It is important to include a discussion of the initial states of the data sets in your report. language Java public class week3 {public static void main(String args[]){ //========================================================== //Question 1 testing //================== // Comment on benchmarking for Q1 results // // //========================================================== } static void quickSort(int f[], int p, int q){ if(q-p <= 1) ; //skip else{ int x; int i, j, k; // let x = middle element in f[p..q-1] x = f[(p+q)/2]; //x = f[p]; i = p; j = p; k = q; while(j != k){ if(f[j] == x) j = j + 1; else if(f[j] < x){ //swap f[j] with f[i] int temp; temp = f[j]; f[j] = f[i]; f[i] = temp; j = j + 1; i = i + 1; } else{…
Write a program that asks user to enter number of vertices in an undirected graph and then the adjacency matrix representing the undirected graph. The program, then, must display whether the given graph is connected or not. Sample 1Enter number of vertices: 3Enter adjacency matrix:0 1 11 0 01 0 0The graph is connected.
Modify the die-rolling simulation in Section 5.17.2 to omit displaying the frequencies and percentages above each bar. Try to minimize the number of lines of code. Use python code. import matplotlib.pyplot as pltimport numpy as npimport randomimport seaborn as snsrolls = [random.randrange(1, 7) for i in range(600)]values, frequencies = np.unique(rolls, return_counts=True)title = f'Rolling a Six-Sided Die {len(rolls):,} Times'sns.set_style('whitegrid')axes = sns.barplot(x=values, y=frequencies, palette='bright')axes.set_title(title)print(axes.set_title(title))axes.set(xlabel='Die Value', ylabel='Frequency')print(axes.set(xlabel='Die Value', ylabel='Frequency'))axes.set_ylim(top=max(frequencies) * 1.10)print(axes.set_ylim(top=max(frequencies) * 1.10))for bar, frequency in zip(axes.patches, frequencies):text_x = bar.get_x() + bar.get_width() / 2.0text_y = bar.get_height()text = f'{frequency:,}\n{frequency / len(rolls):.3%}'axes.text(text_x, text_y, text,fontsize=11, ha='center',…
You are given a list of projects and a list of dependencies (which is a list of pairs ofprojects, where the second project is dependent on the first project). All of a project's dependenciesmust be built before the project is. Find a build order that will allow the projects to be built. If thereis no valid build order, return an error.EXAMPLEInput:projects: a, b, c, d, e, fdependencies: (a, d), (f, b), (b, d), (f, a), (d, c)Output: f, e, a, b, d, c
Write a program that reads a course's title and enrolled student information (student id, student score) and displays the input data followed by the frequency of each score in the course. The end of input is indicated by letter q on the last line For example, for the input: 10 90 12 50 17 85 15 90 42 75 20 90 30 75 78 50 61 50 21 85 22 50 q The output is: COP 3804 class list 10 90 12 50 17 85 15 90 42 75 20 90 30 75 78 50 61 50 21 85 22 50 COP 3804 class scores 90 3 50 4 85 2 75 2 Given classes: class Student represents a student class Roster represents a course class LabProgram contains the main method that reads course data (i.e. course title and students' information), creates a Roster object with the input data and produces the output by calling relevant methods of the Roster object Your task is to complete the following methods: class Student: public Student(String id, int score) { /* Student Employee */ } public String getID() { /* returns student's id */ } public…
Write a program that prompts the user to enter apositive integer and displays all its smallest factors in decreasing order. Forexample, if the integer is 120, the smallest factors are displayed as 5, 3, 2, 2,2. Use the StackOfIntegers class to store the factors (e.g., 2, 2, 2, 3, 5) andretrieve and display them in reverse order.